./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/config/GemCutterReach.xml -i ../../sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/config/svcomp-Overflow-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx --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 2a10f98c1a89e2ac521234c9e4f0eca565cc5bc1484e9c7d67d861e216c6f9ba --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 20:43:35,125 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 20:43:35,187 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/config/svcomp-Overflow-32bit-GemCutter_Default.epf [2023-12-02 20:43:35,192 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 20:43:35,192 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 20:43:35,213 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 20:43:35,214 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 20:43:35,214 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 20:43:35,215 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 20:43:35,216 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 20:43:35,217 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 20:43:35,217 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 20:43:35,217 INFO L153 SettingsManager]: * Use SBE=true [2023-12-02 20:43:35,218 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 20:43:35,219 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 20:43:35,219 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 20:43:35,220 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 20:43:35,220 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 20:43:35,220 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 20:43:35,221 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 20:43:35,221 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 20:43:35,223 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 20:43:35,224 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-12-02 20:43:35,224 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 20:43:35,224 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 20:43:35,225 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 20:43:35,225 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 20:43:35,225 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 20:43:35,225 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 20:43:35,226 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 20:43:35,226 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 20:43:35,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 20:43:35,227 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 20:43:35,227 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 20:43:35,227 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 20:43:35,227 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-02 20:43:35,228 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2023-12-02 20:43:35,228 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 20:43:35,228 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 20:43:35,228 INFO L153 SettingsManager]: * Abstraction used for commutativity in POR=VARIABLES_GLOBAL [2023-12-02 20:43:35,228 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-12-02 20:43:35,229 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 20:43:35,229 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-12-02 20:43:35,229 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-12-02 20:43:35,229 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx 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 -> 2a10f98c1a89e2ac521234c9e4f0eca565cc5bc1484e9c7d67d861e216c6f9ba [2023-12-02 20:43:35,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 20:43:35,453 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 20:43:35,456 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 20:43:35,457 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 20:43:35,457 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 20:43:35,459 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/../../sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i [2023-12-02 20:43:38,260 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 20:43:38,519 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 20:43:38,519 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/sv-benchmarks/c/goblint-regression/28-race_reach_70-funloop_racefree.i [2023-12-02 20:43:38,535 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/data/09be11d53/7b101da6ac894ea9b2f7b7613285aab4/FLAGdc6913c57 [2023-12-02 20:43:38,547 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/data/09be11d53/7b101da6ac894ea9b2f7b7613285aab4 [2023-12-02 20:43:38,549 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 20:43:38,551 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 20:43:38,552 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 20:43:38,552 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 20:43:38,558 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 20:43:38,559 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:43:38" (1/1) ... [2023-12-02 20:43:38,560 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f1cf209 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:43:38, skipping insertion in model container [2023-12-02 20:43:38,560 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:43:38" (1/1) ... [2023-12-02 20:43:38,607 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 20:43:39,013 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 20:43:39,032 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 20:43:39,075 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 20:43:39,125 INFO L206 MainTranslator]: Completed translation [2023-12-02 20:43:39,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:43:39 WrapperNode [2023-12-02 20:43:39,126 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 20:43:39,127 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 20:43:39,127 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 20:43:39,127 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 20:43:39,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:43:39" (1/1) ... [2023-12-02 20:43:39,150 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:43:39" (1/1) ... [2023-12-02 20:43:39,178 INFO L138 Inliner]: procedures = 272, calls = 36, calls flagged for inlining = 6, calls inlined = 8, statements flattened = 245 [2023-12-02 20:43:39,179 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 20:43:39,180 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 20:43:39,180 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 20:43:39,180 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 20:43:39,189 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:43:39" (1/1) ... [2023-12-02 20:43:39,189 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:43:39" (1/1) ... [2023-12-02 20:43:39,193 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:43:39" (1/1) ... [2023-12-02 20:43:39,194 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:43:39" (1/1) ... [2023-12-02 20:43:39,204 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:43:39" (1/1) ... [2023-12-02 20:43:39,210 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:43:39" (1/1) ... [2023-12-02 20:43:39,212 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:43:39" (1/1) ... [2023-12-02 20:43:39,215 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:43:39" (1/1) ... [2023-12-02 20:43:39,219 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 20:43:39,220 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 20:43:39,220 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 20:43:39,220 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 20:43:39,221 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:43:39" (1/1) ... [2023-12-02 20:43:39,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 20:43:39,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:43:39,250 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 20:43:39,256 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 20:43:39,287 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 20:43:39,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 20:43:39,288 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-02 20:43:39,288 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 20:43:39,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 20:43:39,288 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-02 20:43:39,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 20:43:39,289 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-12-02 20:43:39,289 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-12-02 20:43:39,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 20:43:39,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 20:43:39,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 20:43:39,291 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-02 20:43:39,440 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 20:43:39,442 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 20:43:39,780 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 20:43:39,968 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 20:43:39,968 INFO L309 CfgBuilder]: Removed 25 assume(true) statements. [2023-12-02 20:43:39,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:43:39 BoogieIcfgContainer [2023-12-02 20:43:39,969 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 20:43:39,972 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 20:43:39,972 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 20:43:39,976 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 20:43:39,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:43:38" (1/3) ... [2023-12-02 20:43:39,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48793753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:43:39, skipping insertion in model container [2023-12-02 20:43:39,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:43:39" (2/3) ... [2023-12-02 20:43:39,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48793753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:43:39, skipping insertion in model container [2023-12-02 20:43:39,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:43:39" (3/3) ... [2023-12-02 20:43:39,979 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_70-funloop_racefree.i [2023-12-02 20:43:39,989 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-12-02 20:43:40,000 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 20:43:40,000 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-12-02 20:43:40,000 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-02 20:43:40,056 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-12-02 20:43:40,103 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=VARIABLES_GLOBAL, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:43:40,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-12-02 20:43:40,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:43:40,106 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-12-02 20:43:40,108 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-12-02 20:43:40,148 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-12-02 20:43:40,161 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2023-12-02 20:43:40,168 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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;@7d7a7477, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:43:40,168 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-12-02 20:43:40,390 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-12-02 20:43:40,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:43:40,395 INFO L85 PathProgramCache]: Analyzing trace with hash 328484835, now seen corresponding path program 1 times [2023-12-02 20:43:40,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:43:40,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887268508] [2023-12-02 20:43:40,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:43:40,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:43:40,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:43:40,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:43:40,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:43:40,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887268508] [2023-12-02 20:43:40,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887268508] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:43:40,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:43:40,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 20:43:40,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974333040] [2023-12-02 20:43:40,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:43:40,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 20:43:40,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:43:40,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 20:43:40,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 20:43:40,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:43:40,696 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:43:40,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 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) [2023-12-02 20:43:40,697 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:43:40,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:43:40,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 20:43:40,760 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-12-02 20:43:40,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:43:40,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1188486054, now seen corresponding path program 1 times [2023-12-02 20:43:40,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:43:40,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964209737] [2023-12-02 20:43:40,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:43:40,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:43:40,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:43:40,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:43:40,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:43:40,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964209737] [2023-12-02 20:43:40,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964209737] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:43:40,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364154324] [2023-12-02 20:43:40,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:43:40,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:43:40,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:43:40,909 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:43:40,911 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 20:43:41,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:43:41,013 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 20:43:41,017 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:43:41,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:43:41,043 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:43:41,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:43:41,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364154324] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:43:41,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:43:41,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2023-12-02 20:43:41,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338330697] [2023-12-02 20:43:41,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:43:41,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-02 20:43:41,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:43:41,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-02 20:43:41,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-12-02 20:43:41,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:43:41,078 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:43:41,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 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) [2023-12-02 20:43:41,079 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:43:41,079 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:43:41,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:43:41,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:43:41,181 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-02 20:43:41,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:43:41,376 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-12-02 20:43:41,376 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:43:41,377 INFO L85 PathProgramCache]: Analyzing trace with hash 2098397882, now seen corresponding path program 2 times [2023-12-02 20:43:41,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:43:41,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819079877] [2023-12-02 20:43:41,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:43:41,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:43:41,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:43:41,469 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-02 20:43:41,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:43:41,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819079877] [2023-12-02 20:43:41,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819079877] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:43:41,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:43:41,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 20:43:41,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840561379] [2023-12-02 20:43:41,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:43:41,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 20:43:41,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:43:41,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 20:43:41,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 20:43:41,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:43:41,473 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:43:41,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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) [2023-12-02 20:43:41,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:43:41,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:43:41,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:43:41,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:43:41,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:43:41,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:43:41,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 20:43:41,587 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-12-02 20:43:41,588 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:43:41,588 INFO L85 PathProgramCache]: Analyzing trace with hash -2118062731, now seen corresponding path program 1 times [2023-12-02 20:43:41,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:43:41,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929785029] [2023-12-02 20:43:41,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:43:41,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:43:41,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:43:41,761 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 20:43:41,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:43:41,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929785029] [2023-12-02 20:43:41,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929785029] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:43:41,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407437500] [2023-12-02 20:43:41,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:43:41,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:43:41,763 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:43:41,764 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:43:41,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 20:43:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:43:41,869 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 20:43:41,871 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:43:41,906 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 20:43:41,906 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:43:41,998 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 20:43:41,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407437500] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:43:41,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:43:41,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2023-12-02 20:43:41,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214921080] [2023-12-02 20:43:41,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:43:42,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-02 20:43:42,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:43:42,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-02 20:43:42,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2023-12-02 20:43:42,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:43:42,003 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:43:42,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:43:42,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:43:42,003 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:43:42,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:43:42,004 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:43:42,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:43:42,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:43:42,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:43:42,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 20:43:42,229 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 20:43:42,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:43:42,429 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-12-02 20:43:42,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:43:42,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1101844661, now seen corresponding path program 2 times [2023-12-02 20:43:42,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:43:42,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993034610] [2023-12-02 20:43:42,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:43:42,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:43:42,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:43:42,766 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 20:43:42,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:43:42,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993034610] [2023-12-02 20:43:42,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993034610] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:43:42,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [383824551] [2023-12-02 20:43:42,767 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 20:43:42,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:43:42,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:43:42,772 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:43:42,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 20:43:42,919 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 20:43:42,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:43:42,921 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-02 20:43:42,924 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:43:42,988 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 20:43:42,988 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:43:43,184 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 20:43:43,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [383824551] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:43:43,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:43:43,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 22 [2023-12-02 20:43:43,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311168156] [2023-12-02 20:43:43,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:43:43,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-02 20:43:43,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:43:43,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-02 20:43:43,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2023-12-02 20:43:43,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:43:43,189 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:43:43,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 22 states have internal predecessors, (51), 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) [2023-12-02 20:43:43,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:43:43,189 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:43:43,190 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:43:43,190 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-12-02 20:43:43,190 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:43:43,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:43:43,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:43:43,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:43:43,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 20:43:43,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-02 20:43:43,432 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 20:43:43,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:43:43,628 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-12-02 20:43:43,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:43:43,628 INFO L85 PathProgramCache]: Analyzing trace with hash -479743164, now seen corresponding path program 3 times [2023-12-02 20:43:43,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:43:43,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25236337] [2023-12-02 20:43:43,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:43:43,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:43:43,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:43:44,010 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 20:43:44,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:43:44,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25236337] [2023-12-02 20:43:44,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25236337] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:43:44,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077571900] [2023-12-02 20:43:44,011 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 20:43:44,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:43:44,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:43:44,012 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:43:44,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 20:43:44,116 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 20:43:44,116 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:43:44,117 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-02 20:43:44,122 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:43:44,151 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 7 treesize of output 6 [2023-12-02 20:43:44,363 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:43:44,364 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 [2023-12-02 20:43:44,378 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 15 treesize of output 10 [2023-12-02 20:43:44,448 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 15 treesize of output 10 [2023-12-02 20:43:44,484 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 14 treesize of output 10 [2023-12-02 20:43:44,500 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 20:43:44,500 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:43:44,548 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_195 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (< 0 (+ 2147483650 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_195) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))) is different from false [2023-12-02 20:43:44,562 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_195 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (< 0 (+ 2147483650 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_195) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))) is different from false [2023-12-02 20:43:44,880 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 2 not checked. [2023-12-02 20:43:44,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077571900] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:43:44,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:43:44,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2023-12-02 20:43:44,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374721240] [2023-12-02 20:43:44,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:43:44,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-02 20:43:44,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:43:44,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-02 20:43:44,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=124, Unknown=2, NotChecked=46, Total=210 [2023-12-02 20:43:44,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:43:44,885 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:43:44,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 14 states have internal predecessors, (55), 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) [2023-12-02 20:43:44,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:43:44,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:43:44,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:43:44,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-12-02 20:43:44,886 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-12-02 20:43:44,887 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:43:45,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:43:45,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:43:45,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:43:45,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 20:43:45,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-02 20:43:45,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:43:45,191 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 20:43:45,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:43:45,392 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-12-02 20:43:45,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:43:45,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1790324698, now seen corresponding path program 1 times [2023-12-02 20:43:45,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:43:45,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862055969] [2023-12-02 20:43:45,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:43:45,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:43:45,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:43:45,987 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 20:43:45,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:43:45,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862055969] [2023-12-02 20:43:45,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862055969] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:43:45,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183061243] [2023-12-02 20:43:45,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:43:45,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:43:45,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:43:45,992 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:43:45,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 20:43:46,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:43:46,124 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-02 20:43:46,128 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:43:46,136 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 7 treesize of output 6 [2023-12-02 20:43:46,341 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:43:46,342 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 [2023-12-02 20:43:46,366 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 15 treesize of output 10 [2023-12-02 20:43:46,430 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 15 treesize of output 10 [2023-12-02 20:43:46,502 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 35 treesize of output 28 [2023-12-02 20:43:46,556 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 33 treesize of output 25 [2023-12-02 20:43:46,581 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 20:43:46,581 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:43:46,686 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_272 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_272) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))) is different from false [2023-12-02 20:43:47,014 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 1 not checked. [2023-12-02 20:43:47,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183061243] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:43:47,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:43:47,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 21 [2023-12-02 20:43:47,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196420587] [2023-12-02 20:43:47,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:43:47,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-02 20:43:47,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:43:47,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-02 20:43:47,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=384, Unknown=11, NotChecked=40, Total=506 [2023-12-02 20:43:47,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:43:47,018 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:43:47,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.909090909090909) internal successors, (86), 22 states have internal predecessors, (86), 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) [2023-12-02 20:43:47,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:43:47,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:43:47,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:43:47,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-12-02 20:43:47,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-12-02 20:43:47,019 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:43:47,020 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:43:47,280 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| 4))) (let ((.cse0 ((as const (Array Int Int)) 0)) (.cse1 (select .cse2 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))) (and (<= (+ (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1) .cse1) (<= 1 (select (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (= (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| .cse1) .cse2) (= |c_~#__global_lock~0.offset| 0) (forall ((v_ArrVal_272 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_272) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~#t_ids~0#1.base_48| Int)) (or (forall ((v_ArrVal_272 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t_ids~0#1.base_48| v_ArrVal_272) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#t_ids~0#1.base_48|) 0)))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| 4)))) is different from false [2023-12-02 20:43:47,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:43:47,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:43:47,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:43:47,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 20:43:47,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-02 20:43:47,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:43:47,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 20:43:47,454 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 20:43:47,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:43:47,652 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-12-02 20:43:47,653 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:43:47,653 INFO L85 PathProgramCache]: Analyzing trace with hash -334508426, now seen corresponding path program 1 times [2023-12-02 20:43:47,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:43:47,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091486084] [2023-12-02 20:43:47,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:43:47,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:43:47,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:43:47,840 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2023-12-02 20:43:47,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:43:47,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091486084] [2023-12-02 20:43:47,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091486084] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:43:47,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:43:47,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 20:43:47,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410577661] [2023-12-02 20:43:47,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:43:47,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 20:43:47,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:43:47,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 20:43:47,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 20:43:47,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:43:47,843 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:43:47,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) 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) [2023-12-02 20:43:47,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:43:47,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:43:47,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:43:47,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-12-02 20:43:47,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-12-02 20:43:47,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:43:47,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-12-02 20:43:47,844 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:43:48,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:43:48,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:43:48,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:43:48,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 20:43:48,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-02 20:43:48,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:43:48,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 20:43:48,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:43:48,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-02 20:43:48,026 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-12-02 20:43:48,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:43:48,026 INFO L85 PathProgramCache]: Analyzing trace with hash 227939744, now seen corresponding path program 1 times [2023-12-02 20:43:48,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:43:48,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967473791] [2023-12-02 20:43:48,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:43:48,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:43:48,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:43:48,132 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 20:43:48,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:43:48,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967473791] [2023-12-02 20:43:48,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967473791] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:43:48,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:43:48,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 20:43:48,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304434440] [2023-12-02 20:43:48,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:43:48,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 20:43:48,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:43:48,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 20:43:48,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 20:43:48,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:43:48,135 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:43:48,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 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) [2023-12-02 20:43:48,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:43:48,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:43:48,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:43:48,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-12-02 20:43:48,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-12-02 20:43:48,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:43:48,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-12-02 20:43:48,136 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:43:48,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:43:48,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:43:48,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:43:48,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:43:48,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 20:43:48,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-02 20:43:48,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 20:43:48,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 20:43:48,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:43:48,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:43:48,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-02 20:43:48,316 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-12-02 20:43:48,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:43:48,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1898302715, now seen corresponding path program 1 times [2023-12-02 20:43:48,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:43:48,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298345897] [2023-12-02 20:43:48,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:43:48,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:43:48,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:43:50,919 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 20:43:50,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:43:50,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298345897] [2023-12-02 20:43:50,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298345897] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:43:50,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740249548] [2023-12-02 20:43:50,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:43:50,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:43:50,921 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:43:50,922 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:43:50,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 20:43:51,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:43:51,077 INFO L262 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 37 conjunts are in the unsatisfiable core [2023-12-02 20:43:51,085 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:43:51,090 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 7 treesize of output 6 [2023-12-02 20:43:51,291 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:43:51,291 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 [2023-12-02 20:43:51,330 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 15 treesize of output 10 [2023-12-02 20:43:51,423 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 15 treesize of output 10 [2023-12-02 20:43:51,538 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 24 treesize of output 17 [2023-12-02 20:43:51,661 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 32 treesize of output 25 [2023-12-02 20:43:51,796 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 20 treesize of output 16 [2023-12-02 20:43:51,837 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 20:43:51,837 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:43:52,653 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2023-12-02 20:43:52,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1740249548] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:43:52,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:43:52,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 8] total 32 [2023-12-02 20:43:52,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935400538] [2023-12-02 20:43:52,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:43:52,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-12-02 20:43:52,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:43:52,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-12-02 20:43:52,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=982, Unknown=5, NotChecked=0, Total=1122 [2023-12-02 20:43:52,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:43:52,658 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:43:52,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 4.363636363636363) internal successors, (144), 33 states have internal predecessors, (144), 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) [2023-12-02 20:43:52,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:43:52,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:43:52,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:43:52,659 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-12-02 20:43:52,660 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-12-02 20:43:52,660 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-12-02 20:43:52,660 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-12-02 20:43:52,660 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:43:52,660 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:43:52,660 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:43:54,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:43:54,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:43:54,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:43:54,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 20:43:54,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-02 20:43:54,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 20:43:54,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 20:43:54,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:43:54,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:43:54,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-02 20:43:54,718 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-02 20:43:54,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-02 20:43:54,914 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-12-02 20:43:54,914 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:43:54,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1620057769, now seen corresponding path program 1 times [2023-12-02 20:43:54,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:43:54,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102310358] [2023-12-02 20:43:54,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:43:54,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:43:54,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:43:55,066 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 20:43:55,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:43:55,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102310358] [2023-12-02 20:43:55,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102310358] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:43:55,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315056739] [2023-12-02 20:43:55,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:43:55,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:43:55,068 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:43:55,069 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:43:55,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 20:43:55,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:43:55,225 INFO L262 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-02 20:43:55,228 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:43:55,293 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 20:43:55,293 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 20:43:55,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315056739] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:43:55,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 20:43:55,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-12-02 20:43:55,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997419562] [2023-12-02 20:43:55,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:43:55,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 20:43:55,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:43:55,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 20:43:55,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-02 20:43:55,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:43:55,296 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:43:55,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 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) [2023-12-02 20:43:55,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:43:55,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:43:55,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:43:55,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-12-02 20:43:55,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-12-02 20:43:55,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-12-02 20:43:55,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-12-02 20:43:55,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:43:55,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:43:55,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-12-02 20:43:55,297 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:43:55,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:43:55,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:43:55,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:43:55,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 20:43:55,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-02 20:43:55,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 20:43:55,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 20:43:55,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:43:55,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:43:55,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-02 20:43:55,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:43:55,445 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-02 20:43:55,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:43:55,641 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-12-02 20:43:55,641 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:43:55,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1317817479, now seen corresponding path program 1 times [2023-12-02 20:43:55,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:43:55,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615776777] [2023-12-02 20:43:55,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:43:55,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:43:55,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:43:55,732 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2023-12-02 20:43:55,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:43:55,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615776777] [2023-12-02 20:43:55,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615776777] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:43:55,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:43:55,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 20:43:55,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541975321] [2023-12-02 20:43:55,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:43:55,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 20:43:55,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:43:55,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 20:43:55,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 20:43:55,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:43:55,735 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:43:55,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 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) [2023-12-02 20:43:55,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:43:55,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:43:55,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:43:55,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-12-02 20:43:55,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-12-02 20:43:55,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-12-02 20:43:55,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2023-12-02 20:43:55,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:43:55,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:43:55,736 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-12-02 20:43:55,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:43:55,737 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:43:57,232 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (< 0 (+ 2147483649 (select (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))) (forall ((v_ArrVal_272 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_272) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))) (forall ((v_ArrVal_272 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_272) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) is different from false [2023-12-02 20:44:01,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:44:01,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:44:01,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:44:01,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 20:44:01,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-02 20:44:01,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 20:44:01,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-02 20:44:01,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:44:01,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:44:01,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-12-02 20:44:01,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:44:01,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:44:01,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-02 20:44:01,535 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-12-02 20:44:01,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:44:01,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1786744509, now seen corresponding path program 1 times [2023-12-02 20:44:01,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:44:01,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401999497] [2023-12-02 20:44:01,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:44:01,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:44:01,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:44:02,331 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 20:44:02,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:44:02,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401999497] [2023-12-02 20:44:02,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401999497] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:44:02,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739102568] [2023-12-02 20:44:02,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:44:02,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:44:02,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:44:02,334 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:44:02,336 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-02 20:44:02,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:44:02,502 INFO L262 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-02 20:44:02,507 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:44:02,514 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 7 treesize of output 6 [2023-12-02 20:44:02,665 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:44:02,666 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 [2023-12-02 20:44:02,688 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 15 treesize of output 10 [2023-12-02 20:44:02,851 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 22 treesize of output 17 [2023-12-02 20:44:02,950 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 22 treesize of output 15 [2023-12-02 20:44:03,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2023-12-02 20:44:08,001 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 42 treesize of output 33 [2023-12-02 20:44:08,125 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 47 treesize of output 35 [2023-12-02 20:44:08,172 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 20:44:08,173 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:44:10,728 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_742 Int) (v_ArrVal_743 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (< 0 (+ 2147483649 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_743) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_742)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_743) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38|))))) is different from false [2023-12-02 20:44:10,813 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_40| Int) (v_ArrVal_742 Int) (v_ArrVal_743 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_40| 28)) (< 0 (+ 2147483649 (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_40| v_ArrVal_742)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_743) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_40| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38|))))) is different from false [2023-12-02 20:44:10,860 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_40| Int) (v_ArrVal_742 Int) (v_ArrVal_743 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (v_ArrVal_740 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_40| 28)) (< 0 (+ 2147483649 (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_740) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_40| v_ArrVal_742)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_743) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_40| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_38|))))) is different from false [2023-12-02 20:44:11,405 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 145 trivial. 12 not checked. [2023-12-02 20:44:11,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739102568] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:44:11,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:44:11,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 36 [2023-12-02 20:44:11,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655586102] [2023-12-02 20:44:11,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:44:11,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-12-02 20:44:11,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:44:11,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-12-02 20:44:11,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1009, Unknown=10, NotChecked=204, Total=1406 [2023-12-02 20:44:11,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:44:11,410 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:44:11,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 4.324324324324325) internal successors, (160), 37 states have internal predecessors, (160), 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) [2023-12-02 20:44:11,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:44:11,410 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:44:11,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:44:11,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-12-02 20:44:11,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-12-02 20:44:11,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-12-02 20:44:11,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-12-02 20:44:11,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:44:11,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:44:11,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2023-12-02 20:44:11,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:44:11,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:44:11,412 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:44:13,229 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 [0] [2023-12-02 20:44:19,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-12-02 20:44:23,170 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 [0, 1] [2023-12-02 20:44:31,600 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 [0, 1] [2023-12-02 20:44:34,853 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 [0, 1] [2023-12-02 20:44:41,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:44:41,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:44:41,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:44:41,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 20:44:41,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-02 20:44:41,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 20:44:41,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-02 20:44:41,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:44:41,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:44:41,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-12-02 20:44:41,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:44:41,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:44:41,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-02 20:44:41,814 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-02 20:44:42,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:44:42,010 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-12-02 20:44:42,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:44:42,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1771026342, now seen corresponding path program 1 times [2023-12-02 20:44:42,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:44:42,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384630537] [2023-12-02 20:44:42,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:44:42,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:44:42,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:44:51,190 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 20:44:51,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:44:51,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384630537] [2023-12-02 20:44:51,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384630537] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:44:51,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709040105] [2023-12-02 20:44:51,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:44:51,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:44:51,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:44:51,192 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:44:51,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-02 20:44:51,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:44:51,337 INFO L262 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 43 conjunts are in the unsatisfiable core [2023-12-02 20:44:51,342 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:44:51,348 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 7 treesize of output 6 [2023-12-02 20:44:51,573 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:44:51,573 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 [2023-12-02 20:44:51,615 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 15 treesize of output 10 [2023-12-02 20:44:51,786 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 22 treesize of output 17 [2023-12-02 20:44:51,916 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 22 treesize of output 15 [2023-12-02 20:44:52,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2023-12-02 20:44:58,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2023-12-02 20:45:05,337 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 70 treesize of output 57 [2023-12-02 20:45:36,653 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 59 treesize of output 47 [2023-12-02 20:45:36,885 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 20:45:36,885 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:45:39,170 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_877 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int) (v_ArrVal_875 Int)) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_877) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_875)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_877) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ 56 (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)))) is different from false [2023-12-02 20:45:39,268 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_877 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| Int) (v_ArrVal_875 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49|)) (< (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| v_ArrVal_875)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_877) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 2147483647))) is different from false [2023-12-02 20:45:39,322 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_877 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int) (v_ArrVal_874 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| Int) (v_ArrVal_875 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49|)) (< (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_874) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| v_ArrVal_875)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_877) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_49| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) 2147483647))) is different from false [2023-12-02 20:45:39,947 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 12 proven. 14 refuted. 0 times theorem prover too weak. 145 trivial. 22 not checked. [2023-12-02 20:45:39,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709040105] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:45:39,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:45:39,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 14] total 48 [2023-12-02 20:45:39,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795543117] [2023-12-02 20:45:39,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:45:39,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-12-02 20:45:39,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:45:39,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-12-02 20:45:39,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1873, Unknown=29, NotChecked=276, Total=2450 [2023-12-02 20:45:39,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:39,952 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:45:39,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 4.591836734693878) internal successors, (225), 49 states have internal predecessors, (225), 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) [2023-12-02 20:45:39,952 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:45:39,952 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:45:39,952 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:45:39,952 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-12-02 20:45:39,952 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-12-02 20:45:39,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-12-02 20:45:39,953 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-12-02 20:45:39,965 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:45:39,965 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:45:39,965 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2023-12-02 20:45:39,965 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:45:39,965 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:45:39,965 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2023-12-02 20:45:39,965 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:45:59,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:46:08,322 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] [2023-12-02 20:46:12,233 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] [2023-12-02 20:46:24,626 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (< 0 (+ 2147483650 (select (select |c_#memory_int| |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))) (forall ((|v_ULTIMATE.start_main_~#t_ids~0#1.base_49| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~#t_ids~0#1.base_49|) 0)) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_451 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~#t_ids~0#1.base_49| v_ArrVal_451) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 2147483650))))) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int) (v_ArrVal_451 (Array Int Int))) (< 0 (+ 2147483650 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_451) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) is different from false [2023-12-02 20:46:24,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:46:24,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:46:24,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:46:24,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 20:46:24,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-02 20:46:24,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 20:46:24,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-02 20:46:24,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:46:24,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:46:24,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-12-02 20:46:24,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:46:24,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:46:24,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-12-02 20:46:24,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-12-02 20:46:24,635 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-12-02 20:46:24,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-12-02 20:46:24,831 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-12-02 20:46:24,831 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:46:24,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1655274010, now seen corresponding path program 2 times [2023-12-02 20:46:24,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:46:24,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159738513] [2023-12-02 20:46:24,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:46:24,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:46:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:46:34,849 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 20:46:34,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:46:34,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159738513] [2023-12-02 20:46:34,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159738513] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:46:34,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429581685] [2023-12-02 20:46:34,850 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 20:46:34,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:46:34,850 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:46:34,851 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:46:34,852 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-02 20:46:34,994 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 20:46:34,995 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:46:34,997 INFO L262 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 43 conjunts are in the unsatisfiable core [2023-12-02 20:46:35,000 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:46:35,006 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 7 treesize of output 6 [2023-12-02 20:46:35,251 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:46:35,252 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 [2023-12-02 20:46:35,330 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 15 treesize of output 10 [2023-12-02 20:46:35,526 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 22 treesize of output 17 [2023-12-02 20:46:35,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2023-12-02 20:46:42,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2023-12-02 20:46:46,682 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 63 treesize of output 50 [2023-12-02 20:46:50,896 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 70 treesize of output 57 [2023-12-02 20:47:20,211 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 59 treesize of output 47 [2023-12-02 20:47:20,425 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 20:47:20,425 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:47:23,711 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_1013 Int) (v_ArrVal_1015 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1015) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1013)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1015) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) 2147483647))) is different from false [2023-12-02 20:47:23,814 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_1013 Int) (v_ArrVal_1015 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ .cse0 28 |c_~#cache~0.offset|)) (< (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_1013)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1015) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) 2147483647) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56|)))) is different from false [2023-12-02 20:47:23,841 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_34| Int)) (or (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_1013 Int) (v_ArrVal_1015 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_34| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56|) (< (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_1013)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1015) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ .cse0 28 |c_~#cache~0.offset|))))) (< |v_t_funThread1of1ForFork0_~i~0#1_34| (+ |c_t_funThread1of1ForFork0_#t~post45#1| 1)))) is different from false [2023-12-02 20:47:23,886 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| Int) (v_ArrVal_1013 Int) (v_ArrVal_1015 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| Int) (|v_t_funThread1of1ForFork0_~i~0#1_34| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_34| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_34| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56|) (< (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| v_ArrVal_1013)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1015) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_56| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54|) 2147483647) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_54| (+ .cse0 28 |c_~#cache~0.offset|))))) is different from false [2023-12-02 20:47:27,919 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 14 refuted. 5 times theorem prover too weak. 145 trivial. 29 not checked. [2023-12-02 20:47:27,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429581685] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:47:27,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:47:27,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15, 14] total 48 [2023-12-02 20:47:27,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732773344] [2023-12-02 20:47:27,920 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:47:27,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-12-02 20:47:27,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:47:27,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-12-02 20:47:27,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1823, Unknown=35, NotChecked=364, Total=2450 [2023-12-02 20:47:27,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:47:27,924 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:47:27,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 4.591836734693878) internal successors, (225), 49 states have internal predecessors, (225), 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) [2023-12-02 20:47:27,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:47:27,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:47:27,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:47:27,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-12-02 20:47:27,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-12-02 20:47:27,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-12-02 20:47:27,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-12-02 20:47:27,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:47:27,925 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:47:27,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2023-12-02 20:47:27,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:47:27,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:47:27,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2023-12-02 20:47:27,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2023-12-02 20:47:27,926 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:47:58,060 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 [0, 1] [2023-12-02 20:48:30,563 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 [0] [2023-12-02 20:48:49,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:48:49,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:48:49,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:48:49,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-02 20:48:49,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-02 20:48:49,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-02 20:48:49,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-02 20:48:49,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:48:49,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:48:49,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-12-02 20:48:49,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:48:49,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:48:49,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-12-02 20:48:49,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-12-02 20:48:49,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-12-02 20:48:49,982 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-12-02 20:48:50,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-12-02 20:48:50,178 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-12-02 20:48:50,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:48:50,178 INFO L85 PathProgramCache]: Analyzing trace with hash 2144914476, now seen corresponding path program 2 times [2023-12-02 20:48:50,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:48:50,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898037725] [2023-12-02 20:48:50,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:48:50,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:48:50,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:48:59,724 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 20:48:59,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:48:59,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898037725] [2023-12-02 20:48:59,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898037725] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:48:59,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306434168] [2023-12-02 20:48:59,725 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 20:48:59,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:48:59,725 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:48:59,726 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:48:59,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23803d33-5056-4cd0-9391-c071c6a3aeb4/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-02 20:48:59,876 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 20:48:59,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:48:59,879 INFO L262 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 48 conjunts are in the unsatisfiable core [2023-12-02 20:48:59,883 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:48:59,891 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 7 treesize of output 6 [2023-12-02 20:49:00,166 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:49:00,167 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 [2023-12-02 20:49:00,238 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 15 treesize of output 10 [2023-12-02 20:49:00,471 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 22 treesize of output 17 [2023-12-02 20:49:00,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2023-12-02 20:49:07,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2023-12-02 20:49:11,740 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 63 treesize of output 50 [2023-12-02 20:49:15,985 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 70 treesize of output 57 [2023-12-02 20:49:45,616 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 84 treesize of output 69 [2023-12-02 20:49:46,054 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 122 treesize of output 96 [2023-12-02 20:49:46,272 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2023-12-02 20:49:46,272 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:49:47,768 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1160 Int) (|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_1162 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1162) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1160)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1162) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) 2147483649)))) is different from false [2023-12-02 20:49:47,858 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1160 Int) (|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_1162 (Array Int Int))) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (< 0 (+ 2147483649 (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| v_ArrVal_1160)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1162) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|))) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ .cse0 28 |c_~#cache~0.offset|))))) is different from false [2023-12-02 20:49:47,885 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_38| Int)) (or (< |v_t_funThread1of1ForFork0_~i~0#1_38| (+ |c_t_funThread1of1ForFork0_#t~post45#1| 1)) (forall ((v_ArrVal_1160 Int) (|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_1162 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_38| 28))) (or (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65|) (< 0 (+ 2147483649 (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| v_ArrVal_1160)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1162) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ .cse0 28 |c_~#cache~0.offset|))))))) is different from false [2023-12-02 20:49:47,924 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1160 Int) (|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (|v_t_funThread1of1ForFork0_~i~0#1_38| Int) (v_ArrVal_1162 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_38| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_38| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65|) (< 0 (+ 2147483649 (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| v_ArrVal_1160)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1162) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ .cse0 28 |c_~#cache~0.offset|))))) is different from false [2023-12-02 20:49:54,170 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 0 proven. 26 refuted. 5 times theorem prover too weak. 145 trivial. 29 not checked. [2023-12-02 20:49:54,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306434168] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:49:54,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:49:54,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 17] total 54 [2023-12-02 20:49:54,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315643468] [2023-12-02 20:49:54,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:49:54,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-12-02 20:49:54,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:49:54,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-12-02 20:49:54,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=2357, Unknown=54, NotChecked=412, Total=3080 [2023-12-02 20:49:54,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:49:54,174 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:49:54,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 4.4) internal successors, (242), 55 states have internal predecessors, (242), 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) [2023-12-02 20:49:54,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:49:54,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:49:54,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:49:54,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-12-02 20:49:54,174 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2023-12-02 20:49:54,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-12-02 20:49:54,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-12-02 20:49:54,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:49:54,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:49:54,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2023-12-02 20:49:54,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:49:54,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:49:54,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 42 states. [2023-12-02 20:49:54,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 47 states. [2023-12-02 20:49:54,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2023-12-02 20:49:54,175 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:50:03,813 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 [0, 1] [2023-12-02 20:50:08,688 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 [0, 1] [2023-12-02 20:50:13,720 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 [0, 1] [2023-12-02 20:50:15,875 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 [0, 1] [2023-12-02 20:50:17,992 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 [0, 1] [2023-12-02 20:50:20,230 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 [0, 1] [2023-12-02 20:50:22,429 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 [0, 1] [2023-12-02 20:50:28,512 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 [0, 1] [2023-12-02 20:50:30,598 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 [0, 1] [2023-12-02 20:50:32,826 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 [0, 1] [2023-12-02 20:50:39,889 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 [0, 1] [2023-12-02 20:50:42,296 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 [0, 1] [2023-12-02 20:50:48,141 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 [0, 1] [2023-12-02 20:50:50,289 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 [0, 1] [2023-12-02 20:50:52,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 [0, 1] [2023-12-02 20:50:54,446 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 [0, 1] [2023-12-02 20:50:56,762 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 [0, 1] [2023-12-02 20:51:02,948 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 [0, 1] [2023-12-02 20:51:05,235 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 [0, 1] [2023-12-02 20:51:07,426 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 [0, 1] [2023-12-02 20:51:09,530 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 [0, 1] [2023-12-02 20:51:15,799 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 [0, 1] [2023-12-02 20:51:17,905 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 [0, 1] [2023-12-02 20:51:19,917 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 [0, 1] [2023-12-02 20:51:21,933 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 [0, 1] [2023-12-02 20:51:23,948 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 [0, 1] [2023-12-02 20:51:26,030 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 [0, 1] [2023-12-02 20:51:53,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:52:11,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 [0, 1] [2023-12-02 20:52:32,335 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse0 ((as const (Array Int Int)) 0))) (let ((.cse14 (@diff .cse15 .cse0))) (let ((.cse7 (store .cse15 .cse14 0))) (let ((.cse6 (@diff .cse7 .cse0))) (let ((.cse10 (store .cse7 .cse6 0))) (let ((.cse11 (@diff .cse10 .cse0))) (let ((.cse12 (store .cse10 .cse11 0))) (let ((.cse13 (@diff .cse12 .cse0))) (let ((.cse1 (store .cse12 .cse13 0))) (let ((.cse2 (@diff .cse1 .cse0))) (let ((.cse3 (* |c_t_funThread1of1ForFork0_~i~0#1| 28)) (.cse4 (store .cse1 .cse2 0))) (let ((.cse5 (@diff .cse4 .cse0)) (.cse8 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse9 (+ .cse3 28 |c_~#cache~0.offset|))) (and (or (= .cse0 .cse1) (< (+ .cse2 27) .cse3)) (or (= .cse0 .cse4) (< (+ .cse5 27) .cse3)) (or (< (+ .cse6 27) .cse3) (= .cse0 .cse7)) (= (select .cse8 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (= .cse0 (store .cse4 .cse5 0)) (= |c_~#cache~0.offset| 0) (forall ((v_ArrVal_1160 Int) (|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_1162 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| .cse9) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1162) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse8 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1160)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1162) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) 2147483649)))) (or (= .cse0 .cse10) (< (+ .cse11 27) .cse3)) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (or (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse8 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| .cse9))) (or (= .cse0 .cse12) (< (+ .cse13 27) .cse3)) (or (< (+ .cse14 27) .cse3) (= .cse0 .cse15))))))))))))))) is different from false [2023-12-02 20:52:32,350 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (= (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0) (forall ((v_ArrVal_1160 Int) (|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_1162 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1162) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1160)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1162) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) 2147483649)))))) is different from false [2023-12-02 20:52:32,357 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1160 Int) (|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_1162 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1162) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1160)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1162) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) 2147483649)))) (= |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1| 0)) is different from false [2023-12-02 20:52:35,038 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|))) (and (<= 1 (select (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (or (< 0 (+ 2147483649 (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| .cse0))) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_1162 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| .cse0) (< 0 (+ 2147483649 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1162))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|))))))) is different from false [2023-12-02 20:52:35,044 WARN L854 $PredicateComparison]: unable to prove that (and (<= 1 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_1162 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (< 0 (+ 2147483649 (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1162))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|)))))) is different from false [2023-12-02 20:52:37,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:52:40,277 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 [0, 1] [2023-12-02 20:52:42,592 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 [0, 1] [2023-12-02 20:52:44,769 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 [0, 1] [2023-12-02 20:52:57,663 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 [0, 1] [2023-12-02 20:53:10,186 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 [0, 1] [2023-12-02 20:53:23,679 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 [0, 1] [2023-12-02 20:53:25,857 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 [0, 1] [2023-12-02 20:53:32,401 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 [0, 1] [2023-12-02 20:53:41,644 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 [0, 1] [2023-12-02 20:53:43,855 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 [0, 1] [2023-12-02 20:53:51,046 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 [0, 1] [2023-12-02 20:54:13,946 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] [2023-12-02 20:54:21,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:54:24,951 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] [2023-12-02 20:54:26,767 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] [2023-12-02 20:54:34,446 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] [2023-12-02 20:54:43,356 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse4 (+ .cse1 28 |c_~#cache~0.offset|))) (and (<= 1 (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (or (< 0 (+ 2147483649 (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ .cse1 |c_~#cache~0.offset|)))) (forall ((v_ArrVal_1160 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1_70| Int) (|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (|v_t_funThread1of1ForFork0_~i~0#1_38| Int) (v_ArrVal_1162 (Array Int Int))) (let ((.cse3 (* |v_t_funThread1of1ForFork0_~i~0#1_38| 28))) (or (< 0 (+ 2147483649 (select (store (select (store (let ((.cse2 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|))))) (store .cse2 |c_~#cache~0.base| (store (select .cse2 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| v_ArrVal_1160))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1162) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| (+ (- 1) |v_t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1_70|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|))) (< |v_t_funThread1of1ForFork0_~i~0#1_38| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< (+ .cse3 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ .cse3 28 |c_~#cache~0.offset|))))) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (or (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| .cse4))) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_1162 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| .cse4) (< 0 (+ 2147483649 (select (select (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1162))) (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|)))))))) is different from false [2023-12-02 20:54:44,158 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse3 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|))) (and (<= 1 (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)) (forall ((v_ArrVal_1160 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1_70| Int) (|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (|v_t_funThread1of1ForFork0_~i~0#1_38| Int) (v_ArrVal_1162 (Array Int Int))) (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_38| 28))) (or (< 0 (+ 2147483649 (select (store (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|))))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| v_ArrVal_1160))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1162) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| (+ (- 1) |v_t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1_70|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|))) (< |v_t_funThread1of1ForFork0_~i~0#1_38| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< (+ .cse2 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ .cse2 28 |c_~#cache~0.offset|))))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (or (< 0 (+ 2147483649 (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| .cse3))) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_1162 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| .cse3) (< 0 (+ 2147483649 (select (select (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1162))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|))))))) is different from false [2023-12-02 20:54:47,354 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (< 0 (+ (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 2147483648)) (forall ((v_ArrVal_1160 Int) (|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (|v_t_funThread1of1ForFork0_~i~0#1_38| Int) (v_ArrVal_1162 (Array Int Int))) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_38| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_38| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< (+ .cse1 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65|) (< 0 (+ 2147483649 (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| v_ArrVal_1160)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1162) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ .cse1 28 |c_~#cache~0.offset|))))) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (or (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))))) is different from false [2023-12-02 20:54:52,065 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|))) (and (<= 1 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (or (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| .cse0))) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_1162 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| .cse0) (< 0 (+ 2147483649 (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1162))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|))))))) is different from false [2023-12-02 20:55:50,427 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] [2023-12-02 20:56:01,916 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] [2023-12-02 20:56:17,644 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] [2023-12-02 20:56:19,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:56:23,430 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] [2023-12-02 20:56:26,083 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] [2023-12-02 20:56:28,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:56:48,458 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] [2023-12-02 20:56:50,974 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] [2023-12-02 20:56:53,312 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] [2023-12-02 20:57:07,111 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] [2023-12-02 20:57:07,616 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse3 (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|)) (.cse2 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (and (< 0 (+ (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 2147483648)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (or (< 0 (+ 2147483649 (select .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ .cse2 |c_~#cache~0.offset|)))) (forall ((v_ArrVal_1160 Int) (|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (|v_t_funThread1of1ForFork0_~i~0#1_38| Int) (v_ArrVal_1162 (Array Int Int))) (let ((.cse4 (* |v_t_funThread1of1ForFork0_~i~0#1_38| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_38| .cse3) (< (+ .cse4 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65|) (< 0 (+ 2147483649 (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| v_ArrVal_1160)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1162) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ .cse4 28 |c_~#cache~0.offset|))))) (forall ((v_ArrVal_1160 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1_70| Int) (|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (|v_t_funThread1of1ForFork0_~i~0#1_38| Int) (v_ArrVal_1162 (Array Int Int))) (let ((.cse6 (* |v_t_funThread1of1ForFork0_~i~0#1_38| 28))) (or (< 0 (+ 2147483649 (select (store (select (store (let ((.cse5 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|))))) (store .cse5 |c_~#cache~0.base| (store (select .cse5 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| v_ArrVal_1160))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1162) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| (+ (- 1) |v_t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1_70|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|))) (< |v_t_funThread1of1ForFork0_~i~0#1_38| .cse3) (< (+ .cse6 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ .cse6 28 |c_~#cache~0.offset|))))) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (or (< 0 (+ 2147483649 (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ .cse2 28 |c_~#cache~0.offset|)))))) is different from false [2023-12-02 20:57:07,627 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#cache~0.base|))) (and (forall ((v_ArrVal_1160 Int) (|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (|v_t_funThread1of1ForFork0_~i~0#1_38| Int) (v_ArrVal_1162 (Array Int Int))) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_38| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_38| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65|) (< 0 (+ 2147483649 (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| v_ArrVal_1160)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1162) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ .cse0 28 |c_~#cache~0.offset|))))) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (or (< 0 (+ 2147483649 (select .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))))) is different from false [2023-12-02 20:57:07,641 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#cache~0.base|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ (* |c_t_funThread1of1ForFork0_#t~post45#1| 28) 28 |c_~#cache~0.offset|)) (< 0 (+ 2147483649 (select .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|))))) (forall ((|v_t_funThread1of1ForFork0_~i~0#1_38| Int)) (or (< |v_t_funThread1of1ForFork0_~i~0#1_38| (+ |c_t_funThread1of1ForFork0_#t~post45#1| 1)) (forall ((v_ArrVal_1160 Int) (|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_1162 (Array Int Int))) (let ((.cse1 (* |v_t_funThread1of1ForFork0_~i~0#1_38| 28))) (or (< (+ .cse1 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65|) (< 0 (+ 2147483649 (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| v_ArrVal_1160)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1162) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ .cse1 28 |c_~#cache~0.offset|))))))))) is different from false [2023-12-02 20:57:07,649 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (let ((.cse0 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse1 (+ .cse2 |c_~#cache~0.offset|))) (and (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int)) (or (< 0 (+ 2147483649 (select .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|))) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| .cse1))) (forall ((v_ArrVal_1160 Int) (|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_1162 (Array Int Int))) (or (< 0 (+ 2147483649 (select (store (select (store (store |c_#memory_int| |c_~#cache~0.base| (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| v_ArrVal_1160)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1162) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|)) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|))) (< .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_65|) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ .cse2 28 |c_~#cache~0.offset|))))))) is different from false [2023-12-02 20:57:07,657 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (and (forall ((v_ArrVal_1160 Int) (|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_1162 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1162) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1160)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1162) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) 2147483649)))) (< 0 (+ 2147483649 (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) is different from false [2023-12-02 20:57:07,666 WARN L854 $PredicateComparison]: unable to prove that (and (< 0 (+ 2147483649 |c_t_funThread1of1ForFork0_cache_entry_addref_#t~post35#1|)) (forall ((v_ArrVal_1160 Int) (|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_1162 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (< 0 (+ (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1162) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| v_ArrVal_1160)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1162) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|) 2147483649))))) is different from false [2023-12-02 20:57:07,675 WARN L854 $PredicateComparison]: unable to prove that (and (< 0 (+ (select (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 2147483648)) (forall ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| Int) (v_ArrVal_1162 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (< 0 (+ 2147483649 (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1162))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) |t_funThread1of1ForFork0_cache_entry_addref_#t~post39#1|)))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_63|)))))) is different from false [2023-12-02 20:57:12,266 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 [0, 1] [2023-12-02 20:57:14,583 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 [0, 1] [2023-12-02 20:57:16,882 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 [0, 1] [2023-12-02 20:57:19,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 [0, 1] [2023-12-02 20:57:21,070 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 [0, 1] [2023-12-02 20:57:23,086 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 [0, 1] [2023-12-02 20:57:25,209 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 [0, 1] [2023-12-02 20:57:33,742 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 [0, 1] [2023-12-02 20:57:48,999 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 [0, 1] [2023-12-02 20:58:09,150 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 [0, 1] [2023-12-02 20:58:11,323 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 [0, 1] [2023-12-02 20:58:13,388 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 [0, 1] [2023-12-02 20:58:15,563 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 [0, 1]