./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread/queue_longest.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../sv-benchmarks/c/pthread/queue_longest.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Overflow-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5fb3c623242420f3b3352ce2377df781fcc1efd56f82dd0011f9620e127821b3 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 12:45:01,764 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 12:45:01,824 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Overflow-32bit-GemCutter_Default.epf [2024-11-11 12:45:01,829 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 12:45:01,830 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 12:45:01,857 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 12:45:01,857 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 12:45:01,858 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 12:45:01,858 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 12:45:01,858 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 12:45:01,859 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 12:45:01,859 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 12:45:01,860 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 12:45:01,861 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 12:45:01,861 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 12:45:01,861 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 12:45:01,861 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 12:45:01,862 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 12:45:01,862 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 12:45:01,862 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 12:45:01,862 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 12:45:01,865 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 12:45:01,865 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 12:45:01,865 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-11 12:45:01,865 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-11 12:45:01,865 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 12:45:01,866 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 12:45:01,866 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 12:45:01,866 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 12:45:01,866 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 12:45:01,866 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 12:45:01,866 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 12:45:01,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-11 12:45:01,867 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 12:45:01,867 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 12:45:01,867 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 12:45:01,867 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 12:45:01,868 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-11-11 12:45:01,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 12:45:01,868 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 12:45:01,868 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2024-11-11 12:45:01,868 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-11 12:45:01,869 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-11 12:45:01,869 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-11 12:45:01,869 INFO L153 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/UGemCutter-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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5fb3c623242420f3b3352ce2377df781fcc1efd56f82dd0011f9620e127821b3 [2024-11-11 12:45:02,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 12:45:02,081 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 12:45:02,084 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 12:45:02,085 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 12:45:02,086 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 12:45:02,087 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/pthread/queue_longest.i [2024-11-11 12:45:03,248 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 12:45:03,475 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 12:45:03,475 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue_longest.i [2024-11-11 12:45:03,496 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/db59a0199/01d8ceb2bb594cacb46d27c3bf3a2ac3/FLAGddc0f97d4 [2024-11-11 12:45:03,798 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/db59a0199/01d8ceb2bb594cacb46d27c3bf3a2ac3 [2024-11-11 12:45:03,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 12:45:03,802 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 12:45:03,804 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 12:45:03,804 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 12:45:03,814 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 12:45:03,816 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 12:45:03" (1/1) ... [2024-11-11 12:45:03,817 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16e3426d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 12:45:03, skipping insertion in model container [2024-11-11 12:45:03,817 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 12:45:03" (1/1) ... [2024-11-11 12:45:03,871 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 12:45:04,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 12:45:04,269 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 12:45:04,318 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 12:45:04,437 INFO L204 MainTranslator]: Completed translation [2024-11-11 12:45:04,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 12:45:04 WrapperNode [2024-11-11 12:45:04,437 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 12:45:04,439 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 12:45:04,439 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 12:45:04,439 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 12:45:04,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 12:45:04" (1/1) ... [2024-11-11 12:45:04,484 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 12:45:04" (1/1) ... [2024-11-11 12:45:04,572 INFO L138 Inliner]: procedures = 274, calls = 1659, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 1864 [2024-11-11 12:45:04,572 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 12:45:04,573 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 12:45:04,573 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 12:45:04,573 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 12:45:04,582 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 12:45:04" (1/1) ... [2024-11-11 12:45:04,582 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 12:45:04" (1/1) ... [2024-11-11 12:45:04,598 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 12:45:04" (1/1) ... [2024-11-11 12:45:04,598 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 12:45:04" (1/1) ... [2024-11-11 12:45:04,640 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 12:45:04" (1/1) ... [2024-11-11 12:45:04,647 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 12:45:04" (1/1) ... [2024-11-11 12:45:04,656 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 12:45:04" (1/1) ... [2024-11-11 12:45:04,666 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 12:45:04" (1/1) ... [2024-11-11 12:45:04,677 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 12:45:04,678 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 12:45:04,679 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 12:45:04,679 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 12:45:04,679 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 12:45:04" (1/1) ... [2024-11-11 12:45:04,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-11 12:45:04,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 12:45:04,711 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-11 12:45:04,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-11 12:45:04,747 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-11 12:45:04,747 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-11 12:45:04,747 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-11 12:45:04,747 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-11 12:45:04,747 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-11 12:45:04,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-11 12:45:04,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-11 12:45:04,748 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-11 12:45:04,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 12:45:04,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-11 12:45:04,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 12:45:04,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 12:45:04,750 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-11 12:45:04,883 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 12:45:04,885 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 12:45:06,487 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-11 12:45:06,488 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 12:45:31,336 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 12:45:31,337 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-11 12:45:31,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 12:45:31 BoogieIcfgContainer [2024-11-11 12:45:31,338 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 12:45:31,339 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 12:45:31,340 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 12:45:31,343 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 12:45:31,343 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 12:45:03" (1/3) ... [2024-11-11 12:45:31,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a1a800e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 12:45:31, skipping insertion in model container [2024-11-11 12:45:31,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 12:45:04" (2/3) ... [2024-11-11 12:45:31,344 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a1a800e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 12:45:31, skipping insertion in model container [2024-11-11 12:45:31,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 12:45:31" (3/3) ... [2024-11-11 12:45:31,345 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_longest.i [2024-11-11 12:45:31,359 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 12:45:31,360 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2024-11-11 12:45:31,360 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-11 12:45:31,451 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-11 12:45:31,490 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 12:45:31,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-11 12:45:31,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 12:45:31,493 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-11-11 12:45:31,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-11-11 12:45:31,525 INFO L158 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-11 12:45:31,700 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork0 ======== [2024-11-11 12:45:31,714 INFO L333 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, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@24eae139, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 12:45:31,714 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-11-11 12:45:31,941 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-11 12:45:31,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:45:31,946 INFO L85 PathProgramCache]: Analyzing trace with hash -356156547, now seen corresponding path program 1 times [2024-11-11 12:45:31,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:45:31,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025141119] [2024-11-11 12:45:31,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:45:31,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 12:45:32,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:45:33,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:45:33,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 12:45:33,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025141119] [2024-11-11 12:45:33,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025141119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 12:45:33,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 12:45:33,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 12:45:33,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668852493] [2024-11-11 12:45:33,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 12:45:33,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 12:45:33,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 12:45:33,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 12:45:33,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 12:45:33,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:33,742 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 12:45:33,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2024-11-11 12:45:33,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:34,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:34,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 12:45:34,312 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-11 12:45:34,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:45:34,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1844052889, now seen corresponding path program 1 times [2024-11-11 12:45:34,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:45:34,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75445403] [2024-11-11 12:45:34,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:45:34,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 12:45:34,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:45:35,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:45:35,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 12:45:35,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75445403] [2024-11-11 12:45:35,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75445403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 12:45:35,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 12:45:35,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 12:45:35,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076597091] [2024-11-11 12:45:35,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 12:45:35,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 12:45:35,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 12:45:35,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 12:45:35,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 12:45:35,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:35,796 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 12:45:35,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) [2024-11-11 12:45:35,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:35,797 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:36,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:36,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:36,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 12:45:36,438 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-11 12:45:36,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:45:36,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1686540228, now seen corresponding path program 1 times [2024-11-11 12:45:36,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:45:36,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513610952] [2024-11-11 12:45:36,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:45:36,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 12:45:36,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:45:38,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:45:38,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 12:45:38,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513610952] [2024-11-11 12:45:38,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513610952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 12:45:38,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 12:45:38,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 12:45:38,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877946854] [2024-11-11 12:45:38,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 12:45:38,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 12:45:38,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 12:45:38,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 12:45:38,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-11 12:45:38,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:38,102 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 12:45:38,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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) [2024-11-11 12:45:38,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:38,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:38,102 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:39,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:39,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:39,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:45:39,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 12:45:39,376 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-11 12:45:39,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:45:39,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1337010171, now seen corresponding path program 1 times [2024-11-11 12:45:39,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:45:39,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937858580] [2024-11-11 12:45:39,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:45:39,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 12:45:39,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:45:39,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:45:39,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 12:45:39,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937858580] [2024-11-11 12:45:39,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937858580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 12:45:39,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 12:45:39,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 12:45:39,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254187743] [2024-11-11 12:45:39,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 12:45:39,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 12:45:39,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 12:45:39,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 12:45:39,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 12:45:39,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:39,737 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 12:45:39,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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) [2024-11-11 12:45:39,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:39,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:39,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:45:39,738 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:40,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:40,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:40,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:45:40,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:40,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 12:45:40,524 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-11 12:45:40,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:45:40,525 INFO L85 PathProgramCache]: Analyzing trace with hash -3816937, now seen corresponding path program 1 times [2024-11-11 12:45:40,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:45:40,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538171646] [2024-11-11 12:45:40,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:45:40,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 12:45:40,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:45:40,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:45:40,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 12:45:40,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538171646] [2024-11-11 12:45:40,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538171646] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 12:45:40,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 12:45:40,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 12:45:40,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466902347] [2024-11-11 12:45:40,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 12:45:40,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 12:45:40,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 12:45:40,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 12:45:40,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 12:45:40,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:40,758 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 12:45:40,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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) [2024-11-11 12:45:40,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:40,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:40,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:45:40,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:40,759 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:41,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:41,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:41,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:45:41,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:41,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:41,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 12:45:41,412 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-11 12:45:41,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:45:41,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1681622897, now seen corresponding path program 1 times [2024-11-11 12:45:41,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:45:41,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334148529] [2024-11-11 12:45:41,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:45:41,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 12:45:41,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:45:41,709 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:45:41,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 12:45:41,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334148529] [2024-11-11 12:45:41,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334148529] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 12:45:41,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378914399] [2024-11-11 12:45:41,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:45:41,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 12:45:41,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 12:45:41,712 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 12:45:41,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 12:45:42,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:45:42,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 3467 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-11 12:45:42,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 12:45:42,184 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:45:42,184 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 12:45:42,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378914399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 12:45:42,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 12:45:42,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2024-11-11 12:45:42,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848640073] [2024-11-11 12:45:42,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 12:45:42,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 12:45:42,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 12:45:42,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 12:45:42,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-11 12:45:42,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:42,187 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 12:45:42,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 10.5) internal successors, (42), 5 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) [2024-11-11 12:45:42,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:42,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:42,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:45:42,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:42,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:42,188 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:42,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:42,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:42,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:45:42,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:42,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:42,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:42,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 12:45:43,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-11 12:45:43,149 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-11 12:45:43,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:45:43,150 INFO L85 PathProgramCache]: Analyzing trace with hash 590706246, now seen corresponding path program 1 times [2024-11-11 12:45:43,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:45:43,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912775183] [2024-11-11 12:45:43,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:45:43,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 12:45:43,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:45:43,318 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 12:45:43,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 12:45:43,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912775183] [2024-11-11 12:45:43,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912775183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 12:45:43,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 12:45:43,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 12:45:43,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767602477] [2024-11-11 12:45:43,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 12:45:43,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 12:45:43,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 12:45:43,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 12:45:43,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-11 12:45:43,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:43,321 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 12:45:43,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 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) [2024-11-11 12:45:43,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:43,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:43,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:45:43,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:43,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:43,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:43,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:43,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:43,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:43,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:45:43,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:43,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:43,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:43,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:43,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 12:45:43,944 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-11 12:45:43,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:45:43,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1690894632, now seen corresponding path program 1 times [2024-11-11 12:45:43,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:45:43,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685801202] [2024-11-11 12:45:43,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:45:43,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 12:45:44,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:45:44,106 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-11 12:45:44,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 12:45:44,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685801202] [2024-11-11 12:45:44,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685801202] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 12:45:44,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 12:45:44,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 12:45:44,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298663311] [2024-11-11 12:45:44,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 12:45:44,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 12:45:44,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 12:45:44,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 12:45:44,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 12:45:44,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:44,109 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 12:45:44,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 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) [2024-11-11 12:45:44,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:44,109 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:44,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:45:44,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:44,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:44,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:44,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:44,110 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:45,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:45,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:45,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:45:45,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:45,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:45,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:45,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:45,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:45:45,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 12:45:45,318 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-11 12:45:45,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:45:45,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1203290577, now seen corresponding path program 1 times [2024-11-11 12:45:45,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:45:45,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651741129] [2024-11-11 12:45:45,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:45:45,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 12:45:45,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:45:45,447 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:45:45,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 12:45:45,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651741129] [2024-11-11 12:45:45,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651741129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 12:45:45,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 12:45:45,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 12:45:45,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231614251] [2024-11-11 12:45:45,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 12:45:45,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 12:45:45,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 12:45:45,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 12:45:45,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 12:45:45,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:45,450 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 12:45:45,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 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) [2024-11-11 12:45:45,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:45,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:45,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:45:45,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:45,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:45,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:45,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:45,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:45:45,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:45,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:45,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:45,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:45:45,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:45,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:45,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:45,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:45,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:45:45,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:45:45,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 12:45:45,725 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-11 12:45:45,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:45:45,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1625422466, now seen corresponding path program 1 times [2024-11-11 12:45:45,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:45:45,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153302277] [2024-11-11 12:45:45,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:45:45,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 12:45:45,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:45:48,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:45:48,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 12:45:48,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153302277] [2024-11-11 12:45:48,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153302277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 12:45:48,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 12:45:48,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 12:45:48,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555527124] [2024-11-11 12:45:48,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 12:45:48,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 12:45:48,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 12:45:48,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 12:45:48,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-11 12:45:48,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:48,175 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 12:45:48,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.0) internal successors, (24), 8 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) [2024-11-11 12:45:48,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:48,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:48,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:45:48,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:48,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:48,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:48,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:48,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:45:48,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:45:48,176 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:49,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:49,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:49,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:45:49,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:49,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:49,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:49,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:49,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:45:49,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:45:49,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 12:45:49,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 12:45:49,868 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-11 12:45:49,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:45:49,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1151507121, now seen corresponding path program 1 times [2024-11-11 12:45:49,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:45:49,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003432636] [2024-11-11 12:45:49,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:45:49,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 12:45:49,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:45:52,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:45:52,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 12:45:52,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003432636] [2024-11-11 12:45:52,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003432636] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 12:45:52,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 12:45:52,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 12:45:52,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026442488] [2024-11-11 12:45:52,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 12:45:52,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 12:45:52,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 12:45:52,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 12:45:52,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-11 12:45:52,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:52,342 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 12:45:52,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 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) [2024-11-11 12:45:52,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:52,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:52,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:45:52,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:52,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:52,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:52,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:52,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:45:52,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:45:52,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-11 12:45:52,343 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:53,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:53,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:53,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:45:53,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:53,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:53,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:53,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:53,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:45:53,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:45:53,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 12:45:53,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 12:45:53,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 12:45:53,959 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-11 12:45:53,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:45:53,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1503346708, now seen corresponding path program 1 times [2024-11-11 12:45:53,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:45:53,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146820349] [2024-11-11 12:45:53,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:45:53,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 12:45:54,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:45:55,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:45:55,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 12:45:55,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146820349] [2024-11-11 12:45:55,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146820349] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 12:45:55,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 12:45:55,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 12:45:55,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857167315] [2024-11-11 12:45:55,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 12:45:55,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 12:45:55,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 12:45:55,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 12:45:55,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-11 12:45:55,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:55,767 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 12:45:55,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 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) [2024-11-11 12:45:55,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:55,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:55,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:45:55,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:55,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:55,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:55,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:55,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:45:55,767 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:45:55,768 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-11 12:45:55,768 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-11 12:45:55,768 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:45:57,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:57,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:57,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:45:57,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:57,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:57,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:57,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:45:57,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:45:57,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:45:57,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-11 12:45:57,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:45:57,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:45:57,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 12:45:57,469 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-11 12:45:57,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:45:57,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1623926878, now seen corresponding path program 1 times [2024-11-11 12:45:57,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:45:57,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648306873] [2024-11-11 12:45:57,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:45:57,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 12:45:57,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:46:01,857 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:46:01,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 12:46:01,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648306873] [2024-11-11 12:46:01,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648306873] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 12:46:01,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809871416] [2024-11-11 12:46:01,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:46:01,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 12:46:01,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 12:46:01,859 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 12:46:01,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 12:46:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:46:02,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 3579 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-11 12:46:02,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 12:46:02,280 INFO L378 Elim1Store]: Elim1 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 23 treesize of output 28 [2024-11-11 12:46:02,348 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 12:46:02,376 INFO L349 Elim1Store]: treesize reduction 90, result has 23.7 percent of original size [2024-11-11 12:46:02,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 59 [2024-11-11 12:46:02,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:46:02,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:46:02,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:46:02,449 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 12:46:02,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 39 [2024-11-11 12:46:02,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 47 treesize of output 28 [2024-11-11 12:46:02,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:46:02,599 INFO L378 Elim1Store]: Elim1 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 36 treesize of output 27 [2024-11-11 12:46:02,676 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 12:46:02,695 INFO L349 Elim1Store]: treesize reduction 90, result has 23.7 percent of original size [2024-11-11 12:46:02,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 59 [2024-11-11 12:46:02,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:46:02,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:46:02,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:46:02,766 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 12:46:02,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 39 [2024-11-11 12:46:02,885 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 12:46:02,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 39 [2024-11-11 12:46:02,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:46:02,943 INFO L378 Elim1Store]: Elim1 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 36 treesize of output 27 [2024-11-11 12:46:03,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:46:03,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:46:03,079 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 12:46:03,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 54 [2024-11-11 12:46:03,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 12:46:03,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 28 [2024-11-11 12:46:03,198 INFO L378 Elim1Store]: Elim1 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 41 treesize of output 33 [2024-11-11 12:46:03,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 12:46:03,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 23 [2024-11-11 12:46:03,204 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:46:03,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 12:46:03,483 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_417 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_17| Int) (v_ArrVal_419 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_11| Int)) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_417) |c_~#queue~0.base|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (< |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_17| (select .cse0 .cse1)) (< 0 (+ (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_17|)) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_419) (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_11|) .cse1) 2147483650))))) is different from false [2024-11-11 12:46:03,504 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_417 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_17| Int) (v_ArrVal_419 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_11| Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_417) |c_~#queue~0.base|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (< |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_17| (select .cse0 .cse1)) (< 0 (+ 2147483650 (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_17|)) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_419) (+ |c_~#queue~0.offset| (* 4 (select .cse0 (+ |c_~#queue~0.offset| 3204)))) |v_t1Thread1of1ForFork0_enqueue_~x#1_11|) .cse1)))))) is different from false [2024-11-11 12:46:03,521 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_35| Int) (v_ArrVal_417 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_17| Int) (v_ArrVal_419 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_11| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_35| 1))) |c_~#stored_elements~0.base| v_ArrVal_417) |c_~#queue~0.base|)) (.cse3 (+ 3208 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_35|) (< 0 (+ 2147483650 (select (store (store (store .cse2 .cse3 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_17|)) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_419) (+ |c_~#queue~0.offset| (* (select .cse2 (+ |c_~#queue~0.offset| 3204)) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_11|) .cse3))) (< |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_17| (select .cse2 .cse3)))))) is different from false [2024-11-11 12:46:03,540 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_35| Int) (v_ArrVal_417 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_17| Int) (v_ArrVal_419 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_11| Int) (v_ArrVal_414 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_414) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_35| 1))) |c_~#stored_elements~0.base| v_ArrVal_417) |c_~#queue~0.base|)) (.cse3 (+ 3208 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_35|) (< 0 (+ (select (store (store (store .cse2 .cse3 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_17|)) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_419) (+ |c_~#queue~0.offset| (* (select .cse2 (+ |c_~#queue~0.offset| 3204)) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_11|) .cse3) 2147483650)) (< |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_17| (select .cse2 .cse3)) (< v_ArrVal_414 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)))))) is different from false [2024-11-11 12:46:04,717 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_13| Int) (v_ArrVal_417 (Array Int Int)) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_17| Int) (v_ArrVal_419 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_11| Int) (v_ArrVal_412 (Array Int Int)) (v_ArrVal_414 Int)) (let ((.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (let ((.cse4 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_412) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_13|))) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_414) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_35| 1))) |c_~#stored_elements~0.base| v_ArrVal_417) |c_~#queue~0.base|))) (or (< |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_17| (select .cse0 .cse1)) (< v_ArrVal_414 (+ (select .cse2 .cse1) 1)) (< 0 (+ (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_17|)) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_419) (+ (* (select .cse0 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_11|) .cse1) 2147483650)) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_35|)))))) is different from false [2024-11-11 12:46:08,280 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_13| Int) (v_ArrVal_417 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_38| Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_17| Int) (v_ArrVal_419 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_11| Int) (v_ArrVal_412 (Array Int Int)) (v_ArrVal_414 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (+ |c_~#queue~0.offset| 3204)) (.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_38| 1))))) (let ((.cse0 (let ((.cse7 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_412) |c_~#queue~0.base|))) (store .cse7 (+ (* 4 (select .cse7 .cse5)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_13|))) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse4 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_414) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_35| 1))) |c_~#stored_elements~0.base| v_ArrVal_417) |c_~#queue~0.base|))) (or (< v_ArrVal_414 (+ (select .cse0 .cse1) 1)) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_38|) (< |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_17| (select .cse4 .cse1)) (< (select .cse0 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_35|) (< 0 (+ 2147483650 (select (store (store (store .cse4 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_17|)) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_419) (+ (* (select .cse4 .cse5) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_11|) .cse1))))))))) is different from false [2024-11-11 12:46:08,318 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_35| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_13| Int) (v_ArrVal_417 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_38| Int) (v_ArrVal_409 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_17| Int) (v_ArrVal_419 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_11| Int) (v_ArrVal_412 (Array Int Int)) (v_ArrVal_414 Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_409) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_38| 1))))) (let ((.cse2 (let ((.cse7 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_412) |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_13|))) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_414) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_35| 1))) |c_~#stored_elements~0.base| v_ArrVal_417) |c_~#queue~0.base|))) (or (< |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_17| (select .cse0 .cse1)) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_35|) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_38|) (< 0 (+ (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_17|)) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_419) (+ (* (select .cse0 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_11|) .cse1) 2147483650)) (< v_ArrVal_409 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)) (< v_ArrVal_414 (+ (select .cse2 .cse1) 1)))))))) is different from false [2024-11-11 12:46:14,034 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-11 12:46:14,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809871416] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 12:46:14,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 12:46:14,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 15] total 41 [2024-11-11 12:46:14,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204855093] [2024-11-11 12:46:14,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 12:46:14,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-11 12:46:14,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 12:46:14,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-11 12:46:14,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1070, Unknown=14, NotChecked=518, Total=1806 [2024-11-11 12:46:14,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:46:14,037 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 12:46:14,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 3.8333333333333335) internal successors, (161), 42 states have internal predecessors, (161), 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) [2024-11-11 12:46:14,038 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:14,038 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:14,038 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:46:14,038 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:14,038 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:14,038 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:14,038 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:14,038 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:46:14,038 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:46:14,038 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-11 12:46:14,038 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:46:14,038 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:46:14,038 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:46:23,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-11 12:46:25,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-11 12:46:28,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:28,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:28,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:46:28,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:28,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:28,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:28,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:28,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:46:28,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:46:28,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:46:28,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:46:28,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:46:28,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-11 12:46:28,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 12:46:28,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-11 12:46:28,577 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-11 12:46:28,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:46:28,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1197870349, now seen corresponding path program 1 times [2024-11-11 12:46:28,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:46:28,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478668715] [2024-11-11 12:46:28,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:46:28,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 12:46:28,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:46:33,138 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:46:33,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 12:46:33,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478668715] [2024-11-11 12:46:33,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478668715] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 12:46:33,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98058270] [2024-11-11 12:46:33,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:46:33,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 12:46:33,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 12:46:33,141 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 12:46:33,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 12:46:33,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:46:33,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 3580 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-11 12:46:33,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 12:46:33,545 INFO L378 Elim1Store]: Elim1 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 23 treesize of output 28 [2024-11-11 12:46:33,602 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 12:46:33,620 INFO L349 Elim1Store]: treesize reduction 90, result has 23.7 percent of original size [2024-11-11 12:46:33,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 59 [2024-11-11 12:46:33,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:46:33,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:46:33,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:46:33,689 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 12:46:33,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 39 [2024-11-11 12:46:33,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 47 treesize of output 28 [2024-11-11 12:46:33,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:46:33,823 INFO L378 Elim1Store]: Elim1 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 36 treesize of output 27 [2024-11-11 12:46:33,906 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 12:46:33,926 INFO L349 Elim1Store]: treesize reduction 90, result has 23.7 percent of original size [2024-11-11 12:46:33,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 59 [2024-11-11 12:46:33,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:46:33,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:46:33,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:46:33,987 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 12:46:33,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 39 [2024-11-11 12:46:34,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 12:46:34,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 39 [2024-11-11 12:46:34,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:46:34,161 INFO L378 Elim1Store]: Elim1 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 36 treesize of output 27 [2024-11-11 12:46:34,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:46:34,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:46:34,297 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 12:46:34,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 54 [2024-11-11 12:46:34,367 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 12:46:34,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 28 [2024-11-11 12:46:34,437 INFO L378 Elim1Store]: Elim1 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 41 treesize of output 33 [2024-11-11 12:46:34,440 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 12:46:34,440 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 23 [2024-11-11 12:46:34,444 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:46:34,444 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 12:46:34,862 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_17| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45| Int) (v_ArrVal_516 (Array Int Int)) (v_ArrVal_518 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_21| Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45| 1))) |c_~#stored_elements~0.base| v_ArrVal_516) |c_~#queue~0.base|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_21|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45|) (< (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_21|)) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_518) (+ |c_~#queue~0.offset| (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_17|) .cse1) 2147483647))))) is different from false [2024-11-11 12:46:34,885 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_17| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45| Int) (v_ArrVal_516 (Array Int Int)) (v_ArrVal_518 Int) (v_ArrVal_513 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_21| Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_513) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45| 1))) |c_~#stored_elements~0.base| v_ArrVal_516) |c_~#queue~0.base|)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (or (< (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_21|)) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_518) (+ (* (select .cse0 (+ |c_~#queue~0.offset| 3204)) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_17|) .cse1) 2147483647) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45|) (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_21|) (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_513))))) is different from false [2024-11-11 12:46:38,729 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_17| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_19| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45| Int) (v_ArrVal_516 (Array Int Int)) (v_ArrVal_518 Int) (v_ArrVal_511 (Array Int Int)) (v_ArrVal_513 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_21| Int)) (let ((.cse3 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (let ((.cse4 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_511) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_19|))) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_513) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45| 1))) |c_~#stored_elements~0.base| v_ArrVal_516) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_513) (< (select (store (store (store .cse2 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_21|)) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_518) (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_17|) .cse1) 2147483647) (< (select .cse0 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45|) (< (select .cse2 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_21|)))))) is different from false [2024-11-11 12:46:38,769 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_17| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_19| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45| Int) (v_ArrVal_516 (Array Int Int)) (v_ArrVal_518 Int) (v_ArrVal_511 (Array Int Int)) (v_ArrVal_513 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_21| Int)) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse4 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))))) (let ((.cse0 (let ((.cse5 (select (store .cse4 |c_~#stored_elements~0.base| v_ArrVal_511) |c_~#queue~0.base|))) (store .cse5 (+ (* 4 (select .cse5 .cse2)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_19|))) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse3 (select (store (store .cse4 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_513) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45| 1))) |c_~#stored_elements~0.base| v_ArrVal_516) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_513) (< (select .cse0 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45|) (< (select .cse3 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_21|) (< (select (store (store (store .cse3 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_21|)) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_518) (+ (* (select .cse3 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_17|) .cse1) 2147483647)))))) is different from false [2024-11-11 12:46:38,820 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_48| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_17| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_19| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45| Int) (v_ArrVal_516 (Array Int Int)) (v_ArrVal_518 Int) (v_ArrVal_511 (Array Int Int)) (v_ArrVal_513 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_21| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_48| 1))))) (let ((.cse3 (let ((.cse7 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_511) |c_~#queue~0.base|))) (store .cse7 (+ (* 4 (select .cse7 .cse2)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_19|))) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse3 .cse1 v_ArrVal_513) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45| 1))) |c_~#stored_elements~0.base| v_ArrVal_516) |c_~#queue~0.base|))) (or (< (select (store (store (store .cse0 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_21|)) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_518) (+ (* (select .cse0 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_17|) .cse1) 2147483647) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45|) (< (select .cse0 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_21|) (< (+ (select .cse3 .cse1) 1) v_ArrVal_513) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_48|))))))) is different from false [2024-11-11 12:46:38,862 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_48| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_17| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_19| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45| Int) (v_ArrVal_516 (Array Int Int)) (v_ArrVal_508 Int) (v_ArrVal_518 Int) (v_ArrVal_511 (Array Int Int)) (v_ArrVal_513 Int) (|v_t2Thread1of1ForFork1_dequeue_#t~post45#1_21| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_508) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_48| 1))))) (let ((.cse0 (let ((.cse7 (select (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_511) |c_~#queue~0.base|))) (store .cse7 (+ |c_~#queue~0.offset| (* (select .cse7 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_19|))) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse3 (select (store (store .cse6 |c_~#queue~0.base| (store (store .cse0 .cse1 v_ArrVal_513) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45| 1))) |c_~#stored_elements~0.base| v_ArrVal_516) |c_~#queue~0.base|))) (or (< (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1) v_ArrVal_508) (< (+ (select .cse0 .cse1) 1) v_ArrVal_513) (< (select .cse0 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_45|) (< (select (store (store (store .cse3 .cse1 (+ (- 1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_21|)) (+ 3200 |c_~#queue~0.offset|) v_ArrVal_518) (+ |c_~#queue~0.offset| (* (select .cse3 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_17|) .cse1) 2147483647) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_48|) (< (select .cse3 .cse1) |v_t2Thread1of1ForFork1_dequeue_#t~post45#1_21|))))))) is different from false [2024-11-11 12:46:47,350 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-11 12:46:47,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98058270] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 12:46:47,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 12:46:47,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 15] total 41 [2024-11-11 12:46:47,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037474783] [2024-11-11 12:46:47,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 12:46:47,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-11 12:46:47,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 12:46:47,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-11 12:46:47,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=1092, Unknown=21, NotChecked=450, Total=1806 [2024-11-11 12:46:47,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:46:47,353 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 12:46:47,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 3.880952380952381) internal successors, (163), 42 states have internal predecessors, (163), 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) [2024-11-11 12:46:47,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:47,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:47,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:46:47,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:47,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:47,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:47,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:47,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:46:47,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:46:47,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:46:47,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:46:47,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:46:47,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-11-11 12:46:47,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:46:49,606 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-11 12:46:53,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:53,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:53,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:46:53,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:53,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:53,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:53,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:53,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:46:53,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:46:53,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:46:53,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:46:53,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:46:53,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-11 12:46:53,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-11 12:46:53,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-11 12:46:53,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 12:46:53,785 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-11 12:46:53,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:46:53,786 INFO L85 PathProgramCache]: Analyzing trace with hash -102042440, now seen corresponding path program 1 times [2024-11-11 12:46:53,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:46:53,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794498690] [2024-11-11 12:46:53,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:46:53,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 12:46:53,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:46:57,026 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:46:57,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 12:46:57,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794498690] [2024-11-11 12:46:57,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794498690] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 12:46:57,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098802537] [2024-11-11 12:46:57,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:46:57,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 12:46:57,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 12:46:57,030 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 12:46:57,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-11 12:46:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:46:57,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 3592 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-11-11 12:46:57,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 12:46:57,447 INFO L378 Elim1Store]: Elim1 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 23 treesize of output 28 [2024-11-11 12:46:57,509 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 12:46:57,528 INFO L349 Elim1Store]: treesize reduction 90, result has 23.7 percent of original size [2024-11-11 12:46:57,528 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 59 [2024-11-11 12:46:57,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:46:57,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:46:57,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:46:57,578 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 12:46:57,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 47 treesize of output 43 [2024-11-11 12:46:57,677 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 12:46:57,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 25 [2024-11-11 12:46:57,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:46:57,718 INFO L378 Elim1Store]: Elim1 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 27 treesize of output 20 [2024-11-11 12:46:57,787 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 12:46:57,800 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2024-11-11 12:46:57,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 47 [2024-11-11 12:46:57,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:46:57,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:46:57,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2024-11-11 12:46:57,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 12:46:57,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 25 [2024-11-11 12:46:57,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:46:57,968 INFO L378 Elim1Store]: Elim1 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 27 treesize of output 20 [2024-11-11 12:46:58,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:46:58,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:46:58,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2024-11-11 12:46:58,112 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 12:46:58,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 16 [2024-11-11 12:46:58,166 INFO L378 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-11 12:46:58,198 INFO L378 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-11 12:46:58,205 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:46:58,205 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 12:46:58,500 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (v_ArrVal_619 (Array Int Int))) (< 0 (+ (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_619) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|)) .cse1)) 2147483650))) is different from false [2024-11-11 12:46:58,516 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (v_ArrVal_619 (Array Int Int))) (< 0 (+ 2147483650 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_619) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|)) .cse1))))) is different from false [2024-11-11 12:46:58,527 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (v_ArrVal_619 (Array Int Int))) (< 0 (+ 2147483650 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_619) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|)) .cse1))))) is different from false [2024-11-11 12:46:58,535 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (v_ArrVal_619 (Array Int Int)) (v_ArrVal_616 Int)) (< 0 (+ 2147483650 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_616) .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_619) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|)) .cse1))))) is different from false [2024-11-11 12:46:58,984 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-11 12:46:58,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098802537] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 12:46:58,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 12:46:58,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 14] total 37 [2024-11-11 12:46:58,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735551333] [2024-11-11 12:46:58,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 12:46:58,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-11 12:46:58,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 12:46:58,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-11 12:46:58,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=998, Unknown=4, NotChecked=276, Total=1482 [2024-11-11 12:46:58,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:46:58,987 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 12:46:58,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 4.473684210526316) internal successors, (170), 38 states have internal predecessors, (170), 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) [2024-11-11 12:46:58,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:58,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:58,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:46:58,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:58,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:58,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:58,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:46:58,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:46:58,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:46:58,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:46:58,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:46:58,987 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:46:58,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-11-11 12:46:58,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-11-11 12:46:58,988 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:47:11,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:47:11,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:47:11,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:47:11,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:47:11,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:47:11,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:47:11,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:47:11,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:47:11,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:47:11,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:47:11,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:47:11,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:47:11,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-11 12:47:11,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-11 12:47:11,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-11 12:47:11,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-11 12:47:11,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-11 12:47:11,444 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-11 12:47:11,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:47:11,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1131655652, now seen corresponding path program 1 times [2024-11-11 12:47:11,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:47:11,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157559247] [2024-11-11 12:47:11,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:47:11,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 12:47:11,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:47:14,636 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:47:14,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 12:47:14,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157559247] [2024-11-11 12:47:14,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157559247] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 12:47:14,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054919004] [2024-11-11 12:47:14,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:47:14,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 12:47:14,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-11 12:47:14,638 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 12:47:14,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-11 12:47:15,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 12:47:15,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 3593 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-11 12:47:15,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 12:47:15,043 INFO L378 Elim1Store]: Elim1 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 23 treesize of output 28 [2024-11-11 12:47:15,103 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 12:47:15,128 INFO L349 Elim1Store]: treesize reduction 90, result has 23.7 percent of original size [2024-11-11 12:47:15,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 59 [2024-11-11 12:47:15,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:47:15,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:47:15,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:47:15,191 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 12:47:15,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 47 treesize of output 43 [2024-11-11 12:47:15,276 INFO L378 Elim1Store]: Elim1 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 38 treesize of output 16 [2024-11-11 12:47:15,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:47:15,306 INFO L378 Elim1Store]: Elim1 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 27 treesize of output 20 [2024-11-11 12:47:15,394 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 12:47:15,412 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2024-11-11 12:47:15,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 47 [2024-11-11 12:47:15,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:47:15,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:47:15,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2024-11-11 12:47:15,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 12:47:15,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 27 [2024-11-11 12:47:15,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:47:15,566 INFO L378 Elim1Store]: Elim1 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 27 treesize of output 20 [2024-11-11 12:47:15,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:47:15,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 12:47:15,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2024-11-11 12:47:15,690 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 12:47:15,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 16 [2024-11-11 12:47:15,756 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-11 12:47:15,756 INFO L378 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 35 [2024-11-11 12:47:15,779 INFO L378 Elim1Store]: Elim1 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 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-11 12:47:15,785 INFO L378 Elim1Store]: Elim1 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 [2024-11-11 12:47:15,788 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 12:47:15,788 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 12:47:16,107 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_724 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_29| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67|) (< (let ((.cse3 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67| 1))) |c_~#stored_elements~0.base| v_ArrVal_724) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_29|)) .cse3)) 2147483647)))) is different from false [2024-11-11 12:47:16,119 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_724 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_29| Int) (v_ArrVal_721 Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67|) (< (let ((.cse3 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_721) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67| 1))) |c_~#stored_elements~0.base| v_ArrVal_724) |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse3) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_29|)) .cse3)) 2147483647)))) is different from false [2024-11-11 12:47:16,503 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_724 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_29| Int) (v_ArrVal_719 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int) (v_ArrVal_721 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))))) (let ((.cse0 (let ((.cse6 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_719) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|) (< (select (let ((.cse4 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse0 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_721) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67| 1))) |c_~#stored_elements~0.base| v_ArrVal_724) |c_~#queue~0.base|))) (store .cse4 (+ (* (select .cse4 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_29|)) .cse1) 2147483647)))))) is different from false [2024-11-11 12:47:16,527 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_724 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_29| Int) (v_ArrVal_719 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_716 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int) (v_ArrVal_721 Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_716) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))))) (let ((.cse3 (let ((.cse6 (select (store .cse2 |c_~#stored_elements~0.base| v_ArrVal_719) |c_~#queue~0.base|))) (store .cse6 (+ (* 4 (select .cse6 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)))) (or (< (select (let ((.cse0 (select (store (store .cse2 |c_~#queue~0.base| (store (store .cse3 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_721) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67| 1))) |c_~#stored_elements~0.base| v_ArrVal_724) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_29|)) .cse1) 2147483647) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67|) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|)))))) is different from false [2024-11-11 12:47:16,740 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-11-11 12:47:16,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054919004] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 12:47:16,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 12:47:16,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 15] total 38 [2024-11-11 12:47:16,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696863531] [2024-11-11 12:47:16,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 12:47:16,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-11 12:47:16,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 12:47:16,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-11 12:47:16,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=967, Unknown=26, NotChecked=284, Total=1560 [2024-11-11 12:47:16,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:47:16,743 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-11 12:47:16,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 4.410256410256411) internal successors, (172), 39 states have internal predecessors, (172), 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) [2024-11-11 12:47:16,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:47:16,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:47:16,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:47:16,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:47:16,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:47:16,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:47:16,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:47:16,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:47:16,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:47:16,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:47:16,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:47:16,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:47:16,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-11-11 12:47:16,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-11-11 12:47:16,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2024-11-11 12:47:16,744 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-11 12:47:23,813 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse5 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse6 (+ (* (select .cse5 .cse1) 4) |c_~#queue~0.offset|)) (.cse4 (select .cse2 .cse3))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (v_ArrVal_619 (Array Int Int)) (v_ArrVal_616 Int)) (< 0 (+ 2147483650 (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_616) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_619) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|)) .cse1)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int)) (< 0 (+ 2147483650 (select (store .cse5 .cse6 |v_t1Thread1of1ForFork0_enqueue_~x#1_23|) .cse1)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_25| Int) (v_ArrVal_619 (Array Int Int)) (v_ArrVal_616 Int)) (< 0 (+ 2147483650 (select (let ((.cse7 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse8 (store .cse5 .cse6 |v_t1Thread1of1ForFork0_enqueue_~x#1_25|))) (store (store .cse8 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_616) .cse1 (+ (select .cse8 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_619) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|)) .cse1)))) (< 0 (+ 2147483650 .cse4))))) is different from false [2024-11-11 12:47:23,888 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse10 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse7 (select .cse9 .cse10))) (and (forall ((v_ArrVal_724 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_29| Int) (v_ArrVal_719 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_716 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int) (v_ArrVal_721 Int)) (let ((.cse4 (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|))) (.cse3 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse2 (let ((.cse5 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_716) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_719) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_721) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67| 1))) |c_~#stored_elements~0.base| v_ArrVal_724) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_29|)) .cse1) 2147483647) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67|) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|))))) (forall ((v_ArrVal_724 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_29| Int) (v_ArrVal_721 Int)) (or (< .cse7 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67|) (< (select (let ((.cse8 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse9 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_721) .cse10 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67| 1))) |c_~#stored_elements~0.base| v_ArrVal_724) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_29|)) .cse1) 2147483647))) (< .cse7 2147483647)))) is different from false [2024-11-11 12:47:24,367 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse4 (select .cse2 .cse3))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (v_ArrVal_619 (Array Int Int)) (v_ArrVal_616 Int)) (< 0 (+ 2147483650 (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_616) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_619) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|)) .cse1)))) (forall ((v_ArrVal_621 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (< 0 (+ 2147483650 (select (let ((.cse5 (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (store (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|) (+ 3208 |c_t2Thread1of1ForFork1_dequeue_~q#1.offset|) (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 3200) v_ArrVal_621)) |c_~#queue~0.base|))) (store .cse5 (+ (* 4 (select .cse5 .cse1)) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|)) .cse1)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_25| Int) (v_ArrVal_619 (Array Int Int)) (v_ArrVal_616 Int)) (< 0 (+ 2147483650 (select (let ((.cse6 (select (store (store |c_#memory_int| |c_~#queue~0.base| (let ((.cse7 (let ((.cse8 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_25|)))) (store (store .cse7 (+ 3208 |c_~#queue~0.offset|) v_ArrVal_616) .cse1 (+ (select .cse7 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_619) |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|)) .cse1)))) (< 0 (+ 2147483650 .cse4))))) is different from false [2024-11-11 12:47:24,439 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse11 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse8 (select .cse10 .cse11))) (and (forall ((v_ArrVal_724 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_29| Int) (v_ArrVal_719 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_31| Int) (v_ArrVal_716 Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_33| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| Int) (v_ArrVal_721 Int)) (let ((.cse4 (let ((.cse6 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse6 (+ (* (select .cse6 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_33|))) (.cse3 (+ 3208 |c_~#queue~0.offset|))) (let ((.cse2 (let ((.cse5 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse4 .cse3 v_ArrVal_716) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70| 1))) |c_~#stored_elements~0.base| v_ArrVal_719) |c_~#queue~0.base|))) (store .cse5 (+ |c_~#queue~0.offset| (* (select .cse5 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_31|)))) (or (< (select (let ((.cse0 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store (store .cse2 .cse3 v_ArrVal_721) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67| 1))) |c_~#stored_elements~0.base| v_ArrVal_724) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_29|)) .cse1) 2147483647) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67|) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_70|))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_29| Int) (v_ArrVal_727 Int) (|t2Thread1of1ForFork1_dequeue_#t~post45#1| Int)) (< (select (let ((.cse7 (select (store |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base| (store (store (select |c_#memory_int| |c_t2Thread1of1ForFork1_dequeue_~q#1.base|) (+ 3208 |c_t2Thread1of1ForFork1_dequeue_~q#1.offset|) (+ (- 1) |t2Thread1of1ForFork1_dequeue_#t~post45#1|)) (+ |c_t2Thread1of1ForFork1_dequeue_~q#1.offset| 3200) v_ArrVal_727)) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_29|)) .cse1) 2147483647)) (forall ((v_ArrVal_724 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_29| Int) (v_ArrVal_721 Int)) (or (< .cse8 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67|) (< (select (let ((.cse9 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_721) .cse11 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67| 1))) |c_~#stored_elements~0.base| v_ArrVal_724) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_29|)) .cse1) 2147483647))) (< .cse8 2147483647)))) is different from false [2024-11-11 12:47:26,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-11 12:47:28,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-11 12:47:29,351 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (v_ArrVal_619 (Array Int Int)) (v_ArrVal_616 Int)) (< 0 (+ 2147483650 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_616) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_619) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|)) .cse1))))) (< 0 (+ 2147483650 .cse4))))) is different from false [2024-11-11 12:47:29,355 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (and (forall ((v_ArrVal_724 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_29| Int) (v_ArrVal_721 Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67|) (< (let ((.cse2 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_721) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67| 1))) |c_~#stored_elements~0.base| v_ArrVal_724) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_29|)) .cse2)) 2147483647))) (< .cse0 2147483647)))) is different from false [2024-11-11 12:47:29,452 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (and (forall ((v_ArrVal_724 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67| Int) (|v_t1Thread1of1ForFork0_enqueue_~x#1_29| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67|) (< (let ((.cse2 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse3 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post41#1_67| 1))) |c_~#stored_elements~0.base| v_ArrVal_724) |c_~#queue~0.base|))) (store .cse1 (+ |c_~#queue~0.offset| (* (select .cse1 .cse2) 4)) |v_t1Thread1of1ForFork0_enqueue_~x#1_29|)) .cse2)) 2147483647))) (< .cse0 2147483647)))) is different from false [2024-11-11 12:47:29,480 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (<= 0 (+ 2147483649 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|)) (forall ((|v_t1Thread1of1ForFork0_enqueue_~x#1_23| Int) (v_ArrVal_619 (Array Int Int))) (< 0 (+ 2147483650 (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_619) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_23|)) .cse1))))) (< 0 (+ 2147483650 (select .cse2 .cse3))))) is different from false [2024-11-11 12:47:29,566 WARN L851 $PredicateComparison]: unable to prove that (and (<= |c_t1Thread1of1ForFork0_enqueue_#t~post41#1| 2) (forall ((v_ArrVal_724 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_~x#1_29| Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#stored_elements~0.base| v_ArrVal_724) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork0_enqueue_~x#1_29|)) .cse1)) 2147483647))) is different from false [2024-11-11 12:47:30,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:47:30,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:47:30,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 12:47:30,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:47:30,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:47:30,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:47:30,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 12:47:30,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:47:30,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 12:47:30,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:47:30,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:47:30,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 12:47:30,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-11 12:47:30,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-11 12:47:30,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-11 12:47:30,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-11 12:47:30,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-11 12:47:30,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-11 12:47:30,688 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-11 12:47:30,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 12:47:30,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1349031956, now seen corresponding path program 1 times [2024-11-11 12:47:30,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 12:47:30,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133854744] [2024-11-11 12:47:30,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 12:47:30,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 12:47:30,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat