/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-fpi/s4lif.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-09 23:24:17,455 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-09 23:24:17,456 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-09 23:24:17,479 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-09 23:24:17,480 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-09 23:24:17,480 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-09 23:24:17,481 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-09 23:24:17,482 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-09 23:24:17,484 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-09 23:24:17,484 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-09 23:24:17,485 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-09 23:24:17,486 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-09 23:24:17,486 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-09 23:24:17,487 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-09 23:24:17,487 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-09 23:24:17,488 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-09 23:24:17,489 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-09 23:24:17,509 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-09 23:24:17,519 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-09 23:24:17,520 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-09 23:24:17,521 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-09 23:24:17,523 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-09 23:24:17,524 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-09 23:24:17,524 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-09 23:24:17,526 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-09 23:24:17,526 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-09 23:24:17,526 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-09 23:24:17,526 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-09 23:24:17,527 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-09 23:24:17,527 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-09 23:24:17,527 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-09 23:24:17,528 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-09 23:24:17,528 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-09 23:24:17,528 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-09 23:24:17,529 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-09 23:24:17,529 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-09 23:24:17,530 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-09 23:24:17,530 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-09 23:24:17,530 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-09 23:24:17,530 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-09 23:24:17,531 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-09 23:24:17,536 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf [2022-01-09 23:24:17,561 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-09 23:24:17,561 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-09 23:24:17,561 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-09 23:24:17,562 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-09 23:24:17,562 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-09 23:24:17,562 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-09 23:24:17,562 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-09 23:24:17,563 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-09 23:24:17,563 INFO L138 SettingsManager]: * Use SBE=true [2022-01-09 23:24:17,563 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-09 23:24:17,563 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-09 23:24:17,563 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-09 23:24:17,563 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-09 23:24:17,563 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-09 23:24:17,563 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-09 23:24:17,563 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-09 23:24:17,563 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-09 23:24:17,563 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-09 23:24:17,564 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-09 23:24:17,564 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-09 23:24:17,564 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-09 23:24:17,564 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-09 23:24:17,564 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-09 23:24:17,564 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-09 23:24:17,564 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-09 23:24:17,564 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-09 23:24:17,564 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-09 23:24:17,564 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-09 23:24:17,564 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-09 23:24:17,564 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-09 23:24:17,565 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-09 23:24:17,727 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-09 23:24:17,743 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-09 23:24:17,745 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-09 23:24:17,746 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-09 23:24:17,747 INFO L275 PluginConnector]: CDTParser initialized [2022-01-09 23:24:17,748 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/s4lif.c [2022-01-09 23:24:17,794 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5d11a6cc/2d24217319cb4705a4ecadc61f444863/FLAG0277cab3b [2022-01-09 23:24:18,136 INFO L306 CDTParser]: Found 1 translation units. [2022-01-09 23:24:18,136 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/s4lif.c [2022-01-09 23:24:18,140 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5d11a6cc/2d24217319cb4705a4ecadc61f444863/FLAG0277cab3b [2022-01-09 23:24:18,151 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5d11a6cc/2d24217319cb4705a4ecadc61f444863 [2022-01-09 23:24:18,153 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-09 23:24:18,153 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-09 23:24:18,154 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-09 23:24:18,155 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-09 23:24:18,157 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-09 23:24:18,157 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:24:18" (1/1) ... [2022-01-09 23:24:18,158 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@754c2cc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:24:18, skipping insertion in model container [2022-01-09 23:24:18,158 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:24:18" (1/1) ... [2022-01-09 23:24:18,162 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-09 23:24:18,171 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-09 23:24:18,269 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/s4lif.c[588,601] [2022-01-09 23:24:18,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-09 23:24:18,285 INFO L203 MainTranslator]: Completed pre-run [2022-01-09 23:24:18,302 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/s4lif.c[588,601] [2022-01-09 23:24:18,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-09 23:24:18,326 INFO L208 MainTranslator]: Completed translation [2022-01-09 23:24:18,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:24:18 WrapperNode [2022-01-09 23:24:18,327 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-09 23:24:18,328 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-09 23:24:18,328 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-09 23:24:18,328 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-09 23:24:18,351 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:24:18" (1/1) ... [2022-01-09 23:24:18,357 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:24:18" (1/1) ... [2022-01-09 23:24:18,370 INFO L137 Inliner]: procedures = 17, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 81 [2022-01-09 23:24:18,370 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-09 23:24:18,371 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-09 23:24:18,371 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-09 23:24:18,371 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-09 23:24:18,377 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:24:18" (1/1) ... [2022-01-09 23:24:18,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:24:18" (1/1) ... [2022-01-09 23:24:18,384 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:24:18" (1/1) ... [2022-01-09 23:24:18,384 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:24:18" (1/1) ... [2022-01-09 23:24:18,388 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:24:18" (1/1) ... [2022-01-09 23:24:18,390 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:24:18" (1/1) ... [2022-01-09 23:24:18,391 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:24:18" (1/1) ... [2022-01-09 23:24:18,392 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-09 23:24:18,393 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-09 23:24:18,393 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-09 23:24:18,393 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-09 23:24:18,394 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:24:18" (1/1) ... [2022-01-09 23:24:18,399 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-09 23:24:18,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:24:18,414 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-09 23:24:18,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-09 23:24:18,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-09 23:24:18,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-09 23:24:18,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-09 23:24:18,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-09 23:24:18,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-09 23:24:18,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-09 23:24:18,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-09 23:24:18,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-09 23:24:18,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-09 23:24:18,482 INFO L234 CfgBuilder]: Building ICFG [2022-01-09 23:24:18,483 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-09 23:24:18,569 INFO L275 CfgBuilder]: Performing block encoding [2022-01-09 23:24:18,573 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-09 23:24:18,573 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-09 23:24:18,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:24:18 BoogieIcfgContainer [2022-01-09 23:24:18,574 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-09 23:24:18,576 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-09 23:24:18,576 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-09 23:24:18,578 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-09 23:24:18,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:24:18" (1/3) ... [2022-01-09 23:24:18,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8909094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:24:18, skipping insertion in model container [2022-01-09 23:24:18,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:24:18" (2/3) ... [2022-01-09 23:24:18,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8909094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:24:18, skipping insertion in model container [2022-01-09 23:24:18,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:24:18" (3/3) ... [2022-01-09 23:24:18,580 INFO L111 eAbstractionObserver]: Analyzing ICFG s4lif.c [2022-01-09 23:24:18,584 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-09 23:24:18,584 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-09 23:24:18,614 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-09 23:24:18,619 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-09 23:24:18,619 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-09 23:24:18,628 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:18,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-09 23:24:18,632 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:24:18,632 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:24:18,633 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:24:18,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:24:18,636 INFO L85 PathProgramCache]: Analyzing trace with hash -845640729, now seen corresponding path program 1 times [2022-01-09 23:24:18,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:24:18,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617218502] [2022-01-09 23:24:18,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:24:18,643 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:24:18,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:24:18,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:24:18,740 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:24:18,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617218502] [2022-01-09 23:24:18,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617218502] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:24:18,741 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:24:18,741 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-09 23:24:18,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774026727] [2022-01-09 23:24:18,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:24:18,746 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-09 23:24:18,746 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:24:18,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-09 23:24:18,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-09 23:24:18,775 INFO L87 Difference]: Start difference. First operand has 22 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:18,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:24:18,788 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2022-01-09 23:24:18,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-09 23:24:18,790 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-01-09 23:24:18,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:24:18,795 INFO L225 Difference]: With dead ends: 40 [2022-01-09 23:24:18,796 INFO L226 Difference]: Without dead ends: 18 [2022-01-09 23:24:18,798 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-09 23:24:18,802 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 23:24:18,803 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 23:24:18,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-01-09 23:24:18,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-01-09 23:24:18,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:18,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-01-09 23:24:18,830 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 13 [2022-01-09 23:24:18,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:24:18,831 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-01-09 23:24:18,831 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:18,831 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-01-09 23:24:18,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-09 23:24:18,831 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:24:18,832 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:24:18,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-09 23:24:18,832 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:24:18,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:24:18,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1238667739, now seen corresponding path program 1 times [2022-01-09 23:24:18,835 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:24:18,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723326848] [2022-01-09 23:24:18,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:24:18,835 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:24:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:24:18,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:24:18,929 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:24:18,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723326848] [2022-01-09 23:24:18,929 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723326848] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:24:18,929 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:24:18,929 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-09 23:24:18,930 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387620832] [2022-01-09 23:24:18,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:24:18,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-09 23:24:18,931 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:24:18,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-09 23:24:18,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-09 23:24:18,931 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:18,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:24:18,995 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-01-09 23:24:18,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-09 23:24:18,995 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-01-09 23:24:18,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:24:18,996 INFO L225 Difference]: With dead ends: 36 [2022-01-09 23:24:18,996 INFO L226 Difference]: Without dead ends: 25 [2022-01-09 23:24:18,996 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-09 23:24:18,997 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:24:18,997 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 11 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:24:18,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-01-09 23:24:19,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2022-01-09 23:24:19,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:19,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-01-09 23:24:19,001 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 13 [2022-01-09 23:24:19,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:24:19,001 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-01-09 23:24:19,001 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:19,002 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-01-09 23:24:19,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-09 23:24:19,002 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:24:19,002 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:24:19,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-09 23:24:19,002 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:24:19,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:24:19,003 INFO L85 PathProgramCache]: Analyzing trace with hash 2001188913, now seen corresponding path program 1 times [2022-01-09 23:24:19,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:24:19,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652615765] [2022-01-09 23:24:19,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:24:19,003 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:24:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:24:19,500 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:24:19,501 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:24:19,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652615765] [2022-01-09 23:24:19,501 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652615765] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 23:24:19,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838252974] [2022-01-09 23:24:19,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:24:19,501 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:24:19,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:24:19,528 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-09 23:24:19,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-09 23:24:19,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:24:19,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 38 conjunts are in the unsatisfiable core [2022-01-09 23:24:19,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:24:19,680 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-09 23:24:19,692 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-09 23:24:19,739 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-09 23:24:19,867 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2022-01-09 23:24:19,974 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2022-01-09 23:24:20,086 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-01-09 23:24:20,127 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:24:20,128 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:24:20,344 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-09 23:24:20,345 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 28 [2022-01-09 23:24:20,413 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-09 23:24:20,414 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-01-09 23:24:20,416 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:24:20,417 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2022-01-09 23:24:20,427 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:24:20,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838252974] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:24:20,428 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-09 23:24:20,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 28 [2022-01-09 23:24:20,428 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959987535] [2022-01-09 23:24:20,428 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-09 23:24:20,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-09 23:24:20,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:24:20,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-09 23:24:20,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=602, Unknown=0, NotChecked=0, Total=756 [2022-01-09 23:24:20,430 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 28 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 28 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:20,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:24:20,750 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-01-09 23:24:20,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-09 23:24:20,750 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 28 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-01-09 23:24:20,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:24:20,752 INFO L225 Difference]: With dead ends: 46 [2022-01-09 23:24:20,752 INFO L226 Difference]: Without dead ends: 42 [2022-01-09 23:24:20,752 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=227, Invalid=829, Unknown=0, NotChecked=0, Total=1056 [2022-01-09 23:24:20,753 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 26 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 23:24:20,753 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 61 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 181 Invalid, 0 Unknown, 39 Unchecked, 0.2s Time] [2022-01-09 23:24:20,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-01-09 23:24:20,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 31. [2022-01-09 23:24:20,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:20,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2022-01-09 23:24:20,758 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 20 [2022-01-09 23:24:20,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:24:20,759 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2022-01-09 23:24:20,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 28 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:20,759 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2022-01-09 23:24:20,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-09 23:24:20,759 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:24:20,763 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:24:20,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-09 23:24:20,975 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:24:20,976 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:24:20,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:24:20,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1608161903, now seen corresponding path program 1 times [2022-01-09 23:24:20,976 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:24:20,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637934869] [2022-01-09 23:24:20,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:24:20,977 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:24:20,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:24:21,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-09 23:24:21,088 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:24:21,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637934869] [2022-01-09 23:24:21,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637934869] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 23:24:21,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907552239] [2022-01-09 23:24:21,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:24:21,089 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:24:21,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:24:21,090 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-09 23:24:21,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-09 23:24:21,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:24:21,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-09 23:24:21,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:24:21,143 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 14 [2022-01-09 23:24:21,166 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-09 23:24:21,179 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-09 23:24:21,180 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:24:21,211 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2022-01-09 23:24:21,212 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-01-09 23:24:21,222 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-09 23:24:21,223 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907552239] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:24:21,223 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-09 23:24:21,223 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2022-01-09 23:24:21,223 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89570829] [2022-01-09 23:24:21,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-09 23:24:21,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-09 23:24:21,224 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:24:21,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-09 23:24:21,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-01-09 23:24:21,224 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:21,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:24:21,303 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2022-01-09 23:24:21,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-09 23:24:21,303 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-01-09 23:24:21,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:24:21,304 INFO L225 Difference]: With dead ends: 48 [2022-01-09 23:24:21,304 INFO L226 Difference]: Without dead ends: 37 [2022-01-09 23:24:21,304 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-01-09 23:24:21,305 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 11 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 23:24:21,305 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 43 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 23:24:21,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-01-09 23:24:21,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2022-01-09 23:24:21,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.21875) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:21,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-01-09 23:24:21,309 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 20 [2022-01-09 23:24:21,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:24:21,309 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-01-09 23:24:21,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:21,309 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-01-09 23:24:21,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-09 23:24:21,310 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:24:21,310 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:24:21,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-09 23:24:21,519 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-01-09 23:24:21,520 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:24:21,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:24:21,520 INFO L85 PathProgramCache]: Analyzing trace with hash -949569453, now seen corresponding path program 2 times [2022-01-09 23:24:21,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:24:21,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097732417] [2022-01-09 23:24:21,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:24:21,521 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:24:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:24:21,574 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-09 23:24:21,575 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:24:21,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097732417] [2022-01-09 23:24:21,575 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097732417] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 23:24:21,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270323366] [2022-01-09 23:24:21,575 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-09 23:24:21,575 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:24:21,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:24:21,576 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-09 23:24:21,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-09 23:24:21,618 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-09 23:24:21,618 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-09 23:24:21,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-09 23:24:21,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:24:21,668 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-09 23:24:21,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:24:21,701 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-09 23:24:21,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270323366] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:24:21,702 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-09 23:24:21,702 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-01-09 23:24:21,702 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97174195] [2022-01-09 23:24:21,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-09 23:24:21,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-09 23:24:21,703 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:24:21,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-09 23:24:21,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-01-09 23:24:21,704 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:21,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:24:21,787 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2022-01-09 23:24:21,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-09 23:24:21,788 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-01-09 23:24:21,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:24:21,789 INFO L225 Difference]: With dead ends: 70 [2022-01-09 23:24:21,789 INFO L226 Difference]: Without dead ends: 44 [2022-01-09 23:24:21,790 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-01-09 23:24:21,793 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 53 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:24:21,794 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 29 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:24:21,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-01-09 23:24:21,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2022-01-09 23:24:21,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:21,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-01-09 23:24:21,806 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 22 [2022-01-09 23:24:21,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:24:21,807 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-01-09 23:24:21,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:21,807 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-01-09 23:24:21,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-09 23:24:21,808 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:24:21,808 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:24:21,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-09 23:24:22,030 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:24:22,031 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:24:22,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:24:22,031 INFO L85 PathProgramCache]: Analyzing trace with hash -2105967953, now seen corresponding path program 3 times [2022-01-09 23:24:22,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:24:22,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515509151] [2022-01-09 23:24:22,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:24:22,031 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:24:22,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:24:22,071 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-09 23:24:22,072 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:24:22,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515509151] [2022-01-09 23:24:22,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515509151] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 23:24:22,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335575357] [2022-01-09 23:24:22,072 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-09 23:24:22,072 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:24:22,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:24:22,073 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-09 23:24:22,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-09 23:24:22,116 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-09 23:24:22,117 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-09 23:24:22,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-09 23:24:22,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:24:22,174 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-09 23:24:22,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:24:22,227 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-09 23:24:22,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335575357] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:24:22,228 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-09 23:24:22,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-01-09 23:24:22,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468944460] [2022-01-09 23:24:22,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-09 23:24:22,229 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-09 23:24:22,229 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:24:22,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-09 23:24:22,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-01-09 23:24:22,230 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:22,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:24:22,303 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-01-09 23:24:22,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-09 23:24:22,303 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-01-09 23:24:22,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:24:22,305 INFO L225 Difference]: With dead ends: 39 [2022-01-09 23:24:22,306 INFO L226 Difference]: Without dead ends: 31 [2022-01-09 23:24:22,306 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-01-09 23:24:22,308 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 49 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 23:24:22,308 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 24 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 23:24:22,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-01-09 23:24:22,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2022-01-09 23:24:22,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:22,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-01-09 23:24:22,313 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 22 [2022-01-09 23:24:22,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:24:22,313 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-01-09 23:24:22,313 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:22,313 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-01-09 23:24:22,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-09 23:24:22,314 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:24:22,314 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:24:22,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-09 23:24:22,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:24:22,531 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:24:22,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:24:22,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1032594067, now seen corresponding path program 4 times [2022-01-09 23:24:22,531 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:24:22,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127859822] [2022-01-09 23:24:22,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:24:22,531 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:24:22,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:24:23,159 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:24:23,160 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:24:23,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127859822] [2022-01-09 23:24:23,160 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127859822] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 23:24:23,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762203638] [2022-01-09 23:24:23,160 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-09 23:24:23,160 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:24:23,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:24:23,164 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-09 23:24:23,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-09 23:24:23,209 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-09 23:24:23,209 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-09 23:24:23,210 WARN L261 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 54 conjunts are in the unsatisfiable core [2022-01-09 23:24:23,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:24:23,228 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-09 23:24:23,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:23,258 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-09 23:24:23,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:23,292 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-09 23:24:23,474 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:23,476 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-01-09 23:24:23,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:23,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:23,617 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2022-01-09 23:24:23,751 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:24:23,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:23,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:23,753 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2022-01-09 23:24:23,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:23,854 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2022-01-09 23:24:23,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:23,976 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 34 [2022-01-09 23:24:24,005 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:24:24,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:24:24,732 INFO L353 Elim1Store]: treesize reduction 52, result has 41.6 percent of original size [2022-01-09 23:24:24,732 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 554 treesize of output 290 [2022-01-09 23:24:24,824 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:24:24,825 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 67 [2022-01-09 23:24:24,991 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_3 (Array Int Int))) (let ((.cse4 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_3))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 5 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))) (and (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) (div (+ 5 .cse0 .cse1) 5)) (<= (div (+ 4 .cse0 .cse1) 5) |c_ULTIMATE.start_main_~i~0#1|)))))) (not (= (+ (- 4) (select v_arrayElimArr_3 .cse4)) 1)) (not (= 5 (select v_arrayElimArr_3 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) is different from false [2022-01-09 23:24:25,044 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_3 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (or (not (= (+ (- 4) (select v_arrayElimArr_3 .cse0)) 1)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_3))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse1 (select (select (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse4 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 5 .cse2))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse0))) (and (<= (div (+ 4 .cse1 .cse2) 5) (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) (div (+ 5 .cse1 .cse2) 5))))))) (not (= 5 (select v_arrayElimArr_3 |c_ULTIMATE.start_main_~a~0#1.offset|)))))) is different from false [2022-01-09 23:24:25,090 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-01-09 23:24:25,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762203638] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:24:25,090 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-09 23:24:25,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 50 [2022-01-09 23:24:25,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644352001] [2022-01-09 23:24:25,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-09 23:24:25,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-01-09 23:24:25,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:24:25,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-01-09 23:24:25,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=1948, Unknown=2, NotChecked=186, Total=2450 [2022-01-09 23:24:25,092 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 50 states, 50 states have (on average 1.36) internal successors, (68), 50 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:28,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:24:28,693 INFO L93 Difference]: Finished difference Result 78 states and 94 transitions. [2022-01-09 23:24:28,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-01-09 23:24:28,693 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.36) internal successors, (68), 50 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-01-09 23:24:28,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:24:28,694 INFO L225 Difference]: With dead ends: 78 [2022-01-09 23:24:28,694 INFO L226 Difference]: Without dead ends: 73 [2022-01-09 23:24:28,696 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 76 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1870 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=882, Invalid=4824, Unknown=2, NotChecked=298, Total=6006 [2022-01-09 23:24:28,696 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 65 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 161 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-09 23:24:28,696 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 118 Invalid, 1065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 677 Invalid, 0 Unknown, 161 Unchecked, 0.7s Time] [2022-01-09 23:24:28,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-01-09 23:24:28,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 44. [2022-01-09 23:24:28,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.2093023255813953) internal successors, (52), 43 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:28,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 52 transitions. [2022-01-09 23:24:28,702 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 52 transitions. Word has length 27 [2022-01-09 23:24:28,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:24:28,702 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 52 transitions. [2022-01-09 23:24:28,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.36) internal successors, (68), 50 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:28,702 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-01-09 23:24:28,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-09 23:24:28,702 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:24:28,703 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:24:28,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-09 23:24:28,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:24:28,922 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:24:28,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:24:28,922 INFO L85 PathProgramCache]: Analyzing trace with hash -774428629, now seen corresponding path program 1 times [2022-01-09 23:24:28,922 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:24:28,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474894353] [2022-01-09 23:24:28,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:24:28,923 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:24:28,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:24:29,040 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-09 23:24:29,041 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:24:29,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474894353] [2022-01-09 23:24:29,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474894353] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 23:24:29,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66206380] [2022-01-09 23:24:29,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:24:29,041 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:24:29,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:24:29,042 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-09 23:24:29,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-09 23:24:29,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:24:29,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 17 conjunts are in the unsatisfiable core [2022-01-09 23:24:29,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:24:29,103 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-09 23:24:29,137 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-09 23:24:29,138 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-09 23:24:29,157 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-01-09 23:24:29,176 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-09 23:24:29,177 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:24:29,237 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-01-09 23:24:29,254 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-01-09 23:24:29,268 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-09 23:24:29,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66206380] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:24:29,269 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-09 23:24:29,269 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 18 [2022-01-09 23:24:29,269 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764531336] [2022-01-09 23:24:29,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-09 23:24:29,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-09 23:24:29,269 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:24:29,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-09 23:24:29,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2022-01-09 23:24:29,270 INFO L87 Difference]: Start difference. First operand 44 states and 52 transitions. Second operand has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:29,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:24:29,478 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-01-09 23:24:29,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-09 23:24:29,479 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-01-09 23:24:29,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:24:29,479 INFO L225 Difference]: With dead ends: 63 [2022-01-09 23:24:29,479 INFO L226 Difference]: Without dead ends: 50 [2022-01-09 23:24:29,480 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2022-01-09 23:24:29,480 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 28 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:24:29,480 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 67 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:24:29,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-01-09 23:24:29,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2022-01-09 23:24:29,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:29,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2022-01-09 23:24:29,485 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 27 [2022-01-09 23:24:29,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:24:29,486 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2022-01-09 23:24:29,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:29,486 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2022-01-09 23:24:29,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-09 23:24:29,486 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:24:29,486 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:24:29,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-09 23:24:29,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:24:29,699 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:24:29,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:24:29,700 INFO L85 PathProgramCache]: Analyzing trace with hash -132219249, now seen corresponding path program 5 times [2022-01-09 23:24:29,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:24:29,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600588298] [2022-01-09 23:24:29,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:24:29,700 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:24:29,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:24:29,748 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-09 23:24:29,748 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:24:29,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600588298] [2022-01-09 23:24:29,748 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600588298] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 23:24:29,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986305407] [2022-01-09 23:24:29,748 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-09 23:24:29,748 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:24:29,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:24:29,749 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-09 23:24:29,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-09 23:24:29,819 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-01-09 23:24:29,820 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-09 23:24:29,820 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-09 23:24:29,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:24:29,896 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-09 23:24:29,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:24:29,952 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-09 23:24:29,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986305407] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:24:29,952 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-09 23:24:29,952 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-01-09 23:24:29,953 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171755023] [2022-01-09 23:24:29,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-09 23:24:29,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-09 23:24:29,953 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:24:29,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-09 23:24:29,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-01-09 23:24:29,954 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:30,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:24:30,051 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2022-01-09 23:24:30,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-09 23:24:30,051 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-01-09 23:24:30,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:24:30,051 INFO L225 Difference]: With dead ends: 77 [2022-01-09 23:24:30,051 INFO L226 Difference]: Without dead ends: 43 [2022-01-09 23:24:30,052 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-01-09 23:24:30,052 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 65 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:24:30,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 28 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:24:30,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-01-09 23:24:30,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 33. [2022-01-09 23:24:30,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:30,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-01-09 23:24:30,057 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 29 [2022-01-09 23:24:30,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:24:30,057 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-01-09 23:24:30,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.7142857142857144) internal successors, (38), 14 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:30,057 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-01-09 23:24:30,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-09 23:24:30,057 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:24:30,058 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:24:30,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-01-09 23:24:30,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:24:30,276 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:24:30,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:24:30,276 INFO L85 PathProgramCache]: Analyzing trace with hash -863925553, now seen corresponding path program 6 times [2022-01-09 23:24:30,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:24:30,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853382656] [2022-01-09 23:24:30,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:24:30,277 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:24:30,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:24:30,352 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-09 23:24:30,353 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:24:30,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853382656] [2022-01-09 23:24:30,353 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853382656] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 23:24:30,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [136396863] [2022-01-09 23:24:30,353 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-01-09 23:24:30,353 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:24:30,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:24:30,354 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-09 23:24:30,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-09 23:24:30,412 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-01-09 23:24:30,412 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-09 23:24:30,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-09 23:24:30,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:24:30,497 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-09 23:24:30,497 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:24:30,553 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-09 23:24:30,553 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [136396863] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:24:30,553 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-09 23:24:30,553 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2022-01-09 23:24:30,553 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992539430] [2022-01-09 23:24:30,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-09 23:24:30,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-09 23:24:30,554 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:24:30,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-09 23:24:30,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-01-09 23:24:30,554 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:30,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:24:30,664 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-01-09 23:24:30,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-09 23:24:30,664 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-01-09 23:24:30,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:24:30,665 INFO L225 Difference]: With dead ends: 42 [2022-01-09 23:24:30,665 INFO L226 Difference]: Without dead ends: 38 [2022-01-09 23:24:30,665 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 59 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2022-01-09 23:24:30,665 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 65 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:24:30,666 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 21 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:24:30,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-01-09 23:24:30,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2022-01-09 23:24:30,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 34 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:30,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-01-09 23:24:30,670 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 32 [2022-01-09 23:24:30,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:24:30,670 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-01-09 23:24:30,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.357142857142857) internal successors, (47), 14 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:30,670 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-01-09 23:24:30,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-09 23:24:30,670 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:24:30,670 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:24:30,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-09 23:24:30,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-09 23:24:30,889 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:24:30,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:24:30,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1250534543, now seen corresponding path program 7 times [2022-01-09 23:24:30,890 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:24:30,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336148396] [2022-01-09 23:24:30,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:24:30,890 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:24:30,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:24:31,813 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:24:31,814 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:24:31,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336148396] [2022-01-09 23:24:31,814 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336148396] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 23:24:31,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698477027] [2022-01-09 23:24:31,814 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-01-09 23:24:31,814 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:24:31,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:24:31,815 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-09 23:24:31,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-09 23:24:31,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:24:31,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 75 conjunts are in the unsatisfiable core [2022-01-09 23:24:31,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:24:31,899 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-09 23:24:31,904 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-01-09 23:24:31,918 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-09 23:24:31,944 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-09 23:24:31,988 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-09 23:24:32,108 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-01-09 23:24:32,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:32,239 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 37 [2022-01-09 23:24:32,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:32,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:32,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:32,393 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 47 [2022-01-09 23:24:32,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:32,533 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:24:32,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:32,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:32,535 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 53 [2022-01-09 23:24:32,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:32,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:32,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:32,674 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:24:32,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:32,676 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 53 [2022-01-09 23:24:32,805 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45 [2022-01-09 23:24:32,899 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 35 [2022-01-09 23:24:32,932 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:24:32,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:24:35,012 INFO L353 Elim1Store]: treesize reduction 476, result has 26.2 percent of original size [2022-01-09 23:24:35,013 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 6 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 9 new quantified variables, introduced 39 case distinctions, treesize of input 14664 treesize of output 4694 [2022-01-09 23:24:35,050 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:24:35,051 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:24:35,051 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:24:35,052 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2022-01-09 23:24:35,062 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:24:35,062 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:24:35,063 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:24:35,064 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 25 [2022-01-09 23:24:35,072 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:24:35,073 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:24:35,073 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:24:35,074 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2022-01-09 23:24:35,081 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:24:35,082 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:24:35,082 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:24:35,083 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-01-09 23:24:35,089 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:24:35,089 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:24:35,090 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:24:35,090 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2022-01-09 23:24:35,134 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_7 (Array Int Int)) (~N~0 Int)) (let ((.cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse4 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (* 5 ~N~0) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_7))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 5 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (+ .cse0 5 .cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 5 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))))) (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_main_~a~0#1.offset|) 5)) (not (= (+ (select v_arrayElimArr_7 .cse5) 4) 9)) (not (= 5 (select v_arrayElimArr_7 .cse4))) (<= ~N~0 |c_ULTIMATE.start_main_~i~0#1|) (< (+ |c_ULTIMATE.start_main_~i~0#1| 1) ~N~0)))) is different from false [2022-01-09 23:24:35,189 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_7 (Array Int Int)) (~N~0 Int)) (let ((.cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse4 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (* 5 ~N~0) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_7))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 5 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (+ .cse0 5 .cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 5 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))))) (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_main_~a~0#1.offset|) 5)) (not (= (+ (select v_arrayElimArr_7 .cse5) 4) 9)) (< (+ 2 |c_ULTIMATE.start_main_~i~0#1|) ~N~0) (not (= 5 (select v_arrayElimArr_7 .cse4))) (<= ~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 1))))) is different from false [2022-01-09 23:24:35,292 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_7 (Array Int Int)) (~N~0 Int)) (let ((.cse5 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4)) (.cse4 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (* 5 ~N~0) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_arrayElimArr_7))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base|))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (let ((.cse0 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ 5 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5))) (+ .cse0 5 .cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~#sum~0#1.offset| (+ .cse0 5 .cse1))) |c_ULTIMATE.start_main_~a~0#1.base|) .cse4))))))) (not (= (select v_arrayElimArr_7 |c_ULTIMATE.start_main_~a~0#1.offset|) 5)) (not (= (+ (select v_arrayElimArr_7 .cse5) 4) 9)) (not (= 5 (select v_arrayElimArr_7 .cse4))) (<= ~N~0 (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (< (+ 3 |c_ULTIMATE.start_main_~i~0#1|) ~N~0)))) is different from false [2022-01-09 23:24:35,367 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-01-09 23:24:35,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698477027] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:24:35,367 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-09 23:24:35,368 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 24] total 61 [2022-01-09 23:24:35,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718630924] [2022-01-09 23:24:35,368 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-09 23:24:35,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-01-09 23:24:35,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:24:35,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-01-09 23:24:35,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=2894, Unknown=3, NotChecked=342, Total=3660 [2022-01-09 23:24:35,371 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 61 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 61 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:40,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:24:40,375 INFO L93 Difference]: Finished difference Result 84 states and 95 transitions. [2022-01-09 23:24:40,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-01-09 23:24:40,375 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 61 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-01-09 23:24:40,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:24:40,376 INFO L225 Difference]: With dead ends: 84 [2022-01-09 23:24:40,376 INFO L226 Difference]: Without dead ends: 70 [2022-01-09 23:24:40,377 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 30 SyntacticMatches, 8 SemanticMatches, 72 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1567 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=689, Invalid=4290, Unknown=3, NotChecked=420, Total=5402 [2022-01-09 23:24:40,378 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 39 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 1023 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 1355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 1023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 157 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:24:40,378 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 142 Invalid, 1355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 1023 Invalid, 0 Unknown, 157 Unchecked, 1.1s Time] [2022-01-09 23:24:40,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-01-09 23:24:40,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 54. [2022-01-09 23:24:40,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.150943396226415) internal successors, (61), 53 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:40,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2022-01-09 23:24:40,384 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 34 [2022-01-09 23:24:40,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:24:40,384 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2022-01-09 23:24:40,384 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 61 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:40,385 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2022-01-09 23:24:40,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-09 23:24:40,385 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:24:40,385 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:24:40,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-09 23:24:40,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:24:40,599 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:24:40,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:24:40,600 INFO L85 PathProgramCache]: Analyzing trace with hash 2033315503, now seen corresponding path program 2 times [2022-01-09 23:24:40,600 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:24:40,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519031034] [2022-01-09 23:24:40,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:24:40,600 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:24:40,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:24:40,707 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-09 23:24:40,707 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:24:40,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519031034] [2022-01-09 23:24:40,708 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519031034] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 23:24:40,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610067518] [2022-01-09 23:24:40,708 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-09 23:24:40,708 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:24:40,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:24:40,709 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-09 23:24:40,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-09 23:24:40,768 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-09 23:24:40,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-09 23:24:40,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 27 conjunts are in the unsatisfiable core [2022-01-09 23:24:40,775 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:24:40,831 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-09 23:24:40,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:40,882 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-01-09 23:24:40,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:40,916 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-01-09 23:24:40,941 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-09 23:24:40,960 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-09 23:24:40,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:24:41,033 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2022-01-09 23:24:41,035 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-01-09 23:24:41,055 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-09 23:24:41,055 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610067518] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:24:41,055 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-09 23:24:41,055 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 19 [2022-01-09 23:24:41,055 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975320141] [2022-01-09 23:24:41,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-09 23:24:41,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-09 23:24:41,056 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:24:41,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-09 23:24:41,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2022-01-09 23:24:41,056 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:41,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:24:41,230 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2022-01-09 23:24:41,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-09 23:24:41,230 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-01-09 23:24:41,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:24:41,231 INFO L225 Difference]: With dead ends: 77 [2022-01-09 23:24:41,231 INFO L226 Difference]: Without dead ends: 62 [2022-01-09 23:24:41,231 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 58 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=417, Unknown=0, NotChecked=0, Total=506 [2022-01-09 23:24:41,232 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 13 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:24:41,232 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 90 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:24:41,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-01-09 23:24:41,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2022-01-09 23:24:41,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 54 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:41,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2022-01-09 23:24:41,239 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 34 [2022-01-09 23:24:41,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:24:41,240 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2022-01-09 23:24:41,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.736842105263158) internal successors, (52), 19 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:41,240 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-01-09 23:24:41,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-09 23:24:41,240 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:24:41,240 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:24:41,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-01-09 23:24:41,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-01-09 23:24:41,441 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:24:41,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:24:41,441 INFO L85 PathProgramCache]: Analyzing trace with hash 880380819, now seen corresponding path program 8 times [2022-01-09 23:24:41,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:24:41,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090230963] [2022-01-09 23:24:41,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:24:41,442 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:24:41,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:24:41,510 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-09 23:24:41,511 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:24:41,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090230963] [2022-01-09 23:24:41,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090230963] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 23:24:41,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048509827] [2022-01-09 23:24:41,511 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-09 23:24:41,511 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:24:41,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:24:41,512 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-09 23:24:41,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-01-09 23:24:41,569 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-09 23:24:41,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-09 23:24:41,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-09 23:24:41,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:24:41,689 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-09 23:24:41,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:24:41,755 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-09 23:24:41,756 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048509827] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:24:41,756 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-09 23:24:41,756 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-01-09 23:24:41,756 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735120260] [2022-01-09 23:24:41,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-09 23:24:41,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-09 23:24:41,756 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:24:41,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-09 23:24:41,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-01-09 23:24:41,757 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:41,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:24:41,894 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2022-01-09 23:24:41,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-09 23:24:41,895 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-01-09 23:24:41,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:24:41,895 INFO L225 Difference]: With dead ends: 99 [2022-01-09 23:24:41,895 INFO L226 Difference]: Without dead ends: 62 [2022-01-09 23:24:41,895 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2022-01-09 23:24:41,896 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 132 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:24:41,896 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 28 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:24:41,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-01-09 23:24:41,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 48. [2022-01-09 23:24:41,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:41,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-01-09 23:24:41,903 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 36 [2022-01-09 23:24:41,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:24:41,903 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-01-09 23:24:41,903 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.588235294117647) internal successors, (44), 17 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:41,903 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-01-09 23:24:41,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-01-09 23:24:41,905 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:24:41,906 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:24:41,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-01-09 23:24:42,122 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-01-09 23:24:42,123 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:24:42,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:24:42,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1466624367, now seen corresponding path program 9 times [2022-01-09 23:24:42,123 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:24:42,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749554553] [2022-01-09 23:24:42,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:24:42,124 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:24:42,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:24:42,192 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-09 23:24:42,192 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:24:42,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749554553] [2022-01-09 23:24:42,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749554553] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 23:24:42,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288053473] [2022-01-09 23:24:42,193 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-09 23:24:42,193 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:24:42,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:24:42,194 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-09 23:24:42,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-01-09 23:24:42,267 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-01-09 23:24:42,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-09 23:24:42,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-09 23:24:42,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:24:42,380 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-09 23:24:42,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:24:42,459 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-01-09 23:24:42,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288053473] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:24:42,459 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-09 23:24:42,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2022-01-09 23:24:42,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853462637] [2022-01-09 23:24:42,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-09 23:24:42,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-09 23:24:42,460 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:24:42,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-09 23:24:42,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-01-09 23:24:42,461 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:42,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:24:42,599 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2022-01-09 23:24:42,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-09 23:24:42,599 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-01-09 23:24:42,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:24:42,600 INFO L225 Difference]: With dead ends: 57 [2022-01-09 23:24:42,600 INFO L226 Difference]: Without dead ends: 45 [2022-01-09 23:24:42,600 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2022-01-09 23:24:42,600 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 95 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:24:42,600 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 26 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:24:42,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-01-09 23:24:42,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2022-01-09 23:24:42,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 41 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:42,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2022-01-09 23:24:42,605 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 36 [2022-01-09 23:24:42,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:24:42,605 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2022-01-09 23:24:42,605 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:24:42,605 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-01-09 23:24:42,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-09 23:24:42,606 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:24:42,606 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:24:42,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-01-09 23:24:42,815 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-01-09 23:24:42,815 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:24:42,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:24:42,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1118330549, now seen corresponding path program 10 times [2022-01-09 23:24:42,815 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:24:42,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122968981] [2022-01-09 23:24:42,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:24:42,816 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:24:42,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:24:44,013 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:24:44,014 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:24:44,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122968981] [2022-01-09 23:24:44,014 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122968981] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-09 23:24:44,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879188821] [2022-01-09 23:24:44,014 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-09 23:24:44,014 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:24:44,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:24:44,015 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-09 23:24:44,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-01-09 23:24:44,071 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-09 23:24:44,072 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-09 23:24:44,073 WARN L261 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 92 conjunts are in the unsatisfiable core [2022-01-09 23:24:44,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:24:44,090 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-09 23:24:44,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:44,144 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-09 23:24:44,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:44,189 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-09 23:24:44,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:44,231 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-09 23:24:44,310 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:44,311 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-09 23:24:44,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:44,528 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2022-01-09 23:24:44,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:44,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:44,686 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 42 [2022-01-09 23:24:44,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:44,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:44,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:44,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:44,880 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 49 [2022-01-09 23:24:45,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:45,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:45,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:45,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:45,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:45,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:45,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:45,105 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 59 [2022-01-09 23:24:45,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:45,288 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:24:45,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:45,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:45,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:45,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:45,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:45,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:45,295 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 63 [2022-01-09 23:24:45,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:45,443 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:24:45,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:45,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:45,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:45,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:45,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:45,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:45,448 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 66 [2022-01-09 23:24:45,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:45,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:45,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:45,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:45,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:45,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:45,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:45,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:45,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:45,628 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:24:45,629 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 63 [2022-01-09 23:24:45,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:45,806 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 63 [2022-01-09 23:24:45,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:24:45,969 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 46 [2022-01-09 23:24:46,022 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:24:46,022 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:24:55,199 INFO L353 Elim1Store]: treesize reduction 3907, result has 18.3 percent of original size [2022-01-09 23:24:55,202 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 23 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 27 new quantified variables, introduced 190 case distinctions, treesize of input 3738454 treesize of output 866232 [2022-01-09 23:24:58,124 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:24:58,124 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:24:58,125 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:24:58,125 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:24:58,125 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:24:58,126 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:24:58,127 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 287 treesize of output 197 [2022-01-09 23:24:58,939 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2022-01-09 23:24:58,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-01-09 23:24:59,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-01-09 23:24:59,156 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-01-09 23:24:59,158 INFO L158 Benchmark]: Toolchain (without parser) took 41004.51ms. Allocated memory was 167.8MB in the beginning and 423.6MB in the end (delta: 255.9MB). Free memory was 113.2MB in the beginning and 181.6MB in the end (delta: -68.5MB). Peak memory consumption was 235.0MB. Max. memory is 8.0GB. [2022-01-09 23:24:59,158 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 167.8MB. Free memory is still 129.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-09 23:24:59,158 INFO L158 Benchmark]: CACSL2BoogieTranslator took 172.80ms. Allocated memory was 167.8MB in the beginning and 203.4MB in the end (delta: 35.7MB). Free memory was 113.0MB in the beginning and 178.6MB in the end (delta: -65.6MB). Peak memory consumption was 14.4MB. Max. memory is 8.0GB. [2022-01-09 23:24:59,158 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.78ms. Allocated memory is still 203.4MB. Free memory was 178.6MB in the beginning and 177.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-09 23:24:59,158 INFO L158 Benchmark]: Boogie Preprocessor took 21.42ms. Allocated memory is still 203.4MB. Free memory was 177.0MB in the beginning and 176.0MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-09 23:24:59,159 INFO L158 Benchmark]: RCFGBuilder took 181.54ms. Allocated memory is still 203.4MB. Free memory was 176.0MB in the beginning and 163.9MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-01-09 23:24:59,159 INFO L158 Benchmark]: TraceAbstraction took 40581.94ms. Allocated memory was 203.4MB in the beginning and 423.6MB in the end (delta: 220.2MB). Free memory was 163.4MB in the beginning and 181.6MB in the end (delta: -18.3MB). Peak memory consumption was 249.3MB. Max. memory is 8.0GB. [2022-01-09 23:24:59,160 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 167.8MB. Free memory is still 129.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 172.80ms. Allocated memory was 167.8MB in the beginning and 203.4MB in the end (delta: 35.7MB). Free memory was 113.0MB in the beginning and 178.6MB in the end (delta: -65.6MB). Peak memory consumption was 14.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.78ms. Allocated memory is still 203.4MB. Free memory was 178.6MB in the beginning and 177.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.42ms. Allocated memory is still 203.4MB. Free memory was 177.0MB in the beginning and 176.0MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 181.54ms. Allocated memory is still 203.4MB. Free memory was 176.0MB in the beginning and 163.9MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 40581.94ms. Allocated memory was 203.4MB in the beginning and 423.6MB in the end (delta: 220.2MB). Free memory was 163.4MB in the beginning and 181.6MB in the end (delta: -18.3MB). Peak memory consumption was 249.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-01-09 23:24:59,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...