./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/pthread-ext/04_incdec_cas.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20174008 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/pthread-ext/04_incdec_cas.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a9295efc0d8bacfc5fb202511f0d3721ae5554ffb4def47cf5dbf45088356869 --- Real Ultimate output --- This is Ultimate 0.2.3-?-2017400-m [2023-11-24 08:04:58,934 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 08:04:58,988 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2023-11-24 08:04:58,991 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 08:04:58,991 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 08:04:59,005 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 08:04:59,005 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 08:04:59,006 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 08:04:59,006 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 08:04:59,006 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 08:04:59,007 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 08:04:59,007 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 08:04:59,007 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 08:04:59,008 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 08:04:59,008 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-24 08:04:59,008 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 08:04:59,009 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-24 08:04:59,009 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 08:04:59,009 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 08:04:59,009 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-24 08:04:59,010 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 08:04:59,010 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-24 08:04:59,010 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 08:04:59,011 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-24 08:04:59,011 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 08:04:59,011 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 08:04:59,012 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 08:04:59,012 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 08:04:59,012 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 08:04:59,012 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 08:04:59,013 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 08:04:59,013 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 08:04:59,013 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-24 08:04:59,013 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-24 08:04:59,014 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2023-11-24 08:04:59,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-24 08:04:59,014 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 08:04:59,014 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-24 08:04:59,015 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-24 08:04:59,015 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-24 08:04:59,015 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-11-24 08:04:59,020 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> a9295efc0d8bacfc5fb202511f0d3721ae5554ffb4def47cf5dbf45088356869 [2023-11-24 08:04:59,253 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 08:04:59,280 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 08:04:59,282 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 08:04:59,283 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 08:04:59,283 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 08:04:59,284 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-ext/04_incdec_cas.i [2023-11-24 08:05:00,339 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 08:05:00,558 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 08:05:00,567 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/04_incdec_cas.i [2023-11-24 08:05:00,577 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/8f7da752c/8c7f25a1f5664db1bc4e6789562902d3/FLAGd4f6fe205 [2023-11-24 08:05:00,591 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/8f7da752c/8c7f25a1f5664db1bc4e6789562902d3 [2023-11-24 08:05:00,593 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 08:05:00,594 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 08:05:00,595 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 08:05:00,595 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 08:05:00,599 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 08:05:00,600 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 08:05:00" (1/1) ... [2023-11-24 08:05:00,601 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56d6e77b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:05:00, skipping insertion in model container [2023-11-24 08:05:00,602 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 08:05:00" (1/1) ... [2023-11-24 08:05:00,655 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 08:05:00,948 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/04_incdec_cas.i[30369,30382] [2023-11-24 08:05:00,958 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/04_incdec_cas.i[30869,30882] [2023-11-24 08:05:00,965 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 08:05:00,974 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 08:05:01,010 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/04_incdec_cas.i[30369,30382] [2023-11-24 08:05:01,039 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/04_incdec_cas.i[30869,30882] [2023-11-24 08:05:01,042 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 08:05:01,072 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 08:05:01,073 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 08:05:01,078 INFO L206 MainTranslator]: Completed translation [2023-11-24 08:05:01,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:05:01 WrapperNode [2023-11-24 08:05:01,079 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 08:05:01,080 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 08:05:01,080 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 08:05:01,080 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 08:05:01,105 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:05:01" (1/1) ... [2023-11-24 08:05:01,132 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:05:01" (1/1) ... [2023-11-24 08:05:01,162 INFO L138 Inliner]: procedures = 174, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 162 [2023-11-24 08:05:01,163 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 08:05:01,163 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 08:05:01,163 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 08:05:01,163 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 08:05:01,171 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:05:01" (1/1) ... [2023-11-24 08:05:01,171 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:05:01" (1/1) ... [2023-11-24 08:05:01,175 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:05:01" (1/1) ... [2023-11-24 08:05:01,176 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:05:01" (1/1) ... [2023-11-24 08:05:01,188 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:05:01" (1/1) ... [2023-11-24 08:05:01,190 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:05:01" (1/1) ... [2023-11-24 08:05:01,191 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:05:01" (1/1) ... [2023-11-24 08:05:01,192 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:05:01" (1/1) ... [2023-11-24 08:05:01,194 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 08:05:01,195 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 08:05:01,195 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 08:05:01,195 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 08:05:01,195 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:05:01" (1/1) ... [2023-11-24 08:05:01,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 08:05:01,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 08:05:01,223 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-24 08:05:01,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-24 08:05:01,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-24 08:05:01,303 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-24 08:05:01,303 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-24 08:05:01,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-24 08:05:01,303 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-24 08:05:01,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 08:05:01,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 08:05:01,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 08:05:01,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-24 08:05:01,306 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-24 08:05:01,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 08:05:01,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 08:05:01,307 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-24 08:05:01,415 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 08:05:01,417 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 08:05:01,662 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 08:05:01,828 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 08:05:01,828 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-24 08:05:01,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 08:05:01 BoogieIcfgContainer [2023-11-24 08:05:01,829 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 08:05:01,830 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 08:05:01,830 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 08:05:01,833 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 08:05:01,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 08:05:00" (1/3) ... [2023-11-24 08:05:01,834 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b564864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 08:05:01, skipping insertion in model container [2023-11-24 08:05:01,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:05:01" (2/3) ... [2023-11-24 08:05:01,834 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b564864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 08:05:01, skipping insertion in model container [2023-11-24 08:05:01,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 08:05:01" (3/3) ... [2023-11-24 08:05:01,835 INFO L112 eAbstractionObserver]: Analyzing ICFG 04_incdec_cas.i [2023-11-24 08:05:01,852 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-24 08:05:01,860 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 08:05:01,860 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-24 08:05:01,860 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 08:05:01,911 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 08:05:01,944 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 08:05:01,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-24 08:05:01,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 08:05:01,946 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-24 08:05:01,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-11-24 08:05:02,029 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-24 08:05:02,039 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2023-11-24 08:05:02,044 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;@43d0204, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 08:05:02,044 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-24 08:05:02,149 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 08:05:02,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:05:02,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1020178203, now seen corresponding path program 1 times [2023-11-24 08:05:02,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 08:05:02,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268687208] [2023-11-24 08:05:02,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:05:02,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 08:05:02,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:05:02,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 08:05:02,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 08:05:02,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268687208] [2023-11-24 08:05:02,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268687208] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 08:05:02,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 08:05:02,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 08:05:02,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446388472] [2023-11-24 08:05:02,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 08:05:02,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-24 08:05:02,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 08:05:02,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-24 08:05:02,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-24 08:05:02,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:02,329 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:05:02,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-11-24 08:05:02,330 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:02,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:02,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-24 08:05:02,430 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 08:05:02,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:05:02,431 INFO L85 PathProgramCache]: Analyzing trace with hash 960673530, now seen corresponding path program 1 times [2023-11-24 08:05:02,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 08:05:02,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461765757] [2023-11-24 08:05:02,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:05:02,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 08:05:02,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:05:02,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 08:05:02,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 08:05:02,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461765757] [2023-11-24 08:05:02,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461765757] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 08:05:02,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 08:05:02,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 08:05:02,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721969070] [2023-11-24 08:05:02,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 08:05:02,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 08:05:02,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 08:05:02,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 08:05:02,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-24 08:05:02,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:02,742 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:05:02,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 08:05:02,742 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:02,743 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:02,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:02,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:05:02,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-24 08:05:02,961 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 08:05:02,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:05:02,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1530439684, now seen corresponding path program 1 times [2023-11-24 08:05:02,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 08:05:02,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444637518] [2023-11-24 08:05:02,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:05:02,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 08:05:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:05:03,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 08:05:03,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 08:05:03,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444637518] [2023-11-24 08:05:03,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444637518] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 08:05:03,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 08:05:03,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-24 08:05:03,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103197617] [2023-11-24 08:05:03,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 08:05:03,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-24 08:05:03,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-24 08:05:03,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-24 08:05:03,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-24 08:05:03,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:03,450 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:05:03,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 9 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-11-24 08:05:03,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:03,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:05:03,451 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:03,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:03,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:05:03,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:05:03,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-24 08:05:03,672 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 08:05:03,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:05:03,672 INFO L85 PathProgramCache]: Analyzing trace with hash -198990446, now seen corresponding path program 2 times [2023-11-24 08:05:03,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-24 08:05:03,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454360403] [2023-11-24 08:05:03,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:05:03,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-24 08:05:03,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:05:04,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 08:05:04,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-24 08:05:04,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454360403] [2023-11-24 08:05:04,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454360403] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-24 08:05:04,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009939542] [2023-11-24 08:05:04,021 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 08:05:04,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 08:05:04,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 08:05:04,113 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-24 08:05:04,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-24 08:05:04,200 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-24 08:05:04,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 08:05:04,204 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-24 08:05:04,209 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 08:05:04,263 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-24 08:05:04,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 21 [2023-11-24 08:05:04,311 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 16 treesize of output 11 [2023-11-24 08:05:04,378 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-24 08:05:04,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 18 [2023-11-24 08:05:04,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 08:05:04,583 INFO L349 Elim1Store]: treesize reduction 116, result has 29.7 percent of original size [2023-11-24 08:05:04,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 4 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 118 treesize of output 268 [2023-11-24 08:05:04,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 15 [2023-11-24 08:05:04,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2023-11-24 08:05:04,771 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 08:05:04,786 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2023-11-24 08:05:04,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 68 treesize of output 50 [2023-11-24 08:05:04,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 16 [2023-11-24 08:05:04,866 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 08:05:04,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2023-11-24 08:05:04,872 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 5 treesize of output 3 [2023-11-24 08:05:05,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 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 69 [2023-11-24 08:05:05,079 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-24 08:05:05,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-24 08:05:05,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-24 08:05:05,293 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: no need to replace index at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructDerEnabler(DerPreprocessor.java:186) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:144) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:122) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:543) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:522) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:515) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:326) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:110) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-24 08:05:05,300 INFO L158 Benchmark]: Toolchain (without parser) took 4704.38ms. Allocated memory was 157.3MB in the beginning and 245.4MB in the end (delta: 88.1MB). Free memory was 100.3MB in the beginning and 200.9MB in the end (delta: -100.6MB). Peak memory consumption was 127.0MB. Max. memory is 16.1GB. [2023-11-24 08:05:05,302 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 117.4MB. Free memory is still 91.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-24 08:05:05,303 INFO L158 Benchmark]: CACSL2BoogieTranslator took 484.65ms. Allocated memory is still 157.3MB. Free memory was 99.9MB in the beginning and 121.1MB in the end (delta: -21.2MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. [2023-11-24 08:05:05,303 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.60ms. Allocated memory is still 157.3MB. Free memory was 121.1MB in the beginning and 119.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 08:05:05,303 INFO L158 Benchmark]: Boogie Preprocessor took 31.05ms. Allocated memory is still 157.3MB. Free memory was 119.0MB in the beginning and 116.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-24 08:05:05,304 INFO L158 Benchmark]: RCFGBuilder took 634.11ms. Allocated memory is still 157.3MB. Free memory was 116.9MB in the beginning and 72.9MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2023-11-24 08:05:05,309 INFO L158 Benchmark]: TraceAbstraction took 3467.66ms. Allocated memory was 157.3MB in the beginning and 245.4MB in the end (delta: 88.1MB). Free memory was 72.2MB in the beginning and 200.9MB in the end (delta: -128.8MB). Peak memory consumption was 97.9MB. Max. memory is 16.1GB. [2023-11-24 08:05:05,312 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 117.4MB. Free memory is still 91.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 484.65ms. Allocated memory is still 157.3MB. Free memory was 99.9MB in the beginning and 121.1MB in the end (delta: -21.2MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.60ms. Allocated memory is still 157.3MB. Free memory was 121.1MB in the beginning and 119.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.05ms. Allocated memory is still 157.3MB. Free memory was 119.0MB in the beginning and 116.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 634.11ms. Allocated memory is still 157.3MB. Free memory was 116.9MB in the beginning and 72.9MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * TraceAbstraction took 3467.66ms. Allocated memory was 157.3MB in the beginning and 245.4MB in the end (delta: 88.1MB). Free memory was 72.2MB in the beginning and 200.9MB in the end (delta: -128.8MB). Peak memory consumption was 97.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: no need to replace index de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: no need to replace index: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.constructReplacementForSelectCase(DerPreprocessor.java:331) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-24 08:05:05,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2023-11-24 08:05:05,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/pthread-ext/04_incdec_cas.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a9295efc0d8bacfc5fb202511f0d3721ae5554ffb4def47cf5dbf45088356869 --- Real Ultimate output --- This is Ultimate 0.2.3-?-2017400-m [2023-11-24 08:05:07,824 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-24 08:05:07,905 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf [2023-11-24 08:05:07,910 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-24 08:05:07,911 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-24 08:05:07,936 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-24 08:05:07,937 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-24 08:05:07,937 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-24 08:05:07,938 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-24 08:05:07,941 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-24 08:05:07,941 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-24 08:05:07,941 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-24 08:05:07,942 INFO L153 SettingsManager]: * Use SBE=true [2023-11-24 08:05:07,943 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-24 08:05:07,943 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-24 08:05:07,943 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-24 08:05:07,943 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-24 08:05:07,943 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-24 08:05:07,944 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-24 08:05:07,944 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-24 08:05:07,944 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-24 08:05:07,945 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-24 08:05:07,945 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-24 08:05:07,945 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-24 08:05:07,945 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-24 08:05:07,946 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-24 08:05:07,946 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-24 08:05:07,946 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-24 08:05:07,946 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-24 08:05:07,947 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-24 08:05:07,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 08:05:07,948 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-24 08:05:07,948 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-24 08:05:07,948 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-24 08:05:07,948 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-24 08:05:07,948 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2023-11-24 08:05:07,949 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-24 08:05:07,949 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-24 08:05:07,949 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2023-11-24 08:05:07,949 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-24 08:05:07,950 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2023-11-24 08:05:07,950 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2023-11-24 08:05:07,950 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-24 08:05:07,950 INFO L153 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> a9295efc0d8bacfc5fb202511f0d3721ae5554ffb4def47cf5dbf45088356869 [2023-11-24 08:05:08,206 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-24 08:05:08,228 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-24 08:05:08,230 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-24 08:05:08,231 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-24 08:05:08,232 INFO L274 PluginConnector]: CDTParser initialized [2023-11-24 08:05:08,233 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-ext/04_incdec_cas.i [2023-11-24 08:05:09,317 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-24 08:05:09,511 INFO L384 CDTParser]: Found 1 translation units. [2023-11-24 08:05:09,515 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/04_incdec_cas.i [2023-11-24 08:05:09,524 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/0f78d3683/e86d890a59834674901e387608532a08/FLAG4ea453a0a [2023-11-24 08:05:09,537 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/0f78d3683/e86d890a59834674901e387608532a08 [2023-11-24 08:05:09,539 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-24 08:05:09,540 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-24 08:05:09,541 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-24 08:05:09,541 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-24 08:05:09,545 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-24 08:05:09,546 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 08:05:09" (1/1) ... [2023-11-24 08:05:09,546 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15812d37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:05:09, skipping insertion in model container [2023-11-24 08:05:09,546 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 08:05:09" (1/1) ... [2023-11-24 08:05:09,594 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-24 08:05:09,957 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/04_incdec_cas.i[30369,30382] [2023-11-24 08:05:09,979 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/04_incdec_cas.i[30869,30882] [2023-11-24 08:05:09,984 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 08:05:09,998 INFO L202 MainTranslator]: Completed pre-run [2023-11-24 08:05:10,035 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/04_incdec_cas.i[30369,30382] [2023-11-24 08:05:10,044 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/04_incdec_cas.i[30869,30882] [2023-11-24 08:05:10,050 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-24 08:05:10,076 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 08:05:10,076 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-24 08:05:10,082 INFO L206 MainTranslator]: Completed translation [2023-11-24 08:05:10,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:05:10 WrapperNode [2023-11-24 08:05:10,082 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-24 08:05:10,083 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-24 08:05:10,084 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-24 08:05:10,084 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-24 08:05:10,089 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:05:10" (1/1) ... [2023-11-24 08:05:10,116 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:05:10" (1/1) ... [2023-11-24 08:05:10,143 INFO L138 Inliner]: procedures = 178, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 162 [2023-11-24 08:05:10,143 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-24 08:05:10,144 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-24 08:05:10,144 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-24 08:05:10,144 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-24 08:05:10,151 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:05:10" (1/1) ... [2023-11-24 08:05:10,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:05:10" (1/1) ... [2023-11-24 08:05:10,167 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:05:10" (1/1) ... [2023-11-24 08:05:10,168 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:05:10" (1/1) ... [2023-11-24 08:05:10,174 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:05:10" (1/1) ... [2023-11-24 08:05:10,184 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:05:10" (1/1) ... [2023-11-24 08:05:10,186 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:05:10" (1/1) ... [2023-11-24 08:05:10,189 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:05:10" (1/1) ... [2023-11-24 08:05:10,199 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-24 08:05:10,200 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-24 08:05:10,200 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-24 08:05:10,200 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-24 08:05:10,201 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:05:10" (1/1) ... [2023-11-24 08:05:10,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-24 08:05:10,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 08:05:10,230 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-24 08:05:10,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-24 08:05:10,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-24 08:05:10,279 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-24 08:05:10,280 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-24 08:05:10,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-24 08:05:10,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-24 08:05:10,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-24 08:05:10,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-24 08:05:10,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-24 08:05:10,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-24 08:05:10,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-11-24 08:05:10,281 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-24 08:05:10,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-24 08:05:10,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-24 08:05:10,282 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-24 08:05:10,405 INFO L241 CfgBuilder]: Building ICFG [2023-11-24 08:05:10,406 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-24 08:05:10,714 INFO L282 CfgBuilder]: Performing block encoding [2023-11-24 08:05:10,922 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-24 08:05:10,923 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-24 08:05:10,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 08:05:10 BoogieIcfgContainer [2023-11-24 08:05:10,924 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-24 08:05:10,925 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-24 08:05:10,926 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-24 08:05:10,928 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-24 08:05:10,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 08:05:09" (1/3) ... [2023-11-24 08:05:10,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@467066a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 08:05:10, skipping insertion in model container [2023-11-24 08:05:10,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 08:05:10" (2/3) ... [2023-11-24 08:05:10,930 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@467066a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 08:05:10, skipping insertion in model container [2023-11-24 08:05:10,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 08:05:10" (3/3) ... [2023-11-24 08:05:10,931 INFO L112 eAbstractionObserver]: Analyzing ICFG 04_incdec_cas.i [2023-11-24 08:05:10,937 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-24 08:05:10,945 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-24 08:05:10,945 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-24 08:05:10,945 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-24 08:05:10,999 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 08:05:11,033 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 08:05:11,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-24 08:05:11,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 08:05:11,035 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-24 08:05:11,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2023-11-24 08:05:11,075 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-24 08:05:11,084 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2023-11-24 08:05:11,106 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;@423037f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 08:05:11,116 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-24 08:05:11,250 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 08:05:11,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:05:11,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1020178203, now seen corresponding path program 1 times [2023-11-24 08:05:11,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 08:05:11,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1250227610] [2023-11-24 08:05:11,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:05:11,264 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:05:11,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2023-11-24 08:05:11,302 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 08:05:11,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-24 08:05:11,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:05:11,434 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-24 08:05:11,437 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 08:05:11,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 08:05:11,451 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 08:05:11,451 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 08:05:11,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1250227610] [2023-11-24 08:05:11,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1250227610] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 08:05:11,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 08:05:11,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 08:05:11,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501891110] [2023-11-24 08:05:11,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 08:05:11,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-24 08:05:11,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 08:05:11,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-24 08:05:11,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-24 08:05:11,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:11,481 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:05:11,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-11-24 08:05:11,482 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:11,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:11,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-24 08:05:11,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:05:11,877 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 08:05:11,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:05:11,877 INFO L85 PathProgramCache]: Analyzing trace with hash 960673530, now seen corresponding path program 1 times [2023-11-24 08:05:11,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 08:05:11,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [196310630] [2023-11-24 08:05:11,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:05:11,878 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:05:11,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2023-11-24 08:05:11,879 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 08:05:11,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-24 08:05:11,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:05:11,972 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-24 08:05:11,974 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 08:05:12,025 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-24 08:05:12,026 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 13 treesize of output 13 [2023-11-24 08:05:12,139 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 16 treesize of output 11 [2023-11-24 08:05:12,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 08:05:12,183 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 08:05:12,183 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 08:05:12,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [196310630] [2023-11-24 08:05:12,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [196310630] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 08:05:12,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 08:05:12,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 08:05:12,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580974226] [2023-11-24 08:05:12,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 08:05:12,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 08:05:12,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 08:05:12,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 08:05:12,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 08:05:12,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:12,186 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:05:12,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 08:05:12,186 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:12,187 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:13,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:13,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:05:13,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-24 08:05:13,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:05:13,762 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 08:05:13,762 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:05:13,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1530439684, now seen corresponding path program 1 times [2023-11-24 08:05:13,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 08:05:13,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [951551211] [2023-11-24 08:05:13,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:05:13,763 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:05:13,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2023-11-24 08:05:13,766 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 08:05:13,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-24 08:05:13,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:05:13,851 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-24 08:05:13,854 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 08:05:13,879 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-11-24 08:05:13,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 treesize of output 20 [2023-11-24 08:05:13,908 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 16 treesize of output 11 [2023-11-24 08:05:13,943 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-24 08:05:13,944 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 13 treesize of output 13 [2023-11-24 08:05:14,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 42 [2023-11-24 08:05:14,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-24 08:05:14,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 47 [2023-11-24 08:05:14,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 22 [2023-11-24 08:05:14,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2023-11-24 08:05:14,091 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2023-11-24 08:05:14,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2023-11-24 08:05:14,097 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 16 treesize of output 11 [2023-11-24 08:05:14,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 08:05:14,141 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 08:05:14,141 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 08:05:14,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [951551211] [2023-11-24 08:05:14,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [951551211] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 08:05:14,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 08:05:14,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-24 08:05:14,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684690845] [2023-11-24 08:05:14,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 08:05:14,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-24 08:05:14,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 08:05:14,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-24 08:05:14,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-24 08:05:14,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:14,144 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:05:14,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 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-11-24 08:05:14,144 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:14,145 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:05:14,145 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:14,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:14,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:05:14,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:05:14,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-11-24 08:05:14,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:05:14,699 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 08:05:14,700 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:05:14,700 INFO L85 PathProgramCache]: Analyzing trace with hash -198990446, now seen corresponding path program 2 times [2023-11-24 08:05:14,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 08:05:14,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1731480168] [2023-11-24 08:05:14,700 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 08:05:14,701 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:05:14,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2023-11-24 08:05:14,702 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 08:05:14,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-24 08:05:14,784 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-24 08:05:14,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 08:05:14,786 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-24 08:05:14,788 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 08:05:14,808 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2023-11-24 08:05:14,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 treesize of output 20 [2023-11-24 08:05:14,848 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 16 treesize of output 11 [2023-11-24 08:05:14,933 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-24 08:05:14,934 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 13 treesize of output 13 [2023-11-24 08:05:15,032 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-24 08:05:15,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 26 [2023-11-24 08:05:15,049 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-11-24 08:05:15,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 25 [2023-11-24 08:05:15,102 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 16 treesize of output 11 [2023-11-24 08:05:15,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 08:05:15,117 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 08:05:15,155 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_66 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_66) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread1of1ForFork0_inc_~inc__v~0#1|)) is different from false [2023-11-24 08:05:15,210 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread1of1ForFork0_inc_~inc__v~0#1|))) (and (or (not .cse0) (forall ((v_DerPreprocessor_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_66 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.base| (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32))) (bvugt (select (select (store (store (let ((.cse1 (store |c_#memory_int| |~#inc_flag~0.base| (store (select |c_#memory_int| |~#inc_flag~0.base|) |~#inc_flag~0.offset| (_ bv1 32))))) (store .cse1 |c_~#value~0.base| (store (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset| |c_thr1Thread1of1ForFork0_inc_~inc__vn~0#1|))) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_66) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread1of1ForFork0_inc_~inc__v~0#1|))) (or .cse0 (forall ((v_ArrVal_66 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_66) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread1of1ForFork0_inc_~inc__v~0#1|))))) is different from false [2023-11-24 08:05:16,827 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_66 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.base| (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32)) (|v_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base_15| (_ BitVec 32)) (v_ArrVal_60 (Array (_ BitVec 32) (_ BitVec 32)))) (or (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_60))) (let ((.cse2 (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|))) (bvugt (select (select (store (store (let ((.cse0 (store (select .cse1 |~#inc_flag~0.base|) |~#inc_flag~0.offset| (_ bv1 32)))) (store (store |c_#memory_int| |~#inc_flag~0.base| .cse0) |c_~#value~0.base| (store (select (store .cse1 |~#inc_flag~0.base| .cse0) |c_~#value~0.base|) |c_~#value~0.offset| (bvadd (_ bv1 32) .cse2)))) |v_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base_15| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_66) |c_~#value~0.base|) |c_~#value~0.offset|) .cse2))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base_15|))))) is different from false [2023-11-24 08:05:16,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-24 08:05:16,829 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 08:05:16,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1731480168] [2023-11-24 08:05:16,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1731480168] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 08:05:16,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-24 08:05:16,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 13 [2023-11-24 08:05:16,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256661705] [2023-11-24 08:05:16,830 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-24 08:05:16,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-24 08:05:16,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 08:05:16,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-24 08:05:16,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=101, Unknown=4, NotChecked=66, Total=210 [2023-11-24 08:05:16,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:16,831 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:05:16,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.8571428571428572) internal successors, (26), 14 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-11-24 08:05:16,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:16,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:05:16,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:05:16,831 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:19,184 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse1 (bvadd .cse2 (_ bv1 32))) (.cse4 (= .cse2 |c_thr1Thread1of1ForFork0_inc_~inc__v~0#1|))) (and (forall ((v_DerPreprocessor_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_66 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.base| (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32))) (bvugt (select (select (store (store (let ((.cse0 (store |c_#memory_int| |~#inc_flag~0.base| (store (select |c_#memory_int| |~#inc_flag~0.base|) |~#inc_flag~0.offset| (_ bv1 32))))) (store .cse0 |c_~#value~0.base| (store (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset| .cse1))) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_66) |c_~#value~0.base|) |c_~#value~0.offset|) .cse2)) (= (select (select |c_#memory_int| (_ bv3 32)) |c_~#value~0.offset|) (_ bv1 32)) (= |c_thr1Thread1of1ForFork0_inc_~inc__v~0#1| (_ bv0 32)) (not (= (_ bv3 32) |c_ULTIMATE.start_main_~#t~0#1.base|)) (forall ((|v_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base_15| (_ BitVec 32))) (or (forall ((v_DerPreprocessor_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_66 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.base| (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32))) (bvugt (select (select (store (store (let ((.cse3 (store |c_#memory_int| |~#inc_flag~0.base| (store (select |c_#memory_int| |~#inc_flag~0.base|) |~#inc_flag~0.offset| (_ bv1 32))))) (store .cse3 |c_~#value~0.base| (store (select .cse3 |c_~#value~0.base|) |c_~#value~0.offset| .cse1))) |v_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base_15| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_66) |c_~#value~0.base|) |c_~#value~0.offset|) .cse2)) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base_15|))))) (or (not .cse4) (forall ((v_DerPreprocessor_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_66 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.base| (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32))) (bvugt (select (select (store (store (let ((.cse5 (store |c_#memory_int| |~#inc_flag~0.base| (store (select |c_#memory_int| |~#inc_flag~0.base|) |~#inc_flag~0.offset| (_ bv1 32))))) (store .cse5 |c_~#value~0.base| (store (select .cse5 |c_~#value~0.base|) |c_~#value~0.offset| (bvadd |c_thr1Thread1of1ForFork0_inc_~inc__v~0#1| (_ bv1 32))))) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_4) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_66) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread1of1ForFork0_inc_~inc__v~0#1|))) (forall ((v_ArrVal_66 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_66) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread1of1ForFork0_inc_~inc__v~0#1|)) (= (_ bv3 32) |c_~#value~0.base|) (or .cse4 (forall ((v_ArrVal_66 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store (store |c_#memory_int| |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_3) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_66) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread1of1ForFork0_inc_~inc__v~0#1|)))))) is different from false [2023-11-24 08:05:19,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:19,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:05:19,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:05:19,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 08:05:19,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-24 08:05:19,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:05:19,592 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 08:05:19,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:05:19,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1505233376, now seen corresponding path program 1 times [2023-11-24 08:05:19,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 08:05:19,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [24445435] [2023-11-24 08:05:19,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:05:19,593 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:05:19,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2023-11-24 08:05:19,594 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 08:05:19,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-24 08:05:19,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:05:19,665 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-24 08:05:19,667 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 08:05:19,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2023-11-24 08:05:19,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 41 treesize of output 40 [2023-11-24 08:05:19,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 34 treesize of output 33 [2023-11-24 08:05:19,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2023-11-24 08:05:19,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 74 treesize of output 67 [2023-11-24 08:05:19,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 40 [2023-11-24 08:05:19,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 48 treesize of output 44 [2023-11-24 08:05:19,860 INFO L349 Elim1Store]: treesize reduction 35, result has 23.9 percent of original size [2023-11-24 08:05:19,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 19 [2023-11-24 08:05:19,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 08:05:19,871 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2023-11-24 08:05:19,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 1 [2023-11-24 08:05:19,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2023-11-24 08:05:19,889 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-24 08:05:19,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 08:05:19,899 INFO L349 Elim1Store]: treesize reduction 45, result has 2.2 percent of original size [2023-11-24 08:05:19,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 1 [2023-11-24 08:05:19,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 08:05:19,906 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2023-11-24 08:05:19,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 1 [2023-11-24 08:05:19,975 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 08:05:19,975 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 08:05:19,975 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 08:05:19,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [24445435] [2023-11-24 08:05:19,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [24445435] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 08:05:19,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 08:05:19,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 08:05:19,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280382100] [2023-11-24 08:05:19,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 08:05:19,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 08:05:19,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 08:05:19,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 08:05:19,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 08:05:19,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:19,977 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:05:19,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) 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-11-24 08:05:19,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:19,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:05:19,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:05:19,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 08:05:19,977 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:20,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:20,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:05:20,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:05:20,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 08:05:20,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 08:05:20,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-24 08:05:20,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:05:20,432 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 08:05:20,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:05:20,435 INFO L85 PathProgramCache]: Analyzing trace with hash -341853416, now seen corresponding path program 2 times [2023-11-24 08:05:20,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 08:05:20,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2039602347] [2023-11-24 08:05:20,436 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 08:05:20,436 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:05:20,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2023-11-24 08:05:20,437 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 08:05:20,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-24 08:05:20,552 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-24 08:05:20,552 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 08:05:20,554 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-24 08:05:20,557 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 08:05:20,575 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-24 08:05:20,575 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 13 treesize of output 13 [2023-11-24 08:05:20,602 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 16 treesize of output 11 [2023-11-24 08:05:20,765 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-24 08:05:20,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 26 [2023-11-24 08:05:20,808 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2023-11-24 08:05:20,808 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 23 treesize of output 37 [2023-11-24 08:05:20,851 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-24 08:05:20,851 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 7 [2023-11-24 08:05:20,874 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 5 treesize of output 3 [2023-11-24 08:05:20,946 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-11-24 08:05:20,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 44 [2023-11-24 08:05:20,993 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 5 treesize of output 3 [2023-11-24 08:05:21,005 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 5 treesize of output 3 [2023-11-24 08:05:21,493 INFO L349 Elim1Store]: treesize reduction 47, result has 45.3 percent of original size [2023-11-24 08:05:21,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 73 [2023-11-24 08:05:21,536 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2023-11-24 08:05:21,536 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 40 treesize of output 43 [2023-11-24 08:05:21,559 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 7 treesize of output 5 [2023-11-24 08:05:21,587 INFO L349 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2023-11-24 08:05:21,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 1 [2023-11-24 08:05:21,603 INFO L349 Elim1Store]: treesize reduction 58, result has 1.7 percent of original size [2023-11-24 08:05:21,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 1 [2023-11-24 08:05:21,807 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 08:05:21,807 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 08:05:22,104 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread1of1ForFork0_inc_~inc__v~0#1|))) (and (or (not .cse0) (let ((.cse2 (= |c_~#inc_flag~0.base| |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|)) (.cse3 (= |c_~#inc_flag~0.base| |c_~#value~0.base|)) (.cse1 (select |c_#memory_int| |c_~#inc_flag~0.base|))) (and (or (forall ((v_ArrVal_128 (_ BitVec 32)) (v_DerPreprocessor_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_17 (Array (_ BitVec 32) (_ BitVec 32)))) (or (bvugt (select (select (store (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_DerPreprocessor_17) |c_~#value~0.base| (store (select (store |c_#memory_int| |c_~#inc_flag~0.base| (store .cse1 |c_~#inc_flag~0.offset| v_ArrVal_128)) |c_~#value~0.base|) |c_~#value~0.offset| |c_thr1Thread1of1ForFork0_inc_~inc__vn~0#1|)) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_18) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread1of1ForFork0_inc_~inc__v~0#1|) (= (select v_DerPreprocessor_18 |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32)))) .cse2 .cse3) (or (not .cse2) (forall ((v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_128 (_ BitVec 32))) (or (= (select v_DerPreprocessor_16 |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32)) (bvugt (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store (select (store |c_#memory_int| |c_~#inc_flag~0.base| (store .cse1 |c_~#inc_flag~0.offset| v_ArrVal_128)) |c_~#value~0.base|) |c_~#value~0.offset| |c_thr1Thread1of1ForFork0_inc_~inc__vn~0#1|)) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_16) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread1of1ForFork0_inc_~inc__v~0#1|)))) (or (not .cse3) (forall ((v_ArrVal_128 (_ BitVec 32)) (v_DerPreprocessor_19 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select v_DerPreprocessor_19 |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32)) (bvugt (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store (select (store |c_#memory_int| |c_~#inc_flag~0.base| (store .cse1 |c_~#inc_flag~0.offset| v_ArrVal_128)) |c_~#value~0.base|) |c_~#value~0.offset| |c_thr1Thread1of1ForFork0_inc_~inc__vn~0#1|)) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_19) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread1of1ForFork0_inc_~inc__v~0#1|))))))) (or .cse0 (forall ((v_DerPreprocessor_20 (Array (_ BitVec 32) (_ BitVec 32)))) (or (bvugt (select (select (store |c_#memory_int| |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_20) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread1of1ForFork0_inc_~inc__v~0#1|) (= (select v_DerPreprocessor_20 |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32))))))) is different from false [2023-11-24 08:05:24,866 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse19 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse7 (= (select .cse19 |c_~#value~0.offset|) |c_thr1Thread1of1ForFork0_inc_~inc__v~0#1|))) (let ((.cse0 (not .cse7))) (and (or .cse0 (forall ((v_DerPreprocessor_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_125 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_128 (_ BitVec 32)) (|thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32))) (let ((.cse2 (store |c_#memory_int| |c_~#value~0.base| (store (select (store |c_#memory_int| |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| (store (select |c_#memory_int| |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) |~#inc_flag~0.offset| (_ bv1 32))) |c_~#value~0.base|) |c_~#value~0.offset| |c_thr1Thread1of1ForFork0_inc_~inc__vn~0#1|)))) (let ((.cse4 (store (store .cse2 |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_125))) (let ((.cse1 (select .cse4 |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|))) (or (not (= (_ bv0 32) (select .cse1 |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|))) (= (select v_DerPreprocessor_16 |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32)) (let ((.cse3 (select (select .cse4 |c_~#value~0.base|) |c_~#value~0.offset|))) (bvugt (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_125) |c_~#value~0.base| (store (select (store (store .cse2 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_125) |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| (store .cse1 |~#inc_flag~0.offset| v_ArrVal_128)) |c_~#value~0.base|) |c_~#value~0.offset| (bvadd (_ bv1 32) .cse3))) |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_16) |c_~#value~0.base|) |c_~#value~0.offset|) .cse3)))))))) (or (forall ((v_ArrVal_125 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_128 (_ BitVec 32)) (v_DerPreprocessor_17 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32)) (|~#inc_flag~0.base| (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32)) (v_DerPreprocessor_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store (store |c_#memory_int| |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_125))) (or (let ((.cse6 (select (select .cse5 |c_~#value~0.base|) |c_~#value~0.offset|))) (bvugt (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_125) |~#inc_flag~0.base| v_DerPreprocessor_17) |c_~#value~0.base| (store (select (store .cse5 |~#inc_flag~0.base| (store (select .cse5 |~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_128)) |c_~#value~0.base|) |c_~#value~0.offset| (bvadd .cse6 (_ bv1 32)))) |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_18) |c_~#value~0.base|) |c_~#value~0.offset|) .cse6)) (= (select v_DerPreprocessor_18 |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32)) (= |~#inc_flag~0.base| |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) (= |~#inc_flag~0.base| |c_~#value~0.base|) (not (= (_ bv0 32) (select (select .cse5 |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|)))))) .cse7) (or .cse7 (forall ((v_ArrVal_125 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_128 (_ BitVec 32)) (|thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32))) (let ((.cse11 (store (store |c_#memory_int| |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_24) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_125))) (let ((.cse9 (select .cse11 |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|))) (or (let ((.cse10 (select (select .cse11 |c_~#value~0.base|) |c_~#value~0.offset|))) (bvugt (select (select (store (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_125))) (store .cse8 |c_~#value~0.base| (store (select (store .cse8 |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| (store .cse9 |~#inc_flag~0.offset| v_ArrVal_128)) |c_~#value~0.base|) |c_~#value~0.offset| (bvadd .cse10 (_ bv1 32))))) |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_16) |c_~#value~0.base|) |c_~#value~0.offset|) .cse10)) (not (= (select .cse9 |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32))) (= (select v_DerPreprocessor_16 |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32))))))) (or (forall ((v_DerPreprocessor_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_125 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_128 (_ BitVec 32)) (v_DerPreprocessor_17 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.base| (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32)) (|thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32))) (let ((.cse15 (store |c_#memory_int| |~#inc_flag~0.base| (store (select |c_#memory_int| |~#inc_flag~0.base|) |~#inc_flag~0.offset| (_ bv1 32))))) (let ((.cse12 (store (select .cse15 |c_~#value~0.base|) |c_~#value~0.offset| |c_thr1Thread1of1ForFork0_inc_~inc__vn~0#1|))) (let ((.cse13 (store (store (store .cse15 |c_~#value~0.base| .cse12) |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_125))) (or (let ((.cse14 (select (select .cse13 |c_~#value~0.base|) |c_~#value~0.offset|))) (bvugt (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_125) |~#inc_flag~0.base| v_DerPreprocessor_17) |c_~#value~0.base| (store (select (store (store (store (store |c_#memory_int| |c_~#value~0.base| .cse12) |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_125) |~#inc_flag~0.base| (store (select .cse13 |~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_128)) |c_~#value~0.base|) |c_~#value~0.offset| (bvadd .cse14 (_ bv1 32)))) |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_18) |c_~#value~0.base|) |c_~#value~0.offset|) .cse14)) (= (select v_DerPreprocessor_18 |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32)) (= |~#inc_flag~0.base| |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) (= |~#inc_flag~0.base| |c_~#value~0.base|) (not (= (select (select .cse13 |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32)))))))) .cse0) (or .cse0 (forall ((v_DerPreprocessor_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_125 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_128 (_ BitVec 32)) (v_DerPreprocessor_19 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.offset| (_ BitVec 32)) (|thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32))) (let ((.cse16 (store (store (store |c_#memory_int| |c_~#value~0.base| (store (store .cse19 |~#inc_flag~0.offset| (_ bv1 32)) |c_~#value~0.offset| |c_thr1Thread1of1ForFork0_inc_~inc__vn~0#1|)) |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_125))) (or (= (select v_DerPreprocessor_19 |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32)) (not (= (select (select .cse16 |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32))) (let ((.cse17 (select .cse16 |c_~#value~0.base|))) (let ((.cse18 (select .cse17 |c_~#value~0.offset|))) (bvugt (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_125) |c_~#value~0.base| (store (store .cse17 |~#inc_flag~0.offset| v_ArrVal_128) |c_~#value~0.offset| (bvadd (_ bv1 32) .cse18))) |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_19) |c_~#value~0.base|) |c_~#value~0.offset|) .cse18))))))) (or (forall ((v_ArrVal_125 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_128 (_ BitVec 32)) (v_DerPreprocessor_19 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32))) (let ((.cse20 (store (store |c_#memory_int| |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_26) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_125))) (or (= (select v_DerPreprocessor_19 |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32)) (not (= (select (select .cse20 |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32))) (let ((.cse21 (select .cse20 |c_~#value~0.base|))) (let ((.cse22 (select .cse21 |c_~#value~0.offset|))) (bvugt (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_125) |c_~#value~0.base| (store (store .cse21 |~#inc_flag~0.offset| v_ArrVal_128) |c_~#value~0.offset| (bvadd .cse22 (_ bv1 32)))) |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_19) |c_~#value~0.base|) |c_~#value~0.offset|) .cse22)))))) .cse7))))) is different from false [2023-11-24 08:05:25,123 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse8 (= (select .cse12 |c_~#value~0.offset|) |c_thr1Thread1of1ForFork0_inc_~inc__v~0#1|))) (let ((.cse0 (not .cse8)) (.cse5 (bvadd |c_thr1Thread1of1ForFork0_inc_~inc__v~0#1| (_ bv1 32)))) (and (or .cse0 (forall ((v_DerPreprocessor_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_125 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_128 (_ BitVec 32)) (v_DerPreprocessor_17 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.base| (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32)) (|thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32))) (let ((.cse4 (store |c_#memory_int| |~#inc_flag~0.base| (store (select |c_#memory_int| |~#inc_flag~0.base|) |~#inc_flag~0.offset| (_ bv1 32))))) (let ((.cse2 (store (select .cse4 |c_~#value~0.base|) |c_~#value~0.offset| .cse5))) (let ((.cse1 (store (store (store .cse4 |c_~#value~0.base| .cse2) |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_125))) (or (not (= (select (select .cse1 |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32))) (let ((.cse3 (select (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset|))) (bvugt (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_125) |~#inc_flag~0.base| v_DerPreprocessor_17) |c_~#value~0.base| (store (select (store (store (store (store |c_#memory_int| |c_~#value~0.base| .cse2) |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_125) |~#inc_flag~0.base| (store (select .cse1 |~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_128)) |c_~#value~0.base|) |c_~#value~0.offset| (bvadd .cse3 (_ bv1 32)))) |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_18) |c_~#value~0.base|) |c_~#value~0.offset|) .cse3)) (= (select v_DerPreprocessor_18 |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32)) (= |~#inc_flag~0.base| |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) (= |~#inc_flag~0.base| |c_~#value~0.base|))))))) (or (forall ((v_ArrVal_125 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_128 (_ BitVec 32)) (v_DerPreprocessor_17 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32)) (|~#inc_flag~0.base| (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32)) (v_DerPreprocessor_21 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store (store |c_#memory_int| |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_125))) (or (let ((.cse7 (select (select .cse6 |c_~#value~0.base|) |c_~#value~0.offset|))) (bvugt (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_125) |~#inc_flag~0.base| v_DerPreprocessor_17) |c_~#value~0.base| (store (select (store .cse6 |~#inc_flag~0.base| (store (select .cse6 |~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_128)) |c_~#value~0.base|) |c_~#value~0.offset| (bvadd .cse7 (_ bv1 32)))) |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_18) |c_~#value~0.base|) |c_~#value~0.offset|) .cse7)) (= (select v_DerPreprocessor_18 |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32)) (= |~#inc_flag~0.base| |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) (= |~#inc_flag~0.base| |c_~#value~0.base|) (not (= (_ bv0 32) (select (select .cse6 |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|)))))) .cse8) (or .cse0 (forall ((v_DerPreprocessor_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_125 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_128 (_ BitVec 32)) (v_DerPreprocessor_19 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.offset| (_ BitVec 32)) (|thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32))) (let ((.cse11 (store (store (store |c_#memory_int| |c_~#value~0.base| (store (store .cse12 |~#inc_flag~0.offset| (_ bv1 32)) |c_~#value~0.offset| .cse5)) |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_125))) (or (= (select v_DerPreprocessor_19 |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32)) (let ((.cse9 (select .cse11 |c_~#value~0.base|))) (let ((.cse10 (select .cse9 |c_~#value~0.offset|))) (bvugt (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_125) |c_~#value~0.base| (store (store .cse9 |~#inc_flag~0.offset| v_ArrVal_128) |c_~#value~0.offset| (bvadd (_ bv1 32) .cse10))) |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_19) |c_~#value~0.base|) |c_~#value~0.offset|) .cse10))) (not (= (select (select .cse11 |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32))))))) (or .cse0 (forall ((v_DerPreprocessor_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_125 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_128 (_ BitVec 32)) (|thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32))) (let ((.cse13 (store |c_#memory_int| |c_~#value~0.base| (store (select (store |c_#memory_int| |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| (store (select |c_#memory_int| |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) |~#inc_flag~0.offset| (_ bv1 32))) |c_~#value~0.base|) |c_~#value~0.offset| .cse5)))) (let ((.cse16 (store (store .cse13 |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_125))) (let ((.cse14 (select .cse16 |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|))) (or (let ((.cse15 (select (select .cse16 |c_~#value~0.base|) |c_~#value~0.offset|))) (bvugt (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_125) |c_~#value~0.base| (store (select (store (store .cse13 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_125) |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| (store .cse14 |~#inc_flag~0.offset| v_ArrVal_128)) |c_~#value~0.base|) |c_~#value~0.offset| (bvadd .cse15 (_ bv1 32)))) |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_16) |c_~#value~0.base|) |c_~#value~0.offset|) .cse15)) (= (select v_DerPreprocessor_16 |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32)) (not (= (select .cse14 |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32))))))))) (or .cse8 (forall ((v_ArrVal_125 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_24 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_128 (_ BitVec 32)) (|thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32))) (let ((.cse20 (store (store |c_#memory_int| |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_24) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_125))) (let ((.cse18 (select .cse20 |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|))) (or (let ((.cse19 (select (select .cse20 |c_~#value~0.base|) |c_~#value~0.offset|))) (bvugt (select (select (store (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_125))) (store .cse17 |c_~#value~0.base| (store (select (store .cse17 |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| (store .cse18 |~#inc_flag~0.offset| v_ArrVal_128)) |c_~#value~0.base|) |c_~#value~0.offset| (bvadd .cse19 (_ bv1 32))))) |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_16) |c_~#value~0.base|) |c_~#value~0.offset|) .cse19)) (not (= (select .cse18 |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32))) (= (select v_DerPreprocessor_16 |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32))))))) (or (forall ((v_ArrVal_125 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_26 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_128 (_ BitVec 32)) (v_DerPreprocessor_19 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32))) (let ((.cse21 (store (store |c_#memory_int| |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_26) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_125))) (or (= (select v_DerPreprocessor_19 |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32)) (not (= (select (select .cse21 |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32))) (let ((.cse22 (select .cse21 |c_~#value~0.base|))) (let ((.cse23 (select .cse22 |c_~#value~0.offset|))) (bvugt (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_125) |c_~#value~0.base| (store (store .cse22 |~#inc_flag~0.offset| v_ArrVal_128) |c_~#value~0.offset| (bvadd .cse23 (_ bv1 32)))) |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_19) |c_~#value~0.base|) |c_~#value~0.offset|) .cse23)))))) .cse8))))) is different from false [2023-11-24 08:05:25,273 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse4 (bvadd (select .cse3 |c_~#value~0.offset|) (_ bv1 32)))) (and (forall ((v_DerPreprocessor_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_125 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_128 (_ BitVec 32)) (v_DerPreprocessor_19 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.offset| (_ BitVec 32)) (|thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32))) (let ((.cse0 (store (store (store |c_#memory_int| |c_~#value~0.base| (store (store .cse3 |~#inc_flag~0.offset| (_ bv1 32)) |c_~#value~0.offset| .cse4)) |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_125))) (or (not (= (_ bv0 32) (select (select .cse0 |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|))) (= (select v_DerPreprocessor_19 |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32)) (let ((.cse1 (select .cse0 |c_~#value~0.base|))) (let ((.cse2 (select .cse1 |c_~#value~0.offset|))) (bvugt (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_125) |c_~#value~0.base| (store (store .cse1 |~#inc_flag~0.offset| v_ArrVal_128) |c_~#value~0.offset| (bvadd (_ bv1 32) .cse2))) |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_19) |c_~#value~0.base|) |c_~#value~0.offset|) .cse2)))))) (forall ((v_DerPreprocessor_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_125 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_128 (_ BitVec 32)) (|thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32))) (let ((.cse5 (store |c_#memory_int| |c_~#value~0.base| (store (select (store |c_#memory_int| |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| (store (select |c_#memory_int| |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) |~#inc_flag~0.offset| (_ bv1 32))) |c_~#value~0.base|) |c_~#value~0.offset| .cse4)))) (let ((.cse8 (store (store .cse5 |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_125))) (let ((.cse6 (select .cse8 |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|))) (or (let ((.cse7 (select (select .cse8 |c_~#value~0.base|) |c_~#value~0.offset|))) (bvugt (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_125) |c_~#value~0.base| (store (select (store (store .cse5 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_125) |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| (store .cse6 |~#inc_flag~0.offset| v_ArrVal_128)) |c_~#value~0.base|) |c_~#value~0.offset| (bvadd .cse7 (_ bv1 32)))) |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_16) |c_~#value~0.base|) |c_~#value~0.offset|) .cse7)) (= (select v_DerPreprocessor_16 |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32)) (not (= (select .cse6 |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32)))))))) (forall ((v_DerPreprocessor_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_125 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_128 (_ BitVec 32)) (v_DerPreprocessor_17 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.base| (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32)) (|thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32))) (let ((.cse12 (store |c_#memory_int| |~#inc_flag~0.base| (store (select |c_#memory_int| |~#inc_flag~0.base|) |~#inc_flag~0.offset| (_ bv1 32))))) (let ((.cse10 (store (select .cse12 |c_~#value~0.base|) |c_~#value~0.offset| .cse4))) (let ((.cse9 (store (store (store .cse12 |c_~#value~0.base| .cse10) |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_125))) (or (not (= (select (select .cse9 |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32))) (= (select v_DerPreprocessor_18 |c_thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32)) (let ((.cse11 (select (select .cse9 |c_~#value~0.base|) |c_~#value~0.offset|))) (bvugt (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_125) |~#inc_flag~0.base| v_DerPreprocessor_17) |c_~#value~0.base| (store (select (store (store (store (store |c_#memory_int| |c_~#value~0.base| .cse10) |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_125) |~#inc_flag~0.base| (store (select .cse9 |~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_128)) |c_~#value~0.base|) |c_~#value~0.offset| (bvadd .cse11 (_ bv1 32)))) |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_18) |c_~#value~0.base|) |c_~#value~0.offset|) .cse11)) (= |~#inc_flag~0.base| |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) (= |~#inc_flag~0.base| |c_~#value~0.base|))))))))) is different from false [2023-11-24 08:05:25,541 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse4 (bvadd (select .cse3 |c_~#value~0.offset|) (_ bv1 32)))) (and (forall ((v_DerPreprocessor_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_125 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_128 (_ BitVec 32)) (v_DerPreprocessor_19 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.offset| (_ BitVec 32)) (|thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32))) (let ((.cse2 (store (store (store |c_#memory_int| |c_~#value~0.base| (store (store .cse3 |~#inc_flag~0.offset| (_ bv1 32)) |c_~#value~0.offset| .cse4)) |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_125))) (or (= (select v_DerPreprocessor_19 (_ bv0 32)) (_ bv0 32)) (let ((.cse0 (select .cse2 |c_~#value~0.base|))) (let ((.cse1 (select .cse0 |c_~#value~0.offset|))) (bvugt (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_125) |c_~#value~0.base| (store (store .cse0 |~#inc_flag~0.offset| v_ArrVal_128) |c_~#value~0.offset| (bvadd (_ bv1 32) .cse1))) |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_19) |c_~#value~0.base|) |c_~#value~0.offset|) .cse1))) (not (= (select (select .cse2 |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) (_ bv0 32)) (_ bv0 32)))))) (forall ((v_DerPreprocessor_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_125 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_128 (_ BitVec 32)) (v_DerPreprocessor_17 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.base| (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32)) (|thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32))) (let ((.cse8 (store |c_#memory_int| |~#inc_flag~0.base| (store (select |c_#memory_int| |~#inc_flag~0.base|) |~#inc_flag~0.offset| (_ bv1 32))))) (let ((.cse6 (store (select .cse8 |c_~#value~0.base|) |c_~#value~0.offset| .cse4))) (let ((.cse5 (store (store (store .cse8 |c_~#value~0.base| .cse6) |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_125))) (or (not (= (select (select .cse5 |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) (_ bv0 32)) (_ bv0 32))) (= (select v_DerPreprocessor_18 (_ bv0 32)) (_ bv0 32)) (let ((.cse7 (select (select .cse5 |c_~#value~0.base|) |c_~#value~0.offset|))) (bvugt (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_125) |~#inc_flag~0.base| v_DerPreprocessor_17) |c_~#value~0.base| (store (select (store (store (store (store |c_#memory_int| |c_~#value~0.base| .cse6) |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_125) |~#inc_flag~0.base| (store (select .cse5 |~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_128)) |c_~#value~0.base|) |c_~#value~0.offset| (bvadd .cse7 (_ bv1 32)))) |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_18) |c_~#value~0.base|) |c_~#value~0.offset|) .cse7)) (= |~#inc_flag~0.base| |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) (= |~#inc_flag~0.base| |c_~#value~0.base|)))))) (forall ((v_DerPreprocessor_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_125 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_128 (_ BitVec 32)) (|thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32))) (let ((.cse9 (store |c_#memory_int| |c_~#value~0.base| (store (select (store |c_#memory_int| |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| (store (select |c_#memory_int| |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) |~#inc_flag~0.offset| (_ bv1 32))) |c_~#value~0.base|) |c_~#value~0.offset| .cse4)))) (let ((.cse12 (store (store .cse9 |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_125))) (let ((.cse10 (select .cse12 |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|))) (or (let ((.cse11 (select (select .cse12 |c_~#value~0.base|) |c_~#value~0.offset|))) (bvugt (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_125) |c_~#value~0.base| (store (select (store (store .cse9 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_125) |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| (store .cse10 |~#inc_flag~0.offset| v_ArrVal_128)) |c_~#value~0.base|) |c_~#value~0.offset| (bvadd .cse11 (_ bv1 32)))) |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_16) |c_~#value~0.base|) |c_~#value~0.offset|) .cse11)) (not (= (select .cse10 (_ bv0 32)) (_ bv0 32))) (= (select v_DerPreprocessor_16 (_ bv0 32)) (_ bv0 32)))))))))) is different from false [2023-11-24 08:05:25,856 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_DerPreprocessor_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_125 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_128 (_ BitVec 32)) (|thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32)) (v_ArrVal_119 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store |c_#memory_int| |c_~#value~0.base| (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_119))) (store (select (store .cse4 |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| (store (select .cse4 |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) |~#inc_flag~0.offset| (_ bv1 32))) |c_~#value~0.base|) |c_~#value~0.offset| (bvadd (select (select .cse4 |c_~#value~0.base|) |c_~#value~0.offset|) (_ bv1 32))))))) (let ((.cse3 (store (store .cse0 |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_23) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_125))) (let ((.cse1 (select .cse3 |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|))) (or (let ((.cse2 (select (select .cse3 |c_~#value~0.base|) |c_~#value~0.offset|))) (bvugt (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_125) |c_~#value~0.base| (store (select (store (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_125) |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| (store .cse1 |~#inc_flag~0.offset| v_ArrVal_128)) |c_~#value~0.base|) |c_~#value~0.offset| (bvadd .cse2 (_ bv1 32)))) |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_16) |c_~#value~0.base|) |c_~#value~0.offset|) .cse2)) (not (= (select .cse1 (_ bv0 32)) (_ bv0 32))) (= (select v_DerPreprocessor_16 (_ bv0 32)) (_ bv0 32))))))) (forall ((v_DerPreprocessor_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_125 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_18 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_128 (_ BitVec 32)) (v_DerPreprocessor_17 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.base| (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32)) (|thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32)) (v_ArrVal_119 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_119))) (let ((.cse8 (store (select .cse9 |~#inc_flag~0.base|) |~#inc_flag~0.offset| (_ bv1 32)))) (let ((.cse5 (store (select (store .cse9 |~#inc_flag~0.base| .cse8) |c_~#value~0.base|) |c_~#value~0.offset| (bvadd (select (select .cse9 |c_~#value~0.base|) |c_~#value~0.offset|) (_ bv1 32))))) (let ((.cse6 (store (store (store (store |c_#memory_int| |~#inc_flag~0.base| .cse8) |c_~#value~0.base| .cse5) |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_125))) (or (= (select v_DerPreprocessor_18 (_ bv0 32)) (_ bv0 32)) (= |~#inc_flag~0.base| |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) (let ((.cse7 (select (select .cse6 |c_~#value~0.base|) |c_~#value~0.offset|))) (bvugt (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_125) |~#inc_flag~0.base| v_DerPreprocessor_17) |c_~#value~0.base| (store (select (store (store (store (store |c_#memory_int| |c_~#value~0.base| .cse5) |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_125) |~#inc_flag~0.base| (store (select .cse6 |~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_128)) |c_~#value~0.base|) |c_~#value~0.offset| (bvadd (_ bv1 32) .cse7))) |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_18) |c_~#value~0.base|) |c_~#value~0.offset|) .cse7)) (not (= (select (select .cse6 |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) (_ bv0 32)) (_ bv0 32))) (= |~#inc_flag~0.base| |c_~#value~0.base|))))))) (forall ((v_DerPreprocessor_25 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_125 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_128 (_ BitVec 32)) (v_DerPreprocessor_19 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.offset| (_ BitVec 32)) (|thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32)) (v_ArrVal_119 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (store (store (store |c_#memory_int| |c_~#value~0.base| (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_119) |c_~#value~0.base|))) (store (store .cse13 |~#inc_flag~0.offset| (_ bv1 32)) |c_~#value~0.offset| (bvadd (select .cse13 |c_~#value~0.offset|) (_ bv1 32))))) |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_25) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_125))) (or (let ((.cse10 (select .cse12 |c_~#value~0.base|))) (let ((.cse11 (select .cse10 |c_~#value~0.offset|))) (bvugt (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_125) |c_~#value~0.base| (store (store .cse10 |~#inc_flag~0.offset| v_ArrVal_128) |c_~#value~0.offset| (bvadd .cse11 (_ bv1 32)))) |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_19) |c_~#value~0.base|) |c_~#value~0.offset|) .cse11))) (= (select v_DerPreprocessor_19 (_ bv0 32)) (_ bv0 32)) (not (= (select (select .cse12 |thr1Thread1of1ForFork0_inc_~#inc__casret~0#1.base|) (_ bv0 32)) (_ bv0 32))))))) is different from false [2023-11-24 08:05:25,866 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-11-24 08:05:25,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 08:05:25,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2039602347] [2023-11-24 08:05:25,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2039602347] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 08:05:25,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-24 08:05:25,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 27 [2023-11-24 08:05:25,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877479269] [2023-11-24 08:05:25,867 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-24 08:05:25,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-24 08:05:25,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 08:05:25,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-24 08:05:25,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=403, Unknown=14, NotChecked=282, Total=812 [2023-11-24 08:05:25,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:25,868 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:05:25,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 28 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 08:05:25,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:25,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:05:25,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:05:25,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2023-11-24 08:05:25,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 08:05:25,869 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:27,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-24 08:05:29,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-24 08:05:32,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-24 08:05:36,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:36,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:05:36,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:05:36,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-24 08:05:36,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 08:05:36,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-24 08:05:36,361 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err1ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-11-24 08:05:36,362 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-11-24 08:05:36,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-24 08:05:36,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:05:36,570 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1] [2023-11-24 08:05:36,571 INFO L307 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE,SAFE (1/2) [2023-11-24 08:05:36,573 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 08:05:36,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-24 08:05:36,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 08:05:36,574 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-24 08:05:36,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (9)] Waiting until timeout for monitored process [2023-11-24 08:05:36,592 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-24 08:05:36,593 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-24 08:05:36,593 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;@423037f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 08:05:36,593 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-24 08:05:36,654 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-24 08:05:36,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:05:36,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1138696684, now seen corresponding path program 1 times [2023-11-24 08:05:36,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 08:05:36,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1868168336] [2023-11-24 08:05:36,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:05:36,655 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:05:36,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2023-11-24 08:05:36,661 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 08:05:36,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-24 08:05:36,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:05:36,723 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-24 08:05:36,724 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 08:05:36,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 08:05:36,724 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 08:05:36,724 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 08:05:36,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1868168336] [2023-11-24 08:05:36,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1868168336] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 08:05:36,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 08:05:36,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 08:05:36,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320339844] [2023-11-24 08:05:36,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 08:05:36,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-24 08:05:36,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 08:05:36,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-24 08:05:36,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-24 08:05:36,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:36,727 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:05:36,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-11-24 08:05:36,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:36,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:36,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-11-24 08:05:37,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:05:37,132 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-24 08:05:37,132 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:05:37,132 INFO L85 PathProgramCache]: Analyzing trace with hash -210693399, now seen corresponding path program 1 times [2023-11-24 08:05:37,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 08:05:37,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1789387242] [2023-11-24 08:05:37,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:05:37,133 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:05:37,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2023-11-24 08:05:37,135 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 08:05:37,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-24 08:05:37,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:05:37,221 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-24 08:05:37,223 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 08:05:37,235 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-24 08:05:37,235 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 13 treesize of output 13 [2023-11-24 08:05:37,263 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 16 treesize of output 11 [2023-11-24 08:05:37,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-24 08:05:37,306 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 08:05:37,306 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 08:05:37,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1789387242] [2023-11-24 08:05:37,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1789387242] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 08:05:37,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 08:05:37,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 08:05:37,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921092714] [2023-11-24 08:05:37,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 08:05:37,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 08:05:37,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 08:05:37,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 08:05:37,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 08:05:37,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:37,312 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:05:37,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 08:05:37,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:37,312 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:37,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:37,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:05:37,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-11-24 08:05:37,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:05:37,588 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-24 08:05:37,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:05:37,589 INFO L85 PathProgramCache]: Analyzing trace with hash 961626491, now seen corresponding path program 1 times [2023-11-24 08:05:37,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 08:05:37,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2144248688] [2023-11-24 08:05:37,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:05:37,590 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:05:37,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2023-11-24 08:05:37,591 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 08:05:37,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-24 08:05:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 08:05:37,664 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 08:05:37,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 08:05:37,716 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-24 08:05:37,716 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 08:05:37,716 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-11-24 08:05:37,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-11-24 08:05:37,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:05:37,918 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-24 08:05:37,918 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2023-11-24 08:05:37,919 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-24 08:05:37,919 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-24 08:05:37,949 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 08:05:37,951 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 08:05:37,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-24 08:05:37,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 08:05:37,952 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-24 08:05:37,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (13)] Waiting until timeout for monitored process [2023-11-24 08:05:37,981 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-24 08:05:37,981 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2023-11-24 08:05:37,982 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;@423037f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 08:05:37,982 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-24 08:05:38,143 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-24 08:05:38,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:05:38,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1572867083, now seen corresponding path program 1 times [2023-11-24 08:05:38,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 08:05:38,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2020861420] [2023-11-24 08:05:38,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:05:38,144 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:05:38,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2023-11-24 08:05:38,161 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 08:05:38,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-24 08:05:38,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:05:38,250 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-24 08:05:38,251 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 08:05:38,252 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-24 08:05:38,252 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 08:05:38,253 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 08:05:38,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2020861420] [2023-11-24 08:05:38,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2020861420] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 08:05:38,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 08:05:38,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 08:05:38,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545824839] [2023-11-24 08:05:38,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 08:05:38,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-24 08:05:38,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 08:05:38,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-24 08:05:38,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-24 08:05:38,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:38,255 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:05:38,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 08:05:38,255 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:38,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:38,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-11-24 08:05:39,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:05:39,025 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-24 08:05:39,025 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:05:39,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1861066133, now seen corresponding path program 1 times [2023-11-24 08:05:39,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 08:05:39,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [78251643] [2023-11-24 08:05:39,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:05:39,026 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:05:39,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2023-11-24 08:05:39,027 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 08:05:39,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-11-24 08:05:39,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:05:39,155 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-24 08:05:39,156 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 08:05:39,169 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-24 08:05:39,169 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 13 treesize of output 13 [2023-11-24 08:05:39,197 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 16 treesize of output 11 [2023-11-24 08:05:39,232 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-24 08:05:39,232 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 08:05:39,232 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 08:05:39,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [78251643] [2023-11-24 08:05:39,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [78251643] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 08:05:39,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 08:05:39,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 08:05:39,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839270896] [2023-11-24 08:05:39,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 08:05:39,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 08:05:39,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 08:05:39,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 08:05:39,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 08:05:39,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:39,234 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:05:39,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 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-11-24 08:05:39,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:39,234 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:40,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:40,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:05:40,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-11-24 08:05:40,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:05:40,274 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-24 08:05:40,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:05:40,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1549389063, now seen corresponding path program 1 times [2023-11-24 08:05:40,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 08:05:40,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [759876582] [2023-11-24 08:05:40,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:05:40,275 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:05:40,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2023-11-24 08:05:40,276 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 08:05:40,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-11-24 08:05:40,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:05:40,392 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-24 08:05:40,393 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 08:05:40,405 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-24 08:05:40,405 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 13 treesize of output 13 [2023-11-24 08:05:40,425 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 16 treesize of output 11 [2023-11-24 08:05:40,503 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 16 treesize of output 11 [2023-11-24 08:05:40,542 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 08:05:40,542 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 08:05:40,619 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 08:05:40,619 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 08:05:40,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [759876582] [2023-11-24 08:05:40,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [759876582] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 08:05:40,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-24 08:05:40,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-11-24 08:05:40,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883816275] [2023-11-24 08:05:40,620 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-24 08:05:40,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 08:05:40,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 08:05:40,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 08:05:40,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=23, Unknown=4, NotChecked=0, Total=42 [2023-11-24 08:05:40,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:40,621 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:05:40,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 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-11-24 08:05:40,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:40,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:05:40,621 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:40,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:40,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:05:40,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:05:40,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-11-24 08:05:40,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:05:40,918 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-24 08:05:40,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:05:40,919 INFO L85 PathProgramCache]: Analyzing trace with hash 441798315, now seen corresponding path program 1 times [2023-11-24 08:05:40,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 08:05:40,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1801685495] [2023-11-24 08:05:40,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:05:40,920 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:05:40,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2023-11-24 08:05:40,921 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 08:05:40,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-11-24 08:05:41,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 08:05:41,022 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-24 08:05:41,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-24 08:05:41,082 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-24 08:05:41,082 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-24 08:05:41,082 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-11-24 08:05:41,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-11-24 08:05:41,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:05:41,284 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-11-24 08:05:41,284 INFO L307 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2023-11-24 08:05:41,284 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-24 08:05:41,284 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-24 08:05:41,358 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-24 08:05:41,360 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 08:05:41,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2023-11-24 08:05:41,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2023-11-24 08:05:41,364 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2023-11-24 08:05:41,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (18)] Waiting until timeout for monitored process [2023-11-24 08:05:41,382 INFO L159 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2023-11-24 08:05:41,382 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2023-11-24 08:05:41,382 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;@423037f1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-24 08:05:41,383 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-11-24 08:05:41,683 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 08:05:41,683 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:05:41,683 INFO L85 PathProgramCache]: Analyzing trace with hash 631038700, now seen corresponding path program 1 times [2023-11-24 08:05:41,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 08:05:41,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1475415384] [2023-11-24 08:05:41,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:05:41,684 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:05:41,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2023-11-24 08:05:41,686 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 08:05:41,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-11-24 08:05:41,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:05:41,803 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-24 08:05:41,804 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 08:05:41,805 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-24 08:05:41,805 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 08:05:41,805 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 08:05:41,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1475415384] [2023-11-24 08:05:41,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1475415384] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 08:05:41,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 08:05:41,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-24 08:05:41,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125884231] [2023-11-24 08:05:41,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 08:05:41,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-24 08:05:41,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 08:05:41,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-24 08:05:41,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-24 08:05:41,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:41,806 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:05:41,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 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-11-24 08:05:41,807 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:42,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:42,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-11-24 08:05:42,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:05:42,754 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 08:05:42,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:05:42,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1555439647, now seen corresponding path program 1 times [2023-11-24 08:05:42,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 08:05:42,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [247464436] [2023-11-24 08:05:42,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:05:42,755 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:05:42,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2023-11-24 08:05:42,756 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 08:05:42,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-11-24 08:05:42,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:05:42,973 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-24 08:05:42,975 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 08:05:42,987 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-24 08:05:42,987 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 13 treesize of output 13 [2023-11-24 08:05:43,010 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 16 treesize of output 11 [2023-11-24 08:05:43,071 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-24 08:05:43,071 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 08:05:43,071 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 08:05:43,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [247464436] [2023-11-24 08:05:43,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [247464436] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 08:05:43,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 08:05:43,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 08:05:43,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511795689] [2023-11-24 08:05:43,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 08:05:43,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 08:05:43,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 08:05:43,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 08:05:43,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-24 08:05:43,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:43,073 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:05:43,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 08:05:43,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:43,073 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:43,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:43,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:05:43,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-11-24 08:05:43,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:05:43,563 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 08:05:43,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:05:43,563 INFO L85 PathProgramCache]: Analyzing trace with hash -278492013, now seen corresponding path program 1 times [2023-11-24 08:05:43,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 08:05:43,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [96999079] [2023-11-24 08:05:43,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:05:43,564 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:05:43,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2023-11-24 08:05:43,565 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 08:05:43,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-11-24 08:05:43,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:05:43,738 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-24 08:05:43,740 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 08:05:43,754 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-24 08:05:43,757 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 13 treesize of output 13 [2023-11-24 08:05:43,779 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 16 treesize of output 11 [2023-11-24 08:05:43,890 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 16 treesize of output 11 [2023-11-24 08:05:43,936 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 08:05:43,937 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 08:05:44,005 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-24 08:05:44,005 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 08:05:44,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [96999079] [2023-11-24 08:05:44,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [96999079] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 08:05:44,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-24 08:05:44,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-11-24 08:05:44,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310438150] [2023-11-24 08:05:44,006 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-24 08:05:44,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 08:05:44,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 08:05:44,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 08:05:44,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=23, Unknown=4, NotChecked=0, Total=42 [2023-11-24 08:05:44,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:44,007 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:05:44,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 6 states have internal predecessors, (48), 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-11-24 08:05:44,007 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:44,007 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:05:44,007 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:45,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:45,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:05:45,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:05:45,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-11-24 08:05:45,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:05:45,877 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 08:05:45,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:05:45,878 INFO L85 PathProgramCache]: Analyzing trace with hash 332272801, now seen corresponding path program 1 times [2023-11-24 08:05:45,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 08:05:45,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [170539397] [2023-11-24 08:05:45,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:05:45,878 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:05:45,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2023-11-24 08:05:45,880 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 08:05:45,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-11-24 08:05:46,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:05:46,031 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-24 08:05:46,033 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 08:05:46,045 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-24 08:05:46,046 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 13 treesize of output 13 [2023-11-24 08:05:46,066 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 16 treesize of output 11 [2023-11-24 08:05:46,150 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 16 treesize of output 11 [2023-11-24 08:05:46,204 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 16 treesize of output 11 [2023-11-24 08:05:46,232 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-24 08:05:46,232 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 08:05:46,251 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_355 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_355) |c_~#value~0.base|) |c_~#value~0.offset|) (_ bv0 32))) is different from false [2023-11-24 08:05:46,317 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 4 not checked. [2023-11-24 08:05:46,317 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 08:05:46,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [170539397] [2023-11-24 08:05:46,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [170539397] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 08:05:46,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-24 08:05:46,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2023-11-24 08:05:46,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711736623] [2023-11-24 08:05:46,318 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-24 08:05:46,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-24 08:05:46,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 08:05:46,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-24 08:05:46,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=19, Unknown=1, NotChecked=8, Total=42 [2023-11-24 08:05:46,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:46,319 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:05:46,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 6 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 08:05:46,319 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:46,319 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:05:46,319 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:05:46,319 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:47,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:47,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:05:47,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:05:47,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:05:47,945 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2023-11-24 08:05:48,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:05:48,142 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 08:05:48,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:05:48,142 INFO L85 PathProgramCache]: Analyzing trace with hash 2136126883, now seen corresponding path program 1 times [2023-11-24 08:05:48,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 08:05:48,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2025100045] [2023-11-24 08:05:48,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:05:48,143 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:05:48,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2023-11-24 08:05:48,145 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 08:05:48,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-11-24 08:05:48,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:05:48,294 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-24 08:05:48,297 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 08:05:48,321 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-24 08:05:48,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 27 [2023-11-24 08:05:48,355 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 16 treesize of output 11 [2023-11-24 08:05:48,451 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2023-11-24 08:05:48,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 28 treesize of output 36 [2023-11-24 08:05:48,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2023-11-24 08:05:48,586 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 16 treesize of output 11 [2023-11-24 08:05:48,662 INFO L349 Elim1Store]: treesize reduction 48, result has 32.4 percent of original size [2023-11-24 08:05:48,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 28 treesize of output 36 [2023-11-24 08:05:48,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2023-11-24 08:05:48,817 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 16 treesize of output 11 [2023-11-24 08:05:48,906 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-11-24 08:05:48,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 22 [2023-11-24 08:05:49,057 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-11-24 08:05:49,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 34 [2023-11-24 08:05:49,088 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-11-24 08:05:49,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 33 [2023-11-24 08:05:49,140 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-24 08:05:49,140 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 08:05:49,246 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_thr1Thread3of3ForFork0_inc_~inc__v~0#1| (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|)))) (and (or .cse0 (forall ((v_DerPreprocessor_27 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_27) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_inc_~inc__v~0#1|))) (or (forall ((v_ArrVal_392 (_ BitVec 32)) (v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.base| (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32))) (bvugt (select (select (store (let ((.cse1 (store |c_#memory_int| |~#inc_flag~0.base| (store (select |c_#memory_int| |~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_392)))) (store .cse1 |c_~#value~0.base| (store (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset| |c_thr1Thread3of3ForFork0_inc_~inc__vn~0#1|))) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_28) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_inc_~inc__v~0#1|)) (not .cse0)))) is different from false [2023-11-24 08:05:49,275 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_thr1Thread3of3ForFork0_inc_~inc__v~0#1| (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|)))) (and (or .cse0 (forall ((v_DerPreprocessor_27 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_27) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_inc_~inc__v~0#1|))) (or (not .cse0) (forall ((v_ArrVal_392 (_ BitVec 32)) (v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.base| (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32))) (bvugt (select (select (store (let ((.cse1 (store |c_#memory_int| |~#inc_flag~0.base| (store (select |c_#memory_int| |~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_392)))) (store .cse1 |c_~#value~0.base| (store (select .cse1 |c_~#value~0.base|) |c_~#value~0.offset| (bvadd |c_thr1Thread3of3ForFork0_inc_~inc__v~0#1| (_ bv1 32))))) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_28) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_inc_~inc__v~0#1|))))) is different from false [2023-11-24 08:05:49,450 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_387 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_392 (_ BitVec 32)) (v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base_17| (_ BitVec 32)) (|~#inc_flag~0.base| (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base_17|) (_ bv0 1))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_387))) (let ((.cse1 (select (select .cse2 |c_~#value~0.base|) |c_~#value~0.offset|))) (bvugt (select (select (store (let ((.cse0 (store .cse2 |~#inc_flag~0.base| (store (select .cse2 |~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_392)))) (store .cse0 |c_~#value~0.base| (store (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset| (bvadd .cse1 (_ bv1 32))))) |v_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base_17| v_DerPreprocessor_28) |c_~#value~0.base|) |c_~#value~0.offset|) .cse1))))) is different from false [2023-11-24 08:05:50,620 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-24 08:05:50,621 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 08:05:50,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2025100045] [2023-11-24 08:05:50,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2025100045] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 08:05:50,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-24 08:05:50,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 18 [2023-11-24 08:05:50,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152318786] [2023-11-24 08:05:50,621 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-24 08:05:50,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-24 08:05:50,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 08:05:50,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-24 08:05:50,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=44, NotChecked=96, Total=380 [2023-11-24 08:05:50,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:50,622 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:05:50,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.1052631578947367) internal successors, (59), 19 states have internal predecessors, (59), 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-11-24 08:05:50,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:50,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:05:50,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:05:50,622 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:05:50,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:05:55,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-24 08:05:59,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-24 08:06:00,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:06:00,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:06:00,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:06:00,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:06:00,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-24 08:06:00,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2023-11-24 08:06:00,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:06:00,806 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 08:06:00,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:06:00,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1795423590, now seen corresponding path program 2 times [2023-11-24 08:06:00,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 08:06:00,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1452525518] [2023-11-24 08:06:00,807 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 08:06:00,807 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:06:00,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2023-11-24 08:06:00,808 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 08:06:00,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-11-24 08:06:00,976 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-24 08:06:00,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 08:06:00,979 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-24 08:06:00,981 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 08:06:01,107 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-24 08:06:01,107 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 13 treesize of output 13 [2023-11-24 08:06:01,261 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 16 treesize of output 11 [2023-11-24 08:06:02,031 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 16 treesize of output 11 [2023-11-24 08:06:02,658 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 16 treesize of output 11 [2023-11-24 08:06:03,819 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-24 08:06:03,820 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 2 case distinctions, treesize of input 35 treesize of output 18 [2023-11-24 08:06:04,021 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-24 08:06:04,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 2 case distinctions, treesize of input 49 treesize of output 18 [2023-11-24 08:06:04,080 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 19 treesize of output 11 [2023-11-24 08:06:04,159 INFO L349 Elim1Store]: treesize reduction 67, result has 1.5 percent of original size [2023-11-24 08:06:04,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 1 [2023-11-24 08:06:04,235 INFO L349 Elim1Store]: treesize reduction 37, result has 2.6 percent of original size [2023-11-24 08:06:04,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 1 [2023-11-24 08:06:04,630 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 16 treesize of output 11 [2023-11-24 08:06:04,822 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-24 08:06:04,822 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 08:06:04,975 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_430 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_430) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_inc_~inc__v~0#1|)) is different from false [2023-11-24 08:06:06,136 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= |c_thr1Thread3of3ForFork0_inc_~inc__v~0#1| (select .cse2 |c_~#value~0.offset|)))) (and (or .cse0 (forall ((v_DerPreprocessor_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_430 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32))) (bvugt (select (select (store (store |c_#memory_int| |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_430) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_inc_~inc__v~0#1|))) (or (let ((.cse5 (store .cse2 |c_~#value~0.offset| |c_thr1Thread3of3ForFork0_inc_~inc__vn~0#1|))) (and (forall ((v_DerPreprocessor_32 (_ BitVec 32)) (v_ArrVal_430 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.offset| (_ BitVec 32)) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32))) (or (= |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| |~#inc_flag~0.offset|) (bvugt (select (select (store (let ((.cse1 (store |c_#memory_int| |c_~#value~0.base| (store (store .cse2 |~#inc_flag~0.offset| v_DerPreprocessor_32) |c_~#value~0.offset| |c_thr1Thread3of3ForFork0_inc_~inc__vn~0#1|)))) (store .cse1 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store (select .cse1 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32)))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_430) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_inc_~inc__v~0#1|) (= |c_~#value~0.offset| |~#inc_flag~0.offset|))) (forall ((v_ArrVal_425 (_ BitVec 32)) (v_ArrVal_430 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.base| (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32)) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| |~#inc_flag~0.base|) (= |~#inc_flag~0.base| |c_~#value~0.base|) (bvugt (select (select (store (let ((.cse4 (store |c_#memory_int| |~#inc_flag~0.base| (store (select |c_#memory_int| |~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_425)))) (let ((.cse3 (store (select .cse4 |c_~#value~0.base|) |c_~#value~0.offset| |c_thr1Thread3of3ForFork0_inc_~inc__vn~0#1|))) (store (store (store |c_#memory_int| |~#inc_flag~0.base| v_DerPreprocessor_31) |c_~#value~0.base| .cse3) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store (select (store .cse4 |c_~#value~0.base| .cse3) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32))))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_430) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_inc_~inc__v~0#1|))) (forall ((v_ArrVal_430 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse5 |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_430) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_inc_~inc__v~0#1|)) (forall ((v_ArrVal_425 (_ BitVec 32)) (v_ArrVal_430 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.offset| (_ BitVec 32)) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32))) (bvugt (select (select (store (let ((.cse7 (store |c_#memory_int| |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store (select |c_#memory_int| |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |~#inc_flag~0.offset| v_ArrVal_425)))) (let ((.cse6 (store (select .cse7 |c_~#value~0.base|) |c_~#value~0.offset| |c_thr1Thread3of3ForFork0_inc_~inc__vn~0#1|))) (store (store |c_#memory_int| |c_~#value~0.base| .cse6) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store (select (store .cse7 |c_~#value~0.base| .cse6) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32))))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_430) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_inc_~inc__v~0#1|)) (forall ((v_DerPreprocessor_30 (_ BitVec 32)) (v_ArrVal_430 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.offset| (_ BitVec 32)) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32))) (or (= |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| |c_~#value~0.base|) (bvugt (select (select (store (let ((.cse8 (store |c_#memory_int| |c_~#value~0.base| (store (store .cse2 |~#inc_flag~0.offset| v_DerPreprocessor_30) |c_~#value~0.offset| |c_thr1Thread3of3ForFork0_inc_~inc__vn~0#1|)))) (store .cse8 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store (select .cse8 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32)))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_430) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_inc_~inc__v~0#1|) (= |c_~#value~0.offset| |~#inc_flag~0.offset|))) (forall ((v_ArrVal_430 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32))) (bvugt (select (select (store (let ((.cse9 (store |c_#memory_int| |c_~#value~0.base| .cse5))) (store .cse9 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store (select .cse9 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32)))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_430) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_inc_~inc__v~0#1|)))) (not .cse0))))) is different from false [2023-11-24 08:06:06,646 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= |c_thr1Thread3of3ForFork0_inc_~inc__v~0#1| (select .cse5 |c_~#value~0.offset|)))) (and (or .cse0 (forall ((v_DerPreprocessor_29 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_430 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32))) (bvugt (select (select (store (store |c_#memory_int| |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_29) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_430) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_inc_~inc__v~0#1|))) (or (let ((.cse3 (bvadd |c_thr1Thread3of3ForFork0_inc_~inc__v~0#1| (_ bv1 32)))) (let ((.cse8 (store .cse5 |c_~#value~0.offset| .cse3))) (and (forall ((v_ArrVal_425 (_ BitVec 32)) (v_ArrVal_430 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.base| (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32)) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| |~#inc_flag~0.base|) (= |~#inc_flag~0.base| |c_~#value~0.base|) (bvugt (select (select (store (let ((.cse2 (store |c_#memory_int| |~#inc_flag~0.base| (store (select |c_#memory_int| |~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_425)))) (let ((.cse1 (store (select .cse2 |c_~#value~0.base|) |c_~#value~0.offset| .cse3))) (store (store (store |c_#memory_int| |~#inc_flag~0.base| v_DerPreprocessor_31) |c_~#value~0.base| .cse1) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store (select (store .cse2 |c_~#value~0.base| .cse1) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32))))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_430) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_inc_~inc__v~0#1|))) (forall ((v_DerPreprocessor_30 (_ BitVec 32)) (v_ArrVal_430 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.offset| (_ BitVec 32)) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32))) (or (= |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| |c_~#value~0.base|) (bvugt (select (select (store (let ((.cse4 (store |c_#memory_int| |c_~#value~0.base| (store (store .cse5 |~#inc_flag~0.offset| v_DerPreprocessor_30) |c_~#value~0.offset| .cse3)))) (store .cse4 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store (select .cse4 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32)))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_430) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_inc_~inc__v~0#1|) (= |c_~#value~0.offset| |~#inc_flag~0.offset|))) (forall ((v_DerPreprocessor_32 (_ BitVec 32)) (v_ArrVal_430 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.offset| (_ BitVec 32)) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32))) (or (= |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| |~#inc_flag~0.offset|) (bvugt (select (select (store (let ((.cse6 (store |c_#memory_int| |c_~#value~0.base| (store (store .cse5 |~#inc_flag~0.offset| v_DerPreprocessor_32) |c_~#value~0.offset| .cse3)))) (store .cse6 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store (select .cse6 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32)))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_430) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_inc_~inc__v~0#1|) (= |c_~#value~0.offset| |~#inc_flag~0.offset|))) (forall ((v_ArrVal_430 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32))) (bvugt (select (select (store (let ((.cse7 (store |c_#memory_int| |c_~#value~0.base| .cse8))) (store .cse7 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store (select .cse7 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32)))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_430) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_inc_~inc__v~0#1|)) (forall ((v_ArrVal_425 (_ BitVec 32)) (v_ArrVal_430 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.offset| (_ BitVec 32)) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32))) (bvugt (select (select (store (let ((.cse10 (store |c_#memory_int| |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store (select |c_#memory_int| |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |~#inc_flag~0.offset| v_ArrVal_425)))) (let ((.cse9 (store (select .cse10 |c_~#value~0.base|) |c_~#value~0.offset| .cse3))) (store (store |c_#memory_int| |c_~#value~0.base| .cse9) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store (select (store .cse10 |c_~#value~0.base| .cse9) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32))))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_430) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_inc_~inc__v~0#1|)) (forall ((v_ArrVal_430 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store .cse8 |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_430) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_inc_~inc__v~0#1|))))) (not .cse0))))) is different from false [2023-11-24 08:06:16,411 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_422 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_430 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_422) |c_~#value~0.base|))) (let ((.cse1 (select .cse0 |c_~#value~0.offset|))) (bvugt (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store (store .cse0 |c_~#value~0.offset| (bvadd .cse1 (_ bv1 32))) (_ bv0 32) (_ bv1 32))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_430) |c_~#value~0.base|) |c_~#value~0.offset|) .cse1)))) (forall ((v_ArrVal_422 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_425 (_ BitVec 32)) (v_ArrVal_430 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.offset| (_ BitVec 32)) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_422))) (let ((.cse4 (select (select .cse5 |c_~#value~0.base|) |c_~#value~0.offset|))) (bvugt (select (select (store (let ((.cse3 (store .cse5 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store (select .cse5 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |~#inc_flag~0.offset| v_ArrVal_425)))) (let ((.cse2 (store (select .cse3 |c_~#value~0.base|) |c_~#value~0.offset| (bvadd .cse4 (_ bv1 32))))) (store (store |c_#memory_int| |c_~#value~0.base| .cse2) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store (select (store .cse3 |c_~#value~0.base| .cse2) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) (_ bv0 32) (_ bv1 32))))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_430) |c_~#value~0.base|) |c_~#value~0.offset|) .cse4)))) (forall ((v_ArrVal_422 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_30 (_ BitVec 32)) (v_ArrVal_430 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.offset| (_ BitVec 32)) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32))) (or (= |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| |c_~#value~0.base|) (= |c_~#value~0.offset| |~#inc_flag~0.offset|) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_422))) (let ((.cse8 (select .cse7 |c_~#value~0.base|))) (let ((.cse9 (select .cse8 |c_~#value~0.offset|))) (bvugt (select (select (store (let ((.cse6 (store (store .cse8 |~#inc_flag~0.offset| v_DerPreprocessor_30) |c_~#value~0.offset| (bvadd .cse9 (_ bv1 32))))) (store (store |c_#memory_int| |c_~#value~0.base| .cse6) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store (select (store .cse7 |c_~#value~0.base| .cse6) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) (_ bv0 32) (_ bv1 32)))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_430) |c_~#value~0.base|) |c_~#value~0.offset|) .cse9)))))) (forall ((v_ArrVal_422 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_32 (_ BitVec 32)) (v_ArrVal_430 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.offset| (_ BitVec 32)) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32))) (or (= |~#inc_flag~0.offset| (_ bv0 32)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_422))) (let ((.cse12 (select .cse11 |c_~#value~0.base|))) (let ((.cse13 (select .cse12 |c_~#value~0.offset|))) (bvugt (select (select (store (let ((.cse10 (store (store .cse12 |~#inc_flag~0.offset| v_DerPreprocessor_32) |c_~#value~0.offset| (bvadd .cse13 (_ bv1 32))))) (store (store |c_#memory_int| |c_~#value~0.base| .cse10) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store (select (store .cse11 |c_~#value~0.base| .cse10) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) (_ bv0 32) (_ bv1 32)))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_430) |c_~#value~0.base|) |c_~#value~0.offset|) .cse13)))) (= |c_~#value~0.offset| |~#inc_flag~0.offset|))) (forall ((v_ArrVal_422 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_425 (_ BitVec 32)) (v_ArrVal_430 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.base| (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32)) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_31 (Array (_ BitVec 32) (_ BitVec 32)))) (or (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_422))) (let ((.cse16 (select (select .cse17 |c_~#value~0.base|) |c_~#value~0.offset|))) (bvugt (select (select (store (let ((.cse15 (store .cse17 |~#inc_flag~0.base| (store (select .cse17 |~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_425)))) (let ((.cse14 (store (select .cse15 |c_~#value~0.base|) |c_~#value~0.offset| (bvadd .cse16 (_ bv1 32))))) (store (store (store |c_#memory_int| |~#inc_flag~0.base| v_DerPreprocessor_31) |c_~#value~0.base| .cse14) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store (select (store .cse15 |c_~#value~0.base| .cse14) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) (_ bv0 32) (_ bv1 32))))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_430) |c_~#value~0.base|) |c_~#value~0.offset|) .cse16))) (= |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| |~#inc_flag~0.base|) (= |~#inc_flag~0.base| |c_~#value~0.base|))) (forall ((v_ArrVal_422 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_430 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_422))) (let ((.cse20 (select .cse19 |c_~#value~0.base|))) (let ((.cse21 (select .cse20 |c_~#value~0.offset|))) (bvugt (select (select (store (let ((.cse18 (store .cse20 |c_~#value~0.offset| (bvadd .cse21 (_ bv1 32))))) (store (store |c_#memory_int| |c_~#value~0.base| .cse18) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store (select (store .cse19 |c_~#value~0.base| .cse18) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) (_ bv0 32) (_ bv1 32)))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_430) |c_~#value~0.base|) |c_~#value~0.offset|) .cse21)))))) is different from false [2023-11-24 08:06:23,804 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 7 not checked. [2023-11-24 08:06:23,804 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 08:06:23,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1452525518] [2023-11-24 08:06:23,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1452525518] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 08:06:23,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-24 08:06:23,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 13 [2023-11-24 08:06:23,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388462807] [2023-11-24 08:06:23,805 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-24 08:06:23,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-24 08:06:23,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 08:06:23,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-24 08:06:23,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=76, Unknown=6, NotChecked=84, Total=210 [2023-11-24 08:06:23,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:06:23,806 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:06:23,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 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-11-24 08:06:23,806 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:06:23,806 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:06:23,806 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:06:23,806 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:06:23,806 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-11-24 08:06:23,806 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:06:28,668 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse1 (bvadd .cse2 (_ bv1 32))) (.cse4 (= |c_thr1Thread3of3ForFork0_inc_~inc__v~0#1| .cse2))) (and (forall ((|v_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base_17| (_ BitVec 32))) (or (forall ((v_ArrVal_392 (_ BitVec 32)) (v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.base| (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32))) (bvugt (select (select (store (let ((.cse0 (store |c_#memory_int| |~#inc_flag~0.base| (store (select |c_#memory_int| |~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_392)))) (store .cse0 |c_~#value~0.base| (store (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset| .cse1))) |v_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base_17| v_DerPreprocessor_28) |c_~#value~0.base|) |c_~#value~0.offset|) .cse2)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base_17|) (_ bv0 1))))) (forall ((v_ArrVal_392 (_ BitVec 32)) (v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.base| (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32))) (bvugt (select (select (store (let ((.cse3 (store |c_#memory_int| |~#inc_flag~0.base| (store (select |c_#memory_int| |~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_392)))) (store .cse3 |c_~#value~0.base| (store (select .cse3 |c_~#value~0.base|) |c_~#value~0.offset| .cse1))) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_28) |c_~#value~0.base|) |c_~#value~0.offset|) .cse2)) (or .cse4 (forall ((v_DerPreprocessor_27 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_27) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_inc_~inc__v~0#1|))) (or (not .cse4) (forall ((v_ArrVal_392 (_ BitVec 32)) (v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.base| (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32))) (bvugt (select (select (store (let ((.cse5 (store |c_#memory_int| |~#inc_flag~0.base| (store (select |c_#memory_int| |~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_392)))) (store .cse5 |c_~#value~0.base| (store (select .cse5 |c_~#value~0.base|) |c_~#value~0.offset| (bvadd |c_thr1Thread3of3ForFork0_inc_~inc__v~0#1| (_ bv1 32))))) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_28) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_inc_~inc__v~0#1|))) (forall ((v_ArrVal_387 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_392 (_ BitVec 32)) (v_ArrVal_386 (_ BitVec 1)) (v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base_17| (_ BitVec 32)) (|~#inc_flag~0.base| (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32)) (|v_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base_22| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base_22|) (_ bv0 1))) (not (= (_ bv0 1) (select (store |c_#valid| |v_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base_22| v_ArrVal_386) |v_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base_17|))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_387))) (let ((.cse7 (select (select .cse8 |c_~#value~0.base|) |c_~#value~0.offset|))) (bvugt (select (select (store (let ((.cse6 (store .cse8 |~#inc_flag~0.base| (store (select .cse8 |~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_392)))) (store .cse6 |c_~#value~0.base| (store (select .cse6 |c_~#value~0.base|) |c_~#value~0.offset| (bvadd .cse7 (_ bv1 32))))) |v_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base_17| v_DerPreprocessor_28) |c_~#value~0.base|) |c_~#value~0.offset|) .cse7)))))))) is different from false [2023-11-24 08:06:31,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:06:31,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:06:31,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:06:31,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:06:31,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 08:06:31,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:06:31,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2023-11-24 08:06:31,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:06:31,535 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 08:06:31,535 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:06:31,535 INFO L85 PathProgramCache]: Analyzing trace with hash 631326540, now seen corresponding path program 1 times [2023-11-24 08:06:31,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 08:06:31,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1838038431] [2023-11-24 08:06:31,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:06:31,536 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:06:31,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2023-11-24 08:06:31,537 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 08:06:31,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-11-24 08:06:31,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:06:31,704 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-24 08:06:31,705 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 08:06:31,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 8 [2023-11-24 08:06:31,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-24 08:06:31,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 9 treesize of output 12 [2023-11-24 08:06:31,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 42 [2023-11-24 08:06:31,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 08:06:32,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 17 [2023-11-24 08:06:32,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 08:06:32,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-24 08:06:32,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 08:06:32,191 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 16 treesize of output 8 [2023-11-24 08:06:32,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 08:06:32,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-24 08:06:32,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2023-11-24 08:06:32,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 08:06:32,318 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 17 [2023-11-24 08:06:32,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 08:06:32,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-24 08:06:32,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 08:06:32,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-24 08:06:32,612 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-24 08:06:32,612 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 08:06:32,612 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 08:06:32,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1838038431] [2023-11-24 08:06:32,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1838038431] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 08:06:32,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 08:06:32,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 08:06:32,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133057220] [2023-11-24 08:06:32,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 08:06:32,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 08:06:32,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 08:06:32,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 08:06:32,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 08:06:32,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:06:32,613 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:06:32,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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-11-24 08:06:32,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:06:32,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:06:32,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:06:32,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:06:32,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-24 08:06:32,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:06:32,614 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:06:37,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-24 08:06:38,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:06:38,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:06:38,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:06:38,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:06:38,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 08:06:38,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:06:38,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 08:06:38,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2023-11-24 08:06:38,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:06:38,260 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 08:06:38,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:06:38,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1794706500, now seen corresponding path program 2 times [2023-11-24 08:06:38,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 08:06:38,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [951165758] [2023-11-24 08:06:38,260 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 08:06:38,260 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:06:38,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2023-11-24 08:06:38,261 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 08:06:38,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-11-24 08:06:38,416 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-24 08:06:38,416 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 08:06:38,419 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-24 08:06:38,422 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 08:06:38,514 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-24 08:06:38,514 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 13 treesize of output 13 [2023-11-24 08:06:38,681 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 16 treesize of output 11 [2023-11-24 08:06:39,320 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 16 treesize of output 11 [2023-11-24 08:06:39,955 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 16 treesize of output 11 [2023-11-24 08:06:41,044 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-11-24 08:06:41,044 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 2 case distinctions, treesize of input 35 treesize of output 18 [2023-11-24 08:06:41,521 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2023-11-24 08:06:41,522 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 3 case distinctions, treesize of input 49 treesize of output 18 [2023-11-24 08:06:41,794 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-24 08:06:41,794 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 2 case distinctions, treesize of input 22 treesize of output 18 [2023-11-24 08:06:42,290 INFO L349 Elim1Store]: treesize reduction 52, result has 23.5 percent of original size [2023-11-24 08:06:42,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 65 [2023-11-24 08:06:42,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 30 treesize of output 1 [2023-11-24 08:06:42,767 INFO L349 Elim1Store]: treesize reduction 24, result has 36.8 percent of original size [2023-11-24 08:06:42,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 69 [2023-11-24 08:06:43,006 INFO L224 Elim1Store]: Index analysis took 162 ms [2023-11-24 08:06:43,011 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-24 08:06:43,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 67 [2023-11-24 08:06:43,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2023-11-24 08:06:43,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 30 treesize of output 1 [2023-11-24 08:06:44,522 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-11-24 08:06:44,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 423 treesize of output 385 [2023-11-24 08:06:44,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 245 treesize of output 246 [2023-11-24 08:06:44,817 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-11-24 08:06:44,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 240 treesize of output 250 [2023-11-24 08:06:44,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2023-11-24 08:06:45,478 INFO L349 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2023-11-24 08:06:45,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 152 treesize of output 190 [2023-11-24 08:06:45,800 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 08:06:45,825 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-11-24 08:06:45,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 7 [2023-11-24 08:06:46,045 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 5 treesize of output 3 [2023-11-24 08:06:46,237 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 5 treesize of output 3 [2023-11-24 08:06:46,615 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 5 treesize of output 3 [2023-11-24 08:06:46,679 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 18 treesize of output 16 [2023-11-24 08:06:46,847 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 08:06:46,847 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 15 treesize of output 19 [2023-11-24 08:06:49,656 INFO L349 Elim1Store]: treesize reduction 25, result has 32.4 percent of original size [2023-11-24 08:06:49,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 86 [2023-11-24 08:06:49,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-24 08:06:51,142 INFO L349 Elim1Store]: treesize reduction 37, result has 37.3 percent of original size [2023-11-24 08:06:51,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 76 treesize of output 80 [2023-11-24 08:06:51,734 INFO L349 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2023-11-24 08:06:51,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 47 treesize of output 61 [2023-11-24 08:06:53,552 INFO L349 Elim1Store]: treesize reduction 203, result has 20.4 percent of original size [2023-11-24 08:06:53,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 71 treesize of output 94 [2023-11-24 08:06:53,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 56 [2023-11-24 08:06:53,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 08:06:53,703 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 22 treesize of output 27 [2023-11-24 08:06:54,331 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-24 08:06:54,331 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 08:06:55,262 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (= |c_thr1Thread3of3ForFork0_inc_~inc__v~0#1| (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|)))) (and (or (let ((.cse1 (= |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| |c_~#inc_flag~0.base|)) (.cse0 (select |c_#memory_int| |c_~#inc_flag~0.base|)) (.cse2 (= |c_~#inc_flag~0.base| |c_~#value~0.base|))) (and (or (forall ((v_ArrVal_517 (_ BitVec 32)) (v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store (select (store |c_#memory_int| |c_~#inc_flag~0.base| (store .cse0 |c_~#inc_flag~0.offset| v_ArrVal_517)) |c_~#value~0.base|) |c_~#value~0.offset| |c_thr1Thread3of3ForFork0_inc_~inc__vn~0#1|)) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_50) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_inc_~inc__v~0#1|)) (not .cse1)) (or (forall ((v_ArrVal_517 (_ BitVec 32)) (v_DerPreprocessor_47 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store (store (store |c_#memory_int| |c_~#inc_flag~0.base| v_DerPreprocessor_47) |c_~#value~0.base| (store (select (store |c_#memory_int| |c_~#inc_flag~0.base| (store .cse0 |c_~#inc_flag~0.offset| v_ArrVal_517)) |c_~#value~0.base|) |c_~#value~0.offset| |c_thr1Thread3of3ForFork0_inc_~inc__vn~0#1|)) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_48) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_inc_~inc__v~0#1|)) .cse1 .cse2) (or (forall ((v_ArrVal_517 (_ BitVec 32)) (v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store (select (store |c_#memory_int| |c_~#inc_flag~0.base| (store .cse0 |c_~#inc_flag~0.offset| v_ArrVal_517)) |c_~#value~0.base|) |c_~#value~0.offset| |c_thr1Thread3of3ForFork0_inc_~inc__vn~0#1|)) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_49) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_inc_~inc__v~0#1|)) (not .cse2)))) (not .cse3)) (or .cse3 (forall ((v_DerPreprocessor_46 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_46) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_inc_~inc__v~0#1|))))) is different from false [2023-11-24 08:06:59,893 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 24 [2023-11-24 08:07:00,218 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 24 [2023-11-24 08:07:00,649 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse0 (= |c_thr1Thread3of3ForFork0_inc_~inc__v~0#1| (select .cse10 |c_~#value~0.offset|)))) (and (or .cse0 (and (forall ((|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_517 (_ BitVec 32)) (v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_52 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.offset| (_ BitVec 32)) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32)) (v_ArrVal_515 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store (store |c_#memory_int| |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_52) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_515))) (or (not (= (select (select .cse1 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32))) (let ((.cse2 (select .cse1 |c_~#value~0.base|))) (let ((.cse3 (select .cse2 |c_~#value~0.offset|))) (bvugt (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_515) |c_~#value~0.base| (store (store .cse2 |~#inc_flag~0.offset| v_ArrVal_517) |c_~#value~0.offset| (bvadd (_ bv1 32) .cse3))) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_49) |c_~#value~0.base|) |c_~#value~0.offset|) .cse3)))))) (forall ((|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ BitVec 32)) (v_prenex_84 (_ BitVec 32)) (v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_85 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.base| (_ BitVec 32)) (v_DerPreprocessor_52 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.offset| (_ BitVec 32))) (let ((.cse7 (store (store |c_#memory_int| |~#inc_flag~0.base| v_DerPreprocessor_52) |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_85))) (let ((.cse5 (select .cse7 |~#inc_flag~0.base|))) (or (let ((.cse6 (select (select .cse7 |c_~#value~0.base|) |c_~#value~0.offset|))) (bvugt (select (select (store (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_85))) (store .cse4 |c_~#value~0.base| (store (select (store .cse4 |~#inc_flag~0.base| (store .cse5 |~#inc_flag~0.offset| v_prenex_84)) |c_~#value~0.base|) |c_~#value~0.offset| (bvadd (_ bv1 32) .cse6)))) |~#inc_flag~0.base| v_DerPreprocessor_50) |c_~#value~0.base|) |c_~#value~0.offset|) .cse6)) (not (= (select .cse5 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32))))))) (forall ((|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_47 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_86 (_ BitVec 32)) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_87 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.base| (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32)) (v_DerPreprocessor_52 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32))) (let ((.cse8 (store (store |c_#memory_int| |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_52) |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_87))) (or (= |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| |~#inc_flag~0.base|) (not (= (select (select .cse8 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32))) (= |~#inc_flag~0.base| |c_~#value~0.base|) (let ((.cse9 (select (select .cse8 |c_~#value~0.base|) |c_~#value~0.offset|))) (bvugt (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_87) |~#inc_flag~0.base| v_DerPreprocessor_47) |c_~#value~0.base| (store (select (store .cse8 |~#inc_flag~0.base| (store (select .cse8 |~#inc_flag~0.base|) |~#inc_flag~0.offset| v_prenex_86)) |c_~#value~0.base|) |c_~#value~0.offset| (bvadd .cse9 (_ bv1 32)))) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_48) |c_~#value~0.base|) |c_~#value~0.offset|) .cse9))))))) (or (and (forall ((|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_511 (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32)) (v_ArrVal_515 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store (store (store .cse10 |~#inc_flag~0.offset| v_ArrVal_511) |c_~#value~0.offset| |c_thr1Thread3of3ForFork0_inc_~inc__vn~0#1|) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_515) |c_~#value~0.base|) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32)))) (forall ((|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_517 (_ BitVec 32)) (v_ArrVal_511 (_ BitVec 32)) (v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.offset| (_ BitVec 32)) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32)) (v_ArrVal_515 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store |c_#memory_int| |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store (select |c_#memory_int| |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |~#inc_flag~0.offset| v_ArrVal_511)))) (let ((.cse16 (store (select .cse15 |c_~#value~0.base|) |c_~#value~0.offset| |c_thr1Thread3of3ForFork0_inc_~inc__vn~0#1|))) (let ((.cse12 (store |c_#memory_int| |c_~#value~0.base| .cse16))) (let ((.cse14 (store (store .cse12 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store (select (store .cse15 |c_~#value~0.base| .cse16) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_515))) (let ((.cse11 (select .cse14 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|))) (or (not (= (select .cse11 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32))) (let ((.cse13 (select (select .cse14 |c_~#value~0.base|) |c_~#value~0.offset|))) (bvugt (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_515) |c_~#value~0.base| (store (select (store (store .cse12 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_515) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store .cse11 |~#inc_flag~0.offset| v_ArrVal_517)) |c_~#value~0.base|) |c_~#value~0.offset| (bvadd .cse13 (_ bv1 32)))) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_50) |c_~#value~0.base|) |c_~#value~0.offset|) .cse13))))))))) (forall ((|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_517 (_ BitVec 32)) (v_DerPreprocessor_47 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_511 (_ BitVec 32)) (|~#inc_flag~0.base| (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32)) (v_DerPreprocessor_51 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32)) (v_ArrVal_515 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse21 (store |c_#memory_int| |~#inc_flag~0.base| (store (select |c_#memory_int| |~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_511)))) (let ((.cse17 (store (select .cse21 |c_~#value~0.base|) |c_~#value~0.offset| |c_thr1Thread3of3ForFork0_inc_~inc__vn~0#1|))) (let ((.cse18 (store (select (store .cse21 |c_~#value~0.base| .cse17) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32)))) (let ((.cse19 (store (store (store (store |c_#memory_int| |~#inc_flag~0.base| v_DerPreprocessor_51) |c_~#value~0.base| .cse17) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| .cse18) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_515))) (or (let ((.cse20 (select (select .cse19 |c_~#value~0.base|) |c_~#value~0.offset|))) (bvugt (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_515) |~#inc_flag~0.base| v_DerPreprocessor_47) |c_~#value~0.base| (store (select (store (store (store (store |c_#memory_int| |c_~#value~0.base| .cse17) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| .cse18) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_515) |~#inc_flag~0.base| (store (select .cse19 |~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_517)) |c_~#value~0.base|) |c_~#value~0.offset| (bvadd (_ bv1 32) .cse20))) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_48) |c_~#value~0.base|) |c_~#value~0.offset|) .cse20)) (= |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| |~#inc_flag~0.base|) (not (= (select (select .cse19 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32))) (= |~#inc_flag~0.base| |c_~#value~0.base|))))))) (forall ((|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_517 (_ BitVec 32)) (v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_511 (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32)) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32)) (v_ArrVal_515 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse22 (store (let ((.cse25 (store |c_#memory_int| |c_~#value~0.base| (store (store .cse10 |~#inc_flag~0.offset| v_ArrVal_511) |c_~#value~0.offset| |c_thr1Thread3of3ForFork0_inc_~inc__vn~0#1|)))) (store .cse25 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store (select .cse25 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32)))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_515))) (or (not (= (select (select .cse22 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32))) (let ((.cse23 (select .cse22 |c_~#value~0.base|))) (let ((.cse24 (select .cse23 |c_~#value~0.offset|))) (bvugt (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_515) |c_~#value~0.base| (store (store .cse23 |~#inc_flag~0.offset| v_ArrVal_517) |c_~#value~0.offset| (bvadd .cse24 (_ bv1 32)))) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_49) |c_~#value~0.base|) |c_~#value~0.offset|) .cse24))))))) (not .cse0))))) is different from false [2023-11-24 08:07:15,094 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_517 (_ BitVec 32)) (v_ArrVal_511 (_ BitVec 32)) (v_ArrVal_507 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.offset| (_ BitVec 32)) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32)) (v_ArrVal_515 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_507))) (let ((.cse4 (store .cse6 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store (select .cse6 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |~#inc_flag~0.offset| v_ArrVal_511)))) (let ((.cse5 (store (select .cse4 |c_~#value~0.base|) |c_~#value~0.offset| (bvadd (select (select .cse6 |c_~#value~0.base|) |c_~#value~0.offset|) (_ bv1 32))))) (let ((.cse0 (store |c_#memory_int| |c_~#value~0.base| .cse5))) (let ((.cse3 (store (store .cse0 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store (select (store .cse4 |c_~#value~0.base| .cse5) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_515))) (let ((.cse1 (select .cse3 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|))) (or (let ((.cse2 (select (select .cse3 |c_~#value~0.base|) |c_~#value~0.offset|))) (bvugt (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_515) |c_~#value~0.base| (store (select (store (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_515) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store .cse1 |~#inc_flag~0.offset| v_ArrVal_517)) |c_~#value~0.base|) |c_~#value~0.offset| (bvadd .cse2 (_ bv1 32)))) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_50) |c_~#value~0.base|) |c_~#value~0.offset|) .cse2)) (not (= (select .cse1 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32))))))))))) (forall ((|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_517 (_ BitVec 32)) (v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_511 (_ BitVec 32)) (v_ArrVal_507 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.offset| (_ BitVec 32)) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32)) (v_ArrVal_515 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_507))) (let ((.cse10 (let ((.cse12 (select .cse11 |c_~#value~0.base|))) (store (store .cse12 |~#inc_flag~0.offset| v_ArrVal_511) |c_~#value~0.offset| (bvadd (select .cse12 |c_~#value~0.offset|) (_ bv1 32)))))) (store (store |c_#memory_int| |c_~#value~0.base| .cse10) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store (select (store .cse11 |c_~#value~0.base| .cse10) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32))))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_515))) (or (let ((.cse7 (select .cse9 |c_~#value~0.base|))) (let ((.cse8 (select .cse7 |c_~#value~0.offset|))) (bvugt (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_515) |c_~#value~0.base| (store (store .cse7 |~#inc_flag~0.offset| v_ArrVal_517) |c_~#value~0.offset| (bvadd .cse8 (_ bv1 32)))) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_49) |c_~#value~0.base|) |c_~#value~0.offset|) .cse8))) (not (= (select (select .cse9 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32)))))) (forall ((|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_511 (_ BitVec 32)) (v_ArrVal_507 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.offset| (_ BitVec 32)) (v_ArrVal_515 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_507) |c_~#value~0.base|))) (store (store .cse13 |~#inc_flag~0.offset| v_ArrVal_511) |c_~#value~0.offset| (bvadd (select .cse13 |c_~#value~0.offset|) (_ bv1 32)))) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_515) |c_~#value~0.base|) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32)))) (forall ((|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_517 (_ BitVec 32)) (v_DerPreprocessor_47 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_511 (_ BitVec 32)) (v_ArrVal_507 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.base| (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32)) (v_DerPreprocessor_51 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32)) (v_ArrVal_515 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_507))) (let ((.cse18 (store .cse19 |~#inc_flag~0.base| (store (select .cse19 |~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_511)))) (let ((.cse14 (store (select .cse18 |c_~#value~0.base|) |c_~#value~0.offset| (bvadd (select (select .cse19 |c_~#value~0.base|) |c_~#value~0.offset|) (_ bv1 32))))) (let ((.cse15 (store (select (store .cse18 |c_~#value~0.base| .cse14) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32)))) (let ((.cse16 (store (store (store (store |c_#memory_int| |~#inc_flag~0.base| v_DerPreprocessor_51) |c_~#value~0.base| .cse14) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| .cse15) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_515))) (or (= |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| |~#inc_flag~0.base|) (= |~#inc_flag~0.base| |c_~#value~0.base|) (let ((.cse17 (select (select .cse16 |c_~#value~0.base|) |c_~#value~0.offset|))) (bvugt (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_515) |~#inc_flag~0.base| v_DerPreprocessor_47) |c_~#value~0.base| (store (select (store (store (store (store |c_#memory_int| |c_~#value~0.base| .cse14) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| .cse15) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_515) |~#inc_flag~0.base| (store (select .cse16 |~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_517)) |c_~#value~0.base|) |c_~#value~0.offset| (bvadd (_ bv1 32) .cse17))) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_48) |c_~#value~0.base|) |c_~#value~0.offset|) .cse17)) (not (= (select (select .cse16 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32))))))))))) is different from false [2023-11-24 08:07:21,413 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 10 not checked. [2023-11-24 08:07:21,414 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 08:07:21,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [951165758] [2023-11-24 08:07:21,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [951165758] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 08:07:21,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-24 08:07:21,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 21 [2023-11-24 08:07:21,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843369213] [2023-11-24 08:07:21,415 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-24 08:07:21,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-24 08:07:21,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 08:07:21,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-24 08:07:21,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=298, Unknown=17, NotChecked=114, Total=506 [2023-11-24 08:07:21,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:07:21,417 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:07:21,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 08:07:21,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:07:21,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:07:21,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:07:21,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:07:21,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-24 08:07:21,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:07:21,417 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 08:07:21,418 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:07:42,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-24 08:07:47,168 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse17 (select .cse0 |c_~#value~0.offset|))) (let ((.cse1 (bvadd .cse17 (_ bv1 32)))) (and (forall ((|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_511 (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32)) (v_ArrVal_515 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store (store (store .cse0 |~#inc_flag~0.offset| v_ArrVal_511) |c_~#value~0.offset| .cse1) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_515) |c_~#value~0.base|) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset|)))) (forall ((|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_517 (_ BitVec 32)) (v_DerPreprocessor_47 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_511 (_ BitVec 32)) (|~#inc_flag~0.base| (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32)) (v_DerPreprocessor_51 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32)) (v_ArrVal_515 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_int| |~#inc_flag~0.base| (store (select |c_#memory_int| |~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_511)))) (let ((.cse3 (store (select .cse6 |c_~#value~0.base|) |c_~#value~0.offset| .cse1))) (let ((.cse4 (store (select (store .cse6 |c_~#value~0.base| .cse3) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32)))) (let ((.cse2 (store (store (store (store |c_#memory_int| |~#inc_flag~0.base| v_DerPreprocessor_51) |c_~#value~0.base| .cse3) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| .cse4) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_515))) (or (= |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| |~#inc_flag~0.base|) (not (= (select (select .cse2 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32))) (let ((.cse5 (select (select .cse2 |c_~#value~0.base|) |c_~#value~0.offset|))) (bvugt (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_515) |~#inc_flag~0.base| v_DerPreprocessor_47) |c_~#value~0.base| (store (select (store (store (store (store |c_#memory_int| |c_~#value~0.base| .cse3) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| .cse4) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_515) |~#inc_flag~0.base| (store (select .cse2 |~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_517)) |c_~#value~0.base|) |c_~#value~0.offset| (bvadd .cse5 (_ bv1 32)))) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_48) |c_~#value~0.base|) |c_~#value~0.offset|) .cse5)) (= |~#inc_flag~0.base| |c_~#value~0.base|))))))) (forall ((|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_517 (_ BitVec 32)) (v_ArrVal_511 (_ BitVec 32)) (v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.offset| (_ BitVec 32)) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32)) (v_ArrVal_515 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_int| |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store (select |c_#memory_int| |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |~#inc_flag~0.offset| v_ArrVal_511)))) (let ((.cse12 (store (select .cse11 |c_~#value~0.base|) |c_~#value~0.offset| .cse1))) (let ((.cse7 (store |c_#memory_int| |c_~#value~0.base| .cse12))) (let ((.cse10 (store (store .cse7 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store (select (store .cse11 |c_~#value~0.base| .cse12) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_515))) (let ((.cse8 (select .cse10 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|))) (or (let ((.cse9 (select (select .cse10 |c_~#value~0.base|) |c_~#value~0.offset|))) (bvugt (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_515) |c_~#value~0.base| (store (select (store (store .cse7 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_515) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store .cse8 |~#inc_flag~0.offset| v_ArrVal_517)) |c_~#value~0.base|) |c_~#value~0.offset| (bvadd .cse9 (_ bv1 32)))) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_50) |c_~#value~0.base|) |c_~#value~0.offset|) .cse9)) (not (= (select .cse8 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32)))))))))) (forall ((|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_517 (_ BitVec 32)) (v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_511 (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32)) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32)) (v_ArrVal_515 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse15 (store (let ((.cse16 (store |c_#memory_int| |c_~#value~0.base| (store (store .cse0 |~#inc_flag~0.offset| v_ArrVal_511) |c_~#value~0.offset| .cse1)))) (store .cse16 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store (select .cse16 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32)))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_515))) (or (let ((.cse13 (select .cse15 |c_~#value~0.base|))) (let ((.cse14 (select .cse13 |c_~#value~0.offset|))) (bvugt (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_515) |c_~#value~0.base| (store (store .cse13 |~#inc_flag~0.offset| v_ArrVal_517) |c_~#value~0.offset| (bvadd .cse14 (_ bv1 32)))) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_49) |c_~#value~0.base|) |c_~#value~0.offset|) .cse14))) (not (= (select (select .cse15 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32)))))) (bvugt .cse17 |c_thr1Thread3of3ForFork0_inc_~inc__v~0#1|))))) is different from false [2023-11-24 08:07:55,266 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| |c_~#value~0.base|))) (let ((.cse55 (select .cse10 |c_~#value~0.offset|)) (.cse1 (select |c_#memory_int| (_ bv3 32)))) (let ((.cse0 (select .cse1 |c_~#value~0.offset|)) (.cse4 (= |c_~#inc_flag~0.base| |c_~#value~0.base|)) (.cse9 (= |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| |c_~#inc_flag~0.base|)) (.cse11 (bvadd .cse55 (_ bv1 32))) (.cse29 (= |c_thr1Thread3of3ForFork0_inc_~inc__v~0#1| .cse55))) (and (= .cse0 |c_thr1Thread3of3ForFork0_inc_~inc__v~0#1|) (let ((.cse3 (= .cse0 (_ bv1 32))) (.cse2 (select |c_#memory_int| |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|))) (or (and (exists ((|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ BitVec 32))) (and (= (select .cse1 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv1 32)) (= (select .cse2 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32)))) .cse3) (and (not (= |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ bv3 32))) .cse3 (exists ((|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ BitVec 32))) (= (select .cse2 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32)))))) (or (not .cse4) (forall ((v_ArrVal_517 (_ BitVec 32)) (v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_515 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_515))) (or (let ((.cse6 (select (select .cse5 |c_~#value~0.base|) |c_~#value~0.offset|))) (bvugt (select (select (store (store .cse5 |c_~#value~0.base| (store (select (store .cse5 |c_~#inc_flag~0.base| (store (select .cse5 |c_~#inc_flag~0.base|) |c_~#inc_flag~0.offset| v_ArrVal_517)) |c_~#value~0.base|) |c_~#value~0.offset| (bvadd .cse6 (_ bv1 32)))) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_49) |c_~#value~0.base|) |c_~#value~0.offset|) .cse6)) (not (= (select (select .cse5 |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32))))))) (or (forall ((v_ArrVal_517 (_ BitVec 32)) (v_DerPreprocessor_47 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_515 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_515))) (or (not (= (select (select .cse7 |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32))) (let ((.cse8 (select (select .cse7 |c_~#value~0.base|) |c_~#value~0.offset|))) (bvugt (select (select (store (store (store .cse7 |c_~#inc_flag~0.base| v_DerPreprocessor_47) |c_~#value~0.base| (store (select (store .cse7 |c_~#inc_flag~0.base| (store (select .cse7 |c_~#inc_flag~0.base|) |c_~#inc_flag~0.offset| v_ArrVal_517)) |c_~#value~0.base|) |c_~#value~0.offset| (bvadd .cse8 (_ bv1 32)))) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_48) |c_~#value~0.base|) |c_~#value~0.offset|) .cse8))))) .cse9 .cse4) (forall ((|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_511 (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32)) (v_ArrVal_515 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store (store (store .cse10 |~#inc_flag~0.offset| v_ArrVal_511) |c_~#value~0.offset| .cse11) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_515) |c_~#value~0.base|) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset|)))) (forall ((|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_517 (_ BitVec 32)) (v_DerPreprocessor_47 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_511 (_ BitVec 32)) (|~#inc_flag~0.base| (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32)) (v_DerPreprocessor_51 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32)) (v_ArrVal_515 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse16 (store |c_#memory_int| |~#inc_flag~0.base| (store (select |c_#memory_int| |~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_511)))) (let ((.cse13 (store (select .cse16 |c_~#value~0.base|) |c_~#value~0.offset| .cse11))) (let ((.cse14 (store (select (store .cse16 |c_~#value~0.base| .cse13) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32)))) (let ((.cse12 (store (store (store (store |c_#memory_int| |~#inc_flag~0.base| v_DerPreprocessor_51) |c_~#value~0.base| .cse13) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| .cse14) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_515))) (or (= |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| |~#inc_flag~0.base|) (not (= (select (select .cse12 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32))) (let ((.cse15 (select (select .cse12 |c_~#value~0.base|) |c_~#value~0.offset|))) (bvugt (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_515) |~#inc_flag~0.base| v_DerPreprocessor_47) |c_~#value~0.base| (store (select (store (store (store (store |c_#memory_int| |c_~#value~0.base| .cse13) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| .cse14) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_515) |~#inc_flag~0.base| (store (select .cse12 |~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_517)) |c_~#value~0.base|) |c_~#value~0.offset| (bvadd .cse15 (_ bv1 32)))) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_48) |c_~#value~0.base|) |c_~#value~0.offset|) .cse15)) (= |~#inc_flag~0.base| |c_~#value~0.base|))))))) (or (not .cse9) (forall ((v_ArrVal_517 (_ BitVec 32)) (v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_515 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_515))) (or (let ((.cse18 (select (select .cse17 |c_~#value~0.base|) |c_~#value~0.offset|))) (bvugt (select (select (store (store .cse17 |c_~#value~0.base| (store (select (store .cse17 |c_~#inc_flag~0.base| (store (select .cse17 |c_~#inc_flag~0.base|) |c_~#inc_flag~0.offset| v_ArrVal_517)) |c_~#value~0.base|) |c_~#value~0.offset| (bvadd .cse18 (_ bv1 32)))) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_50) |c_~#value~0.base|) |c_~#value~0.offset|) .cse18)) (not (= (select (select .cse17 |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32))))))) (forall ((|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_517 (_ BitVec 32)) (v_ArrVal_511 (_ BitVec 32)) (v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.offset| (_ BitVec 32)) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32)) (v_ArrVal_515 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse23 (store |c_#memory_int| |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store (select |c_#memory_int| |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |~#inc_flag~0.offset| v_ArrVal_511)))) (let ((.cse24 (store (select .cse23 |c_~#value~0.base|) |c_~#value~0.offset| .cse11))) (let ((.cse19 (store |c_#memory_int| |c_~#value~0.base| .cse24))) (let ((.cse22 (store (store .cse19 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store (select (store .cse23 |c_~#value~0.base| .cse24) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_515))) (let ((.cse20 (select .cse22 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|))) (or (let ((.cse21 (select (select .cse22 |c_~#value~0.base|) |c_~#value~0.offset|))) (bvugt (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_515) |c_~#value~0.base| (store (select (store (store .cse19 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_515) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store .cse20 |~#inc_flag~0.offset| v_ArrVal_517)) |c_~#value~0.base|) |c_~#value~0.offset| (bvadd .cse21 (_ bv1 32)))) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_50) |c_~#value~0.base|) |c_~#value~0.offset|) .cse21)) (not (= (select .cse20 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32)))))))))) (forall ((|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_517 (_ BitVec 32)) (v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_511 (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32)) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32)) (v_ArrVal_515 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse27 (store (let ((.cse28 (store |c_#memory_int| |c_~#value~0.base| (store (store .cse10 |~#inc_flag~0.offset| v_ArrVal_511) |c_~#value~0.offset| .cse11)))) (store .cse28 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store (select .cse28 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32)))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_515))) (or (let ((.cse25 (select .cse27 |c_~#value~0.base|))) (let ((.cse26 (select .cse25 |c_~#value~0.offset|))) (bvugt (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_515) |c_~#value~0.base| (store (store .cse25 |~#inc_flag~0.offset| v_ArrVal_517) |c_~#value~0.offset| (bvadd .cse26 (_ bv1 32)))) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_49) |c_~#value~0.base|) |c_~#value~0.offset|) .cse26))) (not (= (select (select .cse27 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32)))))) (or (not .cse29) (let ((.cse30 (bvadd |c_thr1Thread3of3ForFork0_inc_~inc__v~0#1| (_ bv1 32)))) (and (forall ((|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_511 (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32)) (v_ArrVal_515 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_int| |c_~#value~0.base| (store (store (store .cse10 |~#inc_flag~0.offset| v_ArrVal_511) |c_~#value~0.offset| .cse30) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_515) |c_~#value~0.base|) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32)))) (forall ((|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_517 (_ BitVec 32)) (v_DerPreprocessor_47 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_511 (_ BitVec 32)) (|~#inc_flag~0.base| (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32)) (v_DerPreprocessor_51 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32)) (v_ArrVal_515 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse35 (store |c_#memory_int| |~#inc_flag~0.base| (store (select |c_#memory_int| |~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_511)))) (let ((.cse32 (store (select .cse35 |c_~#value~0.base|) |c_~#value~0.offset| .cse30))) (let ((.cse33 (store (select (store .cse35 |c_~#value~0.base| .cse32) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32)))) (let ((.cse31 (store (store (store (store |c_#memory_int| |~#inc_flag~0.base| v_DerPreprocessor_51) |c_~#value~0.base| .cse32) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| .cse33) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_515))) (or (not (= (select (select .cse31 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32))) (= |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| |~#inc_flag~0.base|) (let ((.cse34 (select (select .cse31 |c_~#value~0.base|) |c_~#value~0.offset|))) (bvugt (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_515) |~#inc_flag~0.base| v_DerPreprocessor_47) |c_~#value~0.base| (store (select (store (store (store (store |c_#memory_int| |c_~#value~0.base| .cse32) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| .cse33) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_515) |~#inc_flag~0.base| (store (select .cse31 |~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_517)) |c_~#value~0.base|) |c_~#value~0.offset| (bvadd .cse34 (_ bv1 32)))) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_48) |c_~#value~0.base|) |c_~#value~0.offset|) .cse34)) (= |~#inc_flag~0.base| |c_~#value~0.base|))))))) (forall ((|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_517 (_ BitVec 32)) (v_ArrVal_511 (_ BitVec 32)) (v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.offset| (_ BitVec 32)) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32)) (v_ArrVal_515 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse40 (store |c_#memory_int| |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store (select |c_#memory_int| |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |~#inc_flag~0.offset| v_ArrVal_511)))) (let ((.cse41 (store (select .cse40 |c_~#value~0.base|) |c_~#value~0.offset| .cse30))) (let ((.cse37 (store |c_#memory_int| |c_~#value~0.base| .cse41))) (let ((.cse39 (store (store .cse37 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store (select (store .cse40 |c_~#value~0.base| .cse41) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_515))) (let ((.cse36 (select .cse39 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|))) (or (not (= (select .cse36 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32))) (let ((.cse38 (select (select .cse39 |c_~#value~0.base|) |c_~#value~0.offset|))) (bvugt (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_515) |c_~#value~0.base| (store (select (store (store .cse37 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_515) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store .cse36 |~#inc_flag~0.offset| v_ArrVal_517)) |c_~#value~0.base|) |c_~#value~0.offset| (bvadd .cse38 (_ bv1 32)))) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_50) |c_~#value~0.base|) |c_~#value~0.offset|) .cse38))))))))) (forall ((|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_517 (_ BitVec 32)) (v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_511 (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32)) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32)) (v_ArrVal_515 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse42 (store (let ((.cse45 (store |c_#memory_int| |c_~#value~0.base| (store (store .cse10 |~#inc_flag~0.offset| v_ArrVal_511) |c_~#value~0.offset| .cse30)))) (store .cse45 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store (select .cse45 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32)))) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_515))) (or (not (= (select (select .cse42 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32))) (let ((.cse43 (select .cse42 |c_~#value~0.base|))) (let ((.cse44 (select .cse43 |c_~#value~0.offset|))) (bvugt (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_515) |c_~#value~0.base| (store (store .cse43 |~#inc_flag~0.offset| v_ArrVal_517) |c_~#value~0.offset| (bvadd .cse44 (_ bv1 32)))) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_49) |c_~#value~0.base|) |c_~#value~0.offset|) .cse44))))))))) (= (_ bv3 32) |c_~#value~0.base|) (or .cse29 (and (forall ((|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_517 (_ BitVec 32)) (v_DerPreprocessor_49 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_52 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.offset| (_ BitVec 32)) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32)) (v_ArrVal_515 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse46 (store (store |c_#memory_int| |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_52) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_515))) (or (not (= (select (select .cse46 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32))) (let ((.cse47 (select .cse46 |c_~#value~0.base|))) (let ((.cse48 (select .cse47 |c_~#value~0.offset|))) (bvugt (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_515) |c_~#value~0.base| (store (store .cse47 |~#inc_flag~0.offset| v_ArrVal_517) |c_~#value~0.offset| (bvadd (_ bv1 32) .cse48))) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_49) |c_~#value~0.base|) |c_~#value~0.offset|) .cse48)))))) (forall ((|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ BitVec 32)) (v_prenex_84 (_ BitVec 32)) (v_DerPreprocessor_50 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_85 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.base| (_ BitVec 32)) (v_DerPreprocessor_52 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.offset| (_ BitVec 32))) (let ((.cse52 (store (store |c_#memory_int| |~#inc_flag~0.base| v_DerPreprocessor_52) |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_85))) (let ((.cse50 (select .cse52 |~#inc_flag~0.base|))) (or (let ((.cse51 (select (select .cse52 |c_~#value~0.base|) |c_~#value~0.offset|))) (bvugt (select (select (store (let ((.cse49 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_85))) (store .cse49 |c_~#value~0.base| (store (select (store .cse49 |~#inc_flag~0.base| (store .cse50 |~#inc_flag~0.offset| v_prenex_84)) |c_~#value~0.base|) |c_~#value~0.offset| (bvadd (_ bv1 32) .cse51)))) |~#inc_flag~0.base| v_DerPreprocessor_50) |c_~#value~0.base|) |c_~#value~0.offset|) .cse51)) (not (= (select .cse50 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32))))))) (forall ((|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_47 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_86 (_ BitVec 32)) (v_DerPreprocessor_48 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_87 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.base| (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32)) (v_DerPreprocessor_52 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32))) (let ((.cse53 (store (store |c_#memory_int| |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_52) |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_87))) (or (= |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| |~#inc_flag~0.base|) (not (= (select (select .cse53 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset|) (_ bv0 32))) (= |~#inc_flag~0.base| |c_~#value~0.base|) (let ((.cse54 (select (select .cse53 |c_~#value~0.base|) |c_~#value~0.offset|))) (bvugt (select (select (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_87) |~#inc_flag~0.base| v_DerPreprocessor_47) |c_~#value~0.base| (store (select (store .cse53 |~#inc_flag~0.base| (store (select .cse53 |~#inc_flag~0.base|) |~#inc_flag~0.offset| v_prenex_86)) |c_~#value~0.base|) |c_~#value~0.offset| (bvadd .cse54 (_ bv1 32)))) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_48) |c_~#value~0.base|) |c_~#value~0.offset|) .cse54))))))))))) is different from true [2023-11-24 08:07:59,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-24 08:08:01,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-24 08:08:17,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-24 08:08:23,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-24 08:08:26,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-24 08:08:36,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-24 08:08:36,771 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|))) (let ((.cse1 (bvadd .cse2 (_ bv1 32))) (.cse7 (= |c_thr1Thread3of3ForFork0_inc_~inc__v~0#1| .cse2))) (and (forall ((|v_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base_17| (_ BitVec 32))) (or (forall ((v_ArrVal_392 (_ BitVec 32)) (v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.base| (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32))) (bvugt (select (select (store (let ((.cse0 (store |c_#memory_int| |~#inc_flag~0.base| (store (select |c_#memory_int| |~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_392)))) (store .cse0 |c_~#value~0.base| (store (select .cse0 |c_~#value~0.base|) |c_~#value~0.offset| .cse1))) |v_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base_17| v_DerPreprocessor_28) |c_~#value~0.base|) |c_~#value~0.offset|) .cse2)) (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base_17|) (_ bv0 1))))) (forall ((v_ArrVal_392 (_ BitVec 32)) (v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.base| (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32))) (bvugt (select (select (store (let ((.cse3 (store |c_#memory_int| |~#inc_flag~0.base| (store (select |c_#memory_int| |~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_392)))) (store .cse3 |c_~#value~0.base| (store (select .cse3 |c_~#value~0.base|) |c_~#value~0.offset| .cse1))) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_28) |c_~#value~0.base|) |c_~#value~0.offset|) .cse2)) (forall ((v_ArrVal_387 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_392 (_ BitVec 32)) (v_ArrVal_386 (_ BitVec 1)) (v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base_17| (_ BitVec 32)) (|~#inc_flag~0.base| (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_ArrVal_386) |v_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base_17|))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_387))) (let ((.cse5 (select (select .cse6 |c_~#value~0.base|) |c_~#value~0.offset|))) (bvugt (select (select (store (let ((.cse4 (store .cse6 |~#inc_flag~0.base| (store (select .cse6 |~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_392)))) (store .cse4 |c_~#value~0.base| (store (select .cse4 |c_~#value~0.base|) |c_~#value~0.offset| (bvadd .cse5 (_ bv1 32))))) |v_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base_17| v_DerPreprocessor_28) |c_~#value~0.base|) |c_~#value~0.offset|) .cse5))))) (or .cse7 (forall ((v_DerPreprocessor_27 (Array (_ BitVec 32) (_ BitVec 32)))) (bvugt (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_27) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_inc_~inc__v~0#1|))) (or (not .cse7) (forall ((v_ArrVal_392 (_ BitVec 32)) (v_DerPreprocessor_28 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.base| (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32))) (bvugt (select (select (store (let ((.cse8 (store |c_#memory_int| |~#inc_flag~0.base| (store (select |c_#memory_int| |~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_392)))) (store .cse8 |c_~#value~0.base| (store (select .cse8 |c_~#value~0.base|) |c_~#value~0.offset| (bvadd |c_thr1Thread3of3ForFork0_inc_~inc__v~0#1| (_ bv1 32))))) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_28) |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread3of3ForFork0_inc_~inc__v~0#1|)))))) is different from false [2023-11-24 08:08:44,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-24 08:08:55,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:08:55,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:08:55,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 08:08:55,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:08:55,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-24 08:08:55,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:08:55,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 08:08:55,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-24 08:08:55,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2023-11-24 08:08:55,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:08:55,728 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 08:08:55,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:08:55,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1000648533, now seen corresponding path program 1 times [2023-11-24 08:08:55,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 08:08:55,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1139198433] [2023-11-24 08:08:55,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:08:55,729 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:08:55,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2023-11-24 08:08:55,730 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 08:08:55,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-11-24 08:08:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:08:55,898 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-24 08:08:55,900 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 08:08:58,433 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 0 case distinctions, treesize of input 33 treesize of output 25 [2023-11-24 08:08:59,238 INFO L349 Elim1Store]: treesize reduction 61, result has 37.1 percent of original size [2023-11-24 08:08:59,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 44 treesize of output 86 [2023-11-24 08:08:59,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-24 08:08:59,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-24 08:08:59,639 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2023-11-24 08:09:00,853 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-24 08:09:00,853 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 08:09:00,853 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 08:09:00,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1139198433] [2023-11-24 08:09:00,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1139198433] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 08:09:00,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 08:09:00,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-24 08:09:00,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867270332] [2023-11-24 08:09:00,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 08:09:00,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-24 08:09:00,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 08:09:00,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-24 08:09:00,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-24 08:09:00,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:09:00,855 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:09:00,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 08:09:00,855 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:09:00,855 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:09:00,856 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-11-24 08:09:00,856 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:09:00,856 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-11-24 08:09:00,856 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:09:00,856 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 08:09:00,856 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-24 08:09:00,856 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:09:04,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:09:04,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:09:04,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 08:09:04,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:09:04,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-24 08:09:04,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:09:04,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 08:09:04,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-24 08:09:04,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 08:09:05,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2023-11-24 08:09:05,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:09:05,204 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 08:09:05,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:09:05,205 INFO L85 PathProgramCache]: Analyzing trace with hash 955333108, now seen corresponding path program 2 times [2023-11-24 08:09:05,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 08:09:05,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [797086902] [2023-11-24 08:09:05,205 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 08:09:05,205 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:09:05,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2023-11-24 08:09:05,206 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 08:09:05,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-11-24 08:09:05,417 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-24 08:09:05,417 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 08:09:05,421 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-24 08:09:05,423 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 08:09:08,640 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 0 case distinctions, treesize of input 21 treesize of output 21 [2023-11-24 08:09:08,860 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-24 08:09:08,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 15 [2023-11-24 08:09:08,991 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 0 case distinctions, treesize of input 16 treesize of output 16 [2023-11-24 08:09:09,037 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 16 treesize of output 11 [2023-11-24 08:09:10,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2023-11-24 08:09:10,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-24 08:09:10,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 08:09:10,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-24 08:09:10,542 INFO L349 Elim1Store]: treesize reduction 29, result has 3.3 percent of original size [2023-11-24 08:09:10,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 56 [2023-11-24 08:09:10,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-24 08:09:10,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 23 [2023-11-24 08:09:11,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-24 08:09:17,647 INFO L349 Elim1Store]: treesize reduction 29, result has 49.1 percent of original size [2023-11-24 08:09:17,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 108 treesize of output 115 [2023-11-24 08:09:17,861 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-24 08:09:17,862 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 08:09:17,862 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 08:09:17,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [797086902] [2023-11-24 08:09:17,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [797086902] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 08:09:17,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 08:09:17,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-24 08:09:17,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933054817] [2023-11-24 08:09:17,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 08:09:17,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-24 08:09:17,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 08:09:17,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-24 08:09:17,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=76, Unknown=2, NotChecked=0, Total=110 [2023-11-24 08:09:17,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:09:17,863 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:09:17,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 08:09:17,863 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:09:17,863 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:09:17,863 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-11-24 08:09:17,863 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:09:17,863 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-11-24 08:09:17,863 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:09:17,863 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 08:09:17,863 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-24 08:09:17,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 08:09:17,864 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:09:24,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 08:09:27,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 08:09:29,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 08:09:31,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 08:09:35,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 08:09:44,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 08:09:46,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 08:09:52,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 08:09:55,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 08:09:55,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:09:55,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:09:55,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 08:09:55,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:09:55,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-24 08:09:55,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:09:55,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 08:09:55,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-24 08:09:55,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 08:09:55,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-24 08:09:55,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2023-11-24 08:09:55,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:09:55,621 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 08:09:55,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:09:55,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1533436250, now seen corresponding path program 1 times [2023-11-24 08:09:55,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 08:09:55,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1178369440] [2023-11-24 08:09:55,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:09:55,622 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:09:55,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2023-11-24 08:09:55,623 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 08:09:55,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-11-24 08:09:55,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:09:55,807 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-24 08:09:55,810 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 08:09:59,363 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 0 case distinctions, treesize of input 33 treesize of output 25 [2023-11-24 08:10:00,116 INFO L349 Elim1Store]: treesize reduction 65, result has 33.0 percent of original size [2023-11-24 08:10:00,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 44 treesize of output 82 [2023-11-24 08:10:00,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-24 08:10:00,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 08:10:00,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-24 08:10:00,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 23 [2023-11-24 08:10:03,455 INFO L349 Elim1Store]: treesize reduction 36, result has 36.8 percent of original size [2023-11-24 08:10:03,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 90 treesize of output 97 [2023-11-24 08:10:03,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-24 08:10:04,085 INFO L224 Elim1Store]: Index analysis took 153 ms [2023-11-24 08:10:04,779 INFO L349 Elim1Store]: treesize reduction 126, result has 12.5 percent of original size [2023-11-24 08:10:04,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 110 treesize of output 132 [2023-11-24 08:10:04,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 08:10:05,033 INFO L224 Elim1Store]: Index analysis took 206 ms [2023-11-24 08:10:06,408 INFO L349 Elim1Store]: treesize reduction 72, result has 41.0 percent of original size [2023-11-24 08:10:06,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 123 treesize of output 136 [2023-11-24 08:10:06,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-24 08:10:07,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-24 08:10:07,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 32 [2023-11-24 08:10:08,684 INFO L349 Elim1Store]: treesize reduction 39, result has 42.6 percent of original size [2023-11-24 08:10:08,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 95 treesize of output 108 [2023-11-24 08:10:08,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-24 08:10:09,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 08:10:09,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 1 [2023-11-24 08:10:09,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2023-11-24 08:10:09,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-11-24 08:10:09,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 08:10:09,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-24 08:10:11,912 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-24 08:10:11,912 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 08:10:11,912 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 08:10:11,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1178369440] [2023-11-24 08:10:11,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1178369440] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 08:10:11,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 08:10:11,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-24 08:10:11,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624824078] [2023-11-24 08:10:11,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 08:10:11,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-24 08:10:11,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 08:10:11,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-24 08:10:11,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-11-24 08:10:11,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:10:11,915 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:10:11,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 8 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 08:10:11,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:10:11,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:10:11,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-11-24 08:10:11,915 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:10:11,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-11-24 08:10:11,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:10:11,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 08:10:11,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-24 08:10:11,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 08:10:11,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2023-11-24 08:10:11,916 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:10:24,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 08:10:25,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:10:25,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:10:25,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 08:10:25,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:10:25,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-24 08:10:25,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:10:25,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 08:10:25,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-24 08:10:25,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:10:25,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-24 08:10:25,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-24 08:10:25,981 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2023-11-24 08:10:26,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:10:26,178 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 08:10:26,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:10:26,178 INFO L85 PathProgramCache]: Analyzing trace with hash 409769401, now seen corresponding path program 1 times [2023-11-24 08:10:26,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 08:10:26,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [962250284] [2023-11-24 08:10:26,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:10:26,179 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:10:26,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2023-11-24 08:10:26,180 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 08:10:26,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2023-11-24 08:10:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:10:26,365 INFO L262 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-24 08:10:26,368 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 08:10:26,533 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-24 08:10:26,533 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 13 treesize of output 13 [2023-11-24 08:10:29,955 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 0 case distinctions, treesize of input 33 treesize of output 25 [2023-11-24 08:10:30,827 INFO L349 Elim1Store]: treesize reduction 61, result has 37.1 percent of original size [2023-11-24 08:10:30,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 44 treesize of output 86 [2023-11-24 08:10:30,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-24 08:10:31,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 08:10:31,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-24 08:10:31,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2023-11-24 08:10:32,152 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2023-11-24 08:10:32,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 34 [2023-11-24 08:10:33,613 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 16 treesize of output 11 [2023-11-24 08:10:33,848 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-24 08:10:33,848 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 08:10:35,277 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 08:10:35,277 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 41 treesize of output 34 [2023-11-24 08:10:35,388 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 08:10:35,389 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 551 treesize of output 541 [2023-11-24 08:10:35,419 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 234 treesize of output 226 [2023-11-24 08:10:35,446 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 226 treesize of output 210 [2023-11-24 08:10:35,859 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 6 treesize of output 4 [2023-11-24 08:10:37,146 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 3 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-24 08:10:37,146 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 08:10:37,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [962250284] [2023-11-24 08:10:37,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [962250284] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 08:10:37,146 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-24 08:10:37,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2023-11-24 08:10:37,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965110390] [2023-11-24 08:10:37,147 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-24 08:10:37,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-24 08:10:37,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 08:10:37,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-24 08:10:37,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=65, Unknown=13, NotChecked=0, Total=110 [2023-11-24 08:10:37,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:10:37,147 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:10:37,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 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-11-24 08:10:37,148 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:10:37,148 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:10:37,148 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-11-24 08:10:37,148 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:10:37,148 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-11-24 08:10:37,148 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:10:37,148 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 08:10:37,148 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-24 08:10:37,148 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:10:37,148 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-11-24 08:10:37,148 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-11-24 08:10:37,148 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:10:44,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:10:44,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:10:44,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 08:10:44,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:10:44,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-24 08:10:44,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:10:44,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 08:10:44,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-24 08:10:44,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:10:44,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-24 08:10:44,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-24 08:10:44,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 08:10:44,879 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2023-11-24 08:10:45,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:10:45,076 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 08:10:45,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:10:45,077 INFO L85 PathProgramCache]: Analyzing trace with hash -19065505, now seen corresponding path program 1 times [2023-11-24 08:10:45,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 08:10:45,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2027761302] [2023-11-24 08:10:45,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:10:45,077 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:10:45,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2023-11-24 08:10:45,078 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 08:10:45,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2023-11-24 08:10:45,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:10:45,282 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-24 08:10:45,285 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 08:10:45,438 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-24 08:10:45,438 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 13 treesize of output 13 [2023-11-24 08:10:49,899 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 0 case distinctions, treesize of input 33 treesize of output 25 [2023-11-24 08:10:50,728 INFO L349 Elim1Store]: treesize reduction 61, result has 37.1 percent of original size [2023-11-24 08:10:50,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 44 treesize of output 86 [2023-11-24 08:10:50,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-24 08:10:51,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-24 08:10:51,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2023-11-24 08:10:51,461 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-24 08:10:53,329 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 16 treesize of output 11 [2023-11-24 08:10:54,489 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2023-11-24 08:10:55,225 INFO L349 Elim1Store]: treesize reduction 65, result has 33.0 percent of original size [2023-11-24 08:10:55,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 44 treesize of output 82 [2023-11-24 08:10:55,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-24 08:10:55,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 08:10:55,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-24 08:10:55,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 12 [2023-11-24 08:10:56,760 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-24 08:10:56,761 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 08:10:57,242 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_thr1Thread3of3ForFork0_inc_~inc__v~0#1| (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|)))) (and (or (not .cse0) (forall ((v_ArrVal_741 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_746 (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32)) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32))) (not (= (select (select (let ((.cse1 (store (store |c_#memory_int| |c_~#inc_flag~0.base| (store (select |c_#memory_int| |c_~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_746)) |c_~#value~0.base| v_ArrVal_741))) (store .cse1 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store (select .cse1 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32)))) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) (_ bv0 32))))) (or .cse0 (forall ((v_DerPreprocessor_66 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_66) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|))))))) is different from false [2023-11-24 08:10:57,423 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_741 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_746 (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32)) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32))) (not (= (select (select (let ((.cse0 (store (store |c_#memory_int| |c_~#inc_flag~0.base| (store (select |c_#memory_int| |c_~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_746)) |c_~#value~0.base| v_ArrVal_741))) (store .cse0 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store (select .cse0 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32)))) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) (_ bv0 32)))) is different from false [2023-11-24 08:10:57,527 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_740 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_741 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_746 (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32)) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32))) (not (= (select (select (let ((.cse0 (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_740))) (store .cse1 |c_~#inc_flag~0.base| (store (select .cse1 |c_~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_746))) |c_~#value~0.base| v_ArrVal_741))) (store .cse0 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store (select .cse0 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32)))) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) (_ bv0 32)))) is different from false [2023-11-24 08:10:58,207 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (= (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread2of3ForFork0_dec_~dec__v~0#1|))) (and (or (forall ((v_DerPreprocessor_67 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_740 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_741 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_746 (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32)) (|thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| (_ BitVec 32)) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32))) (not (= (select (select (let ((.cse0 (store (let ((.cse1 (store (store |c_#memory_int| |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_67) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_740))) (store .cse1 |c_~#inc_flag~0.base| (store (select .cse1 |c_~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_746))) |c_~#value~0.base| v_ArrVal_741))) (store .cse0 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store (select .cse0 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32)))) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) (_ bv0 32)))) .cse2) (or (not .cse2) (forall ((v_ArrVal_740 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_741 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_746 (_ BitVec 32)) (v_ArrVal_737 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.offset| (_ BitVec 32)) (|thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| (_ BitVec 32)) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32))) (not (= (select (select (let ((.cse3 (store (let ((.cse4 (store |c_#memory_int| |c_~#dec_flag~0.base| (store (select |c_#memory_int| |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset| (_ bv1 32))))) (let ((.cse6 (store .cse4 |c_~#value~0.base| v_ArrVal_737))) (let ((.cse5 (store (select .cse6 |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.offset| (_ bv1 32)))) (store (store (store .cse4 |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse5) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_740) |c_~#inc_flag~0.base| (store (select (store (store .cse6 |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse5) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_740) |c_~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_746))))) |c_~#value~0.base| v_ArrVal_741))) (store .cse3 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store (select .cse3 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32)))) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) (_ bv0 32))))))) is different from false [2023-11-24 08:10:58,495 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 08:10:58,495 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 164 treesize of output 109 [2023-11-24 08:12:09,066 WARN L293 SmtUtils]: Spent 1.17m on a formula simplification. DAG size of input: 64 DAG size of output: 43 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-24 08:12:09,066 INFO L349 Elim1Store]: treesize reduction 63, result has 51.5 percent of original size [2023-11-24 08:12:09,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 14655455 treesize of output 14278399 [2023-11-24 08:12:13,843 INFO L224 Elim1Store]: Index analysis took 140 ms [2023-11-24 08:12:14,712 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 08:12:14,715 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 282789 treesize of output 281253 [2023-11-24 08:12:20,802 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 90842 treesize of output 88754 [2023-11-24 08:12:25,492 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 81842 treesize of output 78738 [2023-11-24 08:12:26,912 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 92446 treesize of output 91170 [2023-11-24 08:13:09,424 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 6 treesize of output 4 [2023-11-24 08:13:12,575 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-24 08:13:12,577 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-24 08:13:12,579 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-24 08:13:12,606 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-24 08:13:12,608 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-24 08:13:12,611 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-24 08:13:12,669 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 562 treesize of output 532 [2023-11-24 08:13:14,715 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 11 not checked. [2023-11-24 08:13:14,715 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 08:13:14,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2027761302] [2023-11-24 08:13:14,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2027761302] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 08:13:14,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-24 08:13:14,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 14 [2023-11-24 08:13:14,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192001638] [2023-11-24 08:13:14,724 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-24 08:13:14,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-24 08:13:14,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 08:13:14,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-24 08:13:14,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=94, Unknown=4, NotChecked=92, Total=240 [2023-11-24 08:13:14,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:13:14,726 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:13:14,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.266666666666667) internal successors, (79), 15 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-11-24 08:13:14,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:13:14,726 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:13:14,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-11-24 08:13:14,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:13:14,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-11-24 08:13:14,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:13:14,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 08:13:14,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-24 08:13:14,727 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:13:14,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-11-24 08:13:14,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-11-24 08:13:14,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-11-24 08:13:14,728 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:13:16,104 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (= (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread2of3ForFork0_dec_~dec__v~0#1|))) (and (= |c_~#inc_flag~0.base| (_ bv4 32)) (or (forall ((v_DerPreprocessor_67 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_740 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_741 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_746 (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32)) (|thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| (_ BitVec 32)) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32))) (not (= (select (select (let ((.cse0 (store (let ((.cse1 (store (store |c_#memory_int| |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_67) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_740))) (store .cse1 |c_~#inc_flag~0.base| (store (select .cse1 |c_~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_746))) |c_~#value~0.base| v_ArrVal_741))) (store .cse0 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store (select .cse0 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32)))) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) (_ bv0 32)))) .cse2) (= |c_~#dec_flag~0.offset| (_ bv0 32)) (= |c_~#dec_flag~0.base| (_ bv5 32)) (= (_ bv3 32) |c_~#value~0.base|) (= (_ bv0 32) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.offset|) (or (not .cse2) (forall ((v_ArrVal_740 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_741 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_746 (_ BitVec 32)) (v_ArrVal_737 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.offset| (_ BitVec 32)) (|thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| (_ BitVec 32)) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32))) (not (= (select (select (let ((.cse3 (store (let ((.cse4 (store |c_#memory_int| |c_~#dec_flag~0.base| (store (select |c_#memory_int| |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset| (_ bv1 32))))) (let ((.cse6 (store .cse4 |c_~#value~0.base| v_ArrVal_737))) (let ((.cse5 (store (select .cse6 |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.offset| (_ bv1 32)))) (store (store (store .cse4 |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse5) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_740) |c_~#inc_flag~0.base| (store (select (store (store .cse6 |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse5) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_740) |c_~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_746))))) |c_~#value~0.base| v_ArrVal_741))) (store .cse3 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store (select .cse3 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32)))) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) (_ bv0 32))))) (not (= (_ bv5 32) |c_ULTIMATE.start_main_~#t~0#1.base|)))) is different from false [2023-11-24 08:13:25,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:13:25,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:13:25,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 08:13:25,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:13:25,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-24 08:13:25,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:13:25,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 08:13:25,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-24 08:13:25,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:13:25,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-24 08:13:25,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-24 08:13:25,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 08:13:25,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-24 08:13:25,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2023-11-24 08:13:26,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:13:26,120 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 08:13:26,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:13:26,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1616027761, now seen corresponding path program 2 times [2023-11-24 08:13:26,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 08:13:26,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [193085278] [2023-11-24 08:13:26,121 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-24 08:13:26,121 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:13:26,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2023-11-24 08:13:26,122 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 08:13:26,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2023-11-24 08:13:26,305 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-24 08:13:26,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-24 08:13:26,309 INFO L262 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-24 08:13:26,311 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 08:13:28,028 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 08:13:28,028 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 15 treesize of output 15 [2023-11-24 08:13:29,268 INFO L349 Elim1Store]: treesize reduction 58, result has 13.4 percent of original size [2023-11-24 08:13:29,268 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 3 case distinctions, treesize of input 87 treesize of output 20 [2023-11-24 08:13:29,551 INFO L349 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2023-11-24 08:13:29,551 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 2 case distinctions, treesize of input 39 treesize of output 1 [2023-11-24 08:13:29,749 INFO L349 Elim1Store]: treesize reduction 25, result has 3.8 percent of original size [2023-11-24 08:13:29,750 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 2 case distinctions, treesize of input 39 treesize of output 1 [2023-11-24 08:13:30,054 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-24 08:13:30,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 1 case distinctions, treesize of input 20 treesize of output 23 [2023-11-24 08:13:32,043 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-24 08:13:32,043 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 08:13:34,107 INFO L349 Elim1Store]: treesize reduction 69, result has 53.7 percent of original size [2023-11-24 08:13:34,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 117 [2023-11-24 08:13:34,841 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 08:13:34,841 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 238 treesize of output 237 [2023-11-24 08:13:34,895 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 6 treesize of output 4 [2023-11-24 08:13:35,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 08:13:35,033 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 17 treesize of output 21 [2023-11-24 08:13:35,132 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 6 treesize of output 4 [2023-11-24 08:13:37,011 INFO L349 Elim1Store]: treesize reduction 3, result has 25.0 percent of original size [2023-11-24 08:13:37,011 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 25 treesize of output 1 [2023-11-24 08:13:37,012 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-24 08:13:37,012 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 08:13:37,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [193085278] [2023-11-24 08:13:37,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [193085278] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 08:13:37,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-24 08:13:37,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 17 [2023-11-24 08:13:37,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79945072] [2023-11-24 08:13:37,012 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-24 08:13:37,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-24 08:13:37,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 08:13:37,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-24 08:13:37,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2023-11-24 08:13:37,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:13:37,014 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:13:37,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.529411764705882) internal successors, (77), 18 states have internal predecessors, (77), 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-11-24 08:13:37,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:13:37,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:13:37,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-11-24 08:13:37,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:13:37,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-11-24 08:13:37,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:13:37,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 08:13:37,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-24 08:13:37,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:13:37,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 15 states. [2023-11-24 08:13:37,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-11-24 08:13:37,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-11-24 08:13:37,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2023-11-24 08:13:37,014 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:13:50,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 08:14:02,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 08:14:06,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 08:14:10,033 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (= (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread2of3ForFork0_dec_~dec__v~0#1|))) (and (let ((.cse1 (select |c_#memory_int| (_ bv5 32)))) (let ((.cse0 (= (select .cse1 (_ bv0 32)) (_ bv1 32)))) (or (and .cse0 (or (exists ((|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32))) (= (store .cse1 (_ bv0 32) (_ bv1 32)) (select |c_#memory_int| |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|))) (exists ((|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32))) (= (select (select |c_#memory_int| |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) (_ bv0 32)) (_ bv1 32))))) (and .cse0 (= (select (select |c_#memory_int| (_ bv3 32)) (_ bv0 32)) (_ bv1 32)))))) (= |c_~#inc_flag~0.base| (_ bv4 32)) (or (forall ((v_DerPreprocessor_67 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_740 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_741 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_746 (_ BitVec 32)) (|~#inc_flag~0.offset| (_ BitVec 32)) (|thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| (_ BitVec 32)) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32))) (not (= (select (select (let ((.cse2 (store (let ((.cse3 (store (store |c_#memory_int| |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_67) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_740))) (store .cse3 |c_~#inc_flag~0.base| (store (select .cse3 |c_~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_746))) |c_~#value~0.base| v_ArrVal_741))) (store .cse2 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store (select .cse2 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32)))) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) (_ bv0 32)))) .cse4) (= |c_~#dec_flag~0.offset| (_ bv0 32)) (= |c_~#dec_flag~0.base| (_ bv5 32)) (= (_ bv3 32) |c_~#value~0.base|) (= (_ bv0 32) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.offset|) (or (not .cse4) (forall ((v_ArrVal_740 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_741 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_746 (_ BitVec 32)) (v_ArrVal_737 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.offset| (_ BitVec 32)) (|thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| (_ BitVec 32)) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32))) (not (= (select (select (let ((.cse5 (store (let ((.cse6 (store |c_#memory_int| |c_~#dec_flag~0.base| (store (select |c_#memory_int| |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset| (_ bv1 32))))) (let ((.cse8 (store .cse6 |c_~#value~0.base| v_ArrVal_737))) (let ((.cse7 (store (select .cse8 |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.offset| (_ bv1 32)))) (store (store (store .cse6 |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse7) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_740) |c_~#inc_flag~0.base| (store (select (store (store .cse8 |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse7) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_740) |c_~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_746))))) |c_~#value~0.base| v_ArrVal_741))) (store .cse5 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store (select .cse5 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32)))) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) (_ bv0 32))))) (not (= (_ bv5 32) |c_ULTIMATE.start_main_~#t~0#1.base|)))) is different from false [2023-11-24 08:14:15,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:14:15,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:14:15,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 08:14:15,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:14:15,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-24 08:14:15,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:14:15,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 08:14:15,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-24 08:14:15,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 08:14:15,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-24 08:14:15,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-24 08:14:15,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-24 08:14:15,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-24 08:14:15,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-24 08:14:15,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2023-11-24 08:14:16,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:14:16,169 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 08:14:16,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:14:16,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1581327695, now seen corresponding path program 1 times [2023-11-24 08:14:16,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 08:14:16,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [758147797] [2023-11-24 08:14:16,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:14:16,169 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:14:16,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2023-11-24 08:14:16,170 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 08:14:16,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2023-11-24 08:14:16,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:14:16,330 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-24 08:14:16,331 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 08:14:16,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 08:14:16,461 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 16 treesize of output 8 [2023-11-24 08:14:16,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-24 08:14:16,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2023-11-24 08:14:16,546 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-24 08:14:16,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 42 [2023-11-24 08:14:16,623 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-24 08:14:16,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 9 treesize of output 12 [2023-11-24 08:14:16,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 8 [2023-11-24 08:14:16,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 08:14:16,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-24 08:14:16,897 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-24 08:14:16,897 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-24 08:14:16,897 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 08:14:16,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [758147797] [2023-11-24 08:14:16,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [758147797] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-24 08:14:16,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-24 08:14:16,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-24 08:14:16,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004892796] [2023-11-24 08:14:16,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-24 08:14:16,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-24 08:14:16,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 08:14:16,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-24 08:14:16,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-24 08:14:16,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:14:16,898 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:14:16,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-24 08:14:16,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:14:16,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:14:16,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-11-24 08:14:16,898 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:14:16,899 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-11-24 08:14:16,899 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:14:16,899 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 08:14:16,899 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-24 08:14:16,899 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-11-24 08:14:16,899 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-11-24 08:14:16,899 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-11-24 08:14:16,899 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-11-24 08:14:16,899 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. [2023-11-24 08:14:16,899 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-11-24 08:14:16,899 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:14:25,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 08:14:27,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 08:14:28,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 08:14:32,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 08:14:33,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:14:33,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:14:33,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-24 08:14:33,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:14:33,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-24 08:14:33,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:14:33,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 08:14:33,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-24 08:14:33,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-24 08:14:33,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-24 08:14:33,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-24 08:14:33,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-24 08:14:33,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-24 08:14:33,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-24 08:14:33,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-24 08:14:33,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2023-11-24 08:14:33,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:14:33,421 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err1ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-24 08:14:33,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-24 08:14:33,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1251206261, now seen corresponding path program 1 times [2023-11-24 08:14:33,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-24 08:14:33,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [135216243] [2023-11-24 08:14:33,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-24 08:14:33,422 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-24 08:14:33,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2023-11-24 08:14:33,423 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-24 08:14:33,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2023-11-24 08:14:33,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-24 08:14:33,621 INFO L262 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 26 conjunts are in the unsatisfiable core [2023-11-24 08:14:33,624 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-24 08:14:33,750 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-24 08:14:33,750 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 13 treesize of output 13 [2023-11-24 08:14:37,555 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 0 case distinctions, treesize of input 33 treesize of output 25 [2023-11-24 08:14:38,491 INFO L349 Elim1Store]: treesize reduction 61, result has 37.1 percent of original size [2023-11-24 08:14:38,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 44 treesize of output 86 [2023-11-24 08:14:38,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-24 08:14:38,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-24 08:14:39,162 INFO L349 Elim1Store]: treesize reduction 23, result has 4.2 percent of original size [2023-11-24 08:14:39,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 1 [2023-11-24 08:14:39,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 23 [2023-11-24 08:14:39,473 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 5 treesize of output 3 [2023-11-24 08:14:41,329 INFO L349 Elim1Store]: treesize reduction 32, result has 45.8 percent of original size [2023-11-24 08:14:41,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 65 treesize of output 76 [2023-11-24 08:14:41,887 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 5 treesize of output 3 [2023-11-24 08:14:41,981 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 5 treesize of output 3 [2023-11-24 08:14:45,199 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-11-24 08:14:45,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 53 [2023-11-24 08:14:46,391 INFO L349 Elim1Store]: treesize reduction 129, result has 28.7 percent of original size [2023-11-24 08:14:46,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 59 treesize of output 115 [2023-11-24 08:14:46,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-24 08:14:46,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-24 08:14:47,560 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-24 08:14:47,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 26 [2023-11-24 08:14:47,877 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-24 08:14:47,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 22 [2023-11-24 08:14:49,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-24 08:14:49,393 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-24 08:14:49,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 30 [2023-11-24 08:14:55,433 INFO L349 Elim1Store]: treesize reduction 291, result has 13.4 percent of original size [2023-11-24 08:14:55,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 9 new quantified variables, introduced 28 case distinctions, treesize of input 294 treesize of output 312 [2023-11-24 08:15:01,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-24 08:15:02,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-24 08:15:04,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-24 08:15:39,315 WARN L293 SmtUtils]: Spent 35.15s on a formula simplification. DAG size of input: 2616 DAG size of output: 134 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-24 08:15:39,315 INFO L349 Elim1Store]: treesize reduction 5313, result has 3.0 percent of original size [2023-11-24 08:15:39,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 35 select indices, 35 select index equivalence classes, 1 disjoint index pairs (out of 595 index pairs), introduced 36 new quantified variables, introduced 627 case distinctions, treesize of input 1135 treesize of output 1147 [2023-11-24 08:16:27,492 WARN L293 SmtUtils]: Spent 48.04s on a formula simplification. DAG size of input: 2922 DAG size of output: 301 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-24 08:16:27,492 INFO L349 Elim1Store]: treesize reduction 6194, result has 8.3 percent of original size [2023-11-24 08:16:27,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 35 select indices, 35 select index equivalence classes, 2 disjoint index pairs (out of 595 index pairs), introduced 37 new quantified variables, introduced 662 case distinctions, treesize of input 769 treesize of output 1268 [2023-11-24 08:16:27,591 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 647 treesize of output 645 [2023-11-24 08:16:27,966 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-11-24 08:16:27,966 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 645 treesize of output 655 [2023-11-24 08:16:28,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 657 treesize of output 617 [2023-11-24 08:16:28,309 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 08:16:28,310 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 602 treesize of output 607 [2023-11-24 08:16:28,746 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-11-24 08:16:28,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 598 treesize of output 608 [2023-11-24 08:16:28,994 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 08:16:28,995 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 593 treesize of output 598 [2023-11-24 08:16:29,120 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 589 treesize of output 587 [2023-11-24 08:16:29,256 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 587 treesize of output 585 [2023-11-24 08:16:29,370 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 585 treesize of output 583 [2023-11-24 08:16:32,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-24 08:16:33,173 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-11-24 08:16:33,173 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-24 08:16:34,544 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|)) (.cse0 (= |c_thr1Thread3of3ForFork0_inc_~inc__v~0#1| (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|)))) (and (or (not .cse0) (let ((.cse2 (select |c_#memory_int| |c_~#inc_flag~0.base|))) (and (forall ((v_ArrVal_898 (_ BitVec 32)) (v_ArrVal_901 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.offset| (_ BitVec 32)) (v_DerPreprocessor_84 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32))) (not (= (select (select (store (let ((.cse1 (store (store |c_#memory_int| |c_~#inc_flag~0.base| (store .cse2 |~#inc_flag~0.offset| v_ArrVal_898)) |c_~#value~0.base| v_ArrVal_901))) (store .cse1 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store (select .cse1 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32)))) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_84) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) (_ bv0 32)))) (or .cse3 (forall ((v_ArrVal_898 (_ BitVec 32)) (v_ArrVal_901 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.offset| (_ BitVec 32)) (v_DerPreprocessor_85 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_86 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store (let ((.cse4 (store |c_#memory_int| |c_~#inc_flag~0.base| (store .cse2 |~#inc_flag~0.offset| v_ArrVal_898)))) (let ((.cse6 (store .cse4 |c_~#value~0.base| v_ArrVal_901))) (let ((.cse5 (store (select .cse6 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32)))) (store (store .cse4 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| .cse5) |c_~#dec_flag~0.base| (store (select (store .cse6 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| .cse5) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset| (_ bv1 32)))))) |c_~#value~0.base| v_DerPreprocessor_85) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_86) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) (_ bv0 32)))))))) (or (and (or (forall ((v_DerPreprocessor_85 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_87 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_86 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store (let ((.cse7 (store |c_#memory_int| |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_87))) (store .cse7 |c_~#dec_flag~0.base| (store (select .cse7 |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset| (_ bv1 32)))) |c_~#value~0.base| v_DerPreprocessor_85) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_86) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) (_ bv0 32)))) .cse3) (forall ((v_DerPreprocessor_84 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_87 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32))) (not (= (select (select (store (store |c_#memory_int| |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| v_DerPreprocessor_87) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_84) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) (_ bv0 32))))) .cse0))) is different from false [2023-11-24 08:16:35,127 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_~#inc_flag~0.base|))) (and (forall ((v_ArrVal_898 (_ BitVec 32)) (v_ArrVal_901 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.offset| (_ BitVec 32)) (v_DerPreprocessor_84 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32))) (not (= (select (select (store (let ((.cse0 (store (store |c_#memory_int| |c_~#inc_flag~0.base| (store .cse1 |~#inc_flag~0.offset| v_ArrVal_898)) |c_~#value~0.base| v_ArrVal_901))) (store .cse0 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store (select .cse0 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32)))) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_84) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) (_ bv0 32)))) (or (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|) (forall ((v_ArrVal_898 (_ BitVec 32)) (v_ArrVal_901 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.offset| (_ BitVec 32)) (v_DerPreprocessor_85 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_86 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store (let ((.cse2 (store |c_#memory_int| |c_~#inc_flag~0.base| (store .cse1 |~#inc_flag~0.offset| v_ArrVal_898)))) (let ((.cse4 (store .cse2 |c_~#value~0.base| v_ArrVal_901))) (let ((.cse3 (store (select .cse4 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32)))) (store (store .cse2 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| .cse3) |c_~#dec_flag~0.base| (store (select (store .cse4 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| .cse3) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset| (_ bv1 32)))))) |c_~#value~0.base| v_DerPreprocessor_85) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_86) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) (_ bv0 32))))))) is different from false [2023-11-24 08:16:36,410 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_896 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_896))) (or (forall ((v_ArrVal_898 (_ BitVec 32)) (v_ArrVal_901 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.offset| (_ BitVec 32)) (v_DerPreprocessor_84 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32))) (not (= (select (select (store (let ((.cse0 (store (store .cse1 |c_~#inc_flag~0.base| (store (select .cse1 |c_~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_898)) |c_~#value~0.base| v_ArrVal_901))) (store .cse0 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store (select .cse0 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32)))) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_84) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) (_ bv0 32)))) (not (= (select (select .cse1 |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.offset|) (_ bv0 32)))))) (or (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|) (forall ((v_ArrVal_896 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_898 (_ BitVec 32)) (v_ArrVal_901 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.offset| (_ BitVec 32)) (v_DerPreprocessor_85 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_86 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_896))) (or (not (= (_ bv0 32) (select (select (store (store (let ((.cse2 (store .cse5 |c_~#inc_flag~0.base| (store (select .cse5 |c_~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_898)))) (let ((.cse4 (store .cse2 |c_~#value~0.base| v_ArrVal_901))) (let ((.cse3 (store (select .cse4 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32)))) (store (store .cse2 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| .cse3) |c_~#dec_flag~0.base| (store (select (store .cse4 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| .cse3) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset| (_ bv1 32)))))) |c_~#value~0.base| v_DerPreprocessor_85) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_86) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|))) (not (= (select (select .cse5 |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.offset|) (_ bv0 32)))))))) is different from false [2023-11-24 08:16:37,352 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (= (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread2of3ForFork0_dec_~dec__v~0#1|))) (and (or (and (forall ((v_DerPreprocessor_88 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_896 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_898 (_ BitVec 32)) (v_ArrVal_901 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.offset| (_ BitVec 32)) (v_DerPreprocessor_85 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| (_ BitVec 32)) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_86 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_int| |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_88) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_896))) (or (not (= (select (select .cse0 |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.offset|) (_ bv0 32))) (= |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| |c_~#value~0.base|) (not (= (select (select (store (store (let ((.cse1 (store (select .cse0 |c_~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_898))) (let ((.cse3 (store (store .cse0 |c_~#inc_flag~0.base| .cse1) |c_~#value~0.base| v_ArrVal_901))) (let ((.cse2 (store (select .cse3 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32)))) (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_896) |c_~#inc_flag~0.base| .cse1) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| .cse2) |c_~#dec_flag~0.base| (store (select (store .cse3 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| .cse2) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset| (_ bv1 32)))))) |c_~#value~0.base| v_DerPreprocessor_85) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_86) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) (_ bv0 32)))))) (forall ((v_DerPreprocessor_88 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_452 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.offset| (_ BitVec 32)) (v_prenex_454 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_455 (_ BitVec 32)) (v_prenex_456 (_ BitVec 32)) (v_prenex_453 (_ BitVec 32)) (|thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_84 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store (store |c_#memory_int| |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_88) |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_452))) (or (not (= (select (select (store (let ((.cse4 (store (select .cse5 |c_~#inc_flag~0.base|) v_prenex_455 v_prenex_453))) (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_452) |c_~#inc_flag~0.base| .cse4) |c_~#value~0.base| v_prenex_454) v_prenex_456 (store (select (store (store .cse5 |c_~#inc_flag~0.base| .cse4) |c_~#value~0.base| v_prenex_454) v_prenex_456) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32)))) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_84) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) (_ bv0 32))) (not (= (select (select .cse5 |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.offset|) (_ bv0 32))))))) .cse6) (or (let ((.cse8 (store |c_#memory_int| |c_~#dec_flag~0.base| (store (select |c_#memory_int| |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset| (_ bv1 32))))) (and (forall ((v_ArrVal_895 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_896 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.offset| (_ BitVec 32)) (|thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| (_ BitVec 32))) (let ((.cse11 (store .cse8 |c_~#value~0.base| v_ArrVal_895))) (let ((.cse10 (store (select .cse11 |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.offset| (_ bv1 32)))) (let ((.cse7 (store (store .cse11 |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse10) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_896))) (or (not (= (select (select .cse7 |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_898 (_ BitVec 32)) (v_ArrVal_901 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.offset| (_ BitVec 32)) (v_DerPreprocessor_84 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32))) (not (= (select (select (store (let ((.cse9 (store (select .cse7 |c_~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_898))) (store (store (store (store .cse8 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_896) |c_~#inc_flag~0.base| .cse9) |c_~#value~0.base| v_ArrVal_901) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store (store (store .cse8 |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse10) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_896) |c_~#inc_flag~0.base| .cse9) |c_~#value~0.base| v_ArrVal_901) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32)))) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_84) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) (_ bv0 32))))))))) (forall ((v_ArrVal_895 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.offset| (_ BitVec 32)) (|thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| (_ BitVec 32))) (or (= |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| |c_~#value~0.base|) (forall ((v_ArrVal_896 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_898 (_ BitVec 32)) (v_ArrVal_901 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.offset| (_ BitVec 32)) (v_DerPreprocessor_85 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_86 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (store .cse8 |c_~#value~0.base| v_ArrVal_895))) (let ((.cse15 (store (select .cse17 |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.offset| (_ bv1 32)))) (let ((.cse16 (store (store .cse17 |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse15) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_896))) (or (not (= (select (select (store (store (let ((.cse12 (store (select .cse16 |c_~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_898))) (let ((.cse14 (store (store (store (store .cse8 |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse15) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_896) |c_~#inc_flag~0.base| .cse12) |c_~#value~0.base| v_ArrVal_901))) (let ((.cse13 (store (select .cse14 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32)))) (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_896) |c_~#inc_flag~0.base| .cse12) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| .cse13) |c_~#dec_flag~0.base| (store (select (store .cse14 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| .cse13) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset| (_ bv1 32)))))) |c_~#value~0.base| v_DerPreprocessor_85) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_86) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) (_ bv0 32))) (not (= (select (select .cse16 |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.offset|) (_ bv0 32)))))))))))) (not .cse6)))) is different from false [2023-11-24 08:16:37,853 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 08:16:37,854 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 136 treesize of output 128 [2023-11-24 08:16:37,868 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-24 08:16:37,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2023-11-24 08:16:37,898 WARN L214 Elim1Store]: Array PQE input equivalent to true [2023-11-24 08:16:37,924 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 6 treesize of output 4 [2023-11-24 08:16:38,016 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 6 treesize of output 4 [2023-11-24 08:16:38,115 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 08:16:38,115 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 190 treesize of output 126 [2023-11-24 08:16:44,027 WARN L293 SmtUtils]: Spent 5.81s on a formula simplification. DAG size of input: 64 DAG size of output: 44 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-24 08:16:44,027 INFO L349 Elim1Store]: treesize reduction 63, result has 51.5 percent of original size [2023-11-24 08:16:44,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 4941085 treesize of output 4612189 [2023-11-24 08:16:45,027 INFO L224 Elim1Store]: Index analysis took 151 ms [2023-11-24 08:16:46,275 INFO L349 Elim1Store]: treesize reduction 8, result has 83.7 percent of original size [2023-11-24 08:16:46,276 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 28409 treesize of output 28201 [2023-11-24 08:16:47,450 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-24 08:16:47,451 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 24957 treesize of output 24381 [2023-11-24 08:16:48,815 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 20890 treesize of output 20234 [2023-11-24 08:16:49,218 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 27574 treesize of output 27086 [2023-11-24 08:16:50,951 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 22634 treesize of output 22570 [2023-11-24 08:16:59,810 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 6 treesize of output 4 [2023-11-24 08:16:59,887 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 150 treesize of output 140 [2023-11-24 08:17:01,978 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 11 not checked. [2023-11-24 08:17:01,979 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-24 08:17:01,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [135216243] [2023-11-24 08:17:01,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [135216243] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-24 08:17:01,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-24 08:17:01,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 19 [2023-11-24 08:17:01,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494635528] [2023-11-24 08:17:01,979 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-24 08:17:01,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-24 08:17:01,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-24 08:17:01,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-24 08:17:01,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=200, Unknown=13, NotChecked=132, Total=420 [2023-11-24 08:17:01,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:17:01,980 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2023-11-24 08:17:01,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.75) internal successors, (75), 20 states have internal predecessors, (75), 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-11-24 08:17:01,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:17:01,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:17:01,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2023-11-24 08:17:01,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2023-11-24 08:17:01,980 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 20 states. [2023-11-24 08:17:01,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2023-11-24 08:17:01,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 08:17:01,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2023-11-24 08:17:01,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2023-11-24 08:17:01,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-11-24 08:17:01,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2023-11-24 08:17:01,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2023-11-24 08:17:01,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2023-11-24 08:17:01,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 17 states. [2023-11-24 08:17:01,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2023-11-24 08:17:01,981 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2023-11-24 08:17:03,566 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (= (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread2of3ForFork0_dec_~dec__v~0#1|))) (and (or (and (forall ((v_DerPreprocessor_88 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_896 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_898 (_ BitVec 32)) (v_ArrVal_901 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.offset| (_ BitVec 32)) (v_DerPreprocessor_85 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| (_ BitVec 32)) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_86 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (store (store |c_#memory_int| |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_88) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_896))) (or (not (= (select (select .cse0 |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.offset|) (_ bv0 32))) (= |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| |c_~#value~0.base|) (not (= (select (select (store (store (let ((.cse1 (store (select .cse0 |c_~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_898))) (let ((.cse3 (store (store .cse0 |c_~#inc_flag~0.base| .cse1) |c_~#value~0.base| v_ArrVal_901))) (let ((.cse2 (store (select .cse3 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32)))) (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_896) |c_~#inc_flag~0.base| .cse1) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| .cse2) |c_~#dec_flag~0.base| (store (select (store .cse3 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| .cse2) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset| (_ bv1 32)))))) |c_~#value~0.base| v_DerPreprocessor_85) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_86) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) (_ bv0 32)))))) (forall ((v_DerPreprocessor_88 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_452 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.offset| (_ BitVec 32)) (v_prenex_454 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_455 (_ BitVec 32)) (v_prenex_456 (_ BitVec 32)) (v_prenex_453 (_ BitVec 32)) (|thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_84 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store (store |c_#memory_int| |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_88) |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_452))) (or (not (= (select (select (store (let ((.cse4 (store (select .cse5 |c_~#inc_flag~0.base|) v_prenex_455 v_prenex_453))) (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_452) |c_~#inc_flag~0.base| .cse4) |c_~#value~0.base| v_prenex_454) v_prenex_456 (store (select (store (store .cse5 |c_~#inc_flag~0.base| .cse4) |c_~#value~0.base| v_prenex_454) v_prenex_456) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32)))) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_84) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) (_ bv0 32))) (not (= (select (select .cse5 |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.offset|) (_ bv0 32))))))) .cse6) (= |c_~#inc_flag~0.base| (_ bv4 32)) (= |c_~#dec_flag~0.offset| (_ bv0 32)) (= |c_~#dec_flag~0.base| (_ bv5 32)) (= (_ bv3 32) |c_~#value~0.base|) (or (let ((.cse8 (store |c_#memory_int| |c_~#dec_flag~0.base| (store (select |c_#memory_int| |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset| (_ bv1 32))))) (and (forall ((v_ArrVal_895 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_896 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.offset| (_ BitVec 32)) (|thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| (_ BitVec 32))) (let ((.cse11 (store .cse8 |c_~#value~0.base| v_ArrVal_895))) (let ((.cse10 (store (select .cse11 |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.offset| (_ bv1 32)))) (let ((.cse7 (store (store .cse11 |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse10) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_896))) (or (not (= (select (select .cse7 |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_898 (_ BitVec 32)) (v_ArrVal_901 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.offset| (_ BitVec 32)) (v_DerPreprocessor_84 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32))) (not (= (select (select (store (let ((.cse9 (store (select .cse7 |c_~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_898))) (store (store (store (store .cse8 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_896) |c_~#inc_flag~0.base| .cse9) |c_~#value~0.base| v_ArrVal_901) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store (store (store .cse8 |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse10) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_896) |c_~#inc_flag~0.base| .cse9) |c_~#value~0.base| v_ArrVal_901) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32)))) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_84) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) (_ bv0 32))))))))) (forall ((v_ArrVal_895 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.offset| (_ BitVec 32)) (|thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| (_ BitVec 32))) (or (= |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| |c_~#value~0.base|) (forall ((v_ArrVal_896 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_898 (_ BitVec 32)) (v_ArrVal_901 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.offset| (_ BitVec 32)) (v_DerPreprocessor_85 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_86 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (store .cse8 |c_~#value~0.base| v_ArrVal_895))) (let ((.cse15 (store (select .cse17 |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.offset| (_ bv1 32)))) (let ((.cse16 (store (store .cse17 |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse15) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_896))) (or (not (= (select (select (store (store (let ((.cse12 (store (select .cse16 |c_~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_898))) (let ((.cse14 (store (store (store (store .cse8 |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse15) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_896) |c_~#inc_flag~0.base| .cse12) |c_~#value~0.base| v_ArrVal_901))) (let ((.cse13 (store (select .cse14 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32)))) (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_896) |c_~#inc_flag~0.base| .cse12) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| .cse13) |c_~#dec_flag~0.base| (store (select (store .cse14 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| .cse13) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset| (_ bv1 32)))))) |c_~#value~0.base| v_DerPreprocessor_85) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_86) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) (_ bv0 32))) (not (= (select (select .cse16 |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.offset|) (_ bv0 32)))))))))))) (not .cse6)) (not (= (_ bv5 32) |c_ULTIMATE.start_main_~#t~0#1.base|)))) is different from false [2023-11-24 08:17:11,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 08:17:15,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 08:17:18,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 08:17:19,143 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 08:17:27,223 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|))) (let ((.cse0 (let ((.cse21 (select |c_#memory_int| |c_~#inc_flag~0.base|))) (and (forall ((v_ArrVal_898 (_ BitVec 32)) (v_ArrVal_901 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.offset| (_ BitVec 32)) (v_DerPreprocessor_84 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32))) (not (= (select (select (store (let ((.cse20 (store (store |c_#memory_int| |c_~#inc_flag~0.base| (store .cse21 |~#inc_flag~0.offset| v_ArrVal_898)) |c_~#value~0.base| v_ArrVal_901))) (store .cse20 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store (select .cse20 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32)))) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_84) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) (_ bv0 32)))) (or .cse1 (forall ((v_ArrVal_898 (_ BitVec 32)) (v_ArrVal_901 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.offset| (_ BitVec 32)) (v_DerPreprocessor_85 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_86 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store (let ((.cse22 (store |c_#memory_int| |c_~#inc_flag~0.base| (store .cse21 |~#inc_flag~0.offset| v_ArrVal_898)))) (let ((.cse24 (store .cse22 |c_~#value~0.base| v_ArrVal_901))) (let ((.cse23 (store (select .cse24 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32)))) (store (store .cse22 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| .cse23) |c_~#dec_flag~0.base| (store (select (store .cse24 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| .cse23) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset| (_ bv1 32)))))) |c_~#value~0.base| v_DerPreprocessor_85) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_86) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) (_ bv0 32)))))))) (.cse2 (store |c_#memory_int| |c_~#dec_flag~0.base| (store (select |c_#memory_int| |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset| (_ bv1 32)))) (.cse9 (= (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread2of3ForFork0_dec_~dec__v~0#1|))) (and (or (not (= |c_thr1Thread2of3ForFork0_dec_#t~mem12#1| (_ bv0 32))) .cse0) (or (not (= (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.offset|) (_ bv0 32))) .cse0) (= (select (select |c_#memory_int| (_ bv5 32)) (_ bv0 32)) (_ bv1 32)) (or .cse1 (forall ((v_DerPreprocessor_85 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_86 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store .cse2 |c_~#value~0.base| v_DerPreprocessor_85) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_86) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) (_ bv0 32))))) (or (and (forall ((v_DerPreprocessor_88 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_896 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_898 (_ BitVec 32)) (v_ArrVal_901 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.offset| (_ BitVec 32)) (v_DerPreprocessor_85 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| (_ BitVec 32)) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_86 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store (store |c_#memory_int| |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_88) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_896))) (or (not (= (select (select .cse3 |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.offset|) (_ bv0 32))) (= |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| |c_~#value~0.base|) (not (= (select (select (store (store (let ((.cse4 (store (select .cse3 |c_~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_898))) (let ((.cse6 (store (store .cse3 |c_~#inc_flag~0.base| .cse4) |c_~#value~0.base| v_ArrVal_901))) (let ((.cse5 (store (select .cse6 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32)))) (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_896) |c_~#inc_flag~0.base| .cse4) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| .cse5) |c_~#dec_flag~0.base| (store (select (store .cse6 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| .cse5) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset| (_ bv1 32)))))) |c_~#value~0.base| v_DerPreprocessor_85) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_86) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) (_ bv0 32)))))) (forall ((v_DerPreprocessor_88 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_452 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.offset| (_ BitVec 32)) (v_prenex_454 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_455 (_ BitVec 32)) (v_prenex_456 (_ BitVec 32)) (v_prenex_453 (_ BitVec 32)) (|thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_84 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (store (store |c_#memory_int| |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_88) |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_452))) (or (not (= (select (select (store (let ((.cse7 (store (select .cse8 |c_~#inc_flag~0.base|) v_prenex_455 v_prenex_453))) (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_452) |c_~#inc_flag~0.base| .cse7) |c_~#value~0.base| v_prenex_454) v_prenex_456 (store (select (store (store .cse8 |c_~#inc_flag~0.base| .cse7) |c_~#value~0.base| v_prenex_454) v_prenex_456) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32)))) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_84) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) (_ bv0 32))) (not (= (select (select .cse8 |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.offset|) (_ bv0 32))))))) .cse9) (= |c_~#inc_flag~0.base| (_ bv4 32)) (forall ((v_DerPreprocessor_84 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_84) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) (_ bv0 32)))) (= |c_~#dec_flag~0.offset| (_ bv0 32)) (= |c_~#dec_flag~0.base| (_ bv5 32)) (= (_ bv3 32) |c_~#value~0.base|) (or (and (forall ((v_ArrVal_895 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_896 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.offset| (_ BitVec 32)) (|thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| (_ BitVec 32))) (let ((.cse13 (store .cse2 |c_~#value~0.base| v_ArrVal_895))) (let ((.cse12 (store (select .cse13 |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.offset| (_ bv1 32)))) (let ((.cse10 (store (store .cse13 |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse12) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_896))) (or (not (= (select (select .cse10 |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_898 (_ BitVec 32)) (v_ArrVal_901 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.offset| (_ BitVec 32)) (v_DerPreprocessor_84 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32))) (not (= (select (select (store (let ((.cse11 (store (select .cse10 |c_~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_898))) (store (store (store (store .cse2 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_896) |c_~#inc_flag~0.base| .cse11) |c_~#value~0.base| v_ArrVal_901) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store (store (store .cse2 |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse12) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_896) |c_~#inc_flag~0.base| .cse11) |c_~#value~0.base| v_ArrVal_901) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32)))) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_84) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) (_ bv0 32))))))))) (forall ((v_ArrVal_895 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.offset| (_ BitVec 32)) (|thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| (_ BitVec 32))) (or (= |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| |c_~#value~0.base|) (forall ((v_ArrVal_896 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_898 (_ BitVec 32)) (v_ArrVal_901 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.offset| (_ BitVec 32)) (v_DerPreprocessor_85 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_86 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse19 (store .cse2 |c_~#value~0.base| v_ArrVal_895))) (let ((.cse17 (store (select .cse19 |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.offset| (_ bv1 32)))) (let ((.cse18 (store (store .cse19 |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse17) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_896))) (or (not (= (select (select (store (store (let ((.cse14 (store (select .cse18 |c_~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_898))) (let ((.cse16 (store (store (store (store .cse2 |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse17) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_896) |c_~#inc_flag~0.base| .cse14) |c_~#value~0.base| v_ArrVal_901))) (let ((.cse15 (store (select .cse16 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32)))) (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_896) |c_~#inc_flag~0.base| .cse14) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| .cse15) |c_~#dec_flag~0.base| (store (select (store .cse16 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| .cse15) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset| (_ bv1 32)))))) |c_~#value~0.base| v_DerPreprocessor_85) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_86) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) (_ bv0 32))) (not (= (select (select .cse18 |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.offset|) (_ bv0 32))))))))))) (not .cse9)) (not (= (_ bv5 32) |c_ULTIMATE.start_main_~#t~0#1.base|))))) is different from false [2023-11-24 08:17:27,489 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (store |c_#memory_int| |c_~#dec_flag~0.base| (store (select |c_#memory_int| |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset| (_ bv1 32)))) (.cse7 (= (select (select |c_#memory_int| |c_~#value~0.base|) |c_~#value~0.offset|) |c_thr1Thread2of3ForFork0_dec_~dec__v~0#1|))) (and (or (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|) (forall ((v_DerPreprocessor_85 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_86 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store .cse0 |c_~#value~0.base| v_DerPreprocessor_85) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_86) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) (_ bv0 32))))) (or (and (forall ((v_DerPreprocessor_88 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_896 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.offset| (_ BitVec 32)) (v_ArrVal_898 (_ BitVec 32)) (v_ArrVal_901 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.offset| (_ BitVec 32)) (v_DerPreprocessor_85 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| (_ BitVec 32)) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_86 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store (store |c_#memory_int| |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_88) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_896))) (or (not (= (select (select .cse1 |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.offset|) (_ bv0 32))) (= |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| |c_~#value~0.base|) (not (= (select (select (store (store (let ((.cse2 (store (select .cse1 |c_~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_898))) (let ((.cse4 (store (store .cse1 |c_~#inc_flag~0.base| .cse2) |c_~#value~0.base| v_ArrVal_901))) (let ((.cse3 (store (select .cse4 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32)))) (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_896) |c_~#inc_flag~0.base| .cse2) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| .cse3) |c_~#dec_flag~0.base| (store (select (store .cse4 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| .cse3) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset| (_ bv1 32)))))) |c_~#value~0.base| v_DerPreprocessor_85) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_86) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) (_ bv0 32)))))) (forall ((v_DerPreprocessor_88 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_452 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.offset| (_ BitVec 32)) (v_prenex_454 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_455 (_ BitVec 32)) (v_prenex_456 (_ BitVec 32)) (v_prenex_453 (_ BitVec 32)) (|thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_84 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store (store |c_#memory_int| |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_88) |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_452))) (or (not (= (select (select (store (let ((.cse5 (store (select .cse6 |c_~#inc_flag~0.base|) v_prenex_455 v_prenex_453))) (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_prenex_452) |c_~#inc_flag~0.base| .cse5) |c_~#value~0.base| v_prenex_454) v_prenex_456 (store (select (store (store .cse6 |c_~#inc_flag~0.base| .cse5) |c_~#value~0.base| v_prenex_454) v_prenex_456) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32)))) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_84) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) (_ bv0 32))) (not (= (select (select .cse6 |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.offset|) (_ bv0 32))))))) .cse7) (forall ((v_DerPreprocessor_84 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_84) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) (_ bv0 32)))) (or (and (forall ((v_ArrVal_895 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_896 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.offset| (_ BitVec 32)) (|thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| (_ BitVec 32))) (let ((.cse11 (store .cse0 |c_~#value~0.base| v_ArrVal_895))) (let ((.cse10 (store (select .cse11 |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.offset| (_ bv1 32)))) (let ((.cse8 (store (store .cse11 |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse10) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_896))) (or (not (= (select (select .cse8 |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_898 (_ BitVec 32)) (v_ArrVal_901 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.offset| (_ BitVec 32)) (v_DerPreprocessor_84 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32))) (not (= (select (select (store (let ((.cse9 (store (select .cse8 |c_~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_898))) (store (store (store (store .cse0 |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_896) |c_~#inc_flag~0.base| .cse9) |c_~#value~0.base| v_ArrVal_901) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store (select (store (store (store (store .cse0 |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse10) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_896) |c_~#inc_flag~0.base| .cse9) |c_~#value~0.base| v_ArrVal_901) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32)))) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_84) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) (_ bv0 32))))))))) (forall ((v_ArrVal_895 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.offset| (_ BitVec 32)) (|thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| (_ BitVec 32))) (or (= |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| |c_~#value~0.base|) (forall ((v_ArrVal_896 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_898 (_ BitVec 32)) (v_ArrVal_901 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.offset| (_ BitVec 32)) (v_DerPreprocessor_85 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_86 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse17 (store .cse0 |c_~#value~0.base| v_ArrVal_895))) (let ((.cse15 (store (select .cse17 |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.offset| (_ bv1 32)))) (let ((.cse16 (store (store .cse17 |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse15) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_896))) (or (not (= (select (select (store (store (let ((.cse12 (store (select .cse16 |c_~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_898))) (let ((.cse14 (store (store (store (store .cse0 |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| .cse15) |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_896) |c_~#inc_flag~0.base| .cse12) |c_~#value~0.base| v_ArrVal_901))) (let ((.cse13 (store (select .cse14 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32)))) (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_896) |c_~#inc_flag~0.base| .cse12) |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| .cse13) |c_~#dec_flag~0.base| (store (select (store .cse14 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| .cse13) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset| (_ bv1 32)))))) |c_~#value~0.base| v_DerPreprocessor_85) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_86) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) (_ bv0 32))) (not (= (select (select .cse16 |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|) |thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.offset|) (_ bv0 32))))))))))) (not .cse7)))) is different from false [2023-11-24 08:17:27,564 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_896 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_896))) (or (forall ((v_ArrVal_898 (_ BitVec 32)) (v_ArrVal_901 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.offset| (_ BitVec 32)) (v_DerPreprocessor_84 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32))) (not (= (select (select (store (let ((.cse0 (store (store .cse1 |c_~#inc_flag~0.base| (store (select .cse1 |c_~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_898)) |c_~#value~0.base| v_ArrVal_901))) (store .cse0 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (store (select .cse0 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32)))) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_84) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|) (_ bv0 32)))) (not (= (select (select .cse1 |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.offset|) (_ bv0 32)))))) (not (= (_ bv0 32) (select (select |c_#memory_int| |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|))) (or (= |c_~#value~0.base| |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|) (forall ((v_ArrVal_896 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_898 (_ BitVec 32)) (v_ArrVal_901 (Array (_ BitVec 32) (_ BitVec 32))) (|~#inc_flag~0.offset| (_ BitVec 32)) (v_DerPreprocessor_85 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_86 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_896))) (or (not (= (_ bv0 32) (select (select (store (store (let ((.cse2 (store .cse5 |c_~#inc_flag~0.base| (store (select .cse5 |c_~#inc_flag~0.base|) |~#inc_flag~0.offset| v_ArrVal_898)))) (let ((.cse4 (store .cse2 |c_~#value~0.base| v_ArrVal_901))) (let ((.cse3 (store (select .cse4 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base|) |c_thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.offset| (_ bv1 32)))) (store (store .cse2 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| .cse3) |c_~#dec_flag~0.base| (store (select (store .cse4 |thr1Thread3of3ForFork0_inc_~#inc__casret~0#1.base| .cse3) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset| (_ bv1 32)))))) |c_~#value~0.base| v_DerPreprocessor_85) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base| v_DerPreprocessor_86) |c_~#dec_flag~0.base|) |c_~#dec_flag~0.offset|))) (not (= (select (select .cse5 |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.base|) |c_thr1Thread2of3ForFork0_dec_~#dec__casret~0#1.offset|) (_ bv0 32)))))))) is different from false [2023-11-24 08:17:30,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 08:17:33,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 08:17:35,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 08:17:37,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 08:17:39,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 08:17:42,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-24 08:17:44,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-24 08:17:48,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-24 08:17:50,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-24 08:17:53,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-24 08:17:55,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-24 08:17:58,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 08:18:00,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 08:18:03,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 08:18:06,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 08:18:09,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 08:18:11,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 08:18:17,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 08:18:19,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-24 08:18:22,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-24 08:18:24,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-24 08:18:27,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-24 08:18:29,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-24 08:18:31,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-24 08:18:33,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-24 08:18:35,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-24 08:18:37,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-24 08:18:40,276 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-24 08:18:42,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-24 08:18:48,225 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-24 08:18:51,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 08:18:53,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 08:18:55,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 08:18:58,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 08:19:00,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 08:19:02,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-24 08:19:06,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-24 08:19:09,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-24 08:19:10,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-24 08:19:12,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-24 08:19:18,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-24 08:19:22,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] Killed by 15