./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/goblint-regression/28-race_reach_76-tricky_address3_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/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_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/config/GemCutterReach.xml -i ../../sv-benchmarks/c/goblint-regression/28-race_reach_76-tricky_address3_racefree.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 53e3b4cf7a6885129025777f14c3b33a959debd694827832fbe127376cb0a5f9 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 20:30:36,053 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 20:30:36,116 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/config/svcomp-Reach-32bit-GemCutter_Default.epf [2023-12-02 20:30:36,120 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 20:30:36,121 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 20:30:36,142 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 20:30:36,143 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 20:30:36,143 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 20:30:36,144 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 20:30:36,144 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 20:30:36,145 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 20:30:36,146 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 20:30:36,146 INFO L153 SettingsManager]: * Use SBE=true [2023-12-02 20:30:36,147 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 20:30:36,147 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 20:30:36,147 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 20:30:36,148 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 20:30:36,148 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 20:30:36,149 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 20:30:36,149 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 20:30:36,150 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 20:30:36,150 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 20:30:36,151 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 20:30:36,151 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 20:30:36,152 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 20:30:36,152 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 20:30:36,153 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-02 20:30:36,153 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 20:30:36,153 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 20:30:36,154 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 20:30:36,154 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 20:30:36,155 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 20:30:36,166 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 20:30:36,166 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-02 20:30:36,167 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2023-12-02 20:30:36,167 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 20:30:36,168 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 20:30:36,168 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-12-02 20:30:36,168 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 20:30:36,169 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-12-02 20:30:36,169 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-12-02 20:30:36,170 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_39e65a66-975c-4702-bb7e-cd1de0828a46/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_39e65a66-975c-4702-bb7e-cd1de0828a46/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 ! call(reach_error())) ) 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 -> 53e3b4cf7a6885129025777f14c3b33a959debd694827832fbe127376cb0a5f9 [2023-12-02 20:30:36,389 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 20:30:36,409 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 20:30:36,411 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 20:30:36,412 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 20:30:36,412 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 20:30:36,413 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/../../sv-benchmarks/c/goblint-regression/28-race_reach_76-tricky_address3_racefree.i [2023-12-02 20:30:39,189 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 20:30:39,424 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 20:30:39,425 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/sv-benchmarks/c/goblint-regression/28-race_reach_76-tricky_address3_racefree.i [2023-12-02 20:30:39,442 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/data/c1086112a/70a820408d484bfeb783bc2a7fefb22b/FLAGaac0ea948 [2023-12-02 20:30:39,457 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/data/c1086112a/70a820408d484bfeb783bc2a7fefb22b [2023-12-02 20:30:39,459 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 20:30:39,461 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 20:30:39,462 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 20:30:39,462 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 20:30:39,467 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 20:30:39,468 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:30:39" (1/1) ... [2023-12-02 20:30:39,469 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56ebddea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:30:39, skipping insertion in model container [2023-12-02 20:30:39,469 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 08:30:39" (1/1) ... [2023-12-02 20:30:39,525 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 20:30:39,965 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/sv-benchmarks/c/goblint-regression/28-race_reach_76-tricky_address3_racefree.i[41323,41336] [2023-12-02 20:30:39,992 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 20:30:40,011 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 20:30:40,049 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/sv-benchmarks/c/goblint-regression/28-race_reach_76-tricky_address3_racefree.i[41323,41336] [2023-12-02 20:30:40,062 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 20:30:40,127 INFO L206 MainTranslator]: Completed translation [2023-12-02 20:30:40,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:30:40 WrapperNode [2023-12-02 20:30:40,127 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 20:30:40,128 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 20:30:40,129 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 20:30:40,129 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 20:30:40,136 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:30:40" (1/1) ... [2023-12-02 20:30:40,155 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:30:40" (1/1) ... [2023-12-02 20:30:40,186 INFO L138 Inliner]: procedures = 271, calls = 49, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 219 [2023-12-02 20:30:40,186 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 20:30:40,187 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 20:30:40,187 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 20:30:40,187 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 20:30:40,197 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:30:40" (1/1) ... [2023-12-02 20:30:40,197 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:30:40" (1/1) ... [2023-12-02 20:30:40,202 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:30:40" (1/1) ... [2023-12-02 20:30:40,202 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:30:40" (1/1) ... [2023-12-02 20:30:40,213 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:30:40" (1/1) ... [2023-12-02 20:30:40,218 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:30:40" (1/1) ... [2023-12-02 20:30:40,220 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:30:40" (1/1) ... [2023-12-02 20:30:40,222 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:30:40" (1/1) ... [2023-12-02 20:30:40,224 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 20:30:40,225 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 20:30:40,225 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 20:30:40,225 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 20:30:40,226 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:30:40" (1/1) ... [2023-12-02 20:30:40,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 20:30:40,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:30:40,255 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/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:30:40,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/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:30:40,293 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 20:30:40,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 20:30:40,293 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-02 20:30:40,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 20:30:40,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 20:30:40,294 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-02 20:30:40,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 20:30:40,294 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-12-02 20:30:40,294 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-12-02 20:30:40,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 20:30:40,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 20:30:40,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 20:30:40,296 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:30:40,435 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 20:30:40,437 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 20:30:40,741 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 20:30:40,935 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 20:30:40,935 INFO L309 CfgBuilder]: Removed 23 assume(true) statements. [2023-12-02 20:30:40,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:30:40 BoogieIcfgContainer [2023-12-02 20:30:40,936 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 20:30:40,939 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 20:30:40,939 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 20:30:40,942 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 20:30:40,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 08:30:39" (1/3) ... [2023-12-02 20:30:40,943 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@697845a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:30:40, skipping insertion in model container [2023-12-02 20:30:40,943 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 08:30:40" (2/3) ... [2023-12-02 20:30:40,944 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@697845a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 08:30:40, skipping insertion in model container [2023-12-02 20:30:40,944 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 08:30:40" (3/3) ... [2023-12-02 20:30:40,945 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_76-tricky_address3_racefree.i [2023-12-02 20:30:40,955 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-12-02 20:30:40,966 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 20:30:40,967 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-02 20:30:40,967 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-02 20:30:41,014 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-12-02 20:30:41,062 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:30:41,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-12-02 20:30:41,063 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:30:41,068 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-12-02 20:30:41,073 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-12-02 20:30:41,105 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-12-02 20:30:41,115 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2023-12-02 20:30:41,121 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;@dec7552, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:30:41,122 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 20:30:41,294 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:30:41,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:30:41,300 INFO L85 PathProgramCache]: Analyzing trace with hash -805108240, now seen corresponding path program 1 times [2023-12-02 20:30:41,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:30:41,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28356375] [2023-12-02 20:30:41,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:30:41,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:30:41,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:30:41,560 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-02 20:30:41,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:30:41,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28356375] [2023-12-02 20:30:41,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28356375] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:30:41,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:30:41,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 20:30:41,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725810647] [2023-12-02 20:30:41,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:30:41,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 20:30:41,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:30:41,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 20:30:41,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 20:30:41,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:30:41,588 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:30:41,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:30:41,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:30:42,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:30:42,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 20:30:42,192 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:30:42,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:30:42,193 INFO L85 PathProgramCache]: Analyzing trace with hash 923684783, now seen corresponding path program 1 times [2023-12-02 20:30:42,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:30:42,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634002779] [2023-12-02 20:30:42,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:30:42,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:30:42,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:30:42,288 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 20:30:42,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:30:42,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634002779] [2023-12-02 20:30:42,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634002779] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:30:42,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852941049] [2023-12-02 20:30:42,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:30:42,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:30:42,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:30:42,319 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:30:42,321 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 20:30:42,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:30:42,419 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 20:30:42,424 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:30:42,450 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 20:30:42,450 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:30:42,469 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 20:30:42,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852941049] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:30:42,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:30:42,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-12-02 20:30:42,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183848536] [2023-12-02 20:30:42,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:30:42,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 20:30:42,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:30:42,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 20:30:42,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-12-02 20:30:42,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:30:42,473 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:30:42,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 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:30:42,473 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:30:42,474 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:30:42,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:30:42,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:30:42,607 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-02 20:30:42,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:30:42,798 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:30:42,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:30:42,798 INFO L85 PathProgramCache]: Analyzing trace with hash -67827575, now seen corresponding path program 2 times [2023-12-02 20:30:42,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:30:42,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698846883] [2023-12-02 20:30:42,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:30:42,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:30:42,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:30:42,938 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 20:30:42,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:30:42,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698846883] [2023-12-02 20:30:42,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698846883] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:30:42,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1613058161] [2023-12-02 20:30:42,939 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 20:30:42,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:30:42,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:30:42,941 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:30:42,945 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 20:30:43,043 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 20:30:43,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:30:43,045 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 20:30:43,046 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:30:43,063 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 20:30:43,063 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:30:43,123 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 20:30:43,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1613058161] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:30:43,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:30:43,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2023-12-02 20:30:43,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583529176] [2023-12-02 20:30:43,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:30:43,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-02 20:30:43,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:30:43,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-02 20:30:43,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2023-12-02 20:30:43,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:30:43,127 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:30:43,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:30:43,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:30:43,127 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:30:43,128 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:30:43,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:30:43,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:30:43,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:30:43,316 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 20:30:43,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:30:43,511 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:30:43,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:30:43,512 INFO L85 PathProgramCache]: Analyzing trace with hash 543266505, now seen corresponding path program 3 times [2023-12-02 20:30:43,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:30:43,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579421325] [2023-12-02 20:30:43,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:30:43,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:30:43,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:30:43,810 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 20:30:43,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:30:43,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579421325] [2023-12-02 20:30:43,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579421325] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:30:43,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624939140] [2023-12-02 20:30:43,811 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 20:30:43,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:30:43,812 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:30:43,813 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:30:43,817 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 20:30:43,919 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 20:30:43,919 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:30:43,921 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-02 20:30:43,924 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:30:43,953 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:30:44,050 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:30:44,050 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:30:44,076 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:30:44,152 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:30:44,189 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 31 treesize of output 25 [2023-12-02 20:30:44,204 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 20:30:44,204 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:30:54,242 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_140 (Array Int Int)) (|t_funThread1of1ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_140) |c_t_funThread1of1ForFork0_~p~0#1.base|) |t_funThread1of1ForFork0_~p~0#1.offset|) 0)) is different from false [2023-12-02 20:30:54,268 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_140 (Array Int Int)) (|t_funThread1of1ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_140) |c_~#a~0.base|) |t_funThread1of1ForFork0_~p~0#1.offset|) 0)) is different from false [2023-12-02 20:30:54,391 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2023-12-02 20:30:54,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624939140] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:30:54,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:30:54,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2023-12-02 20:30:54,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197137940] [2023-12-02 20:30:54,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:30:54,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-02 20:30:54,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:30:54,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-02 20:30:54,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=120, Unknown=6, NotChecked=46, Total=210 [2023-12-02 20:30:54,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:30:54,395 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:30:54,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.066666666666667) internal successors, (46), 14 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:30:54,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:30:54,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:30:54,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:30:54,396 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:30:56,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:30:56,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:30:56,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:30:56,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 20:30:56,859 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 20:30:57,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-12-02 20:30:57,054 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:30:57,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:30:57,055 INFO L85 PathProgramCache]: Analyzing trace with hash -516402208, now seen corresponding path program 1 times [2023-12-02 20:30:57,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:30:57,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499921159] [2023-12-02 20:30:57,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:30:57,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:30:57,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:30:57,133 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 20:30:57,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:30:57,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499921159] [2023-12-02 20:30:57,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499921159] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:30:57,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64687341] [2023-12-02 20:30:57,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:30:57,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:30:57,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:30:57,135 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:30:57,141 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 20:30:57,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:30:57,254 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 20:30:57,256 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:30:57,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-12-02 20:30:57,274 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-12-02 20:30:57,274 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-02 20:30:57,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [64687341] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:30:57,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-02 20:30:57,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-12-02 20:30:57,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583939459] [2023-12-02 20:30:57,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:30:57,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 20:30:57,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:30:57,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 20:30:57,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-02 20:30:57,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:30:57,277 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:30:57,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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:30:57,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:30:57,277 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:30:57,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:30:57,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-12-02 20:30:57,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:30:57,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:30:57,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:30:57,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:30:57,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 20:30:57,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:30:57,457 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 20:30:57,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:30:57,650 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:30:57,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:30:57,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1301409357, now seen corresponding path program 1 times [2023-12-02 20:30:57,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:30:57,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788912171] [2023-12-02 20:30:57,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:30:57,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:30:57,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:30:57,732 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 20:30:57,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:30:57,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788912171] [2023-12-02 20:30:57,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788912171] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:30:57,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484358639] [2023-12-02 20:30:57,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:30:57,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:30:57,734 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:30:57,735 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:30:57,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 20:30:57,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:30:57,861 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 20:30:57,863 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:30:57,884 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 20:30:57,885 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:30:57,909 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 20:30:57,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484358639] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:30:57,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:30:57,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-12-02 20:30:57,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839609682] [2023-12-02 20:30:57,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:30:57,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 20:30:57,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:30:57,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 20:30:57,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-12-02 20:30:57,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:30:57,912 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:30:57,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:30:57,913 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:30:57,913 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:30:57,913 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:30:57,913 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-12-02 20:30:57,913 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:30:57,913 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:30:58,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:30:58,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:30:58,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:30:58,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 20:30:58,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:30:58,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 20:30:58,025 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-02 20:30:58,031 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-02 20:30:58,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:30:58,230 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2023-12-02 20:30:58,231 INFO L307 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was SAFE (1/2) [2023-12-02 20:30:58,234 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:30:58,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-12-02 20:30:58,234 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:30:58,235 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-12-02 20:30:58,236 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Waiting until timeout for monitored process [2023-12-02 20:30:58,238 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-12-02 20:30:58,239 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-12-02 20:30:58,239 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;@dec7552, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:30:58,239 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-02 20:30:58,303 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 20:30:58,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:30:58,304 INFO L85 PathProgramCache]: Analyzing trace with hash 869346202, now seen corresponding path program 1 times [2023-12-02 20:30:58,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:30:58,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433826498] [2023-12-02 20:30:58,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:30:58,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:30:58,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:30:58,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 20:30:58,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:30:58,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433826498] [2023-12-02 20:30:58,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433826498] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:30:58,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:30:58,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 20:30:58,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958939719] [2023-12-02 20:30:58,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:30:58,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 20:30:58,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:30:58,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 20:30:58,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 20:30:58,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:30:58,327 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:30:58,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:30:58,328 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:30:58,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:30:58,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-02 20:30:58,358 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 20:30:58,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:30:58,358 INFO L85 PathProgramCache]: Analyzing trace with hash -2039781693, now seen corresponding path program 1 times [2023-12-02 20:30:58,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:30:58,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289429703] [2023-12-02 20:30:58,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:30:58,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:30:58,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:30:58,387 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 20:30:58,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:30:58,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289429703] [2023-12-02 20:30:58,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289429703] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:30:58,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996460542] [2023-12-02 20:30:58,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:30:58,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:30:58,388 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:30:58,391 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:30:58,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-02 20:30:58,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:30:58,481 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 20:30:58,482 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:30:58,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 20:30:58,487 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:30:58,505 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 20:30:58,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996460542] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:30:58,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:30:58,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-12-02 20:30:58,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251263945] [2023-12-02 20:30:58,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:30:58,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 20:30:58,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:30:58,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 20:30:58,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-12-02 20:30:58,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:30:58,507 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:30:58,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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:30:58,507 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:30:58,508 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:30:58,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:30:58,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:30:58,541 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-02 20:30:58,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:30:58,737 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 20:30:58,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:30:58,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1057710947, now seen corresponding path program 2 times [2023-12-02 20:30:58,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:30:58,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515585636] [2023-12-02 20:30:58,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:30:58,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:30:58,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:30:58,803 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 20:30:58,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:30:58,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515585636] [2023-12-02 20:30:58,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515585636] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:30:58,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478430836] [2023-12-02 20:30:58,803 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 20:30:58,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:30:58,803 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:30:58,804 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:30:58,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-02 20:30:58,905 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 20:30:58,905 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:30:58,907 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 20:30:58,908 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:30:58,921 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 20:30:58,922 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:30:58,972 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-02 20:30:58,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478430836] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:30:58,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:30:58,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2023-12-02 20:30:58,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836065396] [2023-12-02 20:30:58,973 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:30:58,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-02 20:30:58,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:30:58,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-02 20:30:58,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2023-12-02 20:30:58,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:30:58,975 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:30:58,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:30:58,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:30:58,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:30:58,975 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:30:59,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:30:59,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:30:59,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:30:59,018 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-12-02 20:30:59,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:30:59,217 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 20:30:59,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:30:59,217 INFO L85 PathProgramCache]: Analyzing trace with hash -865973539, now seen corresponding path program 3 times [2023-12-02 20:30:59,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:30:59,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046853696] [2023-12-02 20:30:59,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:30:59,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:30:59,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 20:30:59,242 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 20:30:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 20:30:59,280 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-02 20:30:59,280 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-02 20:30:59,280 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-12-02 20:30:59,280 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-02 20:30:59,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-02 20:30:59,282 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-12-02 20:30:59,282 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (2/2) [2023-12-02 20:30:59,283 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-02 20:30:59,283 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-12-02 20:30:59,309 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-12-02 20:30:59,312 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:30:59,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-12-02 20:30:59,313 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:30:59,314 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-12-02 20:30:59,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (11)] Waiting until timeout for monitored process [2023-12-02 20:30:59,319 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-12-02 20:30:59,319 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of2ForFork0 ======== [2023-12-02 20:30:59,319 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;@dec7552, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:30:59,320 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 20:30:59,692 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:30:59,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:30:59,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1903214948, now seen corresponding path program 1 times [2023-12-02 20:30:59,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:30:59,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136433607] [2023-12-02 20:30:59,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:30:59,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:30:59,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:30:59,730 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-12-02 20:30:59,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:30:59,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136433607] [2023-12-02 20:30:59,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136433607] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:30:59,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:30:59,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 20:30:59,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484196507] [2023-12-02 20:30:59,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:30:59,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 20:30:59,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:30:59,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 20:30:59,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 20:30:59,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:30:59,733 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:30:59,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:30:59,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:31:04,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:31:04,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-02 20:31:04,290 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:31:04,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:31:04,291 INFO L85 PathProgramCache]: Analyzing trace with hash -873688129, now seen corresponding path program 1 times [2023-12-02 20:31:04,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:31:04,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175094281] [2023-12-02 20:31:04,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:31:04,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:31:04,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:31:04,336 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 20:31:04,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:31:04,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175094281] [2023-12-02 20:31:04,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175094281] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:31:04,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975231074] [2023-12-02 20:31:04,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:31:04,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:31:04,337 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:31:04,340 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:31:04,345 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-02 20:31:04,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:31:04,492 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 20:31:04,493 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:31:04,499 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 20:31:04,499 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:31:04,514 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 20:31:04,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975231074] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:31:04,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:31:04,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-12-02 20:31:04,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535721270] [2023-12-02 20:31:04,515 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:31:04,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 20:31:04,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:31:04,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 20:31:04,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-12-02 20:31:04,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:31:04,516 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:31:04,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 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:31:04,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:31:04,517 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:31:05,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:31:05,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:31:05,857 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-12-02 20:31:06,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-02 20:31:06,053 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:31:06,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:31:06,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1662008047, now seen corresponding path program 2 times [2023-12-02 20:31:06,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:31:06,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819080957] [2023-12-02 20:31:06,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:31:06,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:31:06,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:31:06,137 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 20:31:06,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:31:06,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819080957] [2023-12-02 20:31:06,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819080957] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:31:06,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130789423] [2023-12-02 20:31:06,138 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 20:31:06,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:31:06,138 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:31:06,139 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:31:06,141 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-02 20:31:06,260 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 20:31:06,260 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:31:06,262 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 20:31:06,263 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:31:06,279 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 20:31:06,279 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:31:06,331 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 20:31:06,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130789423] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:31:06,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:31:06,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2023-12-02 20:31:06,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854180156] [2023-12-02 20:31:06,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:31:06,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-02 20:31:06,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:31:06,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-02 20:31:06,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2023-12-02 20:31:06,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:31:06,333 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:31:06,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 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:31:06,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:31:06,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:31:06,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:31:07,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:31:07,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:31:07,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:31:07,636 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-12-02 20:31:07,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-02 20:31:07,832 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:31:07,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:31:07,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1699849809, now seen corresponding path program 3 times [2023-12-02 20:31:07,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:31:07,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708433288] [2023-12-02 20:31:07,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:31:07,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:31:07,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:31:08,232 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 20:31:08,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:31:08,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708433288] [2023-12-02 20:31:08,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708433288] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:31:08,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574265883] [2023-12-02 20:31:08,233 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 20:31:08,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:31:08,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:31:08,234 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:31:08,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-12-02 20:31:08,360 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 20:31:08,360 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:31:08,362 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-02 20:31:08,365 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:31:08,373 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:31:08,468 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:31:08,468 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:31:08,495 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:31:08,575 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:31:08,613 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 31 treesize of output 25 [2023-12-02 20:31:08,627 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 20:31:08,627 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:31:14,671 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_539 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_539) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|))) is different from false [2023-12-02 20:31:14,691 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_539 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_539) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-12-02 20:31:14,795 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 3 not checked. [2023-12-02 20:31:14,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574265883] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:31:14,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:31:14,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2023-12-02 20:31:14,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97772472] [2023-12-02 20:31:14,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:31:14,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-02 20:31:14,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:31:14,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-02 20:31:14,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=169, Unknown=5, NotChecked=54, Total=272 [2023-12-02 20:31:14,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:31:14,798 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:31:14,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 16 states have internal predecessors, (60), 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:31:14,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:31:14,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:31:14,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:31:14,798 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:31:16,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:31:16,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:31:16,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:31:16,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 20:31:16,876 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-12-02 20:31:17,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:31:17,072 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:31:17,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:31:17,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1707502223, now seen corresponding path program 1 times [2023-12-02 20:31:17,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:31:17,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109013468] [2023-12-02 20:31:17,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:31:17,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:31:17,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:31:17,177 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2023-12-02 20:31:17,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:31:17,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109013468] [2023-12-02 20:31:17,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109013468] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:31:17,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:31:17,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 20:31:17,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292067895] [2023-12-02 20:31:17,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:31:17,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 20:31:17,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:31:17,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 20:31:17,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 20:31:17,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:31:17,179 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:31:17,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:31:17,179 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:31:17,179 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:31:17,179 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:31:17,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-12-02 20:31:17,180 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:31:18,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:31:18,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:31:18,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:31:18,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 20:31:18,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:31:18,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-02 20:31:18,349 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:31:18,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:31:18,349 INFO L85 PathProgramCache]: Analyzing trace with hash -405240481, now seen corresponding path program 1 times [2023-12-02 20:31:18,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:31:18,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290284858] [2023-12-02 20:31:18,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:31:18,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:31:18,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:31:22,440 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:31:22,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:31:22,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290284858] [2023-12-02 20:31:22,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290284858] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:31:22,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162064137] [2023-12-02 20:31:22,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:31:22,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:31:22,441 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:31:22,442 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:31:22,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-12-02 20:31:22,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:31:22,548 INFO L262 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-02 20:31:22,550 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:31:22,556 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:31:22,644 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:31:22,644 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:31:22,674 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:31:22,726 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 13 treesize of output 9 [2023-12-02 20:31:22,819 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:31:22,898 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:31:22,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-12-02 20:31:22,984 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:31:23,054 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:31:23,126 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 38 treesize of output 30 [2023-12-02 20:31:23,161 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 20:31:23,161 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:31:24,108 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_665 (Array Int Int)) (v_ArrVal_667 Int)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_665))) (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_667))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-12-02 20:31:24,299 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 18 treesize of output 12 [2023-12-02 20:31:24,317 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_665 (Array Int Int)) (v_ArrVal_667 Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (or (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_665))) (store .cse0 |c_~#a~0.base| (store (select .cse0 |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_667))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= |t_funThread1of2ForFork0_~p~0#1.offset| |t_funThread2of2ForFork0_~p~0#1.offset|))) (or (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_665 (Array Int Int)) (v_ArrVal_667 Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_665))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_667))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) (= |c_~#a~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|))) is different from false [2023-12-02 20:31:24,326 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_665 (Array Int Int)) (v_ArrVal_667 Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_665) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_667) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= |t_funThread1of2ForFork0_~p~0#1.offset| |t_funThread2of2ForFork0_~p~0#1.offset|))) is different from false [2023-12-02 20:31:24,525 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 6 not checked. [2023-12-02 20:31:24,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162064137] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:31:24,526 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:31:24,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10, 10] total 36 [2023-12-02 20:31:24,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180497593] [2023-12-02 20:31:24,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:31:24,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-12-02 20:31:24,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:31:24,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-12-02 20:31:24,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=989, Unknown=3, NotChecked=198, Total=1332 [2023-12-02 20:31:24,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:31:24,528 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:31:24,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.4324324324324325) internal successors, (90), 36 states have internal predecessors, (90), 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:31:24,529 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:31:24,529 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:31:24,529 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:31:24,529 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-12-02 20:31:24,529 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:31:24,529 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:31:28,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:31:28,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:31:28,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:31:28,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 20:31:28,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:31:28,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-02 20:31:28,306 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-12-02 20:31:28,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:31:28,501 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:31:28,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:31:28,502 INFO L85 PathProgramCache]: Analyzing trace with hash -653414819, now seen corresponding path program 1 times [2023-12-02 20:31:28,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:31:28,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913936512] [2023-12-02 20:31:28,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:31:28,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:31:28,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:31:28,598 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 20:31:28,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:31:28,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913936512] [2023-12-02 20:31:28,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913936512] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:31:28,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090361423] [2023-12-02 20:31:28,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:31:28,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:31:28,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:31:28,601 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:31:28,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-12-02 20:31:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:31:28,766 INFO L262 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 20:31:28,769 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:31:28,797 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 20:31:28,797 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:31:28,844 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 20:31:28,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090361423] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:31:28,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:31:28,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2023-12-02 20:31:28,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966191231] [2023-12-02 20:31:28,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:31:28,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 20:31:28,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:31:28,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 20:31:28,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2023-12-02 20:31:28,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:31:28,847 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:31:28,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 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:31:28,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:31:28,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:31:28,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:31:28,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-12-02 20:31:28,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:31:28,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2023-12-02 20:31:28,848 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:31:29,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:31:29,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:31:29,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:31:29,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 20:31:29,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:31:29,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-02 20:31:29,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:31:29,584 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-12-02 20:31:29,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-12-02 20:31:29,780 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:31:29,781 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:31:29,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1556846471, now seen corresponding path program 1 times [2023-12-02 20:31:29,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:31:29,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456868584] [2023-12-02 20:31:29,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:31:29,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:31:29,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:31:30,379 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 20:31:30,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:31:30,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456868584] [2023-12-02 20:31:30,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456868584] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:31:30,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510246996] [2023-12-02 20:31:30,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:31:30,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:31:30,380 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:31:30,381 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:31:30,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-12-02 20:31:30,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:31:30,548 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-02 20:31:30,551 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:31:30,561 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:31:30,631 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:31:30,631 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:31:30,659 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:31:30,713 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:31:30,798 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:31:30,839 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:31:30,917 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:31:30,979 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 37 treesize of output 31 [2023-12-02 20:31:30,997 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 20:31:30,998 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:31:43,043 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|))) (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ (- 1) (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.offset|))))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-12-02 20:31:51,111 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_875 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_875) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-12-02 20:31:53,137 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_875 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_875) |c_~#a~0.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2023-12-02 20:31:53,223 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 5 not checked. [2023-12-02 20:31:53,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510246996] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:31:53,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:31:53,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 7] total 22 [2023-12-02 20:31:53,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035910430] [2023-12-02 20:31:53,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:31:53,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-02 20:31:53,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:31:53,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-02 20:31:53,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=307, Unknown=8, NotChecked=114, Total=506 [2023-12-02 20:31:53,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:31:53,226 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:31:53,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.956521739130435) internal successors, (114), 22 states have internal predecessors, (114), 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:31:53,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:31:53,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:31:53,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:31:53,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-12-02 20:31:53,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:31:53,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2023-12-02 20:31:53,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:31:53,227 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:31:54,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:31:54,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:31:54,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:31:54,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 20:31:54,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:31:54,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-02 20:31:54,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:31:54,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:31:54,007 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-12-02 20:31:54,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-12-02 20:31:54,203 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:31:54,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:31:54,203 INFO L85 PathProgramCache]: Analyzing trace with hash -623728348, now seen corresponding path program 1 times [2023-12-02 20:31:54,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:31:54,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037634649] [2023-12-02 20:31:54,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:31:54,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:31:54,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:32:26,008 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:32:26,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:32:26,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037634649] [2023-12-02 20:32:26,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037634649] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:32:26,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500860365] [2023-12-02 20:32:26,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:32:26,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:32:26,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:32:26,010 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:32:26,017 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-12-02 20:32:26,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:32:26,138 INFO L262 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 32 conjunts are in the unsatisfiable core [2023-12-02 20:32:26,140 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:32:26,145 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:32:26,249 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:32:26,250 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:32:26,290 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:32:26,358 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:32:26,421 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 13 treesize of output 9 [2023-12-02 20:32:26,523 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:32:26,597 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:32:26,598 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 18 treesize of output 13 [2023-12-02 20:32:26,615 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:32:26,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:32:26,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 18 treesize of output 13 [2023-12-02 20:32:26,749 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:32:26,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-12-02 20:32:26,860 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 38 treesize of output 30 [2023-12-02 20:32:26,895 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 20:32:26,896 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:32:27,045 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_969 Int) (v_ArrVal_970 (Array Int Int)) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_970) |c_t_funThread1of2ForFork0_~p~0#1.base|) (+ |t_funThread1of2ForFork0_~p~0#1.offset| 4)) 0)) (= (select (select (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|) |c_t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_969)) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0))) is different from false [2023-12-02 20:32:29,564 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:32:29,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-12-02 20:32:29,575 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:32:29,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2023-12-02 20:32:29,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-12-02 20:32:29,618 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_966 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_969 Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_966))) (store .cse2 |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select .cse2 |c_t_funThread2of2ForFork0_~p~0#1.base|) |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_969))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)))) (and (or .cse0 (not (= |c_~#__global_lock~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (or (= |c_t_funThread2of2ForFork0_~p~0#1.base| |c_t_funThread1of2ForFork0_~p~0#1.base|) .cse0) (forall ((v_ArrVal_966 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_969 Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (or (= (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_966))) (store .cse1 |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select .cse1 |c_t_funThread2of2ForFork0_~p~0#1.base|) |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_969))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= |t_funThread1of2ForFork0_~p~0#1.offset| |t_funThread2of2ForFork0_~p~0#1.offset|))))) is different from false [2023-12-02 20:32:29,645 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_966 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_969 Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (select (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_966))) (store .cse2 |c_~#a~0.base| (store (select .cse2 |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_969))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)))) (and (or .cse0 (= |c_~#a~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|)) (or .cse0 (not (= |c_~#__global_lock~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (forall ((v_ArrVal_966 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_969 Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (or (= (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_966))) (store .cse1 |c_~#a~0.base| (store (select .cse1 |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_969))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= |t_funThread1of2ForFork0_~p~0#1.offset| |t_funThread2of2ForFork0_~p~0#1.offset|))))) is different from false [2023-12-02 20:32:31,717 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_966 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_969 Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (or (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_966) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_969) |t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= |t_funThread1of2ForFork0_~p~0#1.offset| |t_funThread2of2ForFork0_~p~0#1.offset|))) (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((v_ArrVal_966 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_969 Int) (|t_funThread1of2ForFork0_~p~0#1.offset| Int)) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_966) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_969) |t_funThread1of2ForFork0_~p~0#1.offset|) 0)))) is different from false [2023-12-02 20:32:32,014 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 7 not checked. [2023-12-02 20:32:32,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500860365] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:32:32,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:32:32,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 11, 11] total 39 [2023-12-02 20:32:32,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925339202] [2023-12-02 20:32:32,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:32:32,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2023-12-02 20:32:32,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:32:32,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2023-12-02 20:32:32,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1097, Unknown=24, NotChecked=284, Total=1560 [2023-12-02 20:32:32,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:32:32,017 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:32:32,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.3) internal successors, (92), 39 states have internal predecessors, (92), 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:32:32,017 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:32:32,017 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:32:32,017 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:32:32,017 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-12-02 20:32:32,017 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:32:32,017 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2023-12-02 20:32:32,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:32:32,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:32:32,018 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:32:36,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:32:36,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:32:36,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:32:36,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 20:32:36,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:32:36,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-02 20:32:36,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 20:32:36,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:32:36,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-12-02 20:32:36,470 INFO L805 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-02 20:32:36,475 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-12-02 20:32:36,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:32:36,672 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2023-12-02 20:32:36,672 INFO L307 ceAbstractionStarter]: Result for error location t_funThread1of2ForFork0 was SAFE (1/3) [2023-12-02 20:32:36,675 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:32:36,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-12-02 20:32:36,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:32:36,676 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-12-02 20:32:36,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (19)] Waiting until timeout for monitored process [2023-12-02 20:32:36,680 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-12-02 20:32:36,680 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-12-02 20:32:36,680 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;@dec7552, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:32:36,680 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-02 20:32:36,757 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 20:32:36,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:32:36,758 INFO L85 PathProgramCache]: Analyzing trace with hash 422964032, now seen corresponding path program 1 times [2023-12-02 20:32:36,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:32:36,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483156964] [2023-12-02 20:32:36,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:32:36,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:32:36,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:32:36,779 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 20:32:36,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:32:36,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483156964] [2023-12-02 20:32:36,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483156964] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:32:36,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:32:36,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 20:32:36,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647555731] [2023-12-02 20:32:36,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:32:36,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 20:32:36,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:32:36,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 20:32:36,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 20:32:36,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:32:36,780 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:32:36,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 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:32:36,781 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:32:36,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:32:36,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-02 20:32:36,839 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 20:32:36,839 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:32:36,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1444601278, now seen corresponding path program 1 times [2023-12-02 20:32:36,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:32:36,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792652776] [2023-12-02 20:32:36,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:32:36,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:32:36,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:32:36,866 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 20:32:36,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:32:36,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792652776] [2023-12-02 20:32:36,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792652776] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:32:36,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553721284] [2023-12-02 20:32:36,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:32:36,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:32:36,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:32:36,868 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:32:36,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-12-02 20:32:37,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:32:37,006 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 20:32:37,007 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:32:37,016 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 20:32:37,016 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:32:37,031 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 20:32:37,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553721284] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:32:37,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:32:37,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-12-02 20:32:37,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317084422] [2023-12-02 20:32:37,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:32:37,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 20:32:37,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:32:37,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 20:32:37,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-12-02 20:32:37,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:32:37,033 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:32:37,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:32:37,033 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:32:37,034 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:32:37,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:32:37,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:32:37,099 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-12-02 20:32:37,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:32:37,294 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 20:32:37,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:32:37,295 INFO L85 PathProgramCache]: Analyzing trace with hash -112714960, now seen corresponding path program 2 times [2023-12-02 20:32:37,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:32:37,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198647464] [2023-12-02 20:32:37,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:32:37,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:32:37,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:32:37,360 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 20:32:37,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:32:37,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198647464] [2023-12-02 20:32:37,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198647464] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:32:37,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778461422] [2023-12-02 20:32:37,360 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 20:32:37,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:32:37,361 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:32:37,362 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:32:37,364 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-12-02 20:32:37,483 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 20:32:37,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:32:37,484 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 20:32:37,485 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:32:37,492 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 20:32:37,492 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:32:37,529 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 20:32:37,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778461422] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:32:37,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:32:37,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2023-12-02 20:32:37,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018137986] [2023-12-02 20:32:37,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:32:37,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-02 20:32:37,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:32:37,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-02 20:32:37,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2023-12-02 20:32:37,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:32:37,531 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:32:37,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 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:32:37,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:32:37,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:32:37,531 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:32:37,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:32:37,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:32:37,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:32:37,590 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-12-02 20:32:37,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-12-02 20:32:37,786 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 20:32:37,786 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:32:37,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1025663472, now seen corresponding path program 3 times [2023-12-02 20:32:37,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:32:37,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713717558] [2023-12-02 20:32:37,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:32:37,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:32:37,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 20:32:37,801 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 20:32:37,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 20:32:37,821 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-02 20:32:37,821 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-02 20:32:37,821 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-12-02 20:32:37,821 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-02 20:32:37,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-02 20:32:37,823 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-12-02 20:32:37,823 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (2/3) [2023-12-02 20:32:37,824 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-02 20:32:37,824 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-12-02 20:32:37,853 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-12-02 20:32:37,856 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:32:37,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-12-02 20:32:37,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:32:37,858 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-12-02 20:32:37,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (22)] Waiting until timeout for monitored process [2023-12-02 20:32:37,862 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-12-02 20:32:37,863 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-12-02 20:32:37,863 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;@dec7552, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:32:37,863 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-12-02 20:32:37,997 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 20:32:37,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:32:37,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1681109398, now seen corresponding path program 1 times [2023-12-02 20:32:37,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:32:37,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804502208] [2023-12-02 20:32:37,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:32:37,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:32:38,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:32:38,024 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 20:32:38,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:32:38,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804502208] [2023-12-02 20:32:38,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804502208] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:32:38,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:32:38,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 20:32:38,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446324788] [2023-12-02 20:32:38,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:32:38,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 20:32:38,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:32:38,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 20:32:38,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 20:32:38,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:32:38,026 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:32:38,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:32:38,026 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:32:38,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:32:38,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-02 20:32:38,198 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 20:32:38,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:32:38,199 INFO L85 PathProgramCache]: Analyzing trace with hash 925437493, now seen corresponding path program 1 times [2023-12-02 20:32:38,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:32:38,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839917341] [2023-12-02 20:32:38,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:32:38,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:32:38,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:32:38,234 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 20:32:38,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:32:38,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839917341] [2023-12-02 20:32:38,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839917341] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:32:38,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792804370] [2023-12-02 20:32:38,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:32:38,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:32:38,235 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:32:38,236 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:32:38,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-12-02 20:32:38,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:32:38,412 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 20:32:38,413 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:32:38,418 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 20:32:38,418 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:32:38,431 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 20:32:38,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792804370] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:32:38,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:32:38,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-12-02 20:32:38,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437895631] [2023-12-02 20:32:38,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:32:38,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 20:32:38,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:32:38,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 20:32:38,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-12-02 20:32:38,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:32:38,433 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:32:38,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:32:38,433 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:32:38,433 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:32:38,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:32:38,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:32:38,493 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-12-02 20:32:38,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-12-02 20:32:38,689 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 20:32:38,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:32:38,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1656756086, now seen corresponding path program 2 times [2023-12-02 20:32:38,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:32:38,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408704976] [2023-12-02 20:32:38,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:32:38,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:32:38,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:32:38,755 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 20:32:38,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:32:38,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408704976] [2023-12-02 20:32:38,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408704976] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:32:38,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849017251] [2023-12-02 20:32:38,756 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 20:32:38,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:32:38,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:32:38,757 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:32:38,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-12-02 20:32:38,894 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 20:32:38,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:32:38,896 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 20:32:38,897 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:32:38,910 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 20:32:38,910 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:32:38,956 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-02 20:32:38,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849017251] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:32:38,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:32:38,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-12-02 20:32:38,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257627694] [2023-12-02 20:32:38,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:32:38,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-02 20:32:38,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:32:38,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-02 20:32:38,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-12-02 20:32:38,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:32:38,958 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:32:38,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 12 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:32:38,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:32:38,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:32:38,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:32:39,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:32:39,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:32:39,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:32:39,031 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2023-12-02 20:32:39,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-12-02 20:32:39,226 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-02 20:32:39,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:32:39,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1692356374, now seen corresponding path program 3 times [2023-12-02 20:32:39,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:32:39,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433977445] [2023-12-02 20:32:39,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:32:39,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:32:39,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 20:32:39,257 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 20:32:39,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 20:32:39,288 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-02 20:32:39,288 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-02 20:32:39,288 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-12-02 20:32:39,289 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-12-02 20:32:39,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-02 20:32:39,290 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1] [2023-12-02 20:32:39,290 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (1/4) [2023-12-02 20:32:39,291 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-02 20:32:39,291 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-12-02 20:32:39,323 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-12-02 20:32:39,326 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:32:39,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-12-02 20:32:39,327 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:32:39,328 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-12-02 20:32:39,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (25)] Waiting until timeout for monitored process [2023-12-02 20:32:39,335 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-12-02 20:32:39,335 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread4of4ForFork0 ======== [2023-12-02 20:32:39,336 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;@dec7552, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 20:32:39,336 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 20:32:39,574 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:32:39,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:32:39,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1500406526, now seen corresponding path program 1 times [2023-12-02 20:32:39,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:32:39,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217414162] [2023-12-02 20:32:39,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:32:39,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:32:39,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:32:39,612 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-02 20:32:39,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:32:39,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217414162] [2023-12-02 20:32:39,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217414162] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:32:39,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:32:39,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 20:32:39,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505771346] [2023-12-02 20:32:39,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:32:39,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 20:32:39,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:32:39,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 20:32:39,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 20:32:39,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:32:39,614 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:32:39,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:32:39,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:33:07,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:33:07,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-12-02 20:33:07,072 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:33:07,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:33:07,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1290676937, now seen corresponding path program 1 times [2023-12-02 20:33:07,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:33:07,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882840834] [2023-12-02 20:33:07,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:33:07,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:33:07,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:33:07,114 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-02 20:33:07,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:33:07,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882840834] [2023-12-02 20:33:07,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882840834] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:33:07,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2591901] [2023-12-02 20:33:07,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:33:07,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:33:07,115 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:33:07,116 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:33:07,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-12-02 20:33:07,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:33:07,278 INFO L262 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 20:33:07,280 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:33:07,285 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-02 20:33:07,285 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:33:07,299 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-02 20:33:07,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2591901] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:33:07,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:33:07,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-12-02 20:33:07,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201024079] [2023-12-02 20:33:07,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:33:07,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-02 20:33:07,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:33:07,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-02 20:33:07,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-12-02 20:33:07,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:33:07,301 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:33:07,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 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:33:07,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:33:07,301 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:33:19,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:33:19,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:33:19,953 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2023-12-02 20:33:20,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-12-02 20:33:20,149 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:33:20,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:33:20,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1535962550, now seen corresponding path program 2 times [2023-12-02 20:33:20,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:33:20,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871993569] [2023-12-02 20:33:20,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:33:20,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:33:20,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:33:20,229 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-02 20:33:20,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:33:20,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871993569] [2023-12-02 20:33:20,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871993569] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:33:20,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837546483] [2023-12-02 20:33:20,230 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 20:33:20,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:33:20,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:33:20,231 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:33:20,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-12-02 20:33:20,446 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 20:33:20,446 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:33:20,448 INFO L262 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 20:33:20,450 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:33:20,461 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-02 20:33:20,461 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:33:20,509 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-12-02 20:33:20,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837546483] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:33:20,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:33:20,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2023-12-02 20:33:20,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803292648] [2023-12-02 20:33:20,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:33:20,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-02 20:33:20,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:33:20,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-02 20:33:20,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2023-12-02 20:33:20,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:33:20,511 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:33:20,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 11 states have internal predecessors, (79), 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:33:20,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:33:20,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:33:20,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:33:33,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:33:33,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:33:33,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:33:33,761 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2023-12-02 20:33:33,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:33:33,957 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:33:33,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:33:33,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1672147434, now seen corresponding path program 3 times [2023-12-02 20:33:33,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:33:33,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122481009] [2023-12-02 20:33:33,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:33:33,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:33:34,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:33:39,413 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 7 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:33:39,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:33:39,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122481009] [2023-12-02 20:33:39,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122481009] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:33:39,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670677340] [2023-12-02 20:33:39,413 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 20:33:39,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:33:39,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:33:39,414 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:33:39,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-12-02 20:33:41,094 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-12-02 20:33:41,094 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:33:41,098 INFO L262 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 54 conjunts are in the unsatisfiable core [2023-12-02 20:33:41,102 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:33:41,108 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:33:41,221 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:33:41,221 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:33:41,275 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:33:41,395 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:33:41,478 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 13 treesize of output 9 [2023-12-02 20:33:41,616 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:33:41,761 INFO L349 Elim1Store]: treesize reduction 22, result has 38.9 percent of original size [2023-12-02 20:33:41,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 29 [2023-12-02 20:33:41,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:33:41,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-12-02 20:33:41,949 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:33:42,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:33:42,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-12-02 20:33:42,300 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 23 treesize of output 18 [2023-12-02 20:33:42,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:33:42,458 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-12-02 20:33:42,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 18 [2023-12-02 20:33:42,609 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:33:42,855 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 28 treesize of output 23 [2023-12-02 20:33:43,093 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 28 treesize of output 21 [2023-12-02 20:33:43,226 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 37 treesize of output 28 [2023-12-02 20:33:43,443 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:33:43,639 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 51 treesize of output 41 [2023-12-02 20:33:43,712 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 20:33:43,712 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:33:45,343 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1715 Int) (v_ArrVal_1712 (Array Int Int)) (v_ArrVal_1720 Int) (v_ArrVal_1717 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= (select (select (let ((.cse0 (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1713))) (let ((.cse4 (let ((.cse5 (select .cse3 |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse5 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse5 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse4))) (store (store .cse1 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse2 (select (store (store .cse1 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store .cse3 |c_t_funThread1of4ForFork0_~p~0#1.base| .cse4) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1715)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset|)))))))))) (store .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1720))) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1712) |c_~#a~0.base|) (+ |t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)))) is different from false [2023-12-02 20:33:45,363 WARN L854 $PredicateComparison]: unable to prove that (forall ((|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1715 Int) (v_ArrVal_1712 (Array Int Int)) (v_ArrVal_1720 Int) (v_ArrVal_1717 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1712) |c_~#a~0.base|) (+ |t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)) (= (select (select (let ((.cse0 (let ((.cse3 (let ((.cse4 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse5 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse5 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse5 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1713) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse4 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse4 |t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse3))) (store (store .cse1 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse2 (select (store (store .cse1 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1713) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse3) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1715)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset|))))))))) (store .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1720))) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0))) is different from false [2023-12-02 20:33:46,322 INFO L349 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2023-12-02 20:33:46,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 45 [2023-12-02 20:33:46,366 INFO L349 Elim1Store]: treesize reduction 11, result has 64.5 percent of original size [2023-12-02 20:33:46,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 50 [2023-12-02 20:33:46,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-12-02 20:33:48,550 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (.cse26 (= |c_~#a~0.base| |c_t_funThread2of4ForFork0_~p~0#1.base|))) (and (or (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1715 Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1720 Int) (v_ArrVal_1706 (Array Int Int)) (v_ArrVal_1717 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= (select (store (select (let ((.cse2 (let ((.cse3 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1706) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse4 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse4 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1713) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse3 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse3 |t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse2))) (store (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse1 (select (store (store .cse0 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1713) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse2) |c_t_funThread2of4ForFork0_~p~0#1.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1715)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse1 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse1 |t_funThread2of4ForFork0_~p~0#1.offset|))))))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1720) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|))) .cse5) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int)) (or (forall ((|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1715 Int) (v_ArrVal_1720 Int) (v_ArrVal_1706 (Array Int Int)) (v_ArrVal_1717 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= (select (store (select (let ((.cse8 (let ((.cse9 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1706) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse10 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse10 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1713) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse9 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse9 |t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse6 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse8))) (store (store .cse6 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse7 (select (store (store .cse6 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1713) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse8) |c_t_funThread2of4ForFork0_~p~0#1.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1715)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse7 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse7 |t_funThread2of4ForFork0_~p~0#1.offset|))))))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1720) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= |t_funThread3of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|))) (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|))) (or (and (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1715 Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1720 Int) (v_ArrVal_1706 (Array Int Int)) (v_ArrVal_1717 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= (select (store (select (let ((.cse13 (let ((.cse14 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1706) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse15 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse15 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1713) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse14 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse14 |t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse11 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse13))) (store (store .cse11 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse12 (select (store (store .cse11 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1713) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse13) |c_t_funThread2of4ForFork0_~p~0#1.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1715)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse12 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse12 |t_funThread2of4ForFork0_~p~0#1.offset|))))))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1720) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= |t_funThread3of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|))) (or .cse5 (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1715 Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1720 Int) (v_ArrVal_1706 (Array Int Int)) (v_ArrVal_1717 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (= (select (store (select (let ((.cse18 (let ((.cse19 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1706) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse20 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse20 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1713) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse19 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse19 |t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse16 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse18))) (store (store .cse16 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse17 (select (store (store .cse16 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1713) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse18) |c_t_funThread2of4ForFork0_~p~0#1.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1715)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse17 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse17 |t_funThread2of4ForFork0_~p~0#1.offset|))))))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1720) |t_funThread4of4ForFork0_~p~0#1.offset|) 0))) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1715 Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1720 Int) (v_ArrVal_1706 (Array Int Int)) (v_ArrVal_1717 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= (select (store (select (let ((.cse23 (let ((.cse24 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse25 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1706) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse25 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse25 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1713) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse24 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse24 |t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse21 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse23))) (store (store .cse21 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse22 (select (store (store .cse21 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1713) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse23) |c_t_funThread2of4ForFork0_~p~0#1.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1715)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse22 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse22 |t_funThread2of4ForFork0_~p~0#1.offset|))))))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1720) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= |t_funThread3of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|)))) .cse26) (or (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1715 Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1720 Int) (v_ArrVal_1706 (Array Int Int)) (v_ArrVal_1717 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= (select (store (select (let ((.cse29 (let ((.cse30 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse31 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1706) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse31 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse31 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1713) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse30 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse30 |t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse27 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse29))) (store (store .cse27 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse28 (select (store (store .cse27 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1713) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse29) |c_t_funThread2of4ForFork0_~p~0#1.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1715)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse28 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse28 |t_funThread2of4ForFork0_~p~0#1.offset|))))))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1720) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= |t_funThread3of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|))) .cse26))) is different from false [2023-12-02 20:33:50,626 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int)) (or (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|) (forall ((|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1715 Int) (v_ArrVal_1720 Int) (v_ArrVal_1706 (Array Int Int)) (v_ArrVal_1717 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= |t_funThread3of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= (select (store (let ((.cse0 (select (store (let ((.cse1 (let ((.cse2 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1706) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse3 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse3 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1713) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse2 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse2 |t_funThread1of4ForFork0_~p~0#1.offset|)))))) (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse1) |c_~#a~0.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1713) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse1) |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1715))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_~#a~0.base|))) (store .cse0 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse0 |t_funThread2of4ForFork0_~p~0#1.offset|)))) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1720) |t_funThread4of4ForFork0_~p~0#1.offset|) 0))))) (or (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1715 Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1720 Int) (v_ArrVal_1706 (Array Int Int)) (v_ArrVal_1717 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|) (= (select (store (let ((.cse4 (select (store (let ((.cse5 (let ((.cse6 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1706) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse7 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse7 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1713) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse6 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse6 |t_funThread1of4ForFork0_~p~0#1.offset|)))))) (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse5) |c_~#a~0.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1713) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse5) |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1715))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_~#a~0.base|))) (store .cse4 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse4 |t_funThread2of4ForFork0_~p~0#1.offset|)))) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1720) |t_funThread4of4ForFork0_~p~0#1.offset|) 0))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) is different from false [2023-12-02 20:33:52,900 WARN L854 $PredicateComparison]: unable to prove that (and (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1715 Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1720 Int) (v_ArrVal_1706 (Array Int Int)) (v_ArrVal_1717 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|) (= (select (store (let ((.cse0 (select (store (store |c_#memory_int| |c_~#a~0.base| (store (let ((.cse1 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1706) |c_~#a~0.base|))) (store .cse2 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse2 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1713) |c_~#a~0.base|))) (store .cse1 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse1 |t_funThread1of4ForFork0_~p~0#1.offset|)))) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1715)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_~#a~0.base|))) (store .cse0 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse0 |t_funThread2of4ForFork0_~p~0#1.offset|)))) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1720) |t_funThread4of4ForFork0_~p~0#1.offset|) 0)))) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int)) (or (forall ((|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1715 Int) (v_ArrVal_1720 Int) (v_ArrVal_1706 (Array Int Int)) (v_ArrVal_1717 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= |t_funThread3of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= (select (store (let ((.cse3 (select (store (store |c_#memory_int| |c_~#a~0.base| (store (let ((.cse4 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1706) |c_~#a~0.base|))) (store .cse5 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse5 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1713) |c_~#a~0.base|))) (store .cse4 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse4 |t_funThread1of4ForFork0_~p~0#1.offset|)))) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1715)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_~#a~0.base|))) (store .cse3 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse3 |t_funThread2of4ForFork0_~p~0#1.offset|)))) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1720) |t_funThread4of4ForFork0_~p~0#1.offset|) 0))) (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|)))) is different from false [2023-12-02 20:33:53,730 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 19 not checked. [2023-12-02 20:33:53,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670677340] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:33:53,730 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:33:53,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 18, 20] total 65 [2023-12-02 20:33:53,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988252954] [2023-12-02 20:33:53,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:33:53,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2023-12-02 20:33:53,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:33:53,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2023-12-02 20:33:53,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=3358, Unknown=68, NotChecked=610, Total=4290 [2023-12-02 20:33:53,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:33:53,733 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:33:53,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 3.515151515151515) internal successors, (232), 65 states have internal predecessors, (232), 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:33:53,733 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:33:53,734 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:33:53,734 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:33:53,734 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:34:02,652 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:34:28,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:34:28,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:34:28,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:34:28,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-12-02 20:34:28,430 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2023-12-02 20:34:28,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2023-12-02 20:34:28,624 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:34:28,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:34:28,625 INFO L85 PathProgramCache]: Analyzing trace with hash 156415991, now seen corresponding path program 1 times [2023-12-02 20:34:28,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:34:28,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560339730] [2023-12-02 20:34:28,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:34:28,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:34:28,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:34:28,715 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2023-12-02 20:34:28,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:34:28,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560339730] [2023-12-02 20:34:28,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560339730] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 20:34:28,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 20:34:28,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 20:34:28,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465913232] [2023-12-02 20:34:28,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 20:34:28,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 20:34:28,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:34:28,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 20:34:28,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 20:34:28,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:34:28,717 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:34:28,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 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:34:28,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:34:28,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:34:28,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:34:28,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2023-12-02 20:34:28,717 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:34:38,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:34:38,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:34:38,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:34:38,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-12-02 20:34:38,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:34:38,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-12-02 20:34:38,721 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:34:38,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:34:38,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1594468091, now seen corresponding path program 1 times [2023-12-02 20:34:38,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:34:38,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356091772] [2023-12-02 20:34:38,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:34:38,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:34:38,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:34:38,869 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 20:34:38,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:34:38,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356091772] [2023-12-02 20:34:38,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356091772] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:34:38,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991157574] [2023-12-02 20:34:38,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:34:38,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:34:38,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:34:38,871 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:34:38,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-12-02 20:34:39,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:34:39,076 INFO L262 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 20:34:39,078 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:34:39,130 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 20:34:39,130 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:34:39,222 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 20:34:39,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991157574] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:34:39,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:34:39,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2023-12-02 20:34:39,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194777748] [2023-12-02 20:34:39,223 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:34:39,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-02 20:34:39,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:34:39,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-02 20:34:39,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-12-02 20:34:39,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:34:39,224 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:34:39,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.0) internal successors, (156), 13 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 20:34:39,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:34:39,224 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:34:39,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:34:39,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2023-12-02 20:34:39,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:34:39,225 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:34:41,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:34:41,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:34:41,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:34:41,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-12-02 20:34:41,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:34:41,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:34:41,254 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2023-12-02 20:34:41,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2023-12-02 20:34:41,449 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:34:41,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:34:41,449 INFO L85 PathProgramCache]: Analyzing trace with hash -506823408, now seen corresponding path program 1 times [2023-12-02 20:34:41,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:34:41,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752228367] [2023-12-02 20:34:41,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:34:41,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:34:41,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:34:43,887 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 7 proven. 19 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 20:34:43,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:34:43,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752228367] [2023-12-02 20:34:43,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752228367] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:34:43,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729865462] [2023-12-02 20:34:43,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:34:43,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:34:43,887 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:34:43,888 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:34:43,889 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-12-02 20:34:44,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:34:44,095 INFO L262 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 60 conjunts are in the unsatisfiable core [2023-12-02 20:34:44,100 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:34:44,105 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:34:44,191 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:34:44,191 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:34:44,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2023-12-02 20:34:44,388 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 13 treesize of output 9 [2023-12-02 20:34:44,483 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:34:44,557 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:34:44,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-12-02 20:34:44,662 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:34:44,741 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 13 treesize of output 9 [2023-12-02 20:34:44,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:34:44,844 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 18 treesize of output 13 [2023-12-02 20:34:44,872 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:34:44,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:34:44,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-12-02 20:34:45,088 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 23 treesize of output 18 [2023-12-02 20:34:45,192 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:34:45,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-12-02 20:34:45,298 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:34:45,474 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 30 treesize of output 23 [2023-12-02 20:34:45,656 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 44 treesize of output 37 [2023-12-02 20:34:45,823 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 40 treesize of output 35 [2023-12-02 20:34:45,952 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 47 treesize of output 40 [2023-12-02 20:34:46,022 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 40 treesize of output 33 [2023-12-02 20:34:46,120 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 56 treesize of output 48 [2023-12-02 20:34:46,158 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 20:34:46,158 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:34:46,169 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2179 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2179) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) is different from false [2023-12-02 20:34:46,882 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2177 Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2168 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse1 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse1 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse1 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))))) (store .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2177))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2179) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2168) |c_~#a~0.base|) (+ |t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)))) is different from false [2023-12-02 20:34:47,007 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:34:47,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-12-02 20:34:47,017 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:34:47,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2023-12-02 20:34:47,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-12-02 20:34:47,056 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse3 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse3 |c_t_funThread1of4ForFork0_~p~0#1.offset| (select .cse3 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse2 (select .cse1 |c_t_funThread3of4ForFork0_~p~0#1.base|))) (let ((.cse0 (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2177 Int) (v_ArrVal_2179 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (= (select (select (store (store .cse1 |c_t_funThread3of4ForFork0_~p~0#1.base| (store .cse2 |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2177)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2179) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0)))) (and (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) .cse0) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2177 Int) (v_ArrVal_2179 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= (select (select (store (store .cse1 |c_t_funThread3of4ForFork0_~p~0#1.base| (store .cse2 |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2177)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2179) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= |t_funThread3of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|))) (or .cse0 (= |c_~#a~0.base| |c_t_funThread3of4ForFork0_~p~0#1.base|)))))) is different from false [2023-12-02 20:34:49,072 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse2 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse2 |c_t_funThread1of4ForFork0_~p~0#1.offset| (select .cse2 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse1 (select .cse0 |c_~#a~0.base|))) (and (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2177 Int) (v_ArrVal_2179 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= (select (select (store (store .cse0 |c_~#a~0.base| (store .cse1 |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2177)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2179) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= |t_funThread3of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|))) (or (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2177 Int) (v_ArrVal_2179 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (= (select (select (store (store .cse0 |c_~#a~0.base| (store .cse1 |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2177)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2179) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))))) is different from false [2023-12-02 20:34:51,102 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2177 Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2162 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= |t_funThread3of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2162))) (let ((.cse0 (let ((.cse2 (select .cse1 |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse2 |c_t_funThread1of4ForFork0_~p~0#1.offset| (select .cse2 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))) (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse0) |c_~#a~0.base| (store (select (store .cse1 |c_t_funThread1of4ForFork0_~p~0#1.base| .cse0) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2177)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2179) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0))) (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2177 Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2162 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (= (select (select (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2162))) (let ((.cse3 (let ((.cse5 (select .cse4 |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse5 |c_t_funThread1of4ForFork0_~p~0#1.offset| (select .cse5 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))) (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse3) |c_~#a~0.base| (store (select (store .cse4 |c_t_funThread1of4ForFork0_~p~0#1.base| .cse3) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2177)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2179) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0)))) is different from false [2023-12-02 20:34:51,566 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 18 treesize of output 12 [2023-12-02 20:34:53,586 WARN L854 $PredicateComparison]: unable to prove that (and (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2177 Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2162 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2162))) (let ((.cse0 (let ((.cse2 (select .cse1 |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse2 |t_funThread1of4ForFork0_~p~0#1.offset| (select .cse2 |t_funThread1of4ForFork0_~p~0#1.offset|))))) (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse0) |c_~#a~0.base| (store (select (store .cse1 |c_t_funThread1of4ForFork0_~p~0#1.base| .cse0) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2177)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2179) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0))) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2177 Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2162 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= (select (select (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2162))) (let ((.cse3 (let ((.cse5 (select .cse4 |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse5 |t_funThread1of4ForFork0_~p~0#1.offset| (select .cse5 |t_funThread1of4ForFork0_~p~0#1.offset|))))) (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse3) |c_~#a~0.base| (store (select (store .cse4 |c_t_funThread1of4ForFork0_~p~0#1.base| .cse3) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2177)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2179) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= |t_funThread3of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|)))) is different from false [2023-12-02 20:34:53,621 WARN L854 $PredicateComparison]: unable to prove that (and (or (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2177 Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2162 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2162) |c_~#a~0.base|))) (store .cse0 |t_funThread1of4ForFork0_~p~0#1.offset| (select .cse0 |t_funThread1of4ForFork0_~p~0#1.offset|))) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2177)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2179) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2177 Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2162 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= |t_funThread3of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2162) |c_~#a~0.base|))) (store .cse1 |t_funThread1of4ForFork0_~p~0#1.offset| (select .cse1 |t_funThread1of4ForFork0_~p~0#1.offset|))) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2177)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2179) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0)))) is different from false [2023-12-02 20:34:53,986 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 6 refuted. 1 times theorem prover too weak. 55 trivial. 19 not checked. [2023-12-02 20:34:53,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729865462] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:34:53,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:34:53,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20, 19] total 52 [2023-12-02 20:34:53,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176027519] [2023-12-02 20:34:53,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:34:53,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-12-02 20:34:53,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:34:53,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-12-02 20:34:53,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1846, Unknown=36, NotChecked=658, Total=2756 [2023-12-02 20:34:53,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:34:53,989 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:34:53,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 4.39622641509434) internal successors, (233), 52 states have internal predecessors, (233), 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:34:53,990 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:34:53,990 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:34:53,990 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:34:53,990 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2023-12-02 20:34:53,990 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:34:53,990 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:34:53,990 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:35:01,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:35:01,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:35:01,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:35:01,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-12-02 20:35:01,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:35:01,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:35:01,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-02 20:35:01,358 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2023-12-02 20:35:01,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:35:01,554 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:35:01,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:35:01,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1669113992, now seen corresponding path program 2 times [2023-12-02 20:35:01,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:35:01,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128590832] [2023-12-02 20:35:01,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:35:01,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:35:01,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:35:03,270 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 20:35:03,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:35:03,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128590832] [2023-12-02 20:35:03,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128590832] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:35:03,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090768298] [2023-12-02 20:35:03,270 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-02 20:35:03,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:35:03,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:35:03,271 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:35:03,272 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2023-12-02 20:35:03,489 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-02 20:35:03,489 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:35:03,492 INFO L262 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 66 conjunts are in the unsatisfiable core [2023-12-02 20:35:03,497 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:35:03,500 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:35:03,602 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:35:03,602 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:35:03,631 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:35:03,680 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 13 treesize of output 9 [2023-12-02 20:35:03,772 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:35:03,858 INFO L349 Elim1Store]: treesize reduction 22, result has 38.9 percent of original size [2023-12-02 20:35:03,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 29 [2023-12-02 20:35:04,060 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:35:04,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:35:04,215 INFO L349 Elim1Store]: treesize reduction 44, result has 38.0 percent of original size [2023-12-02 20:35:04,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 45 [2023-12-02 20:35:04,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:35:04,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2023-12-02 20:35:04,460 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:35:04,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:35:04,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2023-12-02 20:35:04,838 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 23 treesize of output 18 [2023-12-02 20:35:05,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:35:05,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:35:05,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:35:05,039 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-12-02 20:35:05,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 25 [2023-12-02 20:35:05,209 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:35:05,497 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 30 treesize of output 23 [2023-12-02 20:35:05,894 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 37 [2023-12-02 20:35:06,050 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 51 treesize of output 42 [2023-12-02 20:35:06,173 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 54 [2023-12-02 20:35:06,505 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 61 [2023-12-02 20:35:07,037 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 105 treesize of output 91 [2023-12-02 20:35:07,105 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 20:35:07,105 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:35:07,202 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2367 (Array Int Int)) (v_ArrVal_2368 Int)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2367))) (store .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2368))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) is different from false [2023-12-02 20:35:10,437 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 Int) (v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2357 (Array Int Int)) (v_ArrVal_2367 (Array Int Int)) (v_ArrVal_2368 Int) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= (select (select (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2358))) (let ((.cse5 (let ((.cse9 (select .cse8 |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse9 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse9 |c_t_funThread1of4ForFork0_~p~0#1.offset|) (- 1)))))) (let ((.cse4 (let ((.cse6 (store .cse8 |c_t_funThread1of4ForFork0_~p~0#1.base| .cse5))) (store .cse6 |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse7 (select .cse6 |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse7 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (select .cse7 |c_t_funThread2of4ForFork0_~p~0#1.offset|) 1))))))) (let ((.cse2 (store (select .cse4 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2364))) (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse5)) (.cse1 (let ((.cse3 (select (store .cse4 |c_t_funThread3of4ForFork0_~p~0#1.base| .cse2) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse3 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse3 |c_t_funThread2of4ForFork0_~p~0#1.offset|)))))) (store (store (store .cse0 |c_t_funThread2of4ForFork0_~p~0#1.base| .cse1) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2367) |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select (store (store (store .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base| .cse2) |c_t_funThread2of4ForFork0_~p~0#1.base| .cse1) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2367) |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2368))))))) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2357) |c_~#a~0.base|) (+ |t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)))) is different from false [2023-12-02 20:35:10,457 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 Int) (v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2357 (Array Int Int)) (v_ArrVal_2367 (Array Int Int)) (v_ArrVal_2368 Int) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= (select (select (let ((.cse5 (let ((.cse8 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse9 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse9 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse9 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2358) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse8 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse8 |c_t_funThread1of4ForFork0_~p~0#1.offset|) (- 1)))))) (let ((.cse4 (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2358) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse5))) (store .cse6 |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse7 (select .cse6 |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse7 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (select .cse7 |c_t_funThread2of4ForFork0_~p~0#1.offset|) 1))))))) (let ((.cse2 (store (select .cse4 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2364))) (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse5)) (.cse1 (let ((.cse3 (select (store .cse4 |c_t_funThread3of4ForFork0_~p~0#1.base| .cse2) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse3 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse3 |c_t_funThread2of4ForFork0_~p~0#1.offset|)))))) (store (store (store .cse0 |c_t_funThread2of4ForFork0_~p~0#1.base| .cse1) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2367) |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select (store (store (store .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base| .cse2) |c_t_funThread2of4ForFork0_~p~0#1.base| .cse1) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2367) |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2368)))))) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2357) |c_~#a~0.base|) (+ |t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)))) is different from false [2023-12-02 20:35:16,687 INFO L349 Elim1Store]: treesize reduction 108, result has 32.1 percent of original size [2023-12-02 20:35:16,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 91 treesize of output 104 [2023-12-02 20:35:16,827 INFO L349 Elim1Store]: treesize reduction 30, result has 48.3 percent of original size [2023-12-02 20:35:16,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 134 treesize of output 137 [2023-12-02 20:35:16,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-12-02 20:35:16,937 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 20:35:16,937 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 20 treesize of output 12 [2023-12-02 20:35:17,012 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2023-12-02 20:35:17,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 41 [2023-12-02 20:36:22,159 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|t_funThread1of4ForFork0_~p~0#1.offset| Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int)) (or (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int)) (or (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|) (forall ((v_ArrVal_2364 Int) (v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2367 (Array Int Int)) (v_ArrVal_2368 Int) (v_ArrVal_2351 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= 0 (select (store (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse0 (let ((.cse1 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2351) |c_~#a~0.base|))) (store .cse2 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse2 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2358) |c_~#a~0.base|))) (store .cse1 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse1 |t_funThread1of4ForFork0_~p~0#1.offset|)))))) (store (store .cse0 |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2364) |t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select (store (store .cse0 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (select .cse0 |t_funThread2of4ForFork0_~p~0#1.offset|) 1)) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2364) |t_funThread2of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2367) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2368) |t_funThread4of4ForFork0_~p~0#1.offset|)) (= |t_funThread3of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|))) (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|))) (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread2of4ForFork0_~p~0#1.offset|))) (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2364 Int) (v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2367 (Array Int Int)) (v_ArrVal_2368 Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2351 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|) (= 0 (select (store (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse3 (let ((.cse4 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2351) |c_~#a~0.base|))) (store .cse5 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse5 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2358) |c_~#a~0.base|))) (store .cse4 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse4 |t_funThread1of4ForFork0_~p~0#1.offset|)))))) (store (store .cse3 |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2364) |t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select (store (store .cse3 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (select .cse3 |t_funThread2of4ForFork0_~p~0#1.offset|) 1)) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2364) |t_funThread2of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2367) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2368) |t_funThread4of4ForFork0_~p~0#1.offset|)) (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|) (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread2of4ForFork0_~p~0#1.offset|))))) is different from false [2023-12-02 20:36:23,313 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 14 not checked. [2023-12-02 20:36:23,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090768298] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:36:23,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:36:23,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 20, 22] total 55 [2023-12-02 20:36:23,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982053210] [2023-12-02 20:36:23,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:36:23,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-12-02 20:36:23,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:36:23,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-12-02 20:36:23,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=2339, Unknown=60, NotChecked=412, Total=3080 [2023-12-02 20:36:23,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:36:23,317 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:36:23,317 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 4.178571428571429) internal successors, (234), 55 states have internal predecessors, (234), 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:36:23,317 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:36:23,317 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:36:23,317 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:36:23,317 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 39 states. [2023-12-02 20:36:23,317 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:36:23,317 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:36:23,317 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2023-12-02 20:36:23,317 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:36:38,305 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:36:40,342 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:36:42,764 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:36:44,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:36:46,352 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:36:50,942 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:36:52,036 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 [0, 1] [2023-12-02 20:36:52,482 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|)) (.cse10 (select |c_#pthreadsMutex| |c_t_funThread3of4ForFork0_~p~0#1.base|)) (.cse9 (select |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base|)) (.cse22 ((as const (Array Int Int)) 0))) (and (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1715 Int) (v_ArrVal_1712 (Array Int Int)) (v_ArrVal_1720 Int) (v_ArrVal_1717 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (let ((.cse5 (select |c_#pthreadsMutex| |c_~#a~0.base|)) (.cse6 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4))) (or (= (select (store (select (let ((.cse2 (let ((.cse3 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store .cse4 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse4 |t_funThread1of4ForFork0_~p~0#1.offset|) 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1713) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse3 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse3 |t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse2))) (store (store .cse0 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse1 (select (store (store .cse0 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1713) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse2) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1715)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse1 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse1 |c_t_funThread2of4ForFork0_~p~0#1.offset|))))))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1720) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (not (= (select .cse5 .cse6) 0)) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse5 .cse6 1)) |c_~#__global_lock~0.base| v_ArrVal_1712) |c_~#a~0.base|) (+ |t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0))))) (forall ((v_ArrVal_1715 Int) (v_ArrVal_1720 Int) (v_ArrVal_1717 (Array Int Int))) (= (select (select (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse8 (select (store (store |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base| (store .cse9 |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1715)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse8 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse8 |c_t_funThread2of4ForFork0_~p~0#1.offset|))))))) (store .cse7 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse7 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1720))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (= |c_t_funThread4of4ForFork0_~p~0#1.base| 4) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int)) (let ((.cse11 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4))) (or (forall ((|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1715 Int) (v_ArrVal_1712 (Array Int Int)) (v_ArrVal_1720 Int) (v_ArrVal_1717 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#pthreadsMutex| |c_t_funThread3of4ForFork0_~p~0#1.base| (store .cse10 .cse11 1)) |c_~#__global_lock~0.base| v_ArrVal_1712) |c_~#a~0.base|) (+ |t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)) (= (select (select (let ((.cse12 (let ((.cse15 (let ((.cse16 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store .cse4 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse4 |t_funThread1of4ForFork0_~p~0#1.offset|) 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1713) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse16 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse16 |t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse13 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse15))) (store (store .cse13 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse14 (select (store (store .cse13 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1713) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse15) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1715)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse14 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse14 |c_t_funThread2of4ForFork0_~p~0#1.offset|))))))))) (store .cse12 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse12 |c_t_funThread3of4ForFork0_~p~0#1.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1720))) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0))) (not (= (select .cse10 .cse11) 0))))) (forall ((v_ArrVal_1720 Int)) (= (select (select (store |c_#memory_int| |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1720)) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (forall ((v_ArrVal_1720 Int) (v_ArrVal_1717 (Array Int Int))) (= (select (select (let ((.cse17 (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717))) (store .cse18 |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse19 (select .cse18 |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse19 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse19 |c_t_funThread2of4ForFork0_~p~0#1.offset|)))))))) (store .cse17 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse17 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1720))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (let ((.cse20 (select .cse10 (+ |c_t_funThread3of4ForFork0_~p~0#1.offset| 4)))) (or (= .cse20 1) (let ((.cse21 (= |c_~#a~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|))) (and (or (not .cse21) (and (not (= .cse20 0)) (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4))) (or (and (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_t_funThread2of4ForFork0_~p~0#1.base|) (not (= |c_t_funThread3of4ForFork0_~p~0#1.offset| |c_t_funThread1of4ForFork0_~p~0#1.offset|)) (not (= |c_t_funThread3of4ForFork0_~p~0#1.base| |c_~#__global_lock~0.base|)) (or (< 0 |c_t_funThread3of4ForFork0_~i~0#1|) (and (<= |c_~#__global_lock~0.offset| |c_t_funThread3of4ForFork0_~p~0#1.offset|) (<= |c_t_funThread3of4ForFork0_~p~0#1.offset| (+ (* |c_t_funThread3of4ForFork0_~i~0#1| 28) |c_~#__global_lock~0.offset|)))) (= |c_~#a~0.offset| 0) (= .cse4 .cse22) (not (= |c_t_funThread1of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (= |c_~#a~0.base| |c_t_funThread3of4ForFork0_~p~0#1.base|) (= |c_t_funThread2of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|)) .cse21))))) (forall ((v_ArrVal_1720 Int)) (= (select (select (let ((.cse23 (store |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base| (store .cse9 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse9 |c_t_funThread2of4ForFork0_~p~0#1.offset|)))))) (store .cse23 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse23 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1720))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (exists ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int)) (and (not (= |t_funThread3of4ForFork0_~p~0#1.offset| |c_t_funThread4of4ForFork0_~p~0#1.offset|)) (not (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|)) (not (= |t_funThread2of4ForFork0_~p~0#1.offset| |c_t_funThread4of4ForFork0_~p~0#1.offset|)) (let ((.cse24 (select |c_#memory_int| 4))) (= (store (store (store .cse22 |t_funThread1of4ForFork0_~p~0#1.offset| (select .cse22 |t_funThread1of4ForFork0_~p~0#1.offset|)) |t_funThread2of4ForFork0_~p~0#1.offset| (select .cse24 |t_funThread2of4ForFork0_~p~0#1.offset|)) |t_funThread3of4ForFork0_~p~0#1.offset| (select .cse24 |t_funThread3of4ForFork0_~p~0#1.offset|)) .cse24)))))) is different from false [2023-12-02 20:37:28,206 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_t_funThread3of4ForFork0_~p~0#1.base|))) (and (forall ((v_ArrVal_2368 Int)) (= (select (select (store |c_#memory_int| |c_t_funThread3of4ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2368)) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (forall ((v_ArrVal_2367 (Array Int Int)) (v_ArrVal_2368 Int)) (= (select (select (let ((.cse1 (store (store |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse2 (select |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2367))) (store .cse1 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse1 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2368))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (forall ((v_ArrVal_2364 Int) (v_ArrVal_2367 (Array Int Int)) (v_ArrVal_2368 Int)) (= (select (select (let ((.cse4 (store |c_#memory_int| |c_t_funThread3of4ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2364)))) (let ((.cse3 (let ((.cse5 (select .cse4 |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse5 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse5 |c_t_funThread2of4ForFork0_~p~0#1.offset|)))))) (store (store (store |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base| .cse3) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2367) |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select (store (store .cse4 |c_t_funThread2of4ForFork0_~p~0#1.base| .cse3) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2367) |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2368)))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)))) is different from false [2023-12-02 20:37:38,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:37:44,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:37:47,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:37:58,379 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:38:01,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:38:04,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:38:07,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:38:10,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:38:13,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:38:16,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:38:16,826 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (let ((.cse9 (select .cse8 |c_t_funThread1of4ForFork0_~p~0#1.offset|))) (let ((.cse6 (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread3of4ForFork0_~p~0#1.offset|)) (.cse0 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store .cse8 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) .cse9))))) (let ((.cse1 (select .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base|)) (.cse5 (select |c_#memory_int| |c_t_funThread3of4ForFork0_~p~0#1.base|)) (.cse10 (not .cse6))) (and (forall ((v_ArrVal_2177 Int) (v_ArrVal_2179 (Array Int Int))) (= (select (select (store (store .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base| (store .cse1 |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2177)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2179) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (exists ((|t_funThread1of4ForFork0_~p~0#1.offset| Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int)) (and (not (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread2of4ForFork0_~p~0#1.offset|)) (let ((.cse4 (select |c_#memory_int| 4))) (= (store (let ((.cse2 (let ((.cse3 ((as const (Array Int Int)) 0))) (store .cse3 |t_funThread1of4ForFork0_~p~0#1.offset| (select .cse3 |t_funThread1of4ForFork0_~p~0#1.offset|))))) (store .cse2 |t_funThread2of4ForFork0_~p~0#1.offset| (select .cse2 |t_funThread2of4ForFork0_~p~0#1.offset|))) |c_t_funThread3of4ForFork0_~p~0#1.offset| (select .cse4 |c_t_funThread3of4ForFork0_~p~0#1.offset|)) .cse4)))) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (= |c_t_funThread4of4ForFork0_~p~0#1.base| 4) (= |c_t_funThread4of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|) (forall ((v_ArrVal_2177 Int) (v_ArrVal_2179 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= (select (select (store (store .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base| (store .cse1 |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2177)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2179) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (not (= (select (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ |t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)))) (not (= |c_t_funThread3of4ForFork0_~p~0#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (forall ((|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (forall ((v_ArrVal_2177 Int) (v_ArrVal_2179 (Array Int Int))) (= (select (select (store (store .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base| (store .cse1 |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2177)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2179) |c_t_funThread4of4ForFork0_~p~0#1.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (not (= (select (select |c_#pthreadsMutex| |c_t_funThread4of4ForFork0_~p~0#1.base|) (+ |t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)))) (= |c_t_funThread3of4ForFork0_~p~0#1.base| 4) (or (and (= (select .cse5 |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= |c_t_funThread2of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|)) .cse6) (forall ((v_ArrVal_2177 Int) (v_ArrVal_2179 (Array Int Int)) (v_ArrVal_2168 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= (select (select (store (let ((.cse7 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store .cse8 |c_t_funThread1of4ForFork0_~p~0#1.offset| .cse9)))) (store .cse7 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse7 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2177))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2179) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2168) |c_~#a~0.base|) (+ |t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)))) (or (= (select .cse5 |c_t_funThread3of4ForFork0_~p~0#1.offset|) 0) .cse10) .cse10))))) is different from false [2023-12-02 20:38:21,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:38:25,675 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:38:37,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:38:41,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:39:04,275 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store .cse15 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse15 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse4 (select |c_#pthreadsMutex| |c_~#a~0.base|)) (.cse17 (select |c_#pthreadsMutex| |c_t_funThread3of4ForFork0_~p~0#1.base|)) (.cse3 (select .cse1 |c_t_funThread2of4ForFork0_~p~0#1.base|))) (and (forall ((v_ArrVal_1715 Int) (v_ArrVal_1720 Int) (v_ArrVal_1717 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= (select (select (let ((.cse0 (store (store .cse1 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse2 (select (store (store .cse1 |c_t_funThread2of4ForFork0_~p~0#1.base| (store .cse3 |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1715)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset|))))))) (store .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1720))) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (not (= (select .cse4 (+ |t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)))) (forall ((v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1715 Int) (v_ArrVal_1720 Int) (v_ArrVal_1717 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= (select (select (let ((.cse5 (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1713))) (let ((.cse9 (let ((.cse10 (select .cse8 |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse10 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse10 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse6 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse9))) (store (store .cse6 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse7 (select (store (store .cse6 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store .cse8 |c_t_funThread1of4ForFork0_~p~0#1.base| .cse9) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1715)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse7 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse7 |c_t_funThread2of4ForFork0_~p~0#1.offset|)))))))))) (store .cse5 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse5 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1720))) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (not (= (select .cse4 (+ |t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)))) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1715 Int) (v_ArrVal_1712 (Array Int Int)) (v_ArrVal_1720 Int) (v_ArrVal_1717 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (let ((.cse16 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4))) (or (= (select (store (select (let ((.cse13 (let ((.cse14 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store .cse15 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse15 |t_funThread1of4ForFork0_~p~0#1.offset|) 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1713) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse14 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse14 |t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse11 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse13))) (store (store .cse11 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse12 (select (store (store .cse11 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1713) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse13) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1715)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse12 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse12 |c_t_funThread2of4ForFork0_~p~0#1.offset|))))))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1720) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (not (= (select .cse4 .cse16) 0)) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse4 .cse16 1)) |c_~#__global_lock~0.base| v_ArrVal_1712) |c_~#a~0.base|) (+ |t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0))))) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int)) (let ((.cse18 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4))) (or (forall ((|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1715 Int) (v_ArrVal_1712 (Array Int Int)) (v_ArrVal_1720 Int) (v_ArrVal_1717 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (not (= (select (select (store (store |c_#pthreadsMutex| |c_t_funThread3of4ForFork0_~p~0#1.base| (store .cse17 .cse18 1)) |c_~#__global_lock~0.base| v_ArrVal_1712) |c_~#a~0.base|) (+ |t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)) (= (select (select (let ((.cse19 (let ((.cse22 (let ((.cse23 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store .cse15 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse15 |t_funThread1of4ForFork0_~p~0#1.offset|) 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1713) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse23 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse23 |t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse20 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse22))) (store (store .cse20 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse21 (select (store (store .cse20 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1713) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse22) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1715)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse21 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse21 |c_t_funThread2of4ForFork0_~p~0#1.offset|))))))))) (store .cse19 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse19 |c_t_funThread3of4ForFork0_~p~0#1.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1720))) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0))) (not (= (select .cse17 .cse18) 0))))) (forall ((v_ArrVal_1715 Int) (v_ArrVal_1720 Int) (v_ArrVal_1717 (Array Int Int))) (= 0 (select (select (let ((.cse24 (store (store .cse1 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse25 (select (store (store .cse1 |c_t_funThread2of4ForFork0_~p~0#1.base| (store .cse3 |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1715)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse25 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse25 |c_t_funThread2of4ForFork0_~p~0#1.offset|))))))) (store .cse24 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse24 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1720))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|))) (let ((.cse26 (select .cse17 (+ |c_t_funThread3of4ForFork0_~p~0#1.offset| 4)))) (or (= .cse26 1) (let ((.cse27 (= |c_~#a~0.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|))) (and (or (not .cse27) (and (not (= .cse26 0)) (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4))) (or (and (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_t_funThread2of4ForFork0_~p~0#1.base|) (not (= |c_t_funThread3of4ForFork0_~p~0#1.offset| |c_t_funThread1of4ForFork0_~p~0#1.offset|)) (not (= |c_t_funThread3of4ForFork0_~p~0#1.base| |c_~#__global_lock~0.base|)) (or (< 0 |c_t_funThread3of4ForFork0_~i~0#1|) (and (<= |c_~#__global_lock~0.offset| |c_t_funThread3of4ForFork0_~p~0#1.offset|) (<= |c_t_funThread3of4ForFork0_~p~0#1.offset| (+ (* |c_t_funThread3of4ForFork0_~i~0#1| 28) |c_~#__global_lock~0.offset|)))) (= |c_~#a~0.offset| 0) (= .cse15 ((as const (Array Int Int)) 0)) (not (= |c_t_funThread1of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (= |c_~#a~0.base| |c_t_funThread3of4ForFork0_~p~0#1.base|) (= |c_t_funThread2of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|)) .cse27))))) (forall ((|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (forall ((v_ArrVal_1715 Int) (v_ArrVal_1720 Int) (v_ArrVal_1717 (Array Int Int))) (= (select (select (let ((.cse28 (store (store .cse1 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse29 (select (store (store .cse1 |c_t_funThread2of4ForFork0_~p~0#1.base| (store .cse3 |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_1715)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1717) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse29 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse29 |c_t_funThread2of4ForFork0_~p~0#1.offset|))))))) (store .cse28 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse28 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1720))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (not (= (select (select |c_#pthreadsMutex| |c_t_funThread4of4ForFork0_~p~0#1.base|) (+ |t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)))))))) is different from false [2023-12-02 20:39:11,083 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:39:18,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:39:21,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:39:24,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:39:28,832 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:39:34,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 [1] [2023-12-02 20:39:40,469 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base|))) (let ((.cse0 (select |c_#memory_int| |c_t_funThread3of4ForFork0_~p~0#1.base|)) (.cse3 (select .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset|))) (and (forall ((v_ArrVal_2368 Int)) (= (select (select (store |c_#memory_int| |c_t_funThread3of4ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2368)) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (forall ((v_ArrVal_2367 (Array Int Int)) (v_ArrVal_2368 Int)) (= (select (select (let ((.cse1 (store (store |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base| (store .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) .cse3))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2367))) (store .cse1 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse1 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2368))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (forall ((v_ArrVal_2364 Int) (v_ArrVal_2367 (Array Int Int)) (v_ArrVal_2368 Int)) (= (select (select (let ((.cse5 (store |c_#memory_int| |c_t_funThread3of4ForFork0_~p~0#1.base| (store .cse0 |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2364)))) (let ((.cse4 (let ((.cse6 (select .cse5 |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse6 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse6 |c_t_funThread2of4ForFork0_~p~0#1.offset|)))))) (store (store (store |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base| .cse4) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2367) |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select (store (store .cse5 |c_t_funThread2of4ForFork0_~p~0#1.base| .cse4) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2367) |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2368)))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (forall ((v_ArrVal_2364 Int) (v_ArrVal_2367 (Array Int Int)) (v_ArrVal_2368 Int)) (= (select (select (let ((.cse10 (store |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base| (store .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ .cse3 1))))) (let ((.cse8 (store (select .cse10 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2364))) (let ((.cse7 (let ((.cse9 (select (store .cse10 |c_t_funThread3of4ForFork0_~p~0#1.base| .cse8) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse9 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse9 |c_t_funThread2of4ForFork0_~p~0#1.offset|)))))) (store (store (store |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base| .cse7) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2367) |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select (store (store (store |c_#memory_int| |c_t_funThread3of4ForFork0_~p~0#1.base| .cse8) |c_t_funThread2of4ForFork0_~p~0#1.base| .cse7) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2367) |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2368))))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0))))) is different from false [2023-12-02 20:39:42,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:39:44,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:39:45,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:39:47,809 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:39:48,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:39:48,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:39:48,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:39:48,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-12-02 20:39:48,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:39:48,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:39:48,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-12-02 20:39:48,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-12-02 20:39:48,144 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2023-12-02 20:39:48,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:39:48,340 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:39:48,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:39:48,340 INFO L85 PathProgramCache]: Analyzing trace with hash 882788200, now seen corresponding path program 4 times [2023-12-02 20:39:48,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:39:48,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702789019] [2023-12-02 20:39:48,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:39:48,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:39:48,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:39:54,739 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:39:54,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:39:54,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702789019] [2023-12-02 20:39:54,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702789019] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:39:54,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206182144] [2023-12-02 20:39:54,740 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 20:39:54,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:39:54,740 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:39:54,741 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:39:54,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-12-02 20:39:55,174 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 20:39:55,174 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 20:39:55,178 INFO L262 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 58 conjunts are in the unsatisfiable core [2023-12-02 20:39:55,183 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:39:55,190 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:39:55,323 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:39:55,324 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:39:55,380 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:39:55,457 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 13 treesize of output 9 [2023-12-02 20:39:55,582 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:39:55,706 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:39:55,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-12-02 20:39:55,867 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:39:55,995 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 13 treesize of output 9 [2023-12-02 20:39:56,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:39:56,162 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 18 treesize of output 13 [2023-12-02 20:39:56,194 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:39:56,303 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:39:56,304 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 18 treesize of output 13 [2023-12-02 20:39:56,540 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 23 treesize of output 18 [2023-12-02 20:39:56,696 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:39:56,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2023-12-02 20:39:56,846 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:39:57,016 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 48 treesize of output 41 [2023-12-02 20:39:57,383 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 58 [2023-12-02 20:39:57,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 72 treesize of output 65 [2023-12-02 20:39:57,924 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 110 treesize of output 105 [2023-12-02 20:39:58,152 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 126 treesize of output 118 [2023-12-02 20:39:58,219 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 20:39:58,219 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:40:02,496 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2535 (Array Int Int)) (v_ArrVal_2534 (Array Int Int)) (v_ArrVal_2542 Int) (v_ArrVal_2540 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2534) |c_~#a~0.base|) (+ |t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)) (= (select (select (let ((.cse0 (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2535))) (let ((.cse3 (let ((.cse6 (select .cse5 |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse6 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (select .cse6 |c_t_funThread2of4ForFork0_~p~0#1.offset|) 1))))) (let ((.cse1 (let ((.cse4 (select (store .cse5 |c_t_funThread2of4ForFork0_~p~0#1.base| .cse3) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse4 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse4 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (store (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse1) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2540) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse2 (select (store (store (store |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base| .cse3) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse1) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2540) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset|)))))))))) (store .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2542))) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0))) is different from false [2023-12-02 20:40:02,524 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2535 (Array Int Int)) (v_ArrVal_2534 (Array Int Int)) (v_ArrVal_2542 Int) (v_ArrVal_2540 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2534) |c_~#a~0.base|) (+ |t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)) (= (select (select (let ((.cse0 (let ((.cse5 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse7 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse7 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse7 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2535))) (let ((.cse3 (let ((.cse6 (select .cse5 |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse6 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (select .cse6 |c_t_funThread2of4ForFork0_~p~0#1.offset|) 1))))) (let ((.cse1 (let ((.cse4 (select (store .cse5 |c_t_funThread2of4ForFork0_~p~0#1.base| .cse3) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse4 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse4 |c_t_funThread1of4ForFork0_~p~0#1.offset|) (- 1)))))) (store (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse1) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2540) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse2 (select (store (store (store |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base| .cse3) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse1) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2540) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset|)))))))))) (store .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2542))) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0))) is different from false [2023-12-02 20:40:02,619 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:40:02,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-12-02 20:40:02,701 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:40:02,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2023-12-02 20:40:02,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-12-02 20:40:02,799 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse8 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse16 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse16 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse16 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))))) (let ((.cse0 (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2535 (Array Int Int)) (v_ArrVal_2542 Int) (v_ArrVal_2540 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (= (select (select (let ((.cse9 (let ((.cse14 (store .cse8 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2535))) (let ((.cse12 (let ((.cse15 (select .cse14 |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse15 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (select .cse15 |c_t_funThread2of4ForFork0_~p~0#1.offset|) 1))))) (let ((.cse10 (let ((.cse13 (select (store .cse14 |c_t_funThread2of4ForFork0_~p~0#1.base| .cse12) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse13 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse13 |c_t_funThread1of4ForFork0_~p~0#1.offset|) (- 1)))))) (store (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse10) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2540) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse11 (select (store (store (store |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base| .cse12) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse10) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2540) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse11 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse11 |c_t_funThread2of4ForFork0_~p~0#1.offset|)))))))))) (store .cse9 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse9 |c_t_funThread3of4ForFork0_~p~0#1.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2542))) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0)))) (and (or .cse0 (= |c_~#a~0.base| |c_t_funThread3of4ForFork0_~p~0#1.base|)) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2535 (Array Int Int)) (v_ArrVal_2542 Int) (v_ArrVal_2540 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= |t_funThread3of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= (select (select (let ((.cse1 (let ((.cse6 (store .cse8 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2535))) (let ((.cse4 (let ((.cse7 (select .cse6 |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse7 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (select .cse7 |c_t_funThread2of4ForFork0_~p~0#1.offset|) 1))))) (let ((.cse2 (let ((.cse5 (select (store .cse6 |c_t_funThread2of4ForFork0_~p~0#1.base| .cse4) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse5 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse5 |c_t_funThread1of4ForFork0_~p~0#1.offset|) (- 1)))))) (store (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse2) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2540) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse3 (select (store (store (store |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base| .cse4) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse2) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2540) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse3 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse3 |c_t_funThread2of4ForFork0_~p~0#1.offset|)))))))))) (store .cse1 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse1 |c_t_funThread3of4ForFork0_~p~0#1.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2542))) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0))) (or .cse0 (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))))) is different from false [2023-12-02 20:40:02,853 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse13 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse13 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse13 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))))) (and (or (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2535 (Array Int Int)) (v_ArrVal_2542 Int) (v_ArrVal_2540 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (= (select (store (select (let ((.cse4 (store .cse6 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2535))) (let ((.cse2 (let ((.cse5 (select .cse4 |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse5 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (select .cse5 |c_t_funThread2of4ForFork0_~p~0#1.offset|) 1))))) (let ((.cse0 (let ((.cse3 (select (store .cse4 |c_t_funThread2of4ForFork0_~p~0#1.base| .cse2) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse3 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse3 |c_t_funThread1of4ForFork0_~p~0#1.offset|) (- 1)))))) (store (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse0) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2540) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse1 (select (store (store (store |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base| .cse2) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse0) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2540) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse1 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse1 |c_t_funThread2of4ForFork0_~p~0#1.offset|)))))))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2542) |t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2535 (Array Int Int)) (v_ArrVal_2542 Int) (v_ArrVal_2540 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= (select (store (select (let ((.cse11 (store .cse6 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2535))) (let ((.cse9 (let ((.cse12 (select .cse11 |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse12 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (select .cse12 |c_t_funThread2of4ForFork0_~p~0#1.offset|) 1))))) (let ((.cse7 (let ((.cse10 (select (store .cse11 |c_t_funThread2of4ForFork0_~p~0#1.base| .cse9) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse10 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse10 |c_t_funThread1of4ForFork0_~p~0#1.offset|) (- 1)))))) (store (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse7) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2540) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse8 (select (store (store (store |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base| .cse9) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse7) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2540) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse8 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse8 |c_t_funThread2of4ForFork0_~p~0#1.offset|)))))))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2542) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= |t_funThread3of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|))))) is different from false [2023-12-02 20:40:02,911 WARN L854 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_2528 (Array Int Int)) (|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2535 (Array Int Int)) (v_ArrVal_2542 Int) (v_ArrVal_2540 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (= (select (store (select (let ((.cse4 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2528) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse6 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse6 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2535))) (let ((.cse2 (let ((.cse5 (select .cse4 |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse5 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (select .cse5 |c_t_funThread2of4ForFork0_~p~0#1.offset|) 1))))) (let ((.cse0 (let ((.cse3 (select (store .cse4 |c_t_funThread2of4ForFork0_~p~0#1.base| .cse2) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse3 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse3 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (store (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse0) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2540) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse1 (select (store (store (store |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base| .cse2) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse0) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2540) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse1 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse1 |c_t_funThread2of4ForFork0_~p~0#1.offset|)))))))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2542) |t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((v_ArrVal_2528 (Array Int Int)) (|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2535 (Array Int Int)) (v_ArrVal_2542 Int) (v_ArrVal_2540 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= (select (store (select (let ((.cse11 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2528) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse13 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse13 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2535))) (let ((.cse9 (let ((.cse12 (select .cse11 |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse12 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (select .cse12 |c_t_funThread2of4ForFork0_~p~0#1.offset|) 1))))) (let ((.cse7 (let ((.cse10 (select (store .cse11 |c_t_funThread2of4ForFork0_~p~0#1.base| .cse9) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse10 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse10 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (store (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse7) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2540) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse8 (select (store (store (store |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base| .cse9) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse7) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2540) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse8 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse8 |c_t_funThread2of4ForFork0_~p~0#1.offset|)))))))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2542) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= |t_funThread3of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|)))) is different from false [2023-12-02 20:40:08,070 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 18 treesize of output 12 [2023-12-02 20:40:08,129 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 18 treesize of output 12 [2023-12-02 20:40:10,163 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_~#a~0.base|))) (and (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (and (or .cse0 (forall ((v_ArrVal_2528 (Array Int Int)) (|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2535 (Array Int Int)) (v_ArrVal_2542 Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2540 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (= (select (store (let ((.cse1 (select (store (let ((.cse4 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2528) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse6 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse6 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2535))) (let ((.cse2 (let ((.cse5 (select .cse4 |c_~#a~0.base|))) (store .cse5 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (select .cse5 |t_funThread2of4ForFork0_~p~0#1.offset|) 1))))) (store (store |c_#memory_int| |c_~#a~0.base| .cse2) |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse3 (select (store .cse4 |c_~#a~0.base| .cse2) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse3 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse3 |t_funThread1of4ForFork0_~p~0#1.offset|) (- 1))))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2540) |c_~#a~0.base|))) (store .cse1 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse1 |t_funThread2of4ForFork0_~p~0#1.offset|)))) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2542) |t_funThread4of4ForFork0_~p~0#1.offset|) 0))) (forall ((v_ArrVal_2528 (Array Int Int)) (|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2535 (Array Int Int)) (v_ArrVal_2542 Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2540 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= (select (store (let ((.cse7 (select (store (let ((.cse10 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2528) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse12 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse12 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2535))) (let ((.cse8 (let ((.cse11 (select .cse10 |c_~#a~0.base|))) (store .cse11 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (select .cse11 |t_funThread2of4ForFork0_~p~0#1.offset|) 1))))) (store (store |c_#memory_int| |c_~#a~0.base| .cse8) |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse9 (select (store .cse10 |c_~#a~0.base| .cse8) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse9 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse9 |t_funThread1of4ForFork0_~p~0#1.offset|) (- 1))))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2540) |c_~#a~0.base|))) (store .cse7 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse7 |t_funThread2of4ForFork0_~p~0#1.offset|)))) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2542) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread2of4ForFork0_~p~0#1.offset|))))) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= |t_funThread3of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (forall ((v_ArrVal_2528 (Array Int Int)) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2535 (Array Int Int)) (v_ArrVal_2542 Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2540 (Array Int Int))) (or (= (select (store (let ((.cse13 (select (store (let ((.cse16 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2528) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse18 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse18 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2535))) (let ((.cse14 (let ((.cse17 (select .cse16 |c_~#a~0.base|))) (store .cse17 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (select .cse17 |t_funThread2of4ForFork0_~p~0#1.offset|) 1))))) (store (store |c_#memory_int| |c_~#a~0.base| .cse14) |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse15 (select (store .cse16 |c_~#a~0.base| .cse14) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse15 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse15 |t_funThread1of4ForFork0_~p~0#1.offset|) (- 1))))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2540) |c_~#a~0.base|))) (store .cse13 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse13 |t_funThread2of4ForFork0_~p~0#1.offset|)))) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2542) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread2of4ForFork0_~p~0#1.offset|))))) (or .cse0 (forall ((v_ArrVal_2528 (Array Int Int)) (|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2535 (Array Int Int)) (v_ArrVal_2542 Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2540 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= (select (store (let ((.cse19 (select (store (let ((.cse22 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse24 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2528) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse24 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse24 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2535))) (let ((.cse20 (let ((.cse23 (select .cse22 |c_~#a~0.base|))) (store .cse23 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (select .cse23 |t_funThread2of4ForFork0_~p~0#1.offset|) 1))))) (store (store |c_#memory_int| |c_~#a~0.base| .cse20) |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse21 (select (store .cse22 |c_~#a~0.base| .cse20) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse21 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse21 |t_funThread1of4ForFork0_~p~0#1.offset|) (- 1))))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2540) |c_~#a~0.base|))) (store .cse19 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse19 |t_funThread2of4ForFork0_~p~0#1.offset|)))) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2542) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= |t_funThread3of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|)))))) is different from false [2023-12-02 20:40:12,201 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= |t_funThread3of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (forall ((v_ArrVal_2528 (Array Int Int)) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2535 (Array Int Int)) (v_ArrVal_2542 Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2540 (Array Int Int))) (or (= (select (store (let ((.cse0 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse1 (let ((.cse2 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2528) |c_~#a~0.base|))) (store .cse3 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse3 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2535) |c_~#a~0.base|))) (store .cse2 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (select .cse2 |t_funThread2of4ForFork0_~p~0#1.offset|) 1))))) (store .cse1 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse1 |t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2540) |c_~#a~0.base|))) (store .cse0 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse0 |t_funThread2of4ForFork0_~p~0#1.offset|)))) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2542) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread2of4ForFork0_~p~0#1.offset|))))) (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((v_ArrVal_2528 (Array Int Int)) (|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2535 (Array Int Int)) (v_ArrVal_2542 Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2540 (Array Int Int)) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= (select (store (let ((.cse4 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse5 (let ((.cse6 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2528) |c_~#a~0.base|))) (store .cse7 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse7 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2535) |c_~#a~0.base|))) (store .cse6 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (select .cse6 |t_funThread2of4ForFork0_~p~0#1.offset|) 1))))) (store .cse5 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse5 |t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2540) |c_~#a~0.base|))) (store .cse4 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse4 |t_funThread2of4ForFork0_~p~0#1.offset|)))) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2542) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread2of4ForFork0_~p~0#1.offset|))))) is different from false [2023-12-02 20:40:13,022 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 19 not checked. [2023-12-02 20:40:13,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206182144] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:40:13,022 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:40:13,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 19, 21] total 67 [2023-12-02 20:40:13,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953803833] [2023-12-02 20:40:13,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:40:13,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2023-12-02 20:40:13,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:40:13,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2023-12-02 20:40:13,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=3395, Unknown=46, NotChecked=868, Total=4556 [2023-12-02 20:40:13,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:40:13,027 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:40:13,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 3.411764705882353) internal successors, (232), 67 states have internal predecessors, (232), 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:40:13,027 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:40:13,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:40:13,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:40:13,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2023-12-02 20:40:13,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:40:13,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:40:13,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2023-12-02 20:40:13,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 60 states. [2023-12-02 20:40:13,028 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:40:58,627 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2364 Int) (v_ArrVal_2367 (Array Int Int)) (v_ArrVal_2368 Int)) (= (select (select (let ((.cse1 (store |c_#memory_int| |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2364)))) (let ((.cse0 (let ((.cse2 (select .cse1 |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset|)))))) (store (store (store |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base| .cse0) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2367) |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select (store (store .cse1 |c_t_funThread2of4ForFork0_~p~0#1.base| .cse0) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2367) |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2368)))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (not (= |c_t_funThread4of4ForFork0___VERIFIER_assert_~cond#1| 0))) is different from false [2023-12-02 20:40:58,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:40:58,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:40:58,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:40:58,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-12-02 20:40:58,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:40:58,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:40:58,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2023-12-02 20:40:58,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-12-02 20:40:58,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-12-02 20:40:58,663 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2023-12-02 20:40:58,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:40:58,858 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 20:40:58,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 20:40:58,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1248188674, now seen corresponding path program 1 times [2023-12-02 20:40:58,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-02 20:40:58,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041326931] [2023-12-02 20:40:58,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:40:58,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 20:40:59,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:41:18,514 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 4 proven. 73 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 20:41:18,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-02 20:41:18,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041326931] [2023-12-02 20:41:18,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041326931] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 20:41:18,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140754409] [2023-12-02 20:41:18,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 20:41:18,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 20:41:18,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 [2023-12-02 20:41:18,515 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 20:41:18,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_39e65a66-975c-4702-bb7e-cd1de0828a46/bin/ugemcutter-verify-Bi2udmvEmx/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2023-12-02 20:41:18,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 20:41:18,735 INFO L262 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 58 conjunts are in the unsatisfiable core [2023-12-02 20:41:18,739 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 20:41:18,743 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:41:18,876 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-02 20:41:18,876 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:41:18,937 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:41:19,019 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 13 treesize of output 9 [2023-12-02 20:41:19,147 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:41:19,282 INFO L349 Elim1Store]: treesize reduction 22, result has 38.9 percent of original size [2023-12-02 20:41:19,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 29 [2023-12-02 20:41:19,517 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:41:19,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:41:19,742 INFO L349 Elim1Store]: treesize reduction 44, result has 38.0 percent of original size [2023-12-02 20:41:19,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 45 [2023-12-02 20:41:19,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:41:19,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2023-12-02 20:41:20,019 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:41:20,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:41:20,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2023-12-02 20:41:20,518 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 23 treesize of output 18 [2023-12-02 20:41:20,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:41:20,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:41:20,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 20:41:20,780 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-12-02 20:41:20,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 25 [2023-12-02 20:41:21,018 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 30 treesize of output 25 [2023-12-02 20:41:21,234 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 39 treesize of output 30 [2023-12-02 20:41:21,801 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 45 treesize of output 36 [2023-12-02 20:41:22,127 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 52 treesize of output 43 [2023-12-02 20:41:25,980 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 92 treesize of output 74 [2023-12-02 20:41:26,079 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 20:41:26,079 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 20:41:29,806 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2699 (Array Int Int)) (v_ArrVal_2695 Int) (v_ArrVal_2701 Int)) (= (select (select (let ((.cse0 (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2695)))) (store .cse1 |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse2 (select .cse1 |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse2 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse2 |c_t_funThread1of4ForFork0_~p~0#1.offset|) (- 1)))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2699))) (store .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2701))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) is different from false [2023-12-02 20:41:33,976 INFO L349 Elim1Store]: treesize reduction 108, result has 32.1 percent of original size [2023-12-02 20:41:33,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 91 treesize of output 104 [2023-12-02 20:41:34,009 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-12-02 20:41:34,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 59 [2023-12-02 20:41:34,029 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:41:34,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2023-12-02 20:41:34,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2023-12-02 20:41:34,085 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 20:41:34,085 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 20 treesize of output 12 [2023-12-02 20:41:34,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-12-02 20:41:34,164 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2023-12-02 20:41:34,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 41 [2023-12-02 20:41:34,221 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 20:41:34,264 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 20:41:34,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 42 treesize of output 66 [2023-12-02 20:41:34,780 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (.cse0 (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_~#a~0.base|)) (.cse5 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (and (or .cse0 (and (or .cse1 (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2699 (Array Int Int)) (v_ArrVal_2695 Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2694 (Array Int Int)) (v_ArrVal_2701 Int) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|) (= (select (store (select (store (let ((.cse4 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store .cse5 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse5 |t_funThread1of4ForFork0_~p~0#1.offset|) 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2694))) (let ((.cse2 (store (select .cse4 |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2695))) (store (store |c_#memory_int| |c_~#a~0.base| .cse2) |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse3 (select (store .cse4 |c_~#a~0.base| .cse2) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse3 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse3 |t_funThread1of4ForFork0_~p~0#1.offset|))))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2699) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2701) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread2of4ForFork0_~p~0#1.offset|)))) (forall ((|t_funThread1of4ForFork0_~p~0#1.offset| Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int)) (or (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int)) (or (forall ((v_ArrVal_2699 (Array Int Int)) (v_ArrVal_2695 Int) (v_ArrVal_2694 (Array Int Int)) (v_ArrVal_2701 Int) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= |t_funThread3of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= (select (store (select (store (let ((.cse8 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store .cse5 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse5 |t_funThread1of4ForFork0_~p~0#1.offset|) 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2694))) (let ((.cse6 (store (select .cse8 |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2695))) (store (store |c_#memory_int| |c_~#a~0.base| .cse6) |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse7 (select (store .cse8 |c_~#a~0.base| .cse6) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse7 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse7 |t_funThread1of4ForFork0_~p~0#1.offset|))))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2699) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2701) |t_funThread4of4ForFork0_~p~0#1.offset|) 0))) (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|))) (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread2of4ForFork0_~p~0#1.offset|))) (forall ((|t_funThread1of4ForFork0_~p~0#1.offset| Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int)) (or (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int)) (or (forall ((v_ArrVal_2699 (Array Int Int)) (v_ArrVal_2695 Int) (v_ArrVal_2694 (Array Int Int)) (v_ArrVal_2701 Int) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= |t_funThread3of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= (select (store (select (store (let ((.cse11 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store .cse5 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse5 |t_funThread1of4ForFork0_~p~0#1.offset|) 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2694))) (let ((.cse9 (store (select .cse11 |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2695))) (store (store |c_#memory_int| |c_~#a~0.base| .cse9) |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse10 (select (store .cse11 |c_~#a~0.base| .cse9) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse10 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse10 |t_funThread1of4ForFork0_~p~0#1.offset|))))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2699) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2701) |t_funThread4of4ForFork0_~p~0#1.offset|) 0))) (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|))) (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread2of4ForFork0_~p~0#1.offset|))))) (or (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2699 (Array Int Int)) (v_ArrVal_2695 Int) (v_ArrVal_2694 (Array Int Int)) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2701 Int) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|) (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|) (= (select (store (select (store (let ((.cse14 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store .cse5 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse5 |t_funThread1of4ForFork0_~p~0#1.offset|) 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2694))) (let ((.cse12 (store (select .cse14 |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2695))) (store (store |c_#memory_int| |c_~#a~0.base| .cse12) |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse13 (select (store .cse14 |c_~#a~0.base| .cse12) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse13 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse13 |t_funThread1of4ForFork0_~p~0#1.offset|))))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2699) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2701) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread2of4ForFork0_~p~0#1.offset|))) .cse1) (or .cse0 (and (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int)) (or (forall ((v_ArrVal_2699 (Array Int Int)) (v_ArrVal_2695 Int) (v_ArrVal_2694 (Array Int Int)) (v_ArrVal_2701 Int) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= |t_funThread3of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= (select (store (select (store (let ((.cse17 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store .cse5 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse5 |t_funThread1of4ForFork0_~p~0#1.offset|) 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2694))) (let ((.cse15 (store (select .cse17 |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2695))) (store (store |c_#memory_int| |c_~#a~0.base| .cse15) |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse16 (select (store .cse17 |c_~#a~0.base| .cse15) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse16 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse16 |t_funThread1of4ForFork0_~p~0#1.offset|))))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2699) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2701) |t_funThread4of4ForFork0_~p~0#1.offset|) 0))) (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|))) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int)) (or (forall ((v_ArrVal_2699 (Array Int Int)) (v_ArrVal_2695 Int) (v_ArrVal_2694 (Array Int Int)) (v_ArrVal_2701 Int) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= |t_funThread3of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= (select (store (select (store (let ((.cse20 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store .cse5 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse5 |t_funThread1of4ForFork0_~p~0#1.offset|) 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2694))) (let ((.cse18 (store (select .cse20 |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2695))) (store (store |c_#memory_int| |c_~#a~0.base| .cse18) |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse19 (select (store .cse20 |c_~#a~0.base| .cse18) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse19 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse19 |t_funThread1of4ForFork0_~p~0#1.offset|))))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2699) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2701) |t_funThread4of4ForFork0_~p~0#1.offset|) 0))) (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|) (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|))) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int)) (or (forall ((v_ArrVal_2699 (Array Int Int)) (v_ArrVal_2695 Int) (v_ArrVal_2694 (Array Int Int)) (v_ArrVal_2701 Int) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= |t_funThread3of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= (select (store (select (store (let ((.cse23 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store .cse5 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse5 |t_funThread1of4ForFork0_~p~0#1.offset|) 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2694))) (let ((.cse21 (store (select .cse23 |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2695))) (store (store |c_#memory_int| |c_~#a~0.base| .cse21) |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse22 (select (store .cse23 |c_~#a~0.base| .cse21) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse22 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse22 |t_funThread1of4ForFork0_~p~0#1.offset|))))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2699) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2701) |t_funThread4of4ForFork0_~p~0#1.offset|) 0))) (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|))) (or (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2699 (Array Int Int)) (v_ArrVal_2695 Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2694 (Array Int Int)) (v_ArrVal_2701 Int) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|) (= (select (store (select (store (let ((.cse26 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store .cse5 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse5 |t_funThread1of4ForFork0_~p~0#1.offset|) 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2694))) (let ((.cse24 (store (select .cse26 |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2695))) (store (store |c_#memory_int| |c_~#a~0.base| .cse24) |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse25 (select (store .cse26 |c_~#a~0.base| .cse24) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse25 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse25 |t_funThread1of4ForFork0_~p~0#1.offset|))))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2699) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2701) |t_funThread4of4ForFork0_~p~0#1.offset|) 0))) .cse1) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2699 (Array Int Int)) (v_ArrVal_2695 Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2694 (Array Int Int)) (v_ArrVal_2701 Int) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|) (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= |t_funThread3of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|) (= (select (store (select (store (let ((.cse29 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store .cse5 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse5 |t_funThread1of4ForFork0_~p~0#1.offset|) 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2694))) (let ((.cse27 (store (select .cse29 |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2695))) (store (store |c_#memory_int| |c_~#a~0.base| .cse27) |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse28 (select (store .cse29 |c_~#a~0.base| .cse27) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse28 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse28 |t_funThread1of4ForFork0_~p~0#1.offset|))))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2699) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2701) |t_funThread4of4ForFork0_~p~0#1.offset|) 0))) (or .cse1 (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2699 (Array Int Int)) (v_ArrVal_2695 Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2694 (Array Int Int)) (v_ArrVal_2701 Int) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|) (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|) (= (select (store (select (store (let ((.cse32 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store .cse5 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse5 |t_funThread1of4ForFork0_~p~0#1.offset|) 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2694))) (let ((.cse30 (store (select .cse32 |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2695))) (store (store |c_#memory_int| |c_~#a~0.base| .cse30) |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse31 (select (store .cse32 |c_~#a~0.base| .cse30) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse31 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse31 |t_funThread1of4ForFork0_~p~0#1.offset|))))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2699) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2701) |t_funThread4of4ForFork0_~p~0#1.offset|) 0)))))) (or .cse0 (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2699 (Array Int Int)) (v_ArrVal_2695 Int) (v_ArrVal_2694 (Array Int Int)) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2701 Int) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|) (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= |t_funThread3of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|) (= (select (store (select (store (let ((.cse35 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store .cse5 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse5 |t_funThread1of4ForFork0_~p~0#1.offset|) 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2694))) (let ((.cse33 (store (select .cse35 |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2695))) (store (store |c_#memory_int| |c_~#a~0.base| .cse33) |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse34 (select (store .cse35 |c_~#a~0.base| .cse33) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse34 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse34 |t_funThread1of4ForFork0_~p~0#1.offset|))))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2699) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2701) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread2of4ForFork0_~p~0#1.offset|)))) (forall ((|t_funThread1of4ForFork0_~p~0#1.offset| Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int)) (or (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int)) (or (forall ((v_ArrVal_2699 (Array Int Int)) (v_ArrVal_2695 Int) (v_ArrVal_2694 (Array Int Int)) (v_ArrVal_2701 Int) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= |t_funThread3of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= (select (store (select (store (let ((.cse38 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store .cse5 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse5 |t_funThread1of4ForFork0_~p~0#1.offset|) 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2694))) (let ((.cse36 (store (select .cse38 |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2695))) (store (store |c_#memory_int| |c_~#a~0.base| .cse36) |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse37 (select (store .cse38 |c_~#a~0.base| .cse36) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse37 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse37 |t_funThread1of4ForFork0_~p~0#1.offset|))))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2699) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2701) |t_funThread4of4ForFork0_~p~0#1.offset|) 0))) (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|) (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|))) (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread2of4ForFork0_~p~0#1.offset|))))) is different from false [2023-12-02 20:41:37,683 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#a~0.base|))) (and (or (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2699 (Array Int Int)) (v_ArrVal_2695 Int) (v_ArrVal_2694 (Array Int Int)) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2701 Int) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|) (= (select (store (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse0 (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse1 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse1 |t_funThread1of4ForFork0_~p~0#1.offset|) 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2694) |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2695))) (store .cse0 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse0 |t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2699) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2701) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|) (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread2of4ForFork0_~p~0#1.offset|))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((|t_funThread1of4ForFork0_~p~0#1.offset| Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int)) (or (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int)) (or (forall ((v_ArrVal_2699 (Array Int Int)) (v_ArrVal_2695 Int) (v_ArrVal_2694 (Array Int Int)) (v_ArrVal_2701 Int) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= (select (store (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse2 (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store .cse1 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse1 |t_funThread1of4ForFork0_~p~0#1.offset|) 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2694) |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2695))) (store .cse2 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse2 |t_funThread1of4ForFork0_~p~0#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2699) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2701) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|) (= |t_funThread3of4ForFork0_~p~0#1.offset| |t_funThread4of4ForFork0_~p~0#1.offset|))) (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|) (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|))) (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread2of4ForFork0_~p~0#1.offset|))))) is different from false [2023-12-02 20:42:21,214 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 11 refuted. 5 times theorem prover too weak. 55 trivial. 6 not checked. [2023-12-02 20:42:21,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140754409] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 20:42:21,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 20:42:21,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 18, 20] total 63 [2023-12-02 20:42:21,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637472526] [2023-12-02 20:42:21,215 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 20:42:21,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2023-12-02 20:42:21,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-02 20:42:21,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2023-12-02 20:42:21,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=296, Invalid=3270, Unknown=106, NotChecked=360, Total=4032 [2023-12-02 20:42:21,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:42:21,217 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-12-02 20:42:21,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 3.15625) internal successors, (202), 63 states have internal predecessors, (202), 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:42:21,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:42:21,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-12-02 20:42:21,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-12-02 20:42:21,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2023-12-02 20:42:21,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2023-12-02 20:42:21,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-12-02 20:42:21,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 44 states. [2023-12-02 20:42:21,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 63 states. [2023-12-02 20:42:21,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2023-12-02 20:42:21,218 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-12-02 20:42:35,467 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:42:38,558 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:42:40,594 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:42:42,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:42:43,631 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|)) (.cse8 (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread1of4ForFork0_~p~0#1.offset|))) (let ((.cse10 (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_t_funThread2of4ForFork0_~p~0#1.base|)) (.cse11 (= |c_t_funThread4of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|)) (.cse9 (select |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base|)) (.cse7 (not .cse8)) (.cse5 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store .cse6 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse6 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) (.cse0 (select |c_#pthreadsMutex| |c_~#a~0.base|))) (and (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2699 (Array Int Int)) (v_ArrVal_2695 Int) (v_ArrVal_2694 (Array Int Int)) (v_ArrVal_2693 (Array Int Int)) (v_ArrVal_2701 Int) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (let ((.cse1 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4))) (or (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse0 .cse1 1)) |c_~#__global_lock~0.base| v_ArrVal_2693) |c_~#a~0.base|) (+ |t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)) (not (= (select .cse0 .cse1) 0)) (= (select (store (select (store (let ((.cse4 (store .cse5 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2694))) (let ((.cse2 (store (select .cse4 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2695))) (store (store |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base| .cse2) |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse3 (select (store .cse4 |c_t_funThread2of4ForFork0_~p~0#1.base| .cse2) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse3 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse3 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2699) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2701) |t_funThread4of4ForFork0_~p~0#1.offset|) 0)))) (or (= (select .cse6 |c_t_funThread3of4ForFork0_~p~0#1.offset|) 0) .cse7) (or .cse8 (and (= (select .cse9 |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) .cse10 .cse11)) .cse11 (or (and (= (select .cse9 |c_t_funThread3of4ForFork0_~p~0#1.offset|) 0) .cse10 .cse11 (= (select .cse9 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)) .cse7) (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (not (= |c_t_funThread3of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (not (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2699 (Array Int Int)) (v_ArrVal_2695 Int) (v_ArrVal_2694 (Array Int Int)) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2693 (Array Int Int)) (v_ArrVal_2701 Int) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (let ((.cse17 (+ |t_funThread2of4ForFork0_~p~0#1.offset| 4))) (let ((.cse12 (store .cse0 .cse17 1)) (.cse13 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4))) (or (not (= (select .cse12 .cse13) 0)) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse12 .cse13 1)) |c_~#__global_lock~0.base| v_ArrVal_2693) |c_~#a~0.base|) (+ |t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)) (= (select (store (select (store (let ((.cse16 (store .cse5 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2694))) (let ((.cse14 (store (select .cse16 |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2695))) (store (store |c_#memory_int| |c_~#a~0.base| .cse14) |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse15 (select (store .cse16 |c_~#a~0.base| .cse14) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse15 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse15 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2699) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2701) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (not (= (select .cse0 .cse17) 0)))))) (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread3of4ForFork0_~p~0#1.offset|)) (= (select .cse6 |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)))) is different from false [2023-12-02 20:42:48,335 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread1of4ForFork0_~p~0#1.offset|))) (let ((.cse8 (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_t_funThread2of4ForFork0_~p~0#1.base|)) (.cse9 (= |c_t_funThread4of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|)) (.cse7 (select |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base|)) (.cse5 (not .cse6)) (.cse4 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (and (forall ((v_ArrVal_2699 (Array Int Int)) (v_ArrVal_2695 Int) (v_ArrVal_2694 (Array Int Int)) (v_ArrVal_2693 (Array Int Int)) (v_ArrVal_2701 Int) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2693) |c_~#a~0.base|) (+ |t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)) (= (select (select (let ((.cse0 (store (let ((.cse3 (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store .cse4 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse4 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2694))) (let ((.cse1 (store (select .cse3 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2695))) (store (store |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base| .cse1) |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse2 (select (store .cse3 |c_t_funThread2of4ForFork0_~p~0#1.base| .cse1) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse2 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse2 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2699))) (store .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2701))) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0))) (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|) (or (= (select .cse4 |c_t_funThread3of4ForFork0_~p~0#1.offset|) 0) .cse5) (or .cse6 (and (= (select .cse7 |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) .cse8 .cse9)) .cse9 (or (and (= (select .cse7 |c_t_funThread3of4ForFork0_~p~0#1.offset|) 0) .cse8 .cse9 (= (select .cse7 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)) .cse5) (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (not (= |c_t_funThread3of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (not (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread3of4ForFork0_~p~0#1.offset|)) (= (select .cse4 |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)))) is different from false [2023-12-02 20:42:49,505 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|)) (.cse12 (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread1of4ForFork0_~p~0#1.offset|))) (let ((.cse14 (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_t_funThread2of4ForFork0_~p~0#1.base|)) (.cse15 (= |c_t_funThread4of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|)) (.cse13 (select |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base|)) (.cse11 (not .cse12)) (.cse4 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store .cse10 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse10 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) (.cse5 (select |c_#pthreadsMutex| |c_~#a~0.base|))) (and (forall ((v_ArrVal_2699 (Array Int Int)) (v_ArrVal_2695 Int) (v_ArrVal_2694 (Array Int Int)) (v_ArrVal_2693 (Array Int Int)) (v_ArrVal_2701 Int) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2693) |c_~#a~0.base|) (+ |t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)) (= (select (select (let ((.cse0 (store (let ((.cse3 (store .cse4 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2694))) (let ((.cse1 (store (select .cse3 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2695))) (store (store |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base| .cse1) |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse2 (select (store .cse3 |c_t_funThread2of4ForFork0_~p~0#1.base| .cse1) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse2 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse2 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2699))) (store .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2701))) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0))) (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2699 (Array Int Int)) (v_ArrVal_2695 Int) (v_ArrVal_2694 (Array Int Int)) (v_ArrVal_2693 (Array Int Int)) (v_ArrVal_2701 Int) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (let ((.cse6 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4))) (or (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse5 .cse6 1)) |c_~#__global_lock~0.base| v_ArrVal_2693) |c_~#a~0.base|) (+ |t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)) (not (= (select .cse5 .cse6) 0)) (= (select (store (select (store (let ((.cse9 (store .cse4 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2694))) (let ((.cse7 (store (select .cse9 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2695))) (store (store |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base| .cse7) |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse8 (select (store .cse9 |c_t_funThread2of4ForFork0_~p~0#1.base| .cse7) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse8 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse8 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2699) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2701) |t_funThread4of4ForFork0_~p~0#1.offset|) 0)))) (or (= (select .cse10 |c_t_funThread3of4ForFork0_~p~0#1.offset|) 0) .cse11) (or .cse12 (and (= (select .cse13 |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) .cse14 .cse15)) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int)) (let ((.cse20 (select |c_#pthreadsMutex| |c_t_funThread3of4ForFork0_~p~0#1.base|)) (.cse21 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4))) (or (forall ((v_ArrVal_2699 (Array Int Int)) (v_ArrVal_2695 Int) (v_ArrVal_2694 (Array Int Int)) (v_ArrVal_2693 (Array Int Int)) (v_ArrVal_2701 Int) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= (select (select (let ((.cse16 (store (let ((.cse19 (store .cse4 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2694))) (let ((.cse17 (store (select .cse19 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2695))) (store (store |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base| .cse17) |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse18 (select (store .cse19 |c_t_funThread2of4ForFork0_~p~0#1.base| .cse17) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse18 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse18 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2699))) (store .cse16 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse16 |c_t_funThread3of4ForFork0_~p~0#1.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2701))) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_t_funThread3of4ForFork0_~p~0#1.base| (store .cse20 .cse21 1)) |c_~#__global_lock~0.base| v_ArrVal_2693) |c_~#a~0.base|) (+ |t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)))) (not (= (select .cse20 .cse21) 0))))) (= |c_t_funThread4of4ForFork0_~p~0#1.base| 4) .cse15 (or (and (= (select .cse13 |c_t_funThread3of4ForFork0_~p~0#1.offset|) 0) .cse14 .cse15 (= (select .cse13 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)) .cse11) (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (not (= |c_t_funThread3of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (exists ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int)) (let ((.cse25 (select |c_#memory_int| 4))) (let ((.cse23 ((as const (Array Int Int)) 0)) (.cse22 (select .cse25 |t_funThread1of4ForFork0_~p~0#1.offset|))) (let ((.cse24 (store (store .cse23 |t_funThread2of4ForFork0_~p~0#1.offset| (select .cse25 |t_funThread2of4ForFork0_~p~0#1.offset|)) |t_funThread1of4ForFork0_~p~0#1.offset| .cse22))) (and (not (= |t_funThread3of4ForFork0_~p~0#1.offset| |c_t_funThread4of4ForFork0_~p~0#1.offset|)) (not (= |t_funThread2of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|)) (not (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread3of4ForFork0_~p~0#1.offset|)) (not (= |t_funThread1of4ForFork0_~p~0#1.offset| |c_t_funThread4of4ForFork0_~p~0#1.offset|)) (= (+ .cse22 1) (select (store (store .cse23 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse23 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)) |t_funThread2of4ForFork0_~p~0#1.offset| (select .cse24 |t_funThread2of4ForFork0_~p~0#1.offset|)) |t_funThread1of4ForFork0_~p~0#1.offset|)) (= (store .cse24 |t_funThread3of4ForFork0_~p~0#1.offset| (select .cse25 |t_funThread3of4ForFork0_~p~0#1.offset|)) .cse25) (not (= |t_funThread2of4ForFork0_~p~0#1.offset| |c_t_funThread4of4ForFork0_~p~0#1.offset|))))))) (forall ((|t_funThread2of4ForFork0_~p~0#1.offset| Int)) (let ((.cse32 (select |c_#pthreadsMutex| |c_t_funThread2of4ForFork0_~p~0#1.base|)) (.cse33 (+ |t_funThread2of4ForFork0_~p~0#1.offset| 4))) (or (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2699 (Array Int Int)) (v_ArrVal_2695 Int) (v_ArrVal_2694 (Array Int Int)) (v_ArrVal_2693 (Array Int Int)) (v_ArrVal_2701 Int) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (let ((.cse26 (store |c_#pthreadsMutex| |c_t_funThread2of4ForFork0_~p~0#1.base| (store .cse32 .cse33 1)))) (let ((.cse27 (select .cse26 |c_~#a~0.base|)) (.cse28 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4))) (or (not (= 0 (select (select (store (store .cse26 |c_~#a~0.base| (store .cse27 .cse28 1)) |c_~#__global_lock~0.base| v_ArrVal_2693) |c_~#a~0.base|) (+ |t_funThread4of4ForFork0_~p~0#1.offset| 4)))) (not (= (select .cse27 .cse28) 0)) (= (select (store (select (store (let ((.cse31 (store .cse4 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2694))) (let ((.cse29 (store (select .cse31 |c_t_funThread2of4ForFork0_~p~0#1.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2695))) (store (store |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base| .cse29) |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse30 (select (store .cse31 |c_t_funThread2of4ForFork0_~p~0#1.base| .cse29) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse30 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse30 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2699) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2701) |t_funThread4of4ForFork0_~p~0#1.offset|) 0))))) (not (= (select .cse32 .cse33) 0))))) (not (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2699 (Array Int Int)) (v_ArrVal_2695 Int) (v_ArrVal_2694 (Array Int Int)) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2693 (Array Int Int)) (v_ArrVal_2701 Int) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (let ((.cse39 (+ |t_funThread2of4ForFork0_~p~0#1.offset| 4))) (let ((.cse34 (store .cse5 .cse39 1)) (.cse35 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4))) (or (not (= (select .cse34 .cse35) 0)) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse34 .cse35 1)) |c_~#__global_lock~0.base| v_ArrVal_2693) |c_~#a~0.base|) (+ |t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)) (= (select (store (select (store (let ((.cse38 (store .cse4 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2694))) (let ((.cse36 (store (select .cse38 |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2695))) (store (store |c_#memory_int| |c_~#a~0.base| .cse36) |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse37 (select (store .cse38 |c_~#a~0.base| .cse36) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse37 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse37 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2699) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2701) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (not (= (select .cse5 .cse39) 0)))))) (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread3of4ForFork0_~p~0#1.offset|)) (= (select .cse10 |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)))) is different from false [2023-12-02 20:42:58,933 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] [2023-12-02 20:42:59,003 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|)) (.cse19 (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread1of4ForFork0_~p~0#1.offset|))) (let ((.cse20 (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_t_funThread2of4ForFork0_~p~0#1.base|)) (.cse21 (= |c_t_funThread4of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|)) (.cse15 (not .cse19)) (.cse8 (select |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base|)) (.cse4 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store .cse14 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse14 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) (.cse9 (select |c_#pthreadsMutex| |c_~#a~0.base|))) (and (forall ((v_ArrVal_2699 (Array Int Int)) (v_ArrVal_2695 Int) (v_ArrVal_2694 (Array Int Int)) (v_ArrVal_2693 (Array Int Int)) (v_ArrVal_2701 Int) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2693) |c_~#a~0.base|) (+ |t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)) (= (select (select (let ((.cse0 (store (let ((.cse3 (store .cse4 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2694))) (let ((.cse1 (store (select .cse3 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2695))) (store (store |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base| .cse1) |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse2 (select (store .cse3 |c_t_funThread2of4ForFork0_~p~0#1.base| .cse1) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse2 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse2 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2699))) (store .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2701))) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0))) (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (forall ((v_ArrVal_2699 (Array Int Int)) (v_ArrVal_2695 Int) (v_ArrVal_2701 Int) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= (select (select (let ((.cse5 (store (let ((.cse6 (store |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base| (store .cse8 |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2695)))) (store .cse6 |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse7 (select .cse6 |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse7 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse7 |c_t_funThread1of4ForFork0_~p~0#1.offset|) (- 1)))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2699))) (store .cse5 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse5 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2701))) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (not (= (select .cse9 (+ |t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)))) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2699 (Array Int Int)) (v_ArrVal_2695 Int) (v_ArrVal_2694 (Array Int Int)) (v_ArrVal_2693 (Array Int Int)) (v_ArrVal_2701 Int) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (let ((.cse10 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4))) (or (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse9 .cse10 1)) |c_~#__global_lock~0.base| v_ArrVal_2693) |c_~#a~0.base|) (+ |t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)) (not (= (select .cse9 .cse10) 0)) (= (select (store (select (store (let ((.cse13 (store .cse4 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2694))) (let ((.cse11 (store (select .cse13 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2695))) (store (store |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base| .cse11) |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse12 (select (store .cse13 |c_t_funThread2of4ForFork0_~p~0#1.base| .cse11) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse12 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse12 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2699) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2701) |t_funThread4of4ForFork0_~p~0#1.offset|) 0)))) (or (= (select .cse14 |c_t_funThread3of4ForFork0_~p~0#1.offset|) 0) .cse15) (exists ((|t_funThread1of4ForFork0_~p~0#1.offset| Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int)) (and (not (= |t_funThread2of4ForFork0_~p~0#1.offset| |c_t_funThread3of4ForFork0_~p~0#1.offset|)) (not (= |t_funThread1of4ForFork0_~p~0#1.offset| |c_t_funThread3of4ForFork0_~p~0#1.offset|)) (not (= |t_funThread1of4ForFork0_~p~0#1.offset| |c_t_funThread4of4ForFork0_~p~0#1.offset|)) (not (= |t_funThread2of4ForFork0_~p~0#1.offset| |c_t_funThread4of4ForFork0_~p~0#1.offset|)) (let ((.cse18 (select |c_#memory_int| 4))) (= (let ((.cse16 ((as const (Array Int Int)) 0)) (.cse17 (select .cse18 |t_funThread2of4ForFork0_~p~0#1.offset|))) (store (store .cse16 |t_funThread2of4ForFork0_~p~0#1.offset| .cse17) |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select (store (store .cse16 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse16 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)) |t_funThread2of4ForFork0_~p~0#1.offset| .cse17) |t_funThread1of4ForFork0_~p~0#1.offset|)))) .cse18)))) (or .cse19 (and (= (select .cse8 |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) .cse20 .cse21)) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int)) (let ((.cse26 (select |c_#pthreadsMutex| |c_t_funThread3of4ForFork0_~p~0#1.base|)) (.cse27 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4))) (or (forall ((v_ArrVal_2699 (Array Int Int)) (v_ArrVal_2695 Int) (v_ArrVal_2694 (Array Int Int)) (v_ArrVal_2693 (Array Int Int)) (v_ArrVal_2701 Int) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= (select (select (let ((.cse22 (store (let ((.cse25 (store .cse4 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2694))) (let ((.cse23 (store (select .cse25 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2695))) (store (store |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base| .cse23) |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse24 (select (store .cse25 |c_t_funThread2of4ForFork0_~p~0#1.base| .cse23) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse24 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse24 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2699))) (store .cse22 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse22 |c_t_funThread3of4ForFork0_~p~0#1.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2701))) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_t_funThread3of4ForFork0_~p~0#1.base| (store .cse26 .cse27 1)) |c_~#__global_lock~0.base| v_ArrVal_2693) |c_~#a~0.base|) (+ |t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)))) (not (= (select .cse26 .cse27) 0))))) (= |c_t_funThread4of4ForFork0_~p~0#1.base| 4) .cse21 (or (and (= (select .cse8 |c_t_funThread3of4ForFork0_~p~0#1.offset|) 0) .cse20 .cse21 (= (select .cse8 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)) .cse15) (forall ((v_ArrVal_2699 (Array Int Int)) (v_ArrVal_2695 Int) (v_ArrVal_2694 (Array Int Int)) (v_ArrVal_2701 Int) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (= (select (select (let ((.cse28 (store (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2694))) (let ((.cse29 (store (select .cse31 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2695))) (store (store |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base| .cse29) |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse30 (select (store .cse31 |c_t_funThread2of4ForFork0_~p~0#1.base| .cse29) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse30 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse30 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2699))) (store .cse28 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse28 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2701))) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (not (= (select .cse9 (+ |t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)))) (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (not (= |c_t_funThread3of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (forall ((v_ArrVal_2699 (Array Int Int)) (v_ArrVal_2695 Int) (v_ArrVal_2694 (Array Int Int)) (v_ArrVal_2693 (Array Int Int)) (v_ArrVal_2701 Int) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2693) |c_~#a~0.base|) (+ |t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)) (= (select (select (let ((.cse32 (store (let ((.cse35 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2694))) (let ((.cse33 (store (select .cse35 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2695))) (store (store |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base| .cse33) |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse34 (select (store .cse35 |c_t_funThread2of4ForFork0_~p~0#1.base| .cse33) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse34 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse34 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2699))) (store .cse32 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse32 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2701))) |c_~#a~0.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0))) (= |c_t_funThread3of4ForFork0_~p~0#1.base| 4) (forall ((|t_funThread2of4ForFork0_~p~0#1.offset| Int)) (let ((.cse42 (select |c_#pthreadsMutex| |c_t_funThread2of4ForFork0_~p~0#1.base|)) (.cse43 (+ |t_funThread2of4ForFork0_~p~0#1.offset| 4))) (or (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2699 (Array Int Int)) (v_ArrVal_2695 Int) (v_ArrVal_2694 (Array Int Int)) (v_ArrVal_2693 (Array Int Int)) (v_ArrVal_2701 Int) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (let ((.cse36 (store |c_#pthreadsMutex| |c_t_funThread2of4ForFork0_~p~0#1.base| (store .cse42 .cse43 1)))) (let ((.cse37 (select .cse36 |c_~#a~0.base|)) (.cse38 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4))) (or (not (= 0 (select (select (store (store .cse36 |c_~#a~0.base| (store .cse37 .cse38 1)) |c_~#__global_lock~0.base| v_ArrVal_2693) |c_~#a~0.base|) (+ |t_funThread4of4ForFork0_~p~0#1.offset| 4)))) (not (= (select .cse37 .cse38) 0)) (= (select (store (select (store (let ((.cse41 (store .cse4 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2694))) (let ((.cse39 (store (select .cse41 |c_t_funThread2of4ForFork0_~p~0#1.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2695))) (store (store |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base| .cse39) |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse40 (select (store .cse41 |c_t_funThread2of4ForFork0_~p~0#1.base| .cse39) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse40 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse40 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2699) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2701) |t_funThread4of4ForFork0_~p~0#1.offset|) 0))))) (not (= (select .cse42 .cse43) 0))))) (not (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (forall ((|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (or (forall ((v_ArrVal_2699 (Array Int Int)) (v_ArrVal_2695 Int) (v_ArrVal_2701 Int)) (= (select (select (let ((.cse44 (store (let ((.cse45 (store |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base| (store .cse8 |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2695)))) (store .cse45 |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse46 (select .cse45 |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse46 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse46 |c_t_funThread1of4ForFork0_~p~0#1.offset|) (- 1)))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2699))) (store .cse44 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse44 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2701))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (not (= (select (select |c_#pthreadsMutex| |c_t_funThread4of4ForFork0_~p~0#1.base|) (+ |t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)))) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2699 (Array Int Int)) (v_ArrVal_2695 Int) (v_ArrVal_2694 (Array Int Int)) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2693 (Array Int Int)) (v_ArrVal_2701 Int) (|t_funThread4of4ForFork0_~p~0#1.offset| Int)) (let ((.cse52 (+ |t_funThread2of4ForFork0_~p~0#1.offset| 4))) (let ((.cse47 (store .cse9 .cse52 1)) (.cse48 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4))) (or (not (= (select .cse47 .cse48) 0)) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse47 .cse48 1)) |c_~#__global_lock~0.base| v_ArrVal_2693) |c_~#a~0.base|) (+ |t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)) (= (select (store (select (store (let ((.cse51 (store .cse4 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2694))) (let ((.cse49 (store (select .cse51 |c_~#a~0.base|) |t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2695))) (store (store |c_#memory_int| |c_~#a~0.base| .cse49) |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse50 (select (store .cse51 |c_~#a~0.base| .cse49) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse50 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse50 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2699) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2701) |t_funThread4of4ForFork0_~p~0#1.offset|) 0) (not (= (select .cse9 .cse52) 0)))))) (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread3of4ForFork0_~p~0#1.offset|)) (= (select .cse14 |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)))) is different from false [2023-12-02 20:43:05,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:43:07,434 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:43:09,449 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:43:13,852 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:43:15,873 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:43:22,297 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:43:24,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:43:25,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 20:43:28,527 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:43:30,562 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:43:35,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] [2023-12-02 20:43:44,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:43:46,432 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:43:47,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:43:49,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 20:43:52,372 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:43:54,735 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:43:56,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s 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:04,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1]