./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_75-tricky_address2_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c7c6ca5d 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/goblint-regression/28-race_reach_75-tricky_address2_racefree.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 3c0354ee6107efc04d15102ecf9eef73430e38e14b70f16419cd07cd733fd0df --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-13 12:36:38,957 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 12:36:39,017 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Overflow-32bit-GemCutter_Default.epf [2024-11-13 12:36:39,022 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 12:36:39,023 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 12:36:39,050 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 12:36:39,050 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 12:36:39,051 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 12:36:39,051 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 12:36:39,053 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 12:36:39,054 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 12:36:39,054 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 12:36:39,055 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 12:36:39,055 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 12:36:39,055 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 12:36:39,055 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 12:36:39,056 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 12:36:39,056 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 12:36:39,056 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 12:36:39,056 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 12:36:39,057 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 12:36:39,060 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 12:36:39,060 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 12:36:39,060 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-13 12:36:39,060 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 12:36:39,061 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 12:36:39,061 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 12:36:39,061 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 12:36:39,061 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 12:36:39,061 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 12:36:39,062 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 12:36:39,062 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 12:36:39,062 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 12:36:39,062 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 12:36:39,063 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 12:36:39,063 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 12:36:39,063 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 12:36:39,066 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-11-13 12:36:39,066 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 12:36:39,067 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 12:36:39,067 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2024-11-13 12:36:39,067 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-11-13 12:36:39,067 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-11-13 12:36:39,068 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-11-13 12:36:39,068 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 -> 3c0354ee6107efc04d15102ecf9eef73430e38e14b70f16419cd07cd733fd0df [2024-11-13 12:36:39,327 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 12:36:39,356 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 12:36:39,360 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 12:36:39,361 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 12:36:39,362 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 12:36:39,363 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_75-tricky_address2_racefree.i [2024-11-13 12:36:40,711 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 12:36:40,993 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 12:36:40,994 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_75-tricky_address2_racefree.i [2024-11-13 12:36:41,009 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/fd2431a81/3c7a06984b30425299fbe727b2bd2dd1/FLAGd7c94738d [2024-11-13 12:36:41,025 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/fd2431a81/3c7a06984b30425299fbe727b2bd2dd1 [2024-11-13 12:36:41,028 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 12:36:41,029 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 12:36:41,032 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 12:36:41,032 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 12:36:41,036 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 12:36:41,037 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:36:41" (1/1) ... [2024-11-13 12:36:41,038 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@750feea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:36:41, skipping insertion in model container [2024-11-13 12:36:41,039 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 12:36:41" (1/1) ... [2024-11-13 12:36:41,082 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 12:36:41,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:36:41,501 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 12:36:41,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 12:36:41,622 INFO L204 MainTranslator]: Completed translation [2024-11-13 12:36:41,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:36:41 WrapperNode [2024-11-13 12:36:41,623 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 12:36:41,624 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 12:36:41,624 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 12:36:41,624 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 12:36:41,629 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:36:41" (1/1) ... [2024-11-13 12:36:41,650 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:36:41" (1/1) ... [2024-11-13 12:36:41,678 INFO L138 Inliner]: procedures = 271, calls = 110, calls flagged for inlining = 7, calls inlined = 8, statements flattened = 290 [2024-11-13 12:36:41,679 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 12:36:41,679 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 12:36:41,679 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 12:36:41,679 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 12:36:41,686 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:36:41" (1/1) ... [2024-11-13 12:36:41,686 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:36:41" (1/1) ... [2024-11-13 12:36:41,690 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:36:41" (1/1) ... [2024-11-13 12:36:41,690 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:36:41" (1/1) ... [2024-11-13 12:36:41,697 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:36:41" (1/1) ... [2024-11-13 12:36:41,700 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:36:41" (1/1) ... [2024-11-13 12:36:41,702 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:36:41" (1/1) ... [2024-11-13 12:36:41,703 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:36:41" (1/1) ... [2024-11-13 12:36:41,705 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 12:36:41,706 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 12:36:41,706 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 12:36:41,706 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 12:36:41,707 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:36:41" (1/1) ... [2024-11-13 12:36:41,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-13 12:36:41,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 12:36:41,742 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-13 12:36:41,746 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-13 12:36:41,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-13 12:36:41,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-13 12:36:41,783 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-13 12:36:41,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-13 12:36:41,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-13 12:36:41,783 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-13 12:36:41,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 12:36:41,784 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-13 12:36:41,784 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-13 12:36:41,784 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-13 12:36:41,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 12:36:41,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 12:36:41,787 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 12:36:41,887 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 12:36:41,889 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 12:36:42,220 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 12:36:42,220 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 12:36:42,727 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 12:36:42,727 INFO L316 CfgBuilder]: Removed 23 assume(true) statements. [2024-11-13 12:36:42,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:36:42 BoogieIcfgContainer [2024-11-13 12:36:42,728 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 12:36:42,730 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 12:36:42,730 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 12:36:42,734 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 12:36:42,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 12:36:41" (1/3) ... [2024-11-13 12:36:42,735 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63cd3aad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:36:42, skipping insertion in model container [2024-11-13 12:36:42,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 12:36:41" (2/3) ... [2024-11-13 12:36:42,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63cd3aad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 12:36:42, skipping insertion in model container [2024-11-13 12:36:42,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 12:36:42" (3/3) ... [2024-11-13 12:36:42,738 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_75-tricky_address2_racefree.i [2024-11-13 12:36:42,754 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 12:36:42,756 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2024-11-13 12:36:42,756 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 12:36:42,807 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-13 12:36:42,865 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 12:36:42,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-11-13 12:36:42,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 12:36:42,868 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-13 12:36:42,872 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-13 12:36:42,902 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 12:36:42,911 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2024-11-13 12:36:42,917 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;@71e86c16, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 12:36:42,917 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-13 12:36:43,179 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 9 treesize of output 3 [2024-11-13 12:36:43,185 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 9 treesize of output 3 [2024-11-13 12:36:43,204 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-13 12:36:43,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:36:43,210 INFO L85 PathProgramCache]: Analyzing trace with hash 946315562, now seen corresponding path program 1 times [2024-11-13 12:36:43,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:36:43,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337121197] [2024-11-13 12:36:43,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:36:43,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:36:43,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:36:43,481 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-13 12:36:43,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:36:43,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337121197] [2024-11-13 12:36:43,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337121197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:36:43,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:36:43,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 12:36:43,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610327854] [2024-11-13 12:36:43,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:36:43,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:36:43,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:36:43,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:36:43,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:36:43,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:36:43,512 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:36:43,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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-13 12:36:43,513 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:36:43,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:36:43,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 12:36:43,579 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-13 12:36:43,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:36:43,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1098334102, now seen corresponding path program 1 times [2024-11-13 12:36:43,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:36:43,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246113150] [2024-11-13 12:36:43,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:36:43,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:36:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:36:43,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:36:43,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:36:43,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246113150] [2024-11-13 12:36:43,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246113150] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:36:43,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210117454] [2024-11-13 12:36:43,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:36:43,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:36:43,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 12:36:43,756 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-13 12:36:43,758 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-13 12:36:43,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:36:43,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 12:36:43,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:36:43,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:36:43,910 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:36:43,947 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:36:43,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210117454] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:36:43,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:36:43,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-11-13 12:36:43,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643070989] [2024-11-13 12:36:43,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:36:43,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 12:36:43,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:36:43,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 12:36:43,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-13 12:36:43,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:36:43,953 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:36:43,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 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-13 12:36:43,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:36:43,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:36:44,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:36:44,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:36:44,060 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-13 12:36:44,246 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,SelfDestructingSolverStorable1 [2024-11-13 12:36:44,247 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-13 12:36:44,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:36:44,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1219411050, now seen corresponding path program 2 times [2024-11-13 12:36:44,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:36:44,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108067741] [2024-11-13 12:36:44,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:36:44,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:36:44,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:36:44,351 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 12:36:44,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:36:44,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108067741] [2024-11-13 12:36:44,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108067741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:36:44,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:36:44,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:36:44,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107762048] [2024-11-13 12:36:44,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:36:44,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:36:44,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:36:44,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:36:44,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:36:44,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:36:44,357 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:36:44,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-13 12:36:44,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:36:44,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:36:44,357 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:36:44,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:36:44,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:36:44,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:36:44,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 12:36:44,493 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-13 12:36:44,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:36:44,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1545060096, now seen corresponding path program 1 times [2024-11-13 12:36:44,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:36:44,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715755723] [2024-11-13 12:36:44,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:36:44,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:36:44,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:36:44,633 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 12:36:44,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:36:44,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715755723] [2024-11-13 12:36:44,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715755723] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:36:44,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463505507] [2024-11-13 12:36:44,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:36:44,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:36:44,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 12:36:44,635 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-13 12:36:44,638 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-13 12:36:44,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:36:44,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 12:36:44,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:36:44,756 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 12:36:44,756 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:36:44,827 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 12:36:44,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463505507] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:36:44,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:36:44,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2024-11-13 12:36:44,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065968182] [2024-11-13 12:36:44,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:36:44,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-13 12:36:44,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:36:44,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-13 12:36:44,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-13 12:36:44,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:36:44,830 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:36:44,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 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-13 12:36:44,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:36:44,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:36:44,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:36:44,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:36:44,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:36:44,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:36:44,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:36:44,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:36:44,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-13 12:36:45,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:36:45,166 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-13 12:36:45,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:36:45,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1802516736, now seen corresponding path program 2 times [2024-11-13 12:36:45,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:36:45,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065511286] [2024-11-13 12:36:45,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:36:45,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:36:45,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:36:45,396 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 12:36:45,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:36:45,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065511286] [2024-11-13 12:36:45,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065511286] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:36:45,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860397270] [2024-11-13 12:36:45,396 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 12:36:45,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:36:45,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 12:36:45,401 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-13 12:36:45,402 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-13 12:36:45,515 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 12:36:45,516 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:36:45,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-13 12:36:45,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:36:45,576 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 12:36:45,576 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:36:45,743 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 12:36:45,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860397270] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:36:45,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:36:45,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 22 [2024-11-13 12:36:45,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070143191] [2024-11-13 12:36:45,744 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:36:45,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-13 12:36:45,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:36:45,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-13 12:36:45,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2024-11-13 12:36:45,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:36:45,746 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:36:45,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:36:45,747 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:36:45,747 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:36:45,747 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:36:45,747 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:36:45,747 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:36:45,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:36:45,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:36:45,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:36:45,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:36:45,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 12:36:45,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 12:36:46,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:36:46,156 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-13 12:36:46,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:36:46,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1251416160, now seen corresponding path program 3 times [2024-11-13 12:36:46,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:36:46,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621885555] [2024-11-13 12:36:46,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:36:46,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:36:46,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:36:47,800 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-13 12:36:47,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:36:47,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621885555] [2024-11-13 12:36:47,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621885555] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:36:47,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484253408] [2024-11-13 12:36:47,802 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 12:36:47,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:36:47,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 12:36:47,805 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-13 12:36:47,806 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-13 12:36:47,899 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-13 12:36:47,900 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:36:47,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-13 12:36:47,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:36:48,866 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 12:36:48,866 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 11 treesize of output 11 [2024-11-13 12:36:48,948 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 86 treesize of output 61 [2024-11-13 12:36:49,413 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 86 treesize of output 61 [2024-11-13 12:36:49,620 INFO L349 Elim1Store]: treesize reduction 78, result has 3.7 percent of original size [2024-11-13 12:36:49,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 56 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 10 case distinctions, treesize of input 87 treesize of output 40 [2024-11-13 12:36:49,636 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-13 12:36:49,636 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:36:49,679 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_184 (Array Int Int))) (< 0 (+ 2147483650 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_184) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread1of1ForFork0_~i~0#1| 28)))))) is different from false [2024-11-13 12:36:50,317 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 1 not checked. [2024-11-13 12:36:50,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484253408] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:36:50,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:36:50,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2024-11-13 12:36:50,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948160236] [2024-11-13 12:36:50,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:36:50,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 12:36:50,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:36:50,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 12:36:50,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=189, Unknown=3, NotChecked=28, Total=272 [2024-11-13 12:36:50,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:36:50,323 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:36:50,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 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-13 12:36:50,323 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:36:50,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:36:50,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:36:50,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:36:50,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-13 12:36:50,324 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:36:50,532 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 9 treesize of output 3 [2024-11-13 12:36:50,534 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 9 treesize of output 3 [2024-11-13 12:36:50,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:36:50,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:36:50,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:36:50,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:36:50,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 12:36:50,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:36:50,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-13 12:36:51,028 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,SelfDestructingSolverStorable5 [2024-11-13 12:36:51,028 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-13 12:36:51,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:36:51,029 INFO L85 PathProgramCache]: Analyzing trace with hash -206432122, now seen corresponding path program 1 times [2024-11-13 12:36:51,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:36:51,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753555890] [2024-11-13 12:36:51,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:36:51,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:36:51,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:36:52,447 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-13 12:36:52,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:36:52,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753555890] [2024-11-13 12:36:52,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753555890] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:36:52,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282649898] [2024-11-13 12:36:52,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:36:52,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:36:52,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 12:36:52,451 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-13 12:36:52,453 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-13 12:36:52,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:36:52,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-11-13 12:36:52,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:36:54,414 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 12:36:54,415 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 11 treesize of output 11 [2024-11-13 12:36:54,499 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 86 treesize of output 61 [2024-11-13 12:36:54,881 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 86 treesize of output 61 [2024-11-13 12:36:55,361 INFO L349 Elim1Store]: treesize reduction 257, result has 30.7 percent of original size [2024-11-13 12:36:55,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 56 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 20 case distinctions, treesize of input 114 treesize of output 165 [2024-11-13 12:36:55,792 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:36:55,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 56 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 10 case distinctions, treesize of input 136 treesize of output 160 [2024-11-13 12:36:55,850 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 1 proven. 145 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 12:36:55,851 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:36:56,035 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_23| Int) (v_ArrVal_258 (Array Int Int))) (or (< 9 |v_t_funThread1of1ForFork0_~i~0#1_23|) (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_258) |c_~#a~0.base|) (+ (* |v_t_funThread1of1ForFork0_~i~0#1_23| 28) |c_~#a~0.offset|)))) (< |v_t_funThread1of1ForFork0_~i~0#1_23| 0))) is different from false [2024-11-13 12:36:56,819 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 2 not checked. [2024-11-13 12:36:56,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282649898] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:36:56,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:36:56,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 25, 7] total 38 [2024-11-13 12:36:56,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690902836] [2024-11-13 12:36:56,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:36:56,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-13 12:36:56,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:36:56,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-13 12:36:56,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1318, Unknown=3, NotChecked=74, Total=1560 [2024-11-13 12:36:56,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:36:56,823 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:36:56,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 2.8205128205128207) internal successors, (110), 39 states have internal predecessors, (110), 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-13 12:36:56,823 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:36:56,823 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:36:56,823 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:36:56,823 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:36:56,823 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-13 12:36:56,823 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:36:56,824 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:36:57,808 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 9 treesize of output 3 [2024-11-13 12:36:57,809 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 9 treesize of output 3 [2024-11-13 12:36:58,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:36:58,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:36:58,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:36:58,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:36:58,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 12:36:58,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:36:58,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-13 12:36:58,387 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-13 12:36:58,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:36:58,577 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-13 12:36:58,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:36:58,577 INFO L85 PathProgramCache]: Analyzing trace with hash -2104427630, now seen corresponding path program 1 times [2024-11-13 12:36:58,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:36:58,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748651404] [2024-11-13 12:36:58,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:36:58,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:36:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:36:58,717 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2024-11-13 12:36:58,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:36:58,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748651404] [2024-11-13 12:36:58,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748651404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:36:58,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:36:58,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:36:58,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253356668] [2024-11-13 12:36:58,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:36:58,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:36:58,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:36:58,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:36:58,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:36:58,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:36:58,719 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:36:58,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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-13 12:36:58,720 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:36:58,720 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:36:58,720 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:36:58,720 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:36:58,720 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-13 12:36:58,720 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:36:58,720 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-13 12:36:58,720 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:36:59,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:36:59,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:36:59,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:36:59,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:36:59,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 12:36:59,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:36:59,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-13 12:36:59,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:36:59,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 12:36:59,613 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-13 12:36:59,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:36:59,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1355245415, now seen corresponding path program 1 times [2024-11-13 12:36:59,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:36:59,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788421424] [2024-11-13 12:36:59,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:36:59,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:36:59,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:36:59,700 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-13 12:36:59,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:36:59,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788421424] [2024-11-13 12:36:59,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788421424] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:36:59,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436707656] [2024-11-13 12:36:59,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:36:59,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:36:59,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 12:36:59,709 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:36:59,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-13 12:36:59,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:36:59,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 12:36:59,837 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:36:59,843 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 11 treesize of output 7 [2024-11-13 12:36:59,857 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-11-13 12:36:59,857 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:36:59,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436707656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:36:59,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:36:59,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-13 12:36:59,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520820521] [2024-11-13 12:36:59,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:36:59,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:36:59,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:36:59,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:36:59,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-13 12:36:59,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:36:59,861 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:36:59,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:36:59,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:36:59,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:36:59,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:36:59,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:36:59,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-13 12:36:59,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:36:59,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-11-13 12:36:59,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:36:59,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:37:00,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:37:00,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:37:00,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:00,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:37:00,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 12:37:00,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:37:00,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-13 12:37:00,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:00,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:37:00,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-13 12:37:00,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-13 12:37:00,284 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-13 12:37:00,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:37:00,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1197294209, now seen corresponding path program 1 times [2024-11-13 12:37:00,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:37:00,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618262195] [2024-11-13 12:37:00,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:37:00,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:37:00,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:37:00,374 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-13 12:37:00,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:37:00,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618262195] [2024-11-13 12:37:00,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618262195] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:37:00,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268512049] [2024-11-13 12:37:00,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:37:00,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:37:00,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 12:37:00,379 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:37:00,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-13 12:37:00,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:37:00,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 12:37:00,502 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:37:00,525 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-13 12:37:00,526 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:37:00,552 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-13 12:37:00,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268512049] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:37:00,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:37:00,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2024-11-13 12:37:00,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127786587] [2024-11-13 12:37:00,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:37:00,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 12:37:00,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:37:00,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 12:37:00,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-13 12:37:00,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:37:00,554 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:37:00,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 10 states have internal predecessors, (58), 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-13 12:37:00,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:37:00,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:37:00,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:00,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:37:00,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-13 12:37:00,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:37:00,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-11-13 12:37:00,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:00,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:37:00,555 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:37:00,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:37:00,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:37:00,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:00,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:37:00,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 12:37:00,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 12:37:00,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-13 12:37:00,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:37:00,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:37:00,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:37:00,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-13 12:37:01,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:37:01,075 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-13 12:37:01,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:37:01,075 INFO L85 PathProgramCache]: Analyzing trace with hash -22010520, now seen corresponding path program 2 times [2024-11-13 12:37:01,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:37:01,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364198755] [2024-11-13 12:37:01,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:37:01,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:37:01,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:37:01,985 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-13 12:37:01,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:37:01,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364198755] [2024-11-13 12:37:01,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364198755] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:37:01,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769334989] [2024-11-13 12:37:01,986 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 12:37:01,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:37:01,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 12:37:01,987 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:37:01,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-13 12:37:02,120 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 12:37:02,121 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:37:02,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 79 conjuncts are in the unsatisfiable core [2024-11-13 12:37:02,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:37:03,735 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 12:37:03,736 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 11 treesize of output 11 [2024-11-13 12:37:03,828 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 79 treesize of output 56 [2024-11-13 12:37:04,490 INFO L349 Elim1Store]: treesize reduction 257, result has 30.7 percent of original size [2024-11-13 12:37:04,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 20 case distinctions, treesize of input 107 treesize of output 155 [2024-11-13 12:37:04,700 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 128 treesize of output 103 [2024-11-13 12:37:05,172 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:37:05,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 129 treesize of output 157 [2024-11-13 12:37:05,250 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 12:37:05,251 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:37:08,552 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 36 times theorem prover too weak. 109 trivial. 0 not checked. [2024-11-13 12:37:08,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769334989] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:37:08,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:37:08,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 25, 9] total 39 [2024-11-13 12:37:08,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790123932] [2024-11-13 12:37:08,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:37:08,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-13 12:37:08,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:37:08,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-13 12:37:08,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1451, Unknown=11, NotChecked=0, Total=1640 [2024-11-13 12:37:08,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:37:08,556 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:37:08,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.775) internal successors, (111), 40 states have internal predecessors, (111), 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-13 12:37:08,557 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:37:08,557 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:37:08,557 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:08,557 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:37:08,557 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-13 12:37:08,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-13 12:37:08,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-11-13 12:37:08,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:37:08,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:37:08,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:37:08,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:37:10,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:37:10,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:37:10,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:10,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:37:10,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 12:37:10,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 12:37:10,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-13 12:37:10,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:37:10,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:37:10,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:37:10,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-13 12:37:10,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-13 12:37:11,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:37:11,134 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-13 12:37:11,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:37:11,135 INFO L85 PathProgramCache]: Analyzing trace with hash -682325264, now seen corresponding path program 2 times [2024-11-13 12:37:11,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:37:11,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636828690] [2024-11-13 12:37:11,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:37:11,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:37:11,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:37:11,319 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-13 12:37:11,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:37:11,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636828690] [2024-11-13 12:37:11,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636828690] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:37:11,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647970700] [2024-11-13 12:37:11,320 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 12:37:11,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:37:11,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 12:37:11,322 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:37:11,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-13 12:37:11,423 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 12:37:11,423 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:37:11,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-13 12:37:11,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:37:11,502 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 12:37:11,503 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 11 treesize of output 11 [2024-11-13 12:37:11,544 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 1 [2024-11-13 12:37:11,561 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 20 treesize of output 15 [2024-11-13 12:37:11,586 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 23 treesize of output 7 [2024-11-13 12:37:11,589 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-13 12:37:11,589 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:37:11,620 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_612 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_612) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) 2147483649)) is different from false [2024-11-13 12:37:11,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:37:11,629 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2024-11-13 12:37:11,635 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 25 [2024-11-13 12:37:11,694 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 1 not checked. [2024-11-13 12:37:11,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647970700] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:37:11,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:37:11,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-11-13 12:37:11,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143983144] [2024-11-13 12:37:11,695 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:37:11,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 12:37:11,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:37:11,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 12:37:11,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=119, Unknown=1, NotChecked=22, Total=182 [2024-11-13 12:37:11,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:37:11,697 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:37:11,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.153846153846154) internal successors, (67), 13 states have internal predecessors, (67), 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-13 12:37:11,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:37:11,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:37:11,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:11,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:37:11,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-13 12:37:11,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-13 12:37:11,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-11-13 12:37:11,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:37:11,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:37:11,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:37:11,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-13 12:37:11,698 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:37:12,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:37:12,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:37:12,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:12,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:37:12,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 12:37:12,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 12:37:12,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-13 12:37:12,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:37:12,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:37:12,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:37:12,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-13 12:37:12,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:37:12,789 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-13 12:37:12,789 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-13 12:37:12,789 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-13 12:37:12,789 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-13 12:37:12,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-13 12:37:12,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-13 12:37:12,999 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1] [2024-11-13 12:37:13,001 INFO L317 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was SAFE,SAFE,SAFE,SAFE (1/2) [2024-11-13 12:37:13,003 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 12:37:13,004 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 12:37:13,004 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-11-13 12:37:13,005 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;@71e86c16, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 12:37:13,005 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-11-13 12:37:13,010 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-13 12:37:13,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:37:13,011 INFO L85 PathProgramCache]: Analyzing trace with hash 757606, now seen corresponding path program 1 times [2024-11-13 12:37:13,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:37:13,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246316691] [2024-11-13 12:37:13,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:37:13,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:37:13,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:37:13,073 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-13 12:37:13,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:37:13,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246316691] [2024-11-13 12:37:13,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246316691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:37:13,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:37:13,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 12:37:13,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599287398] [2024-11-13 12:37:13,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:37:13,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:37:13,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:37:13,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:37:13,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:37:13,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:37:13,076 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:37:13,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 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-13 12:37:13,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:37:13,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:13,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 12:37:13,132 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-13 12:37:13,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:37:13,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1095767238, now seen corresponding path program 1 times [2024-11-13 12:37:13,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:37:13,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482541568] [2024-11-13 12:37:13,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:37:13,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:37:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:37:13,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:37:13,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:37:13,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482541568] [2024-11-13 12:37:13,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482541568] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:37:13,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321316059] [2024-11-13 12:37:13,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:37:13,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:37:13,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 12:37:13,213 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:37:13,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-13 12:37:13,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:37:13,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 12:37:13,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:37:13,317 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:37:13,318 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:37:13,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321316059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:37:13,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:37:13,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-11-13 12:37:13,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790740362] [2024-11-13 12:37:13,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:37:13,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 12:37:13,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:37:13,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 12:37:13,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-13 12:37:13,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:37:13,321 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:37:13,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 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-13 12:37:13,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:13,321 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:37:13,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:13,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:37:13,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-13 12:37:13,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:37:13,559 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-13 12:37:13,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:37:13,560 INFO L85 PathProgramCache]: Analyzing trace with hash -390953220, now seen corresponding path program 1 times [2024-11-13 12:37:13,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:37:13,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740019946] [2024-11-13 12:37:13,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:37:13,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:37:13,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:37:13,580 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 12:37:13,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:37:13,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740019946] [2024-11-13 12:37:13,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740019946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:37:13,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:37:13,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 12:37:13,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784520872] [2024-11-13 12:37:13,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:37:13,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:37:13,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:37:13,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:37:13,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:37:13,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:37:13,583 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:37:13,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) 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-13 12:37:13,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:13,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:37:13,583 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:37:13,629 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 9 treesize of output 3 [2024-11-13 12:37:13,630 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 9 treesize of output 3 [2024-11-13 12:37:13,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:13,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:37:13,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:37:13,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 12:37:13,643 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-13 12:37:13,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:37:13,643 INFO L85 PathProgramCache]: Analyzing trace with hash -671348803, now seen corresponding path program 1 times [2024-11-13 12:37:13,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:37:13,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014950728] [2024-11-13 12:37:13,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:37:13,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:37:13,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:37:13,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:37:13,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:37:13,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014950728] [2024-11-13 12:37:13,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014950728] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:37:13,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293910308] [2024-11-13 12:37:13,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:37:13,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:37:13,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 12:37:13,709 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:37:13,710 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-13 12:37:13,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:37:13,802 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 12:37:13,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:37:13,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:37:13,815 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:37:13,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:37:13,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [293910308] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:37:13,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:37:13,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-11-13 12:37:13,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593661966] [2024-11-13 12:37:13,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:37:13,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 12:37:13,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:37:13,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 12:37:13,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-13 12:37:13,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:37:13,837 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:37:13,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:37:13,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:13,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:37:13,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:37:13,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:37:13,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:13,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:37:13,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:37:13,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:37:13,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-13 12:37:14,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-13 12:37:14,112 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-13 12:37:14,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:37:14,112 INFO L85 PathProgramCache]: Analyzing trace with hash -2058419267, now seen corresponding path program 2 times [2024-11-13 12:37:14,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:37:14,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839074748] [2024-11-13 12:37:14,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:37:14,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:37:14,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:37:14,142 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 12:37:14,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:37:14,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839074748] [2024-11-13 12:37:14,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839074748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:37:14,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:37:14,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:37:14,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629236240] [2024-11-13 12:37:14,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:37:14,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:37:14,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:37:14,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:37:14,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:37:14,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:37:14,145 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:37:14,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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-13 12:37:14,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:14,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:37:14,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:37:14,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:37:14,146 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:37:14,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:14,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:37:14,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:37:14,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:37:14,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:14,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-13 12:37:14,210 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-13 12:37:14,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:37:14,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1365643, now seen corresponding path program 1 times [2024-11-13 12:37:14,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:37:14,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80158843] [2024-11-13 12:37:14,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:37:14,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:37:14,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:37:14,280 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 12:37:14,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:37:14,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80158843] [2024-11-13 12:37:14,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80158843] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:37:14,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955590908] [2024-11-13 12:37:14,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:37:14,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:37:14,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 12:37:14,283 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:37:14,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-13 12:37:14,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:37:14,369 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 12:37:14,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:37:14,388 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 12:37:14,389 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:37:14,447 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 12:37:14,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955590908] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:37:14,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:37:14,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2024-11-13 12:37:14,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474980297] [2024-11-13 12:37:14,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:37:14,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-13 12:37:14,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:37:14,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-13 12:37:14,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-13 12:37:14,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:37:14,449 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:37:14,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 17 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:37:14,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:14,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:37:14,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:37:14,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:37:14,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:14,450 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:37:14,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:14,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:37:14,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:37:14,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:37:14,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:14,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 12:37:14,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-11-13 12:37:14,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-13 12:37:14,806 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-13 12:37:14,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:37:14,807 INFO L85 PathProgramCache]: Analyzing trace with hash 94843253, now seen corresponding path program 2 times [2024-11-13 12:37:14,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:37:14,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681878316] [2024-11-13 12:37:14,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:37:14,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:37:14,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:37:14,972 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 12:37:14,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:37:14,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681878316] [2024-11-13 12:37:14,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681878316] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:37:14,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233103585] [2024-11-13 12:37:14,972 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 12:37:14,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:37:14,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 12:37:14,974 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:37:14,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-13 12:37:15,067 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 12:37:15,068 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:37:15,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-13 12:37:15,069 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:37:15,103 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 12:37:15,103 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:37:15,234 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-13 12:37:15,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233103585] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:37:15,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:37:15,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 22 [2024-11-13 12:37:15,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778273246] [2024-11-13 12:37:15,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:37:15,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-13 12:37:15,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:37:15,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-13 12:37:15,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2024-11-13 12:37:15,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:37:15,236 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:37:15,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 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-13 12:37:15,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:15,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:37:15,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:37:15,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:37:15,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:15,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-13 12:37:15,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:37:15,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:15,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:37:15,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:37:15,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 12:37:15,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:15,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 12:37:15,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-11-13 12:37:15,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-13 12:37:15,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:37:15,683 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2024-11-13 12:37:15,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:37:15,683 INFO L85 PathProgramCache]: Analyzing trace with hash 332280533, now seen corresponding path program 3 times [2024-11-13 12:37:15,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:37:15,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382097447] [2024-11-13 12:37:15,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:37:15,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:37:15,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:37:15,703 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 12:37:15,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 12:37:15,748 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 12:37:15,752 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 12:37:15,752 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2024-11-13 12:37:15,752 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 11 remaining) [2024-11-13 12:37:15,752 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 11 remaining) [2024-11-13 12:37:15,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 11 remaining) [2024-11-13 12:37:15,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 11 remaining) [2024-11-13 12:37:15,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 11 remaining) [2024-11-13 12:37:15,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 11 remaining) [2024-11-13 12:37:15,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 11 remaining) [2024-11-13 12:37:15,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 11 remaining) [2024-11-13 12:37:15,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 11 remaining) [2024-11-13 12:37:15,753 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 11 remaining) [2024-11-13 12:37:15,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-13 12:37:15,758 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1] [2024-11-13 12:37:15,763 INFO L317 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (2/2) [2024-11-13 12:37:15,764 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-13 12:37:15,767 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-13 12:37:15,792 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-13 12:37:15,794 INFO L107 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 12:37:15,796 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-11-13 12:37:15,796 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of2ForFork0 ======== [2024-11-13 12:37:15,797 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;@71e86c16, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 12:37:15,797 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-13 12:37:15,829 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 9 treesize of output 3 [2024-11-13 12:37:15,831 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 9 treesize of output 3 [2024-11-13 12:37:15,834 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-13 12:37:15,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:37:15,835 INFO L85 PathProgramCache]: Analyzing trace with hash 109074006, now seen corresponding path program 1 times [2024-11-13 12:37:15,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:37:15,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511585480] [2024-11-13 12:37:15,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:37:15,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:37:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:37:15,853 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-13 12:37:15,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:37:15,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511585480] [2024-11-13 12:37:15,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511585480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:37:15,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:37:15,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 12:37:15,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337830689] [2024-11-13 12:37:15,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:37:15,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:37:15,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:37:15,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:37:15,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:37:15,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:37:15,855 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:37:15,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 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-13 12:37:15,855 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:37:15,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:37:15,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-13 12:37:15,879 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-13 12:37:15,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:37:15,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1243298462, now seen corresponding path program 1 times [2024-11-13 12:37:15,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:37:15,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60823869] [2024-11-13 12:37:15,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:37:15,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:37:15,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:37:15,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:37:15,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:37:15,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60823869] [2024-11-13 12:37:15,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60823869] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:37:15,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134848965] [2024-11-13 12:37:15,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:37:15,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:37:15,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 12:37:15,913 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:37:15,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-13 12:37:16,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:37:16,018 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 12:37:16,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:37:16,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:37:16,031 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:37:16,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 12:37:16,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134848965] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:37:16,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:37:16,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2024-11-13 12:37:16,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37453908] [2024-11-13 12:37:16,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:37:16,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 12:37:16,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:37:16,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 12:37:16,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-13 12:37:16,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:37:16,054 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:37:16,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 9 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-13 12:37:16,054 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:37:16,054 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:37:16,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:37:16,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:37:16,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-13 12:37:16,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:37:16,326 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-13 12:37:16,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:37:16,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1699695422, now seen corresponding path program 2 times [2024-11-13 12:37:16,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:37:16,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317708697] [2024-11-13 12:37:16,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:37:16,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:37:16,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:37:16,370 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-13 12:37:16,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:37:16,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317708697] [2024-11-13 12:37:16,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317708697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:37:16,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:37:16,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:37:16,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302252204] [2024-11-13 12:37:16,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:37:16,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:37:16,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:37:16,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:37:16,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:37:16,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:37:16,373 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:37:16,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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-13 12:37:16,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:37:16,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:37:16,373 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:37:16,449 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 9 treesize of output 3 [2024-11-13 12:37:16,451 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 9 treesize of output 3 [2024-11-13 12:37:16,474 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 9 treesize of output 3 [2024-11-13 12:37:16,476 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 9 treesize of output 3 [2024-11-13 12:37:16,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:37:16,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:37:16,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:16,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-13 12:37:16,516 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-13 12:37:16,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:37:16,517 INFO L85 PathProgramCache]: Analyzing trace with hash -957641851, now seen corresponding path program 1 times [2024-11-13 12:37:16,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:37:16,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171355991] [2024-11-13 12:37:16,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:37:16,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:37:16,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:37:16,611 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 12:37:16,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:37:16,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171355991] [2024-11-13 12:37:16,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171355991] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:37:16,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544307690] [2024-11-13 12:37:16,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:37:16,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:37:16,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 12:37:16,614 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:37:16,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-13 12:37:16,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:37:16,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 12:37:16,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:37:16,781 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 12:37:16,782 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:37:16,857 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 12:37:16,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544307690] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:37:16,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:37:16,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2024-11-13 12:37:16,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334988858] [2024-11-13 12:37:16,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:37:16,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-13 12:37:16,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:37:16,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-13 12:37:16,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2024-11-13 12:37:16,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:37:16,860 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:37:16,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.611111111111111) internal successors, (47), 17 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:37:16,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:37:16,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:37:16,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:16,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:37:17,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:37:17,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:37:17,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:17,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:37:17,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-13 12:37:17,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-13 12:37:17,263 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-13 12:37:17,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:37:17,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1995584709, now seen corresponding path program 2 times [2024-11-13 12:37:17,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:37:17,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517355667] [2024-11-13 12:37:17,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:37:17,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:37:17,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:37:17,494 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 12:37:17,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:37:17,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517355667] [2024-11-13 12:37:17,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517355667] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:37:17,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216359049] [2024-11-13 12:37:17,495 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 12:37:17,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:37:17,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 12:37:17,497 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:37:17,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-13 12:37:17,629 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 12:37:17,630 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:37:17,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-13 12:37:17,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:37:17,674 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 12:37:17,674 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:37:17,863 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-13 12:37:17,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216359049] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:37:17,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:37:17,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 22 [2024-11-13 12:37:17,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601201437] [2024-11-13 12:37:17,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:37:17,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-13 12:37:17,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:37:17,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-13 12:37:17,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2024-11-13 12:37:17,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:37:17,866 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:37:17,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 22 states have internal predecessors, (56), 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-13 12:37:17,866 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:37:17,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:37:17,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:17,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:37:17,868 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:37:18,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:37:18,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:37:18,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:18,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:37:18,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 12:37:18,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-13 12:37:18,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-13 12:37:18,259 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-13 12:37:18,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:37:18,260 INFO L85 PathProgramCache]: Analyzing trace with hash -487574180, now seen corresponding path program 3 times [2024-11-13 12:37:18,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:37:18,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855474826] [2024-11-13 12:37:18,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:37:18,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:37:18,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:37:18,342 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-13 12:37:18,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:37:18,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855474826] [2024-11-13 12:37:18,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855474826] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:37:18,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40756771] [2024-11-13 12:37:18,343 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-13 12:37:18,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:37:18,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 12:37:18,348 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:37:18,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-13 12:37:18,469 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-13 12:37:18,469 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:37:18,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-13 12:37:18,472 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:37:18,497 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-13 12:37:18,498 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 12:37:18,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40756771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:37:18,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 12:37:18,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2024-11-13 12:37:18,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569775093] [2024-11-13 12:37:18,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:37:18,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-13 12:37:18,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:37:18,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-13 12:37:18,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-13 12:37:18,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:37:18,499 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:37:18,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 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-13 12:37:18,499 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:37:18,499 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:37:18,499 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:18,499 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:37:18,499 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-13 12:37:18,499 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:37:18,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:37:18,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:37:18,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:18,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:37:18,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 12:37:18,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:18,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-13 12:37:18,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-13 12:37:18,751 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-13 12:37:18,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:37:18,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1336689797, now seen corresponding path program 1 times [2024-11-13 12:37:18,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:37:18,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537647952] [2024-11-13 12:37:18,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:37:18,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:37:18,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:37:18,799 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2024-11-13 12:37:18,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:37:18,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537647952] [2024-11-13 12:37:18,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537647952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:37:18,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:37:18,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 12:37:18,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925189105] [2024-11-13 12:37:18,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:37:18,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:37:18,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:37:18,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:37:18,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:37:18,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:37:18,801 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:37:18,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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-13 12:37:18,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:37:18,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:37:18,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:18,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:37:18,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-13 12:37:18,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:18,802 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:37:18,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:37:18,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:37:18,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:18,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:37:18,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 12:37:18,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:18,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:18,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-13 12:37:18,873 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-13 12:37:18,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:37:18,873 INFO L85 PathProgramCache]: Analyzing trace with hash 2032620943, now seen corresponding path program 1 times [2024-11-13 12:37:18,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:37:18,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011364126] [2024-11-13 12:37:18,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:37:18,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:37:18,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:37:20,034 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2024-11-13 12:37:20,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:37:20,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011364126] [2024-11-13 12:37:20,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011364126] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:37:20,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485543751] [2024-11-13 12:37:20,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:37:20,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:37:20,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 12:37:20,036 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:37:20,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-13 12:37:20,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:37:20,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-11-13 12:37:20,219 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:37:21,879 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 12:37:21,882 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 11 treesize of output 11 [2024-11-13 12:37:21,952 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 79 treesize of output 56 [2024-11-13 12:37:22,287 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 79 treesize of output 56 [2024-11-13 12:37:22,580 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 79 treesize of output 56 [2024-11-13 12:37:22,721 INFO L349 Elim1Store]: treesize reduction 78, result has 3.7 percent of original size [2024-11-13 12:37:22,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 80 treesize of output 37 [2024-11-13 12:37:22,743 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 3 proven. 146 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-13 12:37:22,744 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:37:22,862 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~i~0#1_21| Int) (v_ArrVal_1051 (Array Int Int))) (or (< |v_t_funThread1of2ForFork0_~i~0#1_21| 0) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1051) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_21| 28) |c_~#a~0.offset|)) 2147483650)) (< 9 |v_t_funThread1of2ForFork0_~i~0#1_21|))) is different from false [2024-11-13 12:37:23,573 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 149 trivial. 4 not checked. [2024-11-13 12:37:23,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485543751] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:37:23,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:37:23,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 23, 5] total 32 [2024-11-13 12:37:23,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854743352] [2024-11-13 12:37:23,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:37:23,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-13 12:37:23,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:37:23,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-13 12:37:23,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=939, Unknown=2, NotChecked=62, Total=1122 [2024-11-13 12:37:23,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:37:23,576 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:37:23,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.272727272727273) internal successors, (108), 33 states have internal predecessors, (108), 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-13 12:37:23,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:37:23,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:37:23,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:23,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:37:23,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-13 12:37:23,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:23,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:23,576 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:37:24,549 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 9 treesize of output 3 [2024-11-13 12:37:24,550 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 9 treesize of output 3 [2024-11-13 12:37:25,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:37:25,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:37:25,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:25,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:37:25,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 12:37:25,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:25,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:25,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-13 12:37:25,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-11-13 12:37:25,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-13 12:37:25,241 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-13 12:37:25,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:37:25,241 INFO L85 PathProgramCache]: Analyzing trace with hash -2009072936, now seen corresponding path program 1 times [2024-11-13 12:37:25,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:37:25,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309218611] [2024-11-13 12:37:25,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:37:25,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:37:25,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:37:26,481 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2024-11-13 12:37:26,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:37:26,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309218611] [2024-11-13 12:37:26,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309218611] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:37:26,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952554378] [2024-11-13 12:37:26,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:37:26,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:37:26,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 12:37:26,483 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:37:26,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-13 12:37:26,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:37:26,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 89 conjuncts are in the unsatisfiable core [2024-11-13 12:37:26,691 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:37:28,403 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 8 treesize of output 1 [2024-11-13 12:37:28,471 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 12:37:28,472 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 11 treesize of output 11 [2024-11-13 12:37:28,536 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 79 treesize of output 56 [2024-11-13 12:37:28,683 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 11 treesize of output 3 [2024-11-13 12:37:28,938 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 79 treesize of output 56 [2024-11-13 12:37:29,214 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 79 treesize of output 56 [2024-11-13 12:37:29,574 INFO L349 Elim1Store]: treesize reduction 257, result has 30.7 percent of original size [2024-11-13 12:37:29,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 20 case distinctions, treesize of input 107 treesize of output 155 [2024-11-13 12:37:30,046 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:37:30,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 129 treesize of output 157 [2024-11-13 12:37:30,089 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 3 proven. 146 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-13 12:37:30,090 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:37:30,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2024-11-13 12:37:30,702 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2024-11-13 12:37:30,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952554378] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:37:30,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:37:30,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 26, 9] total 40 [2024-11-13 12:37:30,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686685315] [2024-11-13 12:37:30,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:37:30,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-13 12:37:30,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:37:30,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-13 12:37:30,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1535, Unknown=1, NotChecked=0, Total=1722 [2024-11-13 12:37:30,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:37:30,704 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:37:30,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 3.268292682926829) internal successors, (134), 41 states have internal predecessors, (134), 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-13 12:37:30,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:37:30,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:37:30,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:30,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:37:30,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-13 12:37:30,704 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:30,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:30,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-11-13 12:37:30,705 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:37:32,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:37:32,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:37:32,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:32,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:37:32,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 12:37:32,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:32,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:32,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-13 12:37:32,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-13 12:37:32,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2024-11-13 12:37:32,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-13 12:37:32,768 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-13 12:37:32,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:37:32,768 INFO L85 PathProgramCache]: Analyzing trace with hash 2143249719, now seen corresponding path program 1 times [2024-11-13 12:37:32,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:37:32,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328019694] [2024-11-13 12:37:32,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:37:32,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:37:32,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:37:32,853 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2024-11-13 12:37:32,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:37:32,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328019694] [2024-11-13 12:37:32,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328019694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:37:32,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:37:32,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:37:32,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832993239] [2024-11-13 12:37:32,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:37:32,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 12:37:32,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:37:32,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 12:37:32,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 12:37:32,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:37:32,856 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:37:32,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 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-13 12:37:32,856 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:37:32,856 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:37:32,856 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:32,856 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:37:32,856 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-13 12:37:32,856 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:32,857 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:32,857 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-11-13 12:37:32,857 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-11-13 12:37:32,857 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:37:33,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:37:33,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:37:33,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:33,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:37:33,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 12:37:33,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:33,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:33,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-13 12:37:33,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-13 12:37:33,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:33,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-13 12:37:33,599 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-13 12:37:33,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:37:33,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1633895777, now seen corresponding path program 1 times [2024-11-13 12:37:33,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:37:33,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993539651] [2024-11-13 12:37:33,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:37:33,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:37:33,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:37:33,733 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2024-11-13 12:37:33,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:37:33,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993539651] [2024-11-13 12:37:33,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993539651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 12:37:33,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 12:37:33,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 12:37:33,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812767481] [2024-11-13 12:37:33,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 12:37:33,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 12:37:33,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:37:33,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 12:37:33,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 12:37:33,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:37:33,735 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:37:33,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:37:33,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:37:33,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:37:33,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:33,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:37:33,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-13 12:37:33,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:33,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:33,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-11-13 12:37:33,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-11-13 12:37:33,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:33,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:37:34,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:37:34,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:37:34,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:34,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:37:34,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 12:37:34,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:34,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:34,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-13 12:37:34,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-13 12:37:34,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:34,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:37:34,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-13 12:37:34,028 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-13 12:37:34,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:37:34,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1278493757, now seen corresponding path program 1 times [2024-11-13 12:37:34,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:37:34,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184810982] [2024-11-13 12:37:34,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:37:34,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:37:34,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:37:35,655 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-13 12:37:35,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:37:35,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184810982] [2024-11-13 12:37:35,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184810982] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:37:35,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589458818] [2024-11-13 12:37:35,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:37:35,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:37:35,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 12:37:35,657 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:37:35,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-13 12:37:35,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:37:35,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 98 conjuncts are in the unsatisfiable core [2024-11-13 12:37:35,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:37:37,503 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 8 treesize of output 1 [2024-11-13 12:37:37,562 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 12:37:37,563 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 11 treesize of output 11 [2024-11-13 12:37:37,628 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 86 treesize of output 61 [2024-11-13 12:37:37,771 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 27 treesize of output 15 [2024-11-13 12:37:38,042 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 86 treesize of output 61 [2024-11-13 12:37:38,259 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 12:37:38,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 11 [2024-11-13 12:37:38,628 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 86 treesize of output 61 [2024-11-13 12:37:39,037 INFO L349 Elim1Store]: treesize reduction 257, result has 30.7 percent of original size [2024-11-13 12:37:39,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 56 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 20 case distinctions, treesize of input 114 treesize of output 165 [2024-11-13 12:37:39,674 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:37:39,802 INFO L349 Elim1Store]: treesize reduction 260, result has 29.9 percent of original size [2024-11-13 12:37:39,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 58 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 20 case distinctions, treesize of input 146 treesize of output 203 [2024-11-13 12:37:45,054 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:37:45,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 56 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 10 case distinctions, treesize of input 1273 treesize of output 681 [2024-11-13 12:37:48,668 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 3 proven. 150 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 12:37:48,668 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:37:53,037 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-13 12:37:53,037 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 26 treesize of output 12 [2024-11-13 12:37:55,732 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 36 refuted. 1 times theorem prover too weak. 117 trivial. 0 not checked. [2024-11-13 12:37:55,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589458818] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:37:55,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:37:55,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 29, 12] total 50 [2024-11-13 12:37:55,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233419709] [2024-11-13 12:37:55,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:37:55,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-13 12:37:55,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:37:55,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-13 12:37:55,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=2398, Unknown=6, NotChecked=0, Total=2652 [2024-11-13 12:37:55,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:37:55,736 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:37:55,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 3.156862745098039) internal successors, (161), 51 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-13 12:37:55,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:37:55,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:37:55,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:55,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:37:55,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-13 12:37:55,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:55,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:55,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-11-13 12:37:55,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-11-13 12:37:55,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:37:55,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:37:55,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:38:00,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:38:02,724 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-13 12:38:06,015 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-13 12:38:13,494 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-13 12:38:15,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:38:18,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:38:19,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:38:19,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:38:19,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:38:19,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:38:19,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 12:38:19,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:38:19,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:38:19,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-13 12:38:19,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-13 12:38:19,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:38:19,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:38:19,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-11-13 12:38:19,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2024-11-13 12:38:19,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,22 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:38:19,753 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-13 12:38:19,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:38:19,754 INFO L85 PathProgramCache]: Analyzing trace with hash 701505559, now seen corresponding path program 1 times [2024-11-13 12:38:19,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:38:19,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627595316] [2024-11-13 12:38:19,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:38:19,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:38:19,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:38:19,838 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-13 12:38:19,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:38:19,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627595316] [2024-11-13 12:38:19,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627595316] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:38:19,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123720444] [2024-11-13 12:38:19,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:38:19,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:38:19,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 12:38:19,840 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:38:19,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-13 12:38:19,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:38:19,985 INFO L255 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-13 12:38:19,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:38:20,018 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-13 12:38:20,018 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:38:20,074 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-13 12:38:20,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123720444] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:38:20,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:38:20,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2024-11-13 12:38:20,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701179087] [2024-11-13 12:38:20,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:38:20,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 12:38:20,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:38:20,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 12:38:20,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-11-13 12:38:20,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:38:20,076 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:38:20,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.928571428571429) internal successors, (97), 14 states have internal predecessors, (97), 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-13 12:38:20,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:38:20,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:38:20,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:38:20,076 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:38:20,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-13 12:38:20,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:38:20,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:38:20,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 28 states. [2024-11-13 12:38:20,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-11-13 12:38:20,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:38:20,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:38:20,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-11-13 12:38:20,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:38:28,831 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-13 12:38:30,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:38:32,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:38:34,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:38:36,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:38:38,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:38:42,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:38:42,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:38:42,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:38:42,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:38:42,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:38:42,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 12:38:42,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:38:42,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:38:42,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-13 12:38:42,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-13 12:38:42,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:38:42,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:38:42,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-11-13 12:38:42,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 12:38:42,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2024-11-13 12:38:42,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2024-11-13 12:38:42,852 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-13 12:38:42,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:38:42,852 INFO L85 PathProgramCache]: Analyzing trace with hash 194708855, now seen corresponding path program 2 times [2024-11-13 12:38:42,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:38:42,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458629395] [2024-11-13 12:38:42,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:38:42,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:38:42,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:38:43,003 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-11-13 12:38:43,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:38:43,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458629395] [2024-11-13 12:38:43,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458629395] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:38:43,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699229165] [2024-11-13 12:38:43,004 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 12:38:43,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:38:43,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 12:38:43,005 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:38:43,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-13 12:38:43,143 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 12:38:43,143 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:38:43,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-13 12:38:43,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:38:43,221 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 12:38:43,222 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 11 treesize of output 11 [2024-11-13 12:38:43,282 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 1 [2024-11-13 12:38:43,296 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 20 treesize of output 15 [2024-11-13 12:38:43,321 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 23 treesize of output 7 [2024-11-13 12:38:43,323 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-11-13 12:38:43,323 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:38:43,368 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:38:43,369 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2024-11-13 12:38:43,371 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 25 [2024-11-13 12:38:43,435 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2024-11-13 12:38:43,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [699229165] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:38:43,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:38:43,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-11-13 12:38:43,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064433980] [2024-11-13 12:38:43,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:38:43,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 12:38:43,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:38:43,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 12:38:43,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=138, Unknown=1, NotChecked=0, Total=182 [2024-11-13 12:38:43,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:38:43,437 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:38:43,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 12:38:43,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:38:43,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:38:43,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:38:43,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:38:43,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-13 12:38:43,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:38:43,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:38:43,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-11-13 12:38:43,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-11-13 12:38:43,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:38:43,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:38:43,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2024-11-13 12:38:43,437 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-13 12:38:43,438 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:38:45,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:38:45,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:38:45,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:38:45,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:38:45,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:38:45,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 12:38:45,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:38:45,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:38:45,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-13 12:38:45,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-13 12:38:45,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:38:45,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:38:45,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-11-13 12:38:45,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 12:38:45,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:38:45,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2024-11-13 12:38:45,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-11-13 12:38:45,392 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-13 12:38:45,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:38:45,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1153811581, now seen corresponding path program 2 times [2024-11-13 12:38:45,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:38:45,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371518187] [2024-11-13 12:38:45,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:38:45,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:38:45,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:38:46,620 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-13 12:38:46,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:38:46,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371518187] [2024-11-13 12:38:46,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371518187] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:38:46,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867554551] [2024-11-13 12:38:46,621 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 12:38:46,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:38:46,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 12:38:46,623 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:38:46,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-11-13 12:38:46,902 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 12:38:46,902 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:38:46,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 93 conjuncts are in the unsatisfiable core [2024-11-13 12:38:46,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:38:48,635 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 12:38:48,636 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 11 treesize of output 11 [2024-11-13 12:38:48,708 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 79 treesize of output 56 [2024-11-13 12:38:48,882 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 15 treesize of output 11 [2024-11-13 12:38:49,171 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 79 treesize of output 56 [2024-11-13 12:38:49,384 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 12:38:49,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 11 [2024-11-13 12:38:50,136 INFO L349 Elim1Store]: treesize reduction 257, result has 30.7 percent of original size [2024-11-13 12:38:50,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 20 case distinctions, treesize of input 107 treesize of output 155 [2024-11-13 12:38:50,382 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 128 treesize of output 103 [2024-11-13 12:38:51,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:38:51,246 INFO L349 Elim1Store]: treesize reduction 260, result has 29.9 percent of original size [2024-11-13 12:38:51,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 46 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 20 case distinctions, treesize of input 139 treesize of output 193 [2024-11-13 12:38:56,115 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:38:56,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 1266 treesize of output 678 [2024-11-13 12:38:59,365 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 2 proven. 151 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 12:38:59,366 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:39:05,420 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 25 treesize of output 16 [2024-11-13 12:39:05,995 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|))) (and (or (forall ((v_ArrVal_1619 Int) (v_ArrVal_1620 (Array Int Int)) (v_ArrVal_1621 Int) (|v_t_funThread2of2ForFork0_~i~0#1_29| Int) (v_ArrVal_1617 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1617) |c_~#a~0.base|))) (or (< 0 (+ (select (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 .cse1 v_ArrVal_1619)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1620) |c_~#a~0.base|) (+ (* |v_t_funThread2of2ForFork0_~i~0#1_29| 28) |c_~#a~0.offset|) v_ArrVal_1621) .cse1) 2147483648)) (< 9 |v_t_funThread2of2ForFork0_~i~0#1_29|) (< |v_t_funThread2of2ForFork0_~i~0#1_29| 0) (< v_ArrVal_1619 (+ (select .cse0 .cse1) 1))))) (= |c_~#a~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|)) (forall ((v_ArrVal_1619 Int) (v_ArrVal_1617 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1617) |c_~#a~0.base|))) (or (forall ((v_ArrVal_1620 (Array Int Int)) (v_ArrVal_1621 Int) (|v_t_funThread2of2ForFork0_~i~0#1_29| Int)) (let ((.cse3 (+ (* |v_t_funThread2of2ForFork0_~i~0#1_29| 28) |c_~#a~0.offset|))) (or (< 0 (+ (select (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse2 .cse1 v_ArrVal_1619)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1620) |c_~#a~0.base|) .cse3 v_ArrVal_1621) .cse1) 2147483648)) (< 9 |v_t_funThread2of2ForFork0_~i~0#1_29|) (< |v_t_funThread2of2ForFork0_~i~0#1_29| 0) (= .cse3 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (< v_ArrVal_1619 (+ (select .cse2 .cse1) 1))))))) is different from false [2024-11-13 12:39:06,894 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 9 refuted. 50 times theorem prover too weak. 95 trivial. 0 not checked. [2024-11-13 12:39:06,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867554551] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:39:06,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:39:06,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 29, 14] total 49 [2024-11-13 12:39:06,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390438680] [2024-11-13 12:39:06,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:39:06,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-13 12:39:06,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:39:06,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-13 12:39:06,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=2207, Unknown=14, NotChecked=96, Total=2550 [2024-11-13 12:39:06,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:39:06,897 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:39:06,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 3.12) internal successors, (156), 50 states have internal predecessors, (156), 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-13 12:39:06,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:39:06,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:39:06,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:39:06,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:39:06,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-13 12:39:06,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:39:06,897 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:39:06,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-11-13 12:39:06,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-11-13 12:39:06,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:39:06,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:39:06,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 49 states. [2024-11-13 12:39:06,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-13 12:39:06,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:39:06,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:39:11,220 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|)) (.cse2 (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28))) (.cse1 (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|))) (and (forall ((v_ArrVal_1619 Int) (v_ArrVal_1620 (Array Int Int)) (v_ArrVal_1621 Int)) (or (< 0 (+ (select (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 .cse1 v_ArrVal_1619)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1620) |c_~#a~0.base|) .cse2 v_ArrVal_1621) .cse1) 2147483648)) (< v_ArrVal_1619 (+ (select .cse0 .cse1) 1)))) (forall ((v_ArrVal_1620 (Array Int Int)) (v_ArrVal_1621 Int)) (< 0 (+ (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1620) |c_~#a~0.base|) .cse2 v_ArrVal_1621) .cse1) 2147483648))) (forall ((v_ArrVal_1621 Int)) (< 0 (+ (select (store .cse0 .cse2 v_ArrVal_1621) .cse1) 2147483648))))) is different from false [2024-11-13 12:39:15,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:39:16,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:39:18,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:39:20,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:39:21,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:39:23,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:39:26,058 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-13 12:39:28,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:39:30,989 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-13 12:39:33,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:39:34,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:39:35,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:39:37,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:39:39,998 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-13 12:39:42,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:39:45,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:39:47,146 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-13 12:39:50,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:39:52,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:39:58,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:40:00,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:40:01,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:40:03,767 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-13 12:40:05,778 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-13 12:40:07,783 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-13 12:40:09,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:40:11,755 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-13 12:40:13,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:40:15,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:40:26,406 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-13 12:40:33,972 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-13 12:40:34,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:40:34,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:40:34,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:40:34,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:40:34,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 12:40:34,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:40:34,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:40:34,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-13 12:40:34,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2024-11-13 12:40:34,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:40:34,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:40:34,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-11-13 12:40:34,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 12:40:34,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:40:34,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-11-13 12:40:34,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2024-11-13 12:40:34,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,25 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:40:34,294 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-13 12:40:34,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:40:34,294 INFO L85 PathProgramCache]: Analyzing trace with hash 823067457, now seen corresponding path program 1 times [2024-11-13 12:40:34,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:40:34,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641644972] [2024-11-13 12:40:34,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:40:34,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:40:34,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:40:36,040 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2024-11-13 12:40:36,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:40:36,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641644972] [2024-11-13 12:40:36,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641644972] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:40:36,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645708986] [2024-11-13 12:40:36,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:40:36,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:40:36,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 12:40:36,042 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:40:36,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-11-13 12:40:36,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:40:36,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 96 conjuncts are in the unsatisfiable core [2024-11-13 12:40:36,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:40:38,266 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 12:40:38,267 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 11 treesize of output 11 [2024-11-13 12:40:38,352 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 79 treesize of output 56 [2024-11-13 12:40:38,853 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 79 treesize of output 56 [2024-11-13 12:40:39,148 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 79 treesize of output 56 [2024-11-13 12:40:39,622 INFO L349 Elim1Store]: treesize reduction 257, result has 30.7 percent of original size [2024-11-13 12:40:39,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 20 case distinctions, treesize of input 107 treesize of output 155 [2024-11-13 12:40:40,872 INFO L349 Elim1Store]: treesize reduction 236, result has 47.3 percent of original size [2024-11-13 12:40:40,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 45 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 32 case distinctions, treesize of input 141 treesize of output 296 [2024-11-13 12:40:44,009 INFO L349 Elim1Store]: treesize reduction 236, result has 47.3 percent of original size [2024-11-13 12:40:44,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 45 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 32 case distinctions, treesize of input 362 treesize of output 471 [2024-11-13 12:40:44,752 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:40:44,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 129 treesize of output 157 [2024-11-13 12:40:44,787 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 3 proven. 146 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-13 12:40:44,788 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:40:46,584 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2024-11-13 12:40:46,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645708986] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:40:46,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:40:46,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 28, 10] total 46 [2024-11-13 12:40:46,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339192181] [2024-11-13 12:40:46,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:40:46,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2024-11-13 12:40:46,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:40:46,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2024-11-13 12:40:46,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=2051, Unknown=6, NotChecked=0, Total=2256 [2024-11-13 12:40:46,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:40:46,587 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:40:46,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 3.5531914893617023) internal successors, (167), 47 states have internal predecessors, (167), 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-13 12:40:46,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:40:46,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:40:46,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:40:46,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:40:46,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-13 12:40:46,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:40:46,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:40:46,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-11-13 12:40:46,587 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2024-11-13 12:40:46,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:40:46,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:40:46,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 64 states. [2024-11-13 12:40:46,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-13 12:40:46,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:40:46,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-11-13 12:40:46,588 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:41:16,166 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-13 12:41:16,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:41:16,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:41:16,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:41:16,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:41:16,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-13 12:41:16,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:41:16,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:41:16,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-13 12:41:16,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2024-11-13 12:41:16,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:41:16,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:41:16,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2024-11-13 12:41:16,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 12:41:16,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:41:16,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2024-11-13 12:41:16,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2024-11-13 12:41:16,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2024-11-13 12:41:16,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-13 12:41:16,381 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-13 12:41:16,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 12:41:16,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1900053247, now seen corresponding path program 2 times [2024-11-13 12:41:16,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 12:41:16,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676737579] [2024-11-13 12:41:16,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 12:41:16,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 12:41:16,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 12:41:17,783 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2024-11-13 12:41:17,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 12:41:17,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676737579] [2024-11-13 12:41:17,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676737579] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 12:41:17,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600711917] [2024-11-13 12:41:17,784 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 12:41:17,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 12:41:17,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-11-13 12:41:17,787 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 12:41:17,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-11-13 12:41:18,078 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 12:41:18,078 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 12:41:18,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 97 conjuncts are in the unsatisfiable core [2024-11-13 12:41:18,087 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 12:41:20,274 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 12:41:20,274 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 11 treesize of output 11 [2024-11-13 12:41:20,357 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 79 treesize of output 56 [2024-11-13 12:41:20,510 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 15 treesize of output 11 [2024-11-13 12:41:20,833 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 79 treesize of output 56 [2024-11-13 12:41:21,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:41:21,225 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 20 treesize of output 15 [2024-11-13 12:41:21,563 INFO L349 Elim1Store]: treesize reduction 257, result has 30.7 percent of original size [2024-11-13 12:41:21,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 20 case distinctions, treesize of input 107 treesize of output 155 [2024-11-13 12:41:21,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:41:21,884 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 20 treesize of output 15 [2024-11-13 12:41:21,999 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-13 12:41:22,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 23 treesize of output 11 [2024-11-13 12:41:22,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:41:22,927 INFO L349 Elim1Store]: treesize reduction 260, result has 29.9 percent of original size [2024-11-13 12:41:22,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 46 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 20 case distinctions, treesize of input 139 treesize of output 193 [2024-11-13 12:41:23,143 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 158 treesize of output 133 [2024-11-13 12:41:24,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 12:41:24,160 INFO L349 Elim1Store]: treesize reduction 260, result has 29.9 percent of original size [2024-11-13 12:41:24,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 46 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 20 case distinctions, treesize of input 169 treesize of output 223 [2024-11-13 12:41:29,249 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:41:29,249 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 1266 treesize of output 678 [2024-11-13 12:41:33,033 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 5 proven. 148 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 12:41:33,033 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 12:41:33,193 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1851 Int) (v_ArrVal_1849 (Array Int Int))) (< 0 (+ (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1849) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)) v_ArrVal_1851) (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) 2147483648))) is different from false [2024-11-13 12:41:44,838 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1846 (Array Int Int)) (v_ArrVal_1847 Int) (v_ArrVal_1851 Int) (|v_t_funThread2of2ForFork0_~i~0#1_33| Int) (v_ArrVal_1844 Int) (v_ArrVal_1849 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_~#a~0.base|)) (.cse1 (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) (.cse3 (* |v_t_funThread2of2ForFork0_~i~0#1_33| 28))) (or (< v_ArrVal_1844 (+ (select .cse0 .cse1) 1)) (< 0 (+ (select (let ((.cse2 (+ |c_~#a~0.offset| .cse3))) (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store (store .cse0 .cse1 v_ArrVal_1844) .cse2 v_ArrVal_1847)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1849) |c_~#a~0.base|) .cse2 v_ArrVal_1851)) .cse1) 2147483648)) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1846) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse3 4)) 0))))) is different from false [2024-11-13 12:41:45,023 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:41:45,023 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2024-11-13 12:41:45,035 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 12:41:45,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 45 treesize of output 45 [2024-11-13 12:41:45,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-11-13 12:42:40,222 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 145 trivial. 4 not checked. [2024-11-13 12:42:40,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600711917] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 12:42:40,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 12:42:40,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 31, 14] total 55 [2024-11-13 12:42:40,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707574999] [2024-11-13 12:42:40,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 12:42:40,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-11-13 12:42:40,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 12:42:40,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-11-13 12:42:40,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=2667, Unknown=40, NotChecked=214, Total=3192 [2024-11-13 12:42:40,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:42:40,225 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-11-13 12:42:40,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 3.142857142857143) internal successors, (176), 56 states have internal predecessors, (176), 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-13 12:42:40,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:42:40,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-11-13 12:42:40,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:42:40,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2024-11-13 12:42:40,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-11-13 12:42:40,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:42:40,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-11-13 12:42:40,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-11-13 12:42:40,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 43 states. [2024-11-13 12:42:40,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-11-13 12:42:40,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-11-13 12:42:40,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 70 states. [2024-11-13 12:42:40,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-11-13 12:42:40,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-11-13 12:42:40,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 66 states. [2024-11-13 12:42:40,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 77 states. [2024-11-13 12:42:40,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-11-13 12:42:59,635 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (let ((.cse10 (+ .cse1 |c_~#a~0.offset|))) (let ((.cse3 (forall ((v_ArrVal_1847 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1851 Int) (|v_t_funThread2of2ForFork0_~i~0#1_33| Int) (v_ArrVal_1844 Int) (v_ArrVal_1849 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1842) |c_~#a~0.base|))) (or (< 0 (+ (select (let ((.cse13 (+ |c_~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_33| 28)))) (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store (store .cse12 .cse10 v_ArrVal_1844) .cse13 v_ArrVal_1847)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1849) |c_~#a~0.base|) .cse13 v_ArrVal_1851)) .cse10) 2147483648)) (< v_ArrVal_1844 (+ (select .cse12 .cse10) 1)))))) (.cse2 (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (.cse0 (select |c_#memory_int| 4))) (and (or (= |c_t_funThread1of2ForFork0_~i~0#1| 4) (= (select .cse0 112) 0)) (= (select (select |c_#pthreadsMutex| 4) (+ .cse1 4)) 1) (or (= (select .cse0 0) 0) (= |c_t_funThread1of2ForFork0_~i~0#1| 0)) (or (= |c_t_funThread1of2ForFork0_~i~0#1| 8) (= (select .cse0 224) 0)) (or .cse2 .cse3) (forall ((|v_ULTIMATE.start_main_~#t_ids~0#1.base_65| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#t_ids~0#1.base_65|))) (forall ((|v_t_funThread1of2ForFork0_~i~0#1_35| Int)) (or (forall ((v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1844 Int)) (let ((.cse4 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t_ids~0#1.base_65| v_ArrVal_1842) |c_~#a~0.base|)) (.cse5 (+ (* |v_t_funThread1of2ForFork0_~i~0#1_35| 28) |c_~#a~0.offset|))) (or (forall ((v_ArrVal_1847 Int) (|v_t_funThread2of2ForFork0_~i~0#1_33| Int) (v_ArrVal_1849 (Array Int Int))) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (store .cse4 .cse5 v_ArrVal_1844) (+ |c_~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_33| 28)) v_ArrVal_1847)) |v_ULTIMATE.start_main_~#t_ids~0#1.base_65| v_ArrVal_1849) |c_~#a~0.base|) .cse5) 2147483648)) (= |v_t_funThread2of2ForFork0_~i~0#1_33| |v_t_funThread1of2ForFork0_~i~0#1_35|))) (< v_ArrVal_1844 (+ (select .cse4 .cse5) 1))))) (< 9 |v_t_funThread1of2ForFork0_~i~0#1_35|) (< |v_t_funThread1of2ForFork0_~i~0#1_35| 0))))) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (or (= |c_t_funThread1of2ForFork0_~i~0#1| 7) (= (select .cse0 196) 0)) (<= 0 |c_t_funThread1of2ForFork0_~i~0#1|) (or .cse3 (= |c_~#a~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|)) (or (= |c_t_funThread1of2ForFork0_~i~0#1| 3) (= (select .cse0 84) 0)) (or (= (select .cse0 252) 0) (= |c_t_funThread1of2ForFork0_~i~0#1| 9)) (or (= (select .cse0 28) 0) (= |c_t_funThread1of2ForFork0_~i~0#1| 1)) (= |c_t_funThread2of2ForFork0_~p~0#1.base| 4) (or (forall ((|v_ULTIMATE.start_main_~#t_ids~0#1.base_65| Int) (v_ArrVal_1847 Int) (|v_t_funThread1of2ForFork0_~i~0#1_35| Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1851 Int) (|v_t_funThread2of2ForFork0_~i~0#1_33| Int) (v_ArrVal_1844 Int) (v_ArrVal_1849 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t_ids~0#1.base_65| v_ArrVal_1842) |c_~#a~0.base|)) (.cse7 (+ (* |v_t_funThread1of2ForFork0_~i~0#1_35| 28) |c_~#a~0.offset|))) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#t_ids~0#1.base_65|))) (< 9 |v_t_funThread1of2ForFork0_~i~0#1_35|) (< |v_t_funThread1of2ForFork0_~i~0#1_35| 0) (< 0 (+ (select (let ((.cse8 (+ |c_~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_33| 28)))) (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store (store .cse6 .cse7 v_ArrVal_1844) .cse8 v_ArrVal_1847)) |v_ULTIMATE.start_main_~#t_ids~0#1.base_65| v_ArrVal_1849) |c_~#a~0.base|) .cse8 v_ArrVal_1851)) .cse7) 2147483648)) (< v_ArrVal_1844 (+ (select .cse6 .cse7) 1))))) .cse2) (= |c_~#a~0.offset| 0) (= |c_t_funThread2of2ForFork0_~p~0#1.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)) (<= |c_~#__global_lock~0.base| 3) (or (= (select .cse0 140) 0) (= |c_t_funThread1of2ForFork0_~i~0#1| 5)) (= |c_~#a~0.base| 4) (or (= (select .cse0 168) 0) (= |c_t_funThread1of2ForFork0_~i~0#1| 6)) (not (= |c_t_funThread1of2ForFork0_~i~0#1| |c_t_funThread2of2ForFork0_~i~0#1|)) (<= |c_t_funThread1of2ForFork0_~i~0#1| 9) (or (= |c_t_funThread1of2ForFork0_~i~0#1| 2) (= (select .cse0 56) 0)) (forall ((v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1844 Int)) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1842) |c_~#a~0.base|))) (or (forall ((v_ArrVal_1847 Int) (v_ArrVal_1851 Int) (|v_t_funThread2of2ForFork0_~i~0#1_33| Int) (v_ArrVal_1849 (Array Int Int))) (let ((.cse11 (+ |c_~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_33| 28)))) (or (< 0 (+ (select (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store (store .cse9 .cse10 v_ArrVal_1844) .cse11 v_ArrVal_1847)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1849) |c_~#a~0.base|) .cse11 v_ArrVal_1851) .cse10) 2147483648)) (= .cse11 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (< v_ArrVal_1844 (+ (select .cse9 .cse10) 1))))) (<= 1 (select .cse0 .cse1)))))) is different from false [2024-11-13 12:43:03,797 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|))) (let ((.cse2 (forall ((v_ArrVal_1847 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1851 Int) (|v_t_funThread2of2ForFork0_~i~0#1_33| Int) (v_ArrVal_1844 Int) (v_ArrVal_1849 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1842) |c_~#a~0.base|))) (or (< 0 (+ (select (let ((.cse11 (+ |c_~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_33| 28)))) (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store (store .cse10 .cse4 v_ArrVal_1844) .cse11 v_ArrVal_1847)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1849) |c_~#a~0.base|) .cse11 v_ArrVal_1851)) .cse4) 2147483648)) (< v_ArrVal_1844 (+ (select .cse10 .cse4) 1)))))) (.cse1 (= |c_t_funThread1of2ForFork0_~i~0#1| 9)) (.cse3 (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28))) (.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (or (not (= |c_t_funThread1of2ForFork0_~i~0#1| 5)) (= (select .cse0 140) 0)) (or (< |c_t_funThread1of2ForFork0_~i~0#1| 9) .cse1) (or (= (select .cse0 84) 0) (not (= |c_t_funThread1of2ForFork0_~i~0#1| 3))) (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) .cse2) (forall ((v_ArrVal_1847 Int) (v_ArrVal_1851 Int) (v_ArrVal_1849 (Array Int Int))) (< 0 (+ (select (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 .cse3 v_ArrVal_1847)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1849) |c_~#a~0.base|) .cse3 v_ArrVal_1851) .cse4) 2147483648))) (<= 0 |c_t_funThread1of2ForFork0_~i~0#1|) (or (forall ((v_ArrVal_1847 Int) (v_ArrVal_1851 Int) (v_ArrVal_1844 Int) (v_ArrVal_1849 (Array Int Int))) (or (< 0 (+ (select (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store (store .cse0 .cse4 v_ArrVal_1844) .cse3 v_ArrVal_1847)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1849) |c_~#a~0.base|) .cse3 v_ArrVal_1851) .cse4) 2147483648)) (< v_ArrVal_1844 (+ |c_t_funThread1of2ForFork0_#t~post36#1| 1)))) (forall ((v_ArrVal_1846 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1846) |c_t_funThread2of2ForFork0_~p~0#1.base|) (+ |c_t_funThread2of2ForFork0_~p~0#1.offset| 4)) 0)))) (or (not (= |c_t_funThread1of2ForFork0_~i~0#1| 0)) (= (select .cse0 0) 0)) (or .cse2 (= |c_~#a~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|)) (forall ((v_ArrVal_1851 Int) (v_ArrVal_1849 (Array Int Int))) (< 0 (+ (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1849) |c_~#a~0.base|) .cse3 v_ArrVal_1851) .cse4) 2147483648))) (or (not .cse1) (= (select .cse0 252) 0)) (not (= |c_~#a~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (= |c_~#a~0.offset| 0) (or (not (= |c_t_funThread1of2ForFork0_~i~0#1| 4)) (= (select .cse0 112) 0)) (or (not (= |c_t_funThread1of2ForFork0_~i~0#1| 7)) (= (select .cse0 196) 0)) (or (not (= |c_t_funThread1of2ForFork0_~i~0#1| 2)) (= (select .cse0 56) 0)) (forall ((v_ArrVal_1851 Int)) (< 0 (+ (select (store .cse0 .cse3 v_ArrVal_1851) .cse4) 2147483648))) (or (not (= |c_t_funThread1of2ForFork0_~i~0#1| 6)) (= (select .cse0 168) 0)) (forall ((v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1844 Int)) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1842) |c_~#a~0.base|))) (or (forall ((v_ArrVal_1847 Int) (v_ArrVal_1851 Int) (|v_t_funThread2of2ForFork0_~i~0#1_33| Int) (v_ArrVal_1849 (Array Int Int))) (let ((.cse6 (+ |c_~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_33| 28)))) (or (< 0 (+ (select (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store (store .cse5 .cse4 v_ArrVal_1844) .cse6 v_ArrVal_1847)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1849) |c_~#a~0.base|) .cse6 v_ArrVal_1851) .cse4) 2147483648)) (= .cse6 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (< v_ArrVal_1844 (+ (select .cse5 .cse4) 1))))) (or (not (= |c_t_funThread1of2ForFork0_~i~0#1| 1)) (= (select .cse0 28) 0)) (or (= 0 (select .cse0 224)) (not (= |c_t_funThread1of2ForFork0_~i~0#1| 8))) (forall ((v_ArrVal_1846 (Array Int Int)) (v_ArrVal_1847 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1851 Int) (|v_t_funThread2of2ForFork0_~i~0#1_33| Int) (v_ArrVal_1844 Int) (v_ArrVal_1849 (Array Int Int))) (let ((.cse9 (* |v_t_funThread2of2ForFork0_~i~0#1_33| 28)) (.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1842) |c_~#a~0.base|))) (or (< 0 (+ (select (let ((.cse8 (+ |c_~#a~0.offset| .cse9))) (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store (store .cse7 .cse4 v_ArrVal_1844) .cse8 v_ArrVal_1847)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1849) |c_~#a~0.base|) .cse8 v_ArrVal_1851)) .cse4) 2147483648)) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1846) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse9 4)) 0)) (< v_ArrVal_1844 (+ (select .cse7 .cse4) 1)))))))) is different from false [2024-11-13 12:43:15,112 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-13 12:43:17,118 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-13 12:43:19,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:43:21,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:43:31,841 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-13 12:43:33,843 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-13 12:43:34,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:43:37,000 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-13 12:43:39,102 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-13 12:43:41,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:43:43,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:43:45,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:43:47,244 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-13 12:43:49,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:43:51,716 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-13 12:43:53,717 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-13 12:43:55,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:43:57,806 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-13 12:43:59,872 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-13 12:44:01,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:44:03,902 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-13 12:44:05,924 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-13 12:44:07,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:44:10,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:44:12,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:44:14,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:44:16,138 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-13 12:44:18,147 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-13 12:44:20,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:44:22,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:44:24,248 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-13 12:44:26,297 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-13 12:44:28,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:44:30,329 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-13 12:44:32,365 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-13 12:44:34,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:44:36,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:44:38,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:44:40,582 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-13 12:44:42,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:44:44,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:44:46,676 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-13 12:44:48,714 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-13 12:44:50,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:44:52,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:44:54,823 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-13 12:44:56,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:44:59,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:45:02,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:45:04,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:45:16,666 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-13 12:45:18,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:45:20,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:45:22,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:45:25,249 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-13 12:45:27,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:45:29,347 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-13 12:45:31,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:45:33,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:45:35,460 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-13 12:45:37,539 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-13 12:45:39,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:45:41,619 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-13 12:45:43,770 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-13 12:45:45,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:45:48,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:45:50,181 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-13 12:45:52,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:45:54,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:45:56,389 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-13 12:45:58,440 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-13 12:46:00,455 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-13 12:46:02,507 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-13 12:46:04,521 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-13 12:46:06,579 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-13 12:46:08,580 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-13 12:46:10,617 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-13 12:46:12,629 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-13 12:46:14,690 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-13 12:46:16,695 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-13 12:46:17,959 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_t_funThread1of2ForFork0_~i~0#1| 9)) (.cse2 (+ |c_~#a~0.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28))) (.cse3 (+ (* |c_t_funThread1of2ForFork0_~i~0#1| 28) |c_~#a~0.offset|)) (.cse0 (select |c_#memory_int| |c_~#a~0.base|))) (and (or (not (= |c_t_funThread1of2ForFork0_~i~0#1| 5)) (= (select .cse0 140) 0)) (or (< |c_t_funThread1of2ForFork0_~i~0#1| 9) .cse1) (or (= (select .cse0 84) 0) (not (= |c_t_funThread1of2ForFork0_~i~0#1| 3))) (forall ((v_ArrVal_1847 Int) (v_ArrVal_1851 Int) (v_ArrVal_1849 (Array Int Int))) (< 0 (+ (select (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse0 .cse2 v_ArrVal_1847)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1849) |c_~#a~0.base|) .cse2 v_ArrVal_1851) .cse3) 2147483648))) (<= 0 |c_t_funThread1of2ForFork0_~i~0#1|) (or (forall ((v_ArrVal_1847 Int) (v_ArrVal_1851 Int) (v_ArrVal_1844 Int) (v_ArrVal_1849 (Array Int Int))) (or (< 0 (+ (select (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store (store .cse0 .cse3 v_ArrVal_1844) .cse2 v_ArrVal_1847)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1849) |c_~#a~0.base|) .cse2 v_ArrVal_1851) .cse3) 2147483648)) (< v_ArrVal_1844 (+ |c_t_funThread1of2ForFork0_#t~post36#1| 1)))) (forall ((v_ArrVal_1846 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1846) |c_t_funThread2of2ForFork0_~p~0#1.base|) (+ |c_t_funThread2of2ForFork0_~p~0#1.offset| 4)) 0)))) (or (not (= |c_t_funThread1of2ForFork0_~i~0#1| 0)) (= (select .cse0 0) 0)) (or (not .cse1) (= (select .cse0 252) 0)) (not (= |c_~#a~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (= |c_~#a~0.offset| 0) (or (not (= |c_t_funThread1of2ForFork0_~i~0#1| 4)) (= (select .cse0 112) 0)) (or (not (= |c_t_funThread1of2ForFork0_~i~0#1| 7)) (= (select .cse0 196) 0)) (= |c_t_funThread1of2ForFork0_#t~post36#1| 0) (or (not (= |c_t_funThread1of2ForFork0_~i~0#1| 2)) (= (select .cse0 56) 0)) (forall ((v_ArrVal_1851 Int)) (< 0 (+ (select (store .cse0 .cse2 v_ArrVal_1851) .cse3) 2147483648))) (or (not (= |c_t_funThread1of2ForFork0_~i~0#1| 6)) (= (select .cse0 168) 0)) (or (not (= |c_t_funThread1of2ForFork0_~i~0#1| 1)) (= (select .cse0 28) 0)) (or (= 0 (select .cse0 224)) (not (= |c_t_funThread1of2ForFork0_~i~0#1| 8))))) is different from false [2024-11-13 12:46:23,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:46:25,475 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-13 12:46:27,486 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-13 12:46:30,492 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-13 12:46:32,510 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-13 12:46:34,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:46:36,539 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-13 12:46:38,548 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-13 12:46:40,599 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-13 12:46:42,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:46:44,666 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-13 12:46:45,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:46:47,790 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-13 12:46:49,815 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-13 12:46:51,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:46:53,856 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-13 12:46:55,913 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-13 12:46:57,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:47:00,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:47:02,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:47:04,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:47:06,204 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-13 12:47:08,249 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-13 12:47:10,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:47:12,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:47:14,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:47:16,462 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-13 12:47:18,473 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-13 12:47:20,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:47:22,537 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-13 12:47:24,552 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-13 12:47:26,990 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-13 12:47:29,001 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-13 12:47:31,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:47:33,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:47:34,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:47:36,796 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-13 12:47:38,805 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-13 12:47:40,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:47:42,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:47:44,115 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-13 12:47:46,129 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-13 12:47:48,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:47:50,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:47:52,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:47:54,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:47:56,757 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-13 12:47:58,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:48:00,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:48:02,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:48:05,036 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-13 12:48:07,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:48:09,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:48:11,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:48:13,657 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (let ((.cse10 (+ .cse1 |c_~#a~0.offset|))) (let ((.cse3 (forall ((v_ArrVal_1847 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1851 Int) (|v_t_funThread2of2ForFork0_~i~0#1_33| Int) (v_ArrVal_1844 Int) (v_ArrVal_1849 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1842) |c_~#a~0.base|))) (or (< 0 (+ (select (let ((.cse13 (+ |c_~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_33| 28)))) (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store (store .cse12 .cse10 v_ArrVal_1844) .cse13 v_ArrVal_1847)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1849) |c_~#a~0.base|) .cse13 v_ArrVal_1851)) .cse10) 2147483648)) (< v_ArrVal_1844 (+ (select .cse12 .cse10) 1)))))) (.cse2 (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (.cse0 (select |c_#memory_int| 4))) (and (or (= |c_t_funThread1of2ForFork0_~i~0#1| 4) (= (select .cse0 112) 0)) (= (select (select |c_#pthreadsMutex| 4) (+ .cse1 4)) 1) (or (= (select .cse0 0) 0) (= |c_t_funThread1of2ForFork0_~i~0#1| 0)) (or (= |c_t_funThread1of2ForFork0_~i~0#1| 8) (= (select .cse0 224) 0)) (or .cse2 .cse3) (forall ((|v_ULTIMATE.start_main_~#t_ids~0#1.base_65| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#t_ids~0#1.base_65|))) (forall ((|v_t_funThread1of2ForFork0_~i~0#1_35| Int)) (or (forall ((v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1844 Int)) (let ((.cse4 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t_ids~0#1.base_65| v_ArrVal_1842) |c_~#a~0.base|)) (.cse5 (+ (* |v_t_funThread1of2ForFork0_~i~0#1_35| 28) |c_~#a~0.offset|))) (or (forall ((v_ArrVal_1847 Int) (|v_t_funThread2of2ForFork0_~i~0#1_33| Int) (v_ArrVal_1849 (Array Int Int))) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (store .cse4 .cse5 v_ArrVal_1844) (+ |c_~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_33| 28)) v_ArrVal_1847)) |v_ULTIMATE.start_main_~#t_ids~0#1.base_65| v_ArrVal_1849) |c_~#a~0.base|) .cse5) 2147483648)) (= |v_t_funThread2of2ForFork0_~i~0#1_33| |v_t_funThread1of2ForFork0_~i~0#1_35|))) (< v_ArrVal_1844 (+ (select .cse4 .cse5) 1))))) (< 9 |v_t_funThread1of2ForFork0_~i~0#1_35|) (< |v_t_funThread1of2ForFork0_~i~0#1_35| 0))))) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (or (= |c_t_funThread1of2ForFork0_~i~0#1| 7) (= (select .cse0 196) 0)) (<= 0 |c_t_funThread1of2ForFork0_~i~0#1|) (or .cse3 (= |c_~#a~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|)) (or (= |c_t_funThread1of2ForFork0_~i~0#1| 3) (= (select .cse0 84) 0)) (or (= (select .cse0 252) 0) (= |c_t_funThread1of2ForFork0_~i~0#1| 9)) (or (= (select .cse0 28) 0) (= |c_t_funThread1of2ForFork0_~i~0#1| 1)) (= |c_t_funThread2of2ForFork0_~p~0#1.base| 4) (or (forall ((|v_ULTIMATE.start_main_~#t_ids~0#1.base_65| Int) (v_ArrVal_1847 Int) (|v_t_funThread1of2ForFork0_~i~0#1_35| Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1851 Int) (|v_t_funThread2of2ForFork0_~i~0#1_33| Int) (v_ArrVal_1844 Int) (v_ArrVal_1849 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t_ids~0#1.base_65| v_ArrVal_1842) |c_~#a~0.base|)) (.cse7 (+ (* |v_t_funThread1of2ForFork0_~i~0#1_35| 28) |c_~#a~0.offset|))) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#t_ids~0#1.base_65|))) (< 9 |v_t_funThread1of2ForFork0_~i~0#1_35|) (< |v_t_funThread1of2ForFork0_~i~0#1_35| 0) (< 0 (+ (select (let ((.cse8 (+ |c_~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_33| 28)))) (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store (store .cse6 .cse7 v_ArrVal_1844) .cse8 v_ArrVal_1847)) |v_ULTIMATE.start_main_~#t_ids~0#1.base_65| v_ArrVal_1849) |c_~#a~0.base|) .cse8 v_ArrVal_1851)) .cse7) 2147483648)) (< v_ArrVal_1844 (+ (select .cse6 .cse7) 1))))) .cse2) (= |c_~#a~0.offset| 0) (= |c_t_funThread2of2ForFork0_~p~0#1.offset| (* |c_t_funThread2of2ForFork0_~i~0#1| 28)) (<= |c_~#__global_lock~0.base| 3) (or (= (select .cse0 140) 0) (= |c_t_funThread1of2ForFork0_~i~0#1| 5)) (= |c_~#a~0.base| 4) (or (= (select .cse0 168) 0) (= |c_t_funThread1of2ForFork0_~i~0#1| 6)) (<= |c_t_funThread1of2ForFork0_~i~0#1| 9) (or (= |c_t_funThread1of2ForFork0_~i~0#1| 2) (= (select .cse0 56) 0)) (forall ((v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1844 Int)) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1842) |c_~#a~0.base|))) (or (forall ((v_ArrVal_1847 Int) (v_ArrVal_1851 Int) (|v_t_funThread2of2ForFork0_~i~0#1_33| Int) (v_ArrVal_1849 (Array Int Int))) (let ((.cse11 (+ |c_~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_33| 28)))) (or (< 0 (+ (select (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store (store .cse9 .cse10 v_ArrVal_1844) .cse11 v_ArrVal_1847)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1849) |c_~#a~0.base|) .cse11 v_ArrVal_1851) .cse10) 2147483648)) (= .cse11 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (< v_ArrVal_1844 (+ (select .cse9 .cse10) 1))))) (<= 1 (select .cse0 .cse1)))))) is different from false [2024-11-13 12:48:27,001 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-13 12:48:29,016 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-13 12:48:31,027 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-13 12:48:34,067 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-13 12:48:36,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:48:38,339 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-13 12:48:40,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:48:42,477 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-13 12:48:44,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:48:46,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:48:48,605 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-13 12:48:50,613 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-13 12:48:54,453 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-13 12:48:56,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:48:58,641 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-13 12:49:02,172 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse34 (* |c_t_funThread1of2ForFork0_~i~0#1| 28))) (let ((.cse12 (+ .cse34 |c_~#a~0.offset|))) (let ((.cse1 (forall ((v_ArrVal_1847 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1851 Int) (|v_t_funThread2of2ForFork0_~i~0#1_33| Int) (v_ArrVal_1844 Int) (v_ArrVal_1849 (Array Int Int))) (let ((.cse35 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1842) |c_~#a~0.base|))) (or (< 0 (+ (select (let ((.cse36 (+ |c_~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_33| 28)))) (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store (store .cse35 .cse12 v_ArrVal_1844) .cse36 v_ArrVal_1847)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1849) |c_~#a~0.base|) .cse36 v_ArrVal_1851)) .cse12) 2147483648)) (< v_ArrVal_1844 (+ (select .cse35 .cse12) 1)))))) (.cse0 (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (.cse15 (select |c_#memory_int| 4))) (and (or .cse0 .cse1) (forall ((|v_ULTIMATE.start_main_~#t_ids~0#1.base_65| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#t_ids~0#1.base_65|))) (forall ((|v_t_funThread1of2ForFork0_~i~0#1_35| Int)) (or (forall ((v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1844 Int)) (let ((.cse2 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t_ids~0#1.base_65| v_ArrVal_1842) |c_~#a~0.base|)) (.cse3 (+ (* |v_t_funThread1of2ForFork0_~i~0#1_35| 28) |c_~#a~0.offset|))) (or (forall ((v_ArrVal_1847 Int) (|v_t_funThread2of2ForFork0_~i~0#1_33| Int) (v_ArrVal_1849 (Array Int Int))) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (store .cse2 .cse3 v_ArrVal_1844) (+ |c_~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_33| 28)) v_ArrVal_1847)) |v_ULTIMATE.start_main_~#t_ids~0#1.base_65| v_ArrVal_1849) |c_~#a~0.base|) .cse3) 2147483648)) (= |v_t_funThread2of2ForFork0_~i~0#1_33| |v_t_funThread1of2ForFork0_~i~0#1_35|))) (< v_ArrVal_1844 (+ (select .cse2 .cse3) 1))))) (< 9 |v_t_funThread1of2ForFork0_~i~0#1_35|) (< |v_t_funThread1of2ForFork0_~i~0#1_35| 0))))) (or .cse0 (forall ((v_ArrVal_1847 Int) (|v_t_funThread1of2ForFork0_~i~0#1_35| Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1851 Int) (|v_t_funThread2of2ForFork0_~i~0#1_33| Int) (v_ArrVal_1844 Int) (v_ArrVal_1849 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1842) |c_~#a~0.base|)) (.cse5 (+ (* |v_t_funThread1of2ForFork0_~i~0#1_35| 28) |c_~#a~0.offset|))) (or (< v_ArrVal_1844 (+ (select .cse4 .cse5) 1)) (< 9 |v_t_funThread1of2ForFork0_~i~0#1_35|) (< 0 (+ (select (let ((.cse6 (+ |c_~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_33| 28)))) (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store (store .cse4 .cse5 v_ArrVal_1844) .cse6 v_ArrVal_1847)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1849) |c_~#a~0.base|) .cse6 v_ArrVal_1851)) .cse5) 2147483648)) (< |v_t_funThread1of2ForFork0_~i~0#1_35| 0))))) (<= 0 |c_t_funThread1of2ForFork0_~i~0#1|) (or .cse1 (= |c_~#a~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|)) (not (= |c_~#a~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (or (forall ((|v_ULTIMATE.start_main_~#t_ids~0#1.base_65| Int) (v_ArrVal_1847 Int) (|v_t_funThread1of2ForFork0_~i~0#1_35| Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1851 Int) (|v_t_funThread2of2ForFork0_~i~0#1_33| Int) (v_ArrVal_1844 Int) (v_ArrVal_1849 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t_ids~0#1.base_65| v_ArrVal_1842) |c_~#a~0.base|)) (.cse8 (+ (* |v_t_funThread1of2ForFork0_~i~0#1_35| 28) |c_~#a~0.offset|))) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_~#t_ids~0#1.base_65|))) (< 9 |v_t_funThread1of2ForFork0_~i~0#1_35|) (< |v_t_funThread1of2ForFork0_~i~0#1_35| 0) (< 0 (+ (select (let ((.cse9 (+ |c_~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_33| 28)))) (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store (store .cse7 .cse8 v_ArrVal_1844) .cse9 v_ArrVal_1847)) |v_ULTIMATE.start_main_~#t_ids~0#1.base_65| v_ArrVal_1849) |c_~#a~0.base|) .cse9 v_ArrVal_1851)) .cse8) 2147483648)) (< v_ArrVal_1844 (+ (select .cse7 .cse8) 1))))) .cse0) (= |c_~#a~0.offset| 0) (= |c_~#a~0.base| 4) (forall ((|v_t_funThread1of2ForFork0_~i~0#1_35| Int)) (or (< 9 |v_t_funThread1of2ForFork0_~i~0#1_35|) (forall ((v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1844 Int)) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1842) |c_~#a~0.base|)) (.cse11 (+ (* |v_t_funThread1of2ForFork0_~i~0#1_35| 28) |c_~#a~0.offset|))) (or (< v_ArrVal_1844 (+ (select .cse10 .cse11) 1)) (forall ((v_ArrVal_1847 Int) (|v_t_funThread2of2ForFork0_~i~0#1_33| Int) (v_ArrVal_1849 (Array Int Int))) (or (< 0 (+ (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (store .cse10 .cse11 v_ArrVal_1844) (+ |c_~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_33| 28)) v_ArrVal_1847)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1849) |c_~#a~0.base|) .cse11) 2147483648)) (= |v_t_funThread2of2ForFork0_~i~0#1_33| |v_t_funThread1of2ForFork0_~i~0#1_35|)))))) (< |v_t_funThread1of2ForFork0_~i~0#1_35| 0))) (<= 1 (select (select |c_#memory_int| |c_~#a~0.base|) .cse12)) (<= |c_t_funThread1of2ForFork0_~i~0#1| 9) (forall ((v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1844 Int)) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1842) |c_~#a~0.base|))) (or (forall ((v_ArrVal_1847 Int) (v_ArrVal_1851 Int) (|v_t_funThread2of2ForFork0_~i~0#1_33| Int) (v_ArrVal_1849 (Array Int Int))) (let ((.cse14 (+ |c_~#a~0.offset| (* |v_t_funThread2of2ForFork0_~i~0#1_33| 28)))) (or (< 0 (+ (select (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store (store .cse13 .cse12 v_ArrVal_1844) .cse14 v_ArrVal_1847)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1849) |c_~#a~0.base|) .cse14 v_ArrVal_1851) .cse12) 2147483648)) (= .cse14 |c_t_funThread1of2ForFork0_~p~0#1.offset|)))) (< v_ArrVal_1844 (+ (select .cse13 .cse12) 1))))) (let ((.cse17 (= (select .cse15 168) 0)) (.cse16 (= (select .cse15 252) 0)) (.cse20 (= (select .cse15 56) 0)) (.cse22 (= (select .cse15 84) 0))) (let ((.cse30 (or (and .cse17 (or (and .cse20 (or .cse16 .cse22)) (and .cse16 .cse22))) (and .cse16 .cse20 .cse22))) (.cse29 (and .cse16 .cse17 .cse20 .cse22)) (.cse21 (= (select .cse15 196) 0)) (.cse18 (= (select .cse15 224) 0)) (.cse23 (= (select .cse15 0) 0)) (.cse19 (= (select .cse15 112) 0)) (.cse26 (= (select .cse15 28) 0))) (or (and (= (select .cse15 140) 0) (or (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse23 (let ((.cse25 (or (and .cse20 .cse22) (and (or .cse20 .cse22) .cse17))) (.cse24 (and .cse17 .cse20 .cse22))) (or (and (or (and (or (and .cse17 .cse18 .cse20 .cse22) (and .cse19 (or .cse24 (and .cse18 .cse25)))) .cse21) (and .cse17 .cse18 .cse19 .cse20 .cse22)) .cse26) (and .cse17 .cse18 .cse19 .cse20 .cse21 .cse22) (and .cse16 (or (and .cse18 (let ((.cse27 (and (or (and .cse17 .cse22) (and (or .cse17 .cse22) .cse19)) .cse21)) (.cse28 (and .cse17 .cse19 .cse22))) (or (and (or .cse27 .cse28 (and (or (and (or .cse17 .cse19 .cse21) .cse22) (and (or .cse17 .cse19) .cse21) (and .cse17 .cse19)) .cse26)) .cse20) (and .cse17 .cse19 .cse21 .cse22) (and (or .cse27 .cse28) .cse26)))) (and (or (and .cse17 .cse19 .cse20 .cse22) (and (or (and .cse19 .cse25) .cse24) .cse21)) .cse26) (and .cse17 .cse19 .cse20 .cse21 .cse22)))))) (and (or (and .cse16 .cse17 .cse18 .cse19 .cse20 .cse22) (and (or (and .cse19 (or .cse29 (and .cse18 .cse30))) (and .cse16 .cse17 .cse18 .cse20 .cse22)) .cse21)) .cse26))) (and .cse16 .cse17 .cse18 .cse23 .cse19 .cse20 .cse21 .cse22) (and (or (and (or (and (or (and (or (and .cse23 .cse30) .cse29) .cse18) (and .cse16 .cse17 .cse23 .cse20 .cse22)) .cse19) (and .cse16 .cse17 .cse18 .cse23 .cse20 .cse22)) .cse21) (and .cse16 .cse17 .cse18 .cse23 .cse19 .cse20 .cse22)) .cse26)))) (forall ((v_ArrVal_1846 (Array Int Int)) (v_ArrVal_1847 Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1851 Int) (|v_t_funThread2of2ForFork0_~i~0#1_33| Int) (v_ArrVal_1844 Int) (v_ArrVal_1849 (Array Int Int))) (let ((.cse33 (* |v_t_funThread2of2ForFork0_~i~0#1_33| 28)) (.cse31 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1842) |c_~#a~0.base|))) (or (< 0 (+ (select (let ((.cse32 (+ |c_~#a~0.offset| .cse33))) (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store (store .cse31 .cse12 v_ArrVal_1844) .cse32 v_ArrVal_1847)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1849) |c_~#a~0.base|) .cse32 v_ArrVal_1851)) .cse12) 2147483648)) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1846) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse33 4)) 0)) (< v_ArrVal_1844 (+ (select .cse31 .cse12) 1))))) (<= 1 (select .cse15 .cse34)))))) is different from false [2024-11-13 12:49:09,445 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-13 12:49:16,503 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-13 12:49:18,517 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-13 12:49:20,534 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-13 12:49:22,628 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-13 12:49:24,643 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-13 12:49:26,649 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-13 12:49:46,696 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-13 12:49:48,763 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-13 12:49:50,860 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-13 12:49:52,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:49:55,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:49:57,672 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-13 12:49:59,783 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-13 12:50:01,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-13 12:50:03,922 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-13 12:50:06,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:50:09,074 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-13 12:50:11,084 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-13 12:50:13,117 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-13 12:50:15,136 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-13 12:50:17,139 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-13 12:50:19,143 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-13 12:50:21,175 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-13 12:50:23,178 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-13 12:50:25,182 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-13 12:50:27,217 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-13 12:50:28,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 12:50:30,320 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-13 12:50:32,340 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-13 12:50:34,358 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-13 12:50:36,570 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-13 12:50:38,582 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-13 12:50:40,643 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-13 12:50:42,651 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-13 12:50:44,654 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-13 12:50:46,680 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-13 12:50:48,683 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-13 12:50:50,840 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-13 12:50:52,896 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-13 12:50:55,005 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-13 12:50:57,008 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] Killed by 15