./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-ext/37_stack_lock_p0_vs_concur.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b03bd7cf 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 ../sv-benchmarks/c/pthread-ext/37_stack_lock_p0_vs_concur.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 62bb9e4cb3fb45378d7de513612dc08e0394f3048289be85bceda07932ec1175 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-b03bd7c-m [2024-10-28 15:17:26,314 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-28 15:17:26,369 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-28 15:17:26,373 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-28 15:17:26,374 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-28 15:17:26,397 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-28 15:17:26,397 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-28 15:17:26,397 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-28 15:17:26,398 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-28 15:17:26,398 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-28 15:17:26,399 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-28 15:17:26,400 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-28 15:17:26,400 INFO L153 SettingsManager]: * Use SBE=true [2024-10-28 15:17:26,400 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-28 15:17:26,400 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-28 15:17:26,400 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-28 15:17:26,401 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-28 15:17:26,401 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-28 15:17:26,401 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-28 15:17:26,401 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-28 15:17:26,402 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-28 15:17:26,404 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-28 15:17:26,404 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-28 15:17:26,405 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-28 15:17:26,405 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-28 15:17:26,405 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-28 15:17:26,405 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-28 15:17:26,406 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-28 15:17:26,406 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-28 15:17:26,406 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-28 15:17:26,406 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-28 15:17:26,406 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-28 15:17:26,406 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-28 15:17:26,407 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-28 15:17:26,407 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-28 15:17:26,407 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-28 15:17:26,407 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-28 15:17:26,407 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-28 15:17:26,408 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-28 15:17:26,408 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-28 15:17:26,408 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-28 15:17:26,411 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 -> 62bb9e4cb3fb45378d7de513612dc08e0394f3048289be85bceda07932ec1175 [2024-10-28 15:17:26,617 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-28 15:17:26,636 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-28 15:17:26,639 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-28 15:17:26,640 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-28 15:17:26,640 INFO L274 PluginConnector]: CDTParser initialized [2024-10-28 15:17:26,641 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/pthread-ext/37_stack_lock_p0_vs_concur.i [2024-10-28 15:17:27,809 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-28 15:17:27,986 INFO L384 CDTParser]: Found 1 translation units. [2024-10-28 15:17:27,986 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/37_stack_lock_p0_vs_concur.i [2024-10-28 15:17:27,996 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/ff48cbba0/a45f699651c84d1d8a21f6bda5c038cd/FLAG3c691076e [2024-10-28 15:17:28,367 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/ff48cbba0/a45f699651c84d1d8a21f6bda5c038cd [2024-10-28 15:17:28,369 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-28 15:17:28,370 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-28 15:17:28,371 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-28 15:17:28,371 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-28 15:17:28,374 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-28 15:17:28,375 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 03:17:28" (1/1) ... [2024-10-28 15:17:28,376 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3964b0de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 03:17:28, skipping insertion in model container [2024-10-28 15:17:28,376 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 03:17:28" (1/1) ... [2024-10-28 15:17:28,402 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-28 15:17:28,646 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/37_stack_lock_p0_vs_concur.i[31044,31057] [2024-10-28 15:17:28,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-28 15:17:28,666 INFO L200 MainTranslator]: Completed pre-run [2024-10-28 15:17:28,698 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/37_stack_lock_p0_vs_concur.i[31044,31057] [2024-10-28 15:17:28,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-28 15:17:28,726 INFO L204 MainTranslator]: Completed translation [2024-10-28 15:17:28,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 03:17:28 WrapperNode [2024-10-28 15:17:28,726 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-28 15:17:28,727 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-28 15:17:28,727 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-28 15:17:28,727 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-28 15:17:28,732 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 03:17:28" (1/1) ... [2024-10-28 15:17:28,744 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 03:17:28" (1/1) ... [2024-10-28 15:17:28,761 INFO L138 Inliner]: procedures = 165, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 148 [2024-10-28 15:17:28,762 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-28 15:17:28,762 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-28 15:17:28,765 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-28 15:17:28,765 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-28 15:17:28,771 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 03:17:28" (1/1) ... [2024-10-28 15:17:28,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 03:17:28" (1/1) ... [2024-10-28 15:17:28,773 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 03:17:28" (1/1) ... [2024-10-28 15:17:28,774 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 03:17:28" (1/1) ... [2024-10-28 15:17:28,778 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 03:17:28" (1/1) ... [2024-10-28 15:17:28,780 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 03:17:28" (1/1) ... [2024-10-28 15:17:28,781 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 03:17:28" (1/1) ... [2024-10-28 15:17:28,782 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 03:17:28" (1/1) ... [2024-10-28 15:17:28,784 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-28 15:17:28,784 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-28 15:17:28,785 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-28 15:17:28,785 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-28 15:17:28,785 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 03:17:28" (1/1) ... [2024-10-28 15:17:28,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-28 15:17:28,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 15:17:28,810 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-10-28 15:17:28,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-10-28 15:17:28,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-28 15:17:28,850 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-10-28 15:17:28,850 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-10-28 15:17:28,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-28 15:17:28,850 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-28 15:17:28,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-28 15:17:28,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-28 15:17:28,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-28 15:17:28,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-28 15:17:28,851 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-28 15:17:28,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-28 15:17:28,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-28 15:17:28,853 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-28 15:17:29,003 INFO L238 CfgBuilder]: Building ICFG [2024-10-28 15:17:29,005 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-28 15:17:29,202 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-28 15:17:29,203 INFO L287 CfgBuilder]: Performing block encoding [2024-10-28 15:17:29,450 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-28 15:17:29,451 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-28 15:17:29,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 03:17:29 BoogieIcfgContainer [2024-10-28 15:17:29,451 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-28 15:17:29,453 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-28 15:17:29,453 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-28 15:17:29,456 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-28 15:17:29,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 03:17:28" (1/3) ... [2024-10-28 15:17:29,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a885d06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 03:17:29, skipping insertion in model container [2024-10-28 15:17:29,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 03:17:28" (2/3) ... [2024-10-28 15:17:29,457 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a885d06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 03:17:29, skipping insertion in model container [2024-10-28 15:17:29,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 03:17:29" (3/3) ... [2024-10-28 15:17:29,458 INFO L112 eAbstractionObserver]: Analyzing ICFG 37_stack_lock_p0_vs_concur.i [2024-10-28 15:17:29,470 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-28 15:17:29,470 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-28 15:17:29,470 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-28 15:17:29,499 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-28 15:17:29,544 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 15:17:29,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-28 15:17:29,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 15:17:29,547 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-28 15:17:29,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-10-28 15:17:29,567 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-28 15:17:29,575 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2024-10-28 15:17:29,579 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6b48888c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 15:17:29,579 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-28 15:17:30,061 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 15:17:30,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:17:30,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1804858899, now seen corresponding path program 1 times [2024-10-28 15:17:30,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 15:17:30,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083596462] [2024-10-28 15:17:30,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 15:17:30,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 15:17:30,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 15:17:30,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 15:17:30,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 15:17:30,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083596462] [2024-10-28 15:17:30,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083596462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 15:17:30,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 15:17:30,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-28 15:17:30,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296077875] [2024-10-28 15:17:30,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 15:17:30,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-28 15:17:30,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 15:17:30,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-28 15:17:30,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-28 15:17:30,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:17:30,709 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 15:17:30,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 15:17:30,710 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:17:31,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:17:31,160 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-28 15:17:31,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-28 15:17:31,166 INFO L407 BasicCegarLoop]: Path program histogram: [1] [2024-10-28 15:17:31,168 INFO L317 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE (1/2) [2024-10-28 15:17:31,172 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 15:17:31,174 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-28 15:17:31,174 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-28 15:17:31,175 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6b48888c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 15:17:31,175 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-28 15:17:31,184 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 15:17:31,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:17:31,185 INFO L85 PathProgramCache]: Analyzing trace with hash -697374160, now seen corresponding path program 1 times [2024-10-28 15:17:31,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 15:17:31,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203393186] [2024-10-28 15:17:31,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 15:17:31,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 15:17:31,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 15:17:31,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 15:17:31,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 15:17:31,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203393186] [2024-10-28 15:17:31,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203393186] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 15:17:31,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 15:17:31,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-28 15:17:31,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093861439] [2024-10-28 15:17:31,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 15:17:31,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-28 15:17:31,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 15:17:31,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-28 15:17:31,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-28 15:17:31,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:17:31,456 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 15:17:31,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 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) [2024-10-28 15:17:31,457 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:17:31,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 15:17:31,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-28 15:17:31,514 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 15:17:31,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:17:31,514 INFO L85 PathProgramCache]: Analyzing trace with hash -142752981, now seen corresponding path program 1 times [2024-10-28 15:17:31,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 15:17:31,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442422574] [2024-10-28 15:17:31,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 15:17:31,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 15:17:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 15:17:31,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 15:17:31,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 15:17:31,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442422574] [2024-10-28 15:17:31,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442422574] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 15:17:31,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 15:17:31,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-28 15:17:31,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352342270] [2024-10-28 15:17:31,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 15:17:31,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-28 15:17:31,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 15:17:31,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-28 15:17:31,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-28 15:17:31,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:17:31,889 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 15:17:31,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 15:17:31,890 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 15:17:31,890 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:17:31,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 15:17:31,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:17:31,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-28 15:17:31,948 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 15:17:31,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:17:31,949 INFO L85 PathProgramCache]: Analyzing trace with hash 116051594, now seen corresponding path program 1 times [2024-10-28 15:17:31,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 15:17:31,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246036388] [2024-10-28 15:17:31,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 15:17:31,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 15:17:32,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-28 15:17:32,156 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-28 15:17:32,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-28 15:17:32,206 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-28 15:17:32,207 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-28 15:17:32,207 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-10-28 15:17:32,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-28 15:17:32,210 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-28 15:17:32,211 INFO L317 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2024-10-28 15:17:32,212 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-28 15:17:32,212 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-28 15:17:32,226 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-28 15:17:32,230 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 15:17:32,231 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-28 15:17:32,232 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-28 15:17:32,232 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6b48888c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 15:17:32,233 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-28 15:17:33,274 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 15:17:33,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:17:33,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1336726624, now seen corresponding path program 1 times [2024-10-28 15:17:33,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 15:17:33,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366742044] [2024-10-28 15:17:33,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 15:17:33,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 15:17:33,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 15:17:33,524 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-28 15:17:33,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 15:17:33,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366742044] [2024-10-28 15:17:33,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366742044] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 15:17:33,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 15:17:33,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-28 15:17:33,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569760559] [2024-10-28 15:17:33,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 15:17:33,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-28 15:17:33,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 15:17:33,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-28 15:17:33,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-28 15:17:33,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:17:33,526 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 15:17:33,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 15:17:33,527 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:17:34,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:17:34,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-28 15:17:34,408 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 15:17:34,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:17:34,409 INFO L85 PathProgramCache]: Analyzing trace with hash 326567677, now seen corresponding path program 1 times [2024-10-28 15:17:34,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 15:17:34,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244457894] [2024-10-28 15:17:34,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 15:17:34,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 15:17:34,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 15:17:34,769 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-28 15:17:34,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 15:17:34,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244457894] [2024-10-28 15:17:34,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244457894] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 15:17:34,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 15:17:34,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-28 15:17:34,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457265276] [2024-10-28 15:17:34,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 15:17:34,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-28 15:17:34,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 15:17:34,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-28 15:17:34,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-28 15:17:34,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:17:34,771 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 15:17:34,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 15:17:34,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:17:34,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:17:34,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:17:34,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:17:34,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-28 15:17:34,868 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 15:17:34,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:17:34,868 INFO L85 PathProgramCache]: Analyzing trace with hash 299802973, now seen corresponding path program 1 times [2024-10-28 15:17:34,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 15:17:34,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160764739] [2024-10-28 15:17:34,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 15:17:34,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 15:17:35,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-28 15:17:35,043 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-28 15:17:35,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-28 15:17:35,066 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-28 15:17:35,066 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-28 15:17:35,066 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-10-28 15:17:35,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-28 15:17:35,067 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-28 15:17:35,068 INFO L317 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2024-10-28 15:17:35,068 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-28 15:17:35,068 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-28 15:17:35,087 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-28 15:17:35,090 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 15:17:35,091 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-28 15:17:35,092 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2024-10-28 15:17:35,092 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6b48888c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 15:17:35,092 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-28 15:17:36,955 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 15:17:36,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:17:36,955 INFO L85 PathProgramCache]: Analyzing trace with hash 498487298, now seen corresponding path program 1 times [2024-10-28 15:17:36,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 15:17:36,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332079582] [2024-10-28 15:17:36,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 15:17:36,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 15:17:37,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 15:17:37,140 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-28 15:17:37,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 15:17:37,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332079582] [2024-10-28 15:17:37,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332079582] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 15:17:37,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 15:17:37,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-28 15:17:37,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595314014] [2024-10-28 15:17:37,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 15:17:37,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-28 15:17:37,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 15:17:37,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-28 15:17:37,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-28 15:17:37,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:17:37,143 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 15:17:37,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 15:17:37,143 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:17:38,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:17:38,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-28 15:17:38,505 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 15:17:38,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:17:38,506 INFO L85 PathProgramCache]: Analyzing trace with hash -746410652, now seen corresponding path program 1 times [2024-10-28 15:17:38,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 15:17:38,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632852653] [2024-10-28 15:17:38,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 15:17:38,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 15:17:38,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 15:17:38,889 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-28 15:17:38,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 15:17:38,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632852653] [2024-10-28 15:17:38,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632852653] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 15:17:38,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 15:17:38,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-28 15:17:38,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695531040] [2024-10-28 15:17:38,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 15:17:38,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-28 15:17:38,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 15:17:38,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-28 15:17:38,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-28 15:17:38,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:17:38,891 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 15:17:38,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 15:17:38,891 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:17:38,891 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:17:40,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:17:40,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:17:40,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-28 15:17:40,388 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 15:17:40,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:17:40,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1754203010, now seen corresponding path program 1 times [2024-10-28 15:17:40,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 15:17:40,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868179262] [2024-10-28 15:17:40,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 15:17:40,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 15:17:40,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 15:17:40,597 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-28 15:17:40,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 15:17:40,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868179262] [2024-10-28 15:17:40,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868179262] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 15:17:40,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 15:17:40,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-28 15:17:40,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000763166] [2024-10-28 15:17:40,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 15:17:40,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-28 15:17:40,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 15:17:40,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-28 15:17:40,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-28 15:17:40,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:17:40,599 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 15:17:40,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 15:17:40,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:17:40,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:17:40,599 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:17:41,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:17:41,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:17:41,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:17:41,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-28 15:17:41,551 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 15:17:41,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:17:41,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1162762926, now seen corresponding path program 2 times [2024-10-28 15:17:41,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 15:17:41,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660083012] [2024-10-28 15:17:41,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 15:17:41,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 15:17:41,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 15:17:41,988 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 15:17:41,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 15:17:41,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660083012] [2024-10-28 15:17:41,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660083012] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 15:17:41,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349080667] [2024-10-28 15:17:41,989 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-28 15:17:41,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 15:17:41,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 15:17:42,000 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-28 15:17:42,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-28 15:17:42,341 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-28 15:17:42,341 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-28 15:17:42,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-28 15:17:42,352 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 15:17:42,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-28 15:17:42,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-28 15:17:42,465 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-10-28 15:17:42,465 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 23 treesize of output 15 [2024-10-28 15:17:42,557 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 15:17:42,557 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 31 treesize of output 23 [2024-10-28 15:17:42,593 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 15:17:42,593 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 15:17:43,133 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 15:17:43,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 49 [2024-10-28 15:17:43,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 122 [2024-10-28 15:17:43,182 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 15:17:43,182 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 21 treesize of output 22 [2024-10-28 15:17:43,184 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 35 treesize of output 27 [2024-10-28 15:17:43,223 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 15:17:43,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349080667] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 15:17:43,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 15:17:43,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 23 [2024-10-28 15:17:43,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389920610] [2024-10-28 15:17:43,224 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 15:17:43,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-10-28 15:17:43,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 15:17:43,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-10-28 15:17:43,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=463, Unknown=7, NotChecked=0, Total=552 [2024-10-28 15:17:43,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:17:43,226 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 15:17:43,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.541666666666667) internal successors, (109), 23 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 15:17:43,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:17:43,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:17:43,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:17:43,226 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:17:45,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:17:47,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:17:49,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:17:51,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:17:53,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:17:56,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:17:58,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:18:00,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:18:02,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:18:04,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:18:09,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:18:11,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:18:13,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:18:15,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:18:17,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:18:19,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:18:21,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:18:23,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:18:25,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:18:27,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:18:29,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:18:31,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:18:31,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:18:31,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:18:31,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:18:31,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-10-28 15:18:31,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-28 15:18:32,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-28 15:18:32,071 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 15:18:32,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:18:32,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1357638934, now seen corresponding path program 3 times [2024-10-28 15:18:32,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 15:18:32,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923682291] [2024-10-28 15:18:32,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 15:18:32,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 15:18:32,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 15:18:32,533 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 15:18:32,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 15:18:32,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923682291] [2024-10-28 15:18:32,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923682291] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 15:18:32,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964408818] [2024-10-28 15:18:32,534 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-28 15:18:32,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 15:18:32,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 15:18:32,536 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-28 15:18:32,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-28 15:18:32,811 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-10-28 15:18:32,811 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-28 15:18:32,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-28 15:18:32,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 15:18:32,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-28 15:18:32,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-28 15:18:32,874 INFO L349 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2024-10-28 15:18:32,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 88 [2024-10-28 15:18:32,899 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 [2024-10-28 15:18:32,934 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-10-28 15:18:32,934 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 31 treesize of output 36 [2024-10-28 15:18:32,941 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 [2024-10-28 15:18:32,950 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 15:18:32,950 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 [2024-10-28 15:18:33,482 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 15:18:33,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 171 treesize of output 139 [2024-10-28 15:18:33,490 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 15:18:33,490 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 65 treesize of output 70 [2024-10-28 15:18:33,496 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 61 treesize of output 59 [2024-10-28 15:18:33,587 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-28 15:18:33,588 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-28 15:18:33,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964408818] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 15:18:33,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-28 15:18:33,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [14] total 22 [2024-10-28 15:18:33,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952468839] [2024-10-28 15:18:33,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 15:18:33,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-28 15:18:33,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 15:18:33,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-28 15:18:33,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=397, Unknown=1, NotChecked=0, Total=462 [2024-10-28 15:18:33,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:18:33,589 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 15:18:33,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 15:18:33,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:18:33,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:18:33,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:18:33,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-10-28 15:18:33,589 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:18:34,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:18:34,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:18:34,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:18:34,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-10-28 15:18:34,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-28 15:18:34,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-28 15:18:35,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 15:18:35,118 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 15:18:35,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:18:35,118 INFO L85 PathProgramCache]: Analyzing trace with hash -46455156, now seen corresponding path program 4 times [2024-10-28 15:18:35,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 15:18:35,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072265188] [2024-10-28 15:18:35,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 15:18:35,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 15:18:35,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 15:18:35,560 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 15:18:35,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 15:18:35,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072265188] [2024-10-28 15:18:35,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072265188] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 15:18:35,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762076424] [2024-10-28 15:18:35,560 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-28 15:18:35,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 15:18:35,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 15:18:35,562 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-28 15:18:35,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-28 15:18:35,839 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-28 15:18:35,839 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-28 15:18:35,841 INFO L255 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-28 15:18:35,843 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 15:18:35,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-28 15:18:35,898 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 [2024-10-28 15:18:35,924 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-28 15:18:35,924 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 13 [2024-10-28 15:18:35,980 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-28 15:18:35,980 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 27 treesize of output 27 [2024-10-28 15:18:36,030 INFO L349 Elim1Store]: treesize reduction 20, result has 50.0 percent of original size [2024-10-28 15:18:36,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 46 [2024-10-28 15:18:36,093 INFO L349 Elim1Store]: treesize reduction 20, result has 47.4 percent of original size [2024-10-28 15:18:36,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 39 [2024-10-28 15:18:36,145 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 15:18:36,146 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 15:18:36,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-28 15:18:36,572 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 84 treesize of output 80 [2024-10-28 15:18:36,601 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 84 treesize of output 80 [2024-10-28 15:18:37,122 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 15:18:37,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 52 [2024-10-28 15:18:37,131 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 15:18:37,132 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 1 case distinctions, treesize of input 9 treesize of output 8 [2024-10-28 15:18:37,211 INFO L349 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2024-10-28 15:18:37,212 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 260 treesize of output 266 [2024-10-28 15:18:37,220 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 230 treesize of output 228 [2024-10-28 15:18:37,227 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 228 treesize of output 226 [2024-10-28 15:18:37,234 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 224 [2024-10-28 15:18:37,588 INFO L349 Elim1Store]: treesize reduction 135, result has 44.9 percent of original size [2024-10-28 15:18:37,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 199 treesize of output 268 [2024-10-28 15:18:37,651 INFO L349 Elim1Store]: treesize reduction 22, result has 60.0 percent of original size [2024-10-28 15:18:37,652 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 295 treesize of output 307 [2024-10-28 15:18:37,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 141 treesize of output 139 [2024-10-28 15:18:37,678 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 139 treesize of output 137 [2024-10-28 15:18:37,688 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 137 treesize of output 135 [2024-10-28 15:18:37,696 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 135 treesize of output 133 [2024-10-28 15:18:37,705 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 133 treesize of output 131 [2024-10-28 15:18:37,869 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 15:18:37,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2024-10-28 15:18:37,933 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 15:18:37,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762076424] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 15:18:37,934 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 15:18:37,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 27 [2024-10-28 15:18:37,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139487307] [2024-10-28 15:18:37,934 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 15:18:37,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-28 15:18:37,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 15:18:37,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-28 15:18:37,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=641, Unknown=17, NotChecked=0, Total=756 [2024-10-28 15:18:37,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:18:37,936 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 15:18:37,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.0) internal successors, (112), 27 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 15:18:37,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:18:37,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:18:37,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:18:37,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-10-28 15:18:37,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-28 15:18:37,936 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:18:38,389 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|))) (and (not (= c_~top~0 0)) (or (< c_~next_alloc_idx~0 65) (forall ((v_DerPreprocessor_4 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_6) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_4) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)))) (not (= (select .cse0 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)) (or (< 64 c_~next_alloc_idx~0) (let ((.cse1 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse0 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (and (or (forall ((v_DerPreprocessor_4 (Array Int Int))) (not (= (select (select (store .cse1 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_4) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0))) (< c_~next_alloc_idx~0 63)) (or (< 62 c_~next_alloc_idx~0) (forall ((v_DerPreprocessor_5 (Array Int Int))) (not (= (select (select (store .cse1 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_5) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0))))))))) is different from false [2024-10-28 15:18:40,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 15:18:44,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 15:18:46,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 15:18:48,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 15:18:53,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 15:18:55,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 15:18:57,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 15:19:00,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 15:19:02,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 15:19:04,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 15:19:06,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 15:19:08,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 15:19:16,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 15:19:18,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 15:19:20,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 15:19:22,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 15:19:24,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 15:19:26,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 15:19:28,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 15:19:30,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 15:19:32,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 15:19:34,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 15:19:36,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 15:19:38,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 15:19:40,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 15:19:42,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 15:19:44,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 15:19:51,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:19:53,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:19:55,778 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:19:58,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:20:00,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:20:03,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:20:05,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:20:10,815 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:20:12,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:20:15,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:20:17,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:20:19,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:20:21,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:20:23,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:20:25,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:20:27,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:20:29,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:20:31,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:20:33,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:20:35,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:20:37,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:20:39,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:20:41,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:20:43,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:20:45,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:20:54,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 15:21:00,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:21:02,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:21:03,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:21:03,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:21:03,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:21:03,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-10-28 15:21:03,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-28 15:21:03,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2024-10-28 15:21:03,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-28 15:21:03,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 15:21:03,533 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 15:21:03,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:21:03,533 INFO L85 PathProgramCache]: Analyzing trace with hash 236429594, now seen corresponding path program 5 times [2024-10-28 15:21:03,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 15:21:03,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196185408] [2024-10-28 15:21:03,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 15:21:03,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 15:21:03,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 15:21:04,138 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 15:21:04,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 15:21:04,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196185408] [2024-10-28 15:21:04,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196185408] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 15:21:04,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728148378] [2024-10-28 15:21:04,138 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-28 15:21:04,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 15:21:04,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 15:21:04,140 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-28 15:21:04,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-28 15:21:04,451 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-10-28 15:21:04,452 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-28 15:21:04,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-28 15:21:04,458 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 15:21:04,468 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 [2024-10-28 15:21:04,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-28 15:21:04,535 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-28 15:21:04,535 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-28 15:21:04,554 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 [2024-10-28 15:21:04,641 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-28 15:21:04,641 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 19 treesize of output 22 [2024-10-28 15:21:04,702 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 15:21:04,703 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 31 treesize of output 23 [2024-10-28 15:21:04,733 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 15:21:04,733 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 15:21:04,761 WARN L851 $PredicateComparison]: unable to prove that (and (or (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int)) (not (= (select (select (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store (select |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0))) (< 64 c_~next_alloc_idx~0)) (or (< c_~next_alloc_idx~0 65) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_9 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_9) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0))))) is different from false [2024-10-28 15:21:04,896 WARN L851 $PredicateComparison]: unable to prove that (and (or (forall ((v_DerPreprocessor_10 (Array Int Int)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_9 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_10) |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_9) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0))) (< c_~next_alloc_idx~0 65)) (or (and (or (< 62 c_~next_alloc_idx~0) (forall ((v_prenex_85 Int) (v_DerPreprocessor_11 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_11))) (store .cse0 v_prenex_85 (store (select .cse0 v_prenex_85) 0 (+ c_~next_alloc_idx~0 2)))) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0)))) (or (< c_~next_alloc_idx~0 63) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| Int) (v_DerPreprocessor_9 (Array Int Int)) (v_DerPreprocessor_11 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_11) |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_9) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0))))) (< 64 c_~next_alloc_idx~0))) is different from false [2024-10-28 15:21:05,097 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 15:21:05,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 52 [2024-10-28 15:21:05,103 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 15:21:05,104 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 1 case distinctions, treesize of input 9 treesize of output 8 [2024-10-28 15:21:05,141 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 235 treesize of output 221 [2024-10-28 15:21:05,167 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 54 treesize of output 52 [2024-10-28 15:21:05,170 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 52 treesize of output 50 [2024-10-28 15:21:05,172 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 50 treesize of output 46 [2024-10-28 15:21:05,184 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 15:21:05,184 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 474 treesize of output 460 [2024-10-28 15:21:05,192 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 297 treesize of output 293 [2024-10-28 15:21:05,201 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 315 treesize of output 307 [2024-10-28 15:21:05,207 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 307 treesize of output 305 [2024-10-28 15:21:05,213 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 305 treesize of output 303 [2024-10-28 15:21:05,220 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 303 treesize of output 299 [2024-10-28 15:21:05,378 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 130 treesize of output 120 [2024-10-28 15:21:05,543 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 15:21:05,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728148378] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 15:21:05,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 15:21:05,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 27 [2024-10-28 15:21:05,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858856714] [2024-10-28 15:21:05,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 15:21:05,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-28 15:21:05,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 15:21:05,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-28 15:21:05,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=545, Unknown=15, NotChecked=98, Total=756 [2024-10-28 15:21:05,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:21:05,544 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 15:21:05,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.035714285714286) internal successors, (113), 27 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 15:21:05,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:21:05,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:21:05,544 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:21:05,545 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-10-28 15:21:05,545 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-28 15:21:05,545 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 120 states. [2024-10-28 15:21:05,545 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:21:15,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:21:17,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:21:19,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:21:21,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:21:32,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:21:32,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 15:21:32,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:21:32,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-10-28 15:21:32,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-28 15:21:32,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2024-10-28 15:21:32,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2024-10-28 15:21:32,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-28 15:21:32,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-28 15:21:32,304 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 15:21:32,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:21:32,305 INFO L85 PathProgramCache]: Analyzing trace with hash 280204162, now seen corresponding path program 6 times [2024-10-28 15:21:32,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 15:21:32,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871683955] [2024-10-28 15:21:32,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 15:21:32,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 15:21:32,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 15:21:32,785 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 15:21:32,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 15:21:32,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871683955] [2024-10-28 15:21:32,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871683955] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 15:21:32,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908658248] [2024-10-28 15:21:32,785 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-28 15:21:32,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 15:21:32,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 15:21:32,787 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-28 15:21:32,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-28 15:21:33,077 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2024-10-28 15:21:33,077 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-28 15:21:33,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-28 15:21:33,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 15:21:33,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-28 15:21:33,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-28 15:21:33,201 INFO L349 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2024-10-28 15:21:33,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 96 [2024-10-28 15:21:33,244 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-10-28 15:21:33,244 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 31 treesize of output 36 [2024-10-28 15:21:33,251 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 [2024-10-28 15:21:33,265 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 15:21:33,266 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 [2024-10-28 15:21:33,284 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 [2024-10-28 15:21:33,293 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 12 [2024-10-28 15:21:33,744 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 15:21:33,745 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 62 treesize of output 42 [2024-10-28 15:21:33,787 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-28 15:21:33,787 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-28 15:21:33,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908658248] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 15:21:33,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-28 15:21:33,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [14] total 22 [2024-10-28 15:21:33,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8021437] [2024-10-28 15:21:33,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 15:21:33,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-28 15:21:33,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 15:21:33,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-28 15:21:33,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2024-10-28 15:21:33,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:21:33,789 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 15:21:33,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 15:21:33,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:21:33,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 15:21:33,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:21:33,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2024-10-28 15:21:33,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-28 15:21:33,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 128 states. [2024-10-28 15:21:33,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 95 states. [2024-10-28 15:21:33,789 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:21:36,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:21:36,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 15:21:36,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:21:36,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2024-10-28 15:21:36,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-28 15:21:36,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2024-10-28 15:21:36,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2024-10-28 15:21:36,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-28 15:21:36,560 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-28 15:21:36,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-28 15:21:36,748 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 15:21:36,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:21:36,748 INFO L85 PathProgramCache]: Analyzing trace with hash -394058204, now seen corresponding path program 7 times [2024-10-28 15:21:36,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 15:21:36,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895667858] [2024-10-28 15:21:36,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 15:21:36,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 15:21:36,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 15:21:37,210 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 15:21:37,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 15:21:37,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895667858] [2024-10-28 15:21:37,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895667858] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 15:21:37,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510454267] [2024-10-28 15:21:37,211 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-28 15:21:37,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 15:21:37,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 15:21:37,213 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-28 15:21:37,214 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-28 15:21:37,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 15:21:37,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-28 15:21:37,577 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 15:21:37,584 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 [2024-10-28 15:21:37,617 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-28 15:21:37,618 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 13 [2024-10-28 15:21:37,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-28 15:21:37,700 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-28 15:21:37,701 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 17 [2024-10-28 15:21:37,762 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-28 15:21:37,763 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 27 treesize of output 27 [2024-10-28 15:21:37,811 INFO L349 Elim1Store]: treesize reduction 24, result has 45.5 percent of original size [2024-10-28 15:21:37,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 39 [2024-10-28 15:21:37,881 INFO L349 Elim1Store]: treesize reduction 20, result has 47.4 percent of original size [2024-10-28 15:21:37,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 39 [2024-10-28 15:21:37,939 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 15 treesize of output 7 [2024-10-28 15:21:37,967 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 15:21:37,967 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 15:21:38,117 WARN L851 $PredicateComparison]: unable to prove that (and (or (< c_~next_alloc_idx~0 65) (forall ((v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_15) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_14) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (or (let ((.cse0 (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|))) (and (or (< 62 c_~next_alloc_idx~0) (forall ((v_ArrVal_2292 Int) (v_DerPreprocessor_13 (Array Int Int))) (or (< v_ArrVal_2292 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse0 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2292)) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))) (or (< c_~next_alloc_idx~0 63) (forall ((v_ArrVal_2292 Int) (v_DerPreprocessor_14 (Array Int Int))) (or (< v_ArrVal_2292 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse0 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2292)) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_14) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))))) (< 64 c_~next_alloc_idx~0))) is different from false [2024-10-28 15:21:38,719 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 15:21:38,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 52 [2024-10-28 15:21:38,727 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 15:21:38,727 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 1 case distinctions, treesize of input 9 treesize of output 8 [2024-10-28 15:21:39,032 INFO L349 Elim1Store]: treesize reduction 190, result has 41.5 percent of original size [2024-10-28 15:21:39,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 22 case distinctions, treesize of input 214 treesize of output 326 [2024-10-28 15:21:39,132 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 15:21:39,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 450 treesize of output 514 [2024-10-28 15:21:39,163 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 191 treesize of output 189 [2024-10-28 15:21:39,183 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 189 treesize of output 187 [2024-10-28 15:21:39,204 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 187 treesize of output 185 [2024-10-28 15:21:39,223 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 185 treesize of output 183 [2024-10-28 15:21:39,244 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 183 treesize of output 181 [2024-10-28 15:21:39,266 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 181 treesize of output 179 [2024-10-28 15:21:39,287 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 179 treesize of output 177 [2024-10-28 15:22:31,465 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 15:22:31,466 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 625 treesize of output 608 [2024-10-28 15:22:32,232 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 15:22:32,233 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 113 treesize of output 117 [2024-10-28 15:22:32,305 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 15:22:32,305 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 453 treesize of output 438 [2024-10-28 15:22:32,852 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 965 treesize of output 891 [2024-10-28 15:22:33,384 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 230 treesize of output 212 [2024-10-28 15:22:33,425 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 [2024-10-28 15:22:33,428 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 10 treesize of output 8 [2024-10-28 15:22:33,435 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 57 treesize of output 53 [2024-10-28 15:22:33,456 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 33 treesize of output 31 [2024-10-28 15:22:33,470 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 [2024-10-28 15:22:33,524 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-28 15:22:33,524 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 1374 treesize of output 1333 [2024-10-28 15:22:33,560 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-28 15:22:33,561 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 1328 treesize of output 1283 [2024-10-28 15:22:38,419 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 15:22:38,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510454267] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 15:22:38,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 15:22:38,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 30 [2024-10-28 15:22:38,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894381549] [2024-10-28 15:22:38,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 15:22:38,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-28 15:22:38,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 15:22:38,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-28 15:22:38,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=759, Unknown=14, NotChecked=56, Total=930 [2024-10-28 15:22:38,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:22:38,421 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 15:22:38,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 4.032258064516129) internal successors, (125), 30 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 15:22:38,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:22:38,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 15:22:38,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:22:38,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 67 states. [2024-10-28 15:22:38,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-28 15:22:38,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 128 states. [2024-10-28 15:22:38,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 95 states. [2024-10-28 15:22:38,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-28 15:22:38,421 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:22:40,284 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|)) (.cse9 (= |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|))) (let ((.cse6 (< c_~next_alloc_idx~0 65)) (.cse5 (+ c_~next_alloc_idx~0 1)) (.cse2 (< 62 c_~next_alloc_idx~0)) (.cse0 (< c_~next_alloc_idx~0 63)) (.cse4 (< 64 c_~next_alloc_idx~0)) (.cse7 (= |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (.cse8 (not .cse9)) (.cse10 (not (= (select .cse11 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)))) (and (or (and (or .cse0 (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21| Int) (v_ArrVal_2292 Int) (v_DerPreprocessor_14 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21|))) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21|) 0)) (< v_ArrVal_2292 c_~next_alloc_idx~0) (not (= (+ (select .cse1 0) 1) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21| (store .cse1 0 v_ArrVal_2292)) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_14) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21|) 0)))))) (or .cse2 (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21| Int) (v_ArrVal_2292 Int) (v_DerPreprocessor_13 (Array Int Int))) (let ((.cse3 (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21|))) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21|) 0)) (< v_ArrVal_2292 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21| (store .cse3 0 v_ArrVal_2292)) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21|) 0)) (not (= (+ (select .cse3 0) 1) 0))))))) .cse4) (<= 0 .cse5) (or .cse6 (forall ((v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_15) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_14) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (or .cse6 (forall ((v_DerPreprocessor_15 (Array Int Int)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21| Int) (v_DerPreprocessor_14 (Array Int Int))) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21|) 0)) (< 0 (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21| v_DerPreprocessor_15) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_14) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21|) 0)) (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21|) 0) 1) 0))))) (not (= .cse5 0)) (or .cse7 .cse8) (<= c_~next_alloc_idx~0 62) (not (= c_~top~0 0)) (or .cse9 .cse10) (or (and (or .cse2 (forall ((v_ArrVal_2292 Int) (v_DerPreprocessor_13 (Array Int Int))) (or (< v_ArrVal_2292 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse11 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2292)) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))) (or .cse0 (forall ((v_ArrVal_2292 Int) (v_DerPreprocessor_14 (Array Int Int))) (or (< v_ArrVal_2292 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse11 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2292)) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_14) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))))) .cse4) (or (and .cse7 (= (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) |c_thr1Thread1of3ForFork0_push_#t~mem1#1|)) .cse8) .cse10))) is different from false [2024-10-28 15:22:42,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 15:22:44,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 15:22:44,446 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|)) (.cse3 (= |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|))) (let ((.cse0 (+ c_~next_alloc_idx~0 1)) (.cse1 (= |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (.cse2 (not .cse3)) (.cse4 (not (= (select .cse5 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)))) (and (<= 0 .cse0) (or (< c_~next_alloc_idx~0 65) (forall ((v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_15) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_14) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (not (= .cse0 0)) (or .cse1 .cse2) (<= c_~next_alloc_idx~0 62) (or .cse3 .cse4) (or (and (or (< 62 c_~next_alloc_idx~0) (forall ((v_ArrVal_2292 Int) (v_DerPreprocessor_13 (Array Int Int))) (or (< v_ArrVal_2292 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse5 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2292)) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))) (or (< c_~next_alloc_idx~0 63) (forall ((v_ArrVal_2292 Int) (v_DerPreprocessor_14 (Array Int Int))) (or (< v_ArrVal_2292 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse5 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2292)) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_14) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))))) (< 64 c_~next_alloc_idx~0)) (or (and .cse1 (= (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) |c_thr1Thread1of3ForFork0_push_#t~mem1#1|)) .cse2) .cse4))) is different from false [2024-10-28 15:22:44,583 WARN L851 $PredicateComparison]: unable to prove that (and (or (forall ((v_DerPreprocessor_13 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (< 64 c_~next_alloc_idx~0)) (or (forall ((v_DerPreprocessor_14 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_14) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (< c_~next_alloc_idx~0 65)) (not (= c_~top~0 0))) is different from false [2024-10-28 15:22:44,662 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|)) (.cse11 (= |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|)) (.cse6 (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|)) (.cse15 (+ c_~next_alloc_idx~0 1))) (let ((.cse3 (<= 0 .cse15)) (.cse2 (not (= (select |c_#valid| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 0))) (.cse5 (<= c_~next_alloc_idx~0 62)) (.cse4 (not .cse6)) (.cse7 (not (= .cse15 0))) (.cse8 (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21|) 0)) (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21|)))) (.cse9 (= |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (.cse10 (not .cse11)) (.cse12 (not (= (select .cse13 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0))) (.cse14 (< 0 (+ c_~next_alloc_idx~0 2))) (.cse1 (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21| Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| Int)) (or (not (= (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21|) 0)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_21| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22|)))) (.cse0 (< c_~next_alloc_idx~0 63))) (and (or .cse0 (forall ((v_prenex_422 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| Int)) (or (= v_prenex_422 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22|) (not (= (select |c_#valid| v_prenex_422) 0))))) (or .cse0 (forall ((v_prenex_497 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| Int)) (or (not (= (select |c_#valid| v_prenex_497) 0)) (= v_prenex_497 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22|)))) (or .cse0 (forall ((v_prenex_503 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| Int)) (or (= v_prenex_503 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22|) (not (= (select |c_#valid| v_prenex_503) 0))))) (or .cse0 (forall ((v_prenex_512 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| Int)) (or (not (= (select |c_#valid| v_prenex_512) 0)) (= v_prenex_512 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22|)))) (or .cse0 (forall ((v_prenex_512 Int)) (or (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_prenex_512) (not (= (select |c_#valid| v_prenex_512) 0))))) (or .cse0 .cse1) (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| Int)) (or (= |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22|) .cse2)) (or .cse0 (forall ((v_prenex_384 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| Int)) (or (not (= (select |c_#valid| v_prenex_384) 0)) (= v_prenex_384 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22|)))) (or .cse0 (forall ((v_prenex_420 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| Int)) (or (not (= (select |c_#valid| v_prenex_420) 0)) (= v_prenex_420 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22|)))) (or .cse0 (forall ((v_prenex_502 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| Int)) (or (= v_prenex_502 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22|) (not (= (select |c_#valid| v_prenex_502) 0))))) (or .cse0 (forall ((v_prenex_511 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| Int)) (or (= v_prenex_511 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22|) (not (= (select |c_#valid| v_prenex_511) 0))))) (or .cse0 (forall ((v_prenex_402 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| Int)) (or (= v_prenex_402 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22|) (not (= (select |c_#valid| v_prenex_402) 0))))) (or .cse0 (forall ((v_prenex_502 Int)) (or (not (= (select |c_#valid| v_prenex_502) 0)) (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_prenex_502)))) (or .cse0 (forall ((v_prenex_393 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| Int)) (or (not (= (select |c_#valid| v_prenex_393) 0)) (= v_prenex_393 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22|)))) (or .cse0 (forall ((v_prenex_400 Int)) (or (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_prenex_400) (not (= (select |c_#valid| v_prenex_400) 0))))) (or .cse0 (forall ((v_prenex_419 Int)) (or (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_prenex_419) (not (= (select |c_#valid| v_prenex_419) 0))))) (or (and .cse3 .cse4 .cse5) (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| 0)) .cse3 (or (forall ((v_prenex_469 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| Int)) (or (= v_prenex_469 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22|) (not (= (select |c_#valid| v_prenex_469) 0)))) .cse0) (or (forall ((v_prenex_392 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| Int)) (or (not (= (select |c_#valid| v_prenex_392) 0)) (= v_prenex_392 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22|))) .cse0) (or (< c_~next_alloc_idx~0 65) (forall ((v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_15) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_14) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (or .cse0 (forall ((v_prenex_408 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| Int)) (or (not (= (select |c_#valid| v_prenex_408) 0)) (= v_prenex_408 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22|)))) (or .cse0 (forall ((v_prenex_425 Int)) (or (not (= (select |c_#valid| v_prenex_425) 0)) (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_prenex_425)))) (or .cse6 .cse2) (or .cse0 (forall ((v_prenex_397 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| Int)) (or (= v_prenex_397 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22|) (not (= (select |c_#valid| v_prenex_397) 0))))) (or (forall ((v_prenex_423 Int)) (or (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_prenex_423) (not (= 0 (select |c_#valid| v_prenex_423))))) .cse0) (or (forall ((v_prenex_505 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| Int)) (or (= v_prenex_505 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22|) (not (= (select |c_#valid| v_prenex_505) 0)))) .cse0) (or (forall ((v_prenex_424 Int)) (or (not (= (select |c_#valid| v_prenex_424) 0)) (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_prenex_424))) .cse0) (or .cse0 (forall ((v_prenex_506 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| Int)) (or (= v_prenex_506 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22|) (not (= (select |c_#valid| v_prenex_506) 0))))) (or .cse0 (forall ((v_prenex_405 Int)) (or (not (= (select |c_#valid| v_prenex_405) 0)) (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_prenex_405)))) (or (forall ((v_prenex_518 Int)) (or (not (= (select |c_#valid| v_prenex_518) 0)) (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_prenex_518))) .cse0) (or .cse0 (forall ((v_prenex_504 Int)) (or (not (= (select |c_#valid| v_prenex_504) 0)) (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_prenex_504)))) .cse7 (or .cse0 (forall ((v_prenex_510 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| Int)) (or (not (= (select |c_#valid| v_prenex_510) 0)) (= v_prenex_510 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22|)))) (or (forall ((v_prenex_394 Int)) (or (not (= (select |c_#valid| v_prenex_394) 0)) (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_prenex_394))) .cse0) (or (forall ((v_prenex_473 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| Int)) (or (= v_prenex_473 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22|) (not (= (select |c_#valid| v_prenex_473) 0)))) .cse0) (or .cse0 (forall ((v_prenex_397 Int)) (or (not (= (select |c_#valid| v_prenex_397) 0)) (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_prenex_397)))) (or .cse0 .cse8) (or .cse9 .cse10) .cse5 (or .cse0 (forall ((v_prenex_503 Int)) (or (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_prenex_503) (not (= (select |c_#valid| v_prenex_503) 0))))) (or .cse0 (forall ((v_prenex_137 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| Int)) (or (not (= (select |c_#valid| v_prenex_137) 0)) (= v_prenex_137 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22|)))) (or .cse0 (forall ((v_prenex_505 Int)) (or (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_prenex_505) (not (= (select |c_#valid| v_prenex_505) 0))))) (or .cse4 .cse7) (or .cse0 (forall ((v_prenex_398 Int)) (or (not (= (select |c_#valid| v_prenex_398) 0)) (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_prenex_398)))) (or (forall ((v_prenex_508 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| Int)) (or (not (= (select |c_#valid| v_prenex_508) 0)) (= v_prenex_508 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22|))) .cse0) (or .cse0 (forall ((v_prenex_500 Int)) (or (not (= (select |c_#valid| v_prenex_500) 0)) (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_prenex_500)))) (or .cse0 (forall ((v_prenex_504 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| Int)) (or (not (= (select |c_#valid| v_prenex_504) 0)) (= v_prenex_504 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22|)))) (or .cse0 (forall ((v_prenex_424 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| Int)) (or (not (= (select |c_#valid| v_prenex_424) 0)) (= v_prenex_424 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22|)))) (or .cse0 (forall ((v_prenex_406 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| Int)) (or (= v_prenex_406 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22|) (not (= (select |c_#valid| v_prenex_406) 0))))) (or (forall ((v_prenex_399 Int)) (or (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_prenex_399) (not (= (select |c_#valid| v_prenex_399) 0)))) .cse0) (or .cse11 .cse12) (or (and (or (< 62 c_~next_alloc_idx~0) (forall ((v_ArrVal_2292 Int) (v_DerPreprocessor_13 (Array Int Int))) (or (< v_ArrVal_2292 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse13 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2292)) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))) (or .cse0 (forall ((v_ArrVal_2292 Int) (v_DerPreprocessor_14 (Array Int Int))) (or (< v_ArrVal_2292 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse13 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2292)) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_14) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))))) (< 64 c_~next_alloc_idx~0)) (or .cse0 (forall ((v_prenex_399 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| Int)) (or (= v_prenex_399 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22|) (not (= (select |c_#valid| v_prenex_399) 0))))) (or .cse0 (forall ((v_prenex_398 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| Int)) (or (not (= (select |c_#valid| v_prenex_398) 0)) (= v_prenex_398 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22|)))) (or .cse0 (forall ((v_prenex_501 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| Int)) (or (not (= (select |c_#valid| v_prenex_501) 0)) (= v_prenex_501 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22|)))) (or .cse0 (forall ((v_prenex_393 Int)) (or (not (= (select |c_#valid| v_prenex_393) 0)) (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_prenex_393)))) (or .cse0 (forall ((v_prenex_408 Int)) (or (not (= (select |c_#valid| v_prenex_408) 0)) (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_prenex_408)))) (or (forall ((v_prenex_419 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| Int)) (or (= v_prenex_419 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22|) (not (= (select |c_#valid| v_prenex_419) 0)))) .cse0) (or .cse14 .cse8) (or .cse0 (forall ((v_prenex_497 Int)) (or (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_prenex_497) (not (= (select |c_#valid| v_prenex_497) 0))))) (or .cse0 (forall ((v_prenex_401 Int)) (or (not (= (select |c_#valid| v_prenex_401) 0)) (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_prenex_401)))) (or .cse0 (forall ((v_prenex_508 Int)) (or (not (= (select |c_#valid| v_prenex_508) 0)) (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_prenex_508)))) (or (forall ((v_prenex_404 Int)) (or (not (= (select |c_#valid| v_prenex_404) 0)) (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_prenex_404))) .cse0) (or .cse0 (forall ((v_prenex_391 Int)) (or (not (= (select |c_#valid| v_prenex_391) 0)) (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_prenex_391)))) (or .cse0 (forall ((v_prenex_423 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| Int)) (or (= v_prenex_423 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22|) (not (= 0 (select |c_#valid| v_prenex_423)))))) (or (forall ((v_prenex_420 Int)) (or (not (= (select |c_#valid| v_prenex_420) 0)) (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_prenex_420))) .cse0) (or .cse0 (forall ((v_prenex_500 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| Int)) (or (= v_prenex_500 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22|) (not (= (select |c_#valid| v_prenex_500) 0))))) (or (forall ((v_prenex_384 Int)) (or (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_prenex_384) (not (= (select |c_#valid| v_prenex_384) 0)))) .cse0) (or (and .cse9 (= (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) |c_thr1Thread1of3ForFork0_push_#t~mem1#1|)) .cse10) (<= c_~next_alloc_idx~0 64) .cse12 (or .cse0 (forall ((v_prenex_501 Int)) (or (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_prenex_501) (not (= (select |c_#valid| v_prenex_501) 0))))) (or .cse0 (forall ((v_prenex_511 Int)) (or (not (= (select |c_#valid| v_prenex_511) 0)) (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_prenex_511)))) (or .cse0 (forall ((v_prenex_392 Int)) (or (not (= (select |c_#valid| v_prenex_392) 0)) (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_prenex_392)))) (or .cse0 (forall ((v_prenex_402 Int)) (or (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_prenex_402) (not (= (select |c_#valid| v_prenex_402) 0))))) (or .cse0 (forall ((v_prenex_400 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| Int)) (or (= v_prenex_400 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22|) (not (= (select |c_#valid| v_prenex_400) 0))))) (or .cse0 (forall ((v_prenex_401 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| Int)) (or (not (= (select |c_#valid| v_prenex_401) 0)) (= v_prenex_401 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22|)))) (or (forall ((v_prenex_406 Int)) (or (not (= (select |c_#valid| v_prenex_406) 0)) (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_prenex_406))) .cse0) (or .cse0 (forall ((v_prenex_391 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| Int)) (or (not (= (select |c_#valid| v_prenex_391) 0)) (= v_prenex_391 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22|)))) (or (forall ((v_prenex_506 Int)) (or (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_prenex_506) (not (= (select |c_#valid| v_prenex_506) 0)))) .cse0) (or .cse0 (forall ((v_prenex_394 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| Int)) (or (not (= (select |c_#valid| v_prenex_394) 0)) (= v_prenex_394 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22|)))) (or .cse0 (forall ((v_prenex_404 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| Int)) (or (= v_prenex_404 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22|) (not (= (select |c_#valid| v_prenex_404) 0))))) (or .cse0 (forall ((v_prenex_473 Int)) (or (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_prenex_473) (not (= (select |c_#valid| v_prenex_473) 0))))) (or (forall ((v_prenex_469 Int)) (or (not (= (select |c_#valid| v_prenex_469) 0)) (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_prenex_469))) .cse0) (or .cse0 (forall ((v_prenex_134 Int)) (or (not (= (select |c_#valid| v_prenex_134) 0)) (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_prenex_134)))) (or .cse0 (forall ((v_prenex_405 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| Int)) (or (not (= (select |c_#valid| v_prenex_405) 0)) (= v_prenex_405 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22|)))) (or .cse0 (forall ((v_prenex_425 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| Int)) (or (not (= (select |c_#valid| v_prenex_425) 0)) (= v_prenex_425 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22|)))) (or .cse0 (forall ((v_prenex_510 Int)) (or (not (= (select |c_#valid| v_prenex_510) 0)) (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_prenex_510)))) (or (forall ((v_prenex_134 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| Int)) (or (= v_prenex_134 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22|) (not (= (select |c_#valid| v_prenex_134) 0)))) .cse0) (or .cse14 .cse1) (or .cse0 (forall ((v_prenex_422 Int)) (or (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_prenex_422) (not (= (select |c_#valid| v_prenex_422) 0))))) (or .cse0 (forall ((v_prenex_137 Int)) (or (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_prenex_137) (not (= (select |c_#valid| v_prenex_137) 0))))) (or (forall ((v_prenex_518 Int) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22| Int)) (or (= v_prenex_518 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_22|) (not (= (select |c_#valid| v_prenex_518) 0)))) .cse0)))) is different from false [2024-10-28 15:23:04,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 15:23:07,582 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|))) (let ((.cse0 (< c_~next_alloc_idx~0 65)) (.cse3 (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|)) (.cse1 (not (= (+ (select .cse9 0) 1) 0))) (.cse2 (< 64 c_~next_alloc_idx~0)) (.cse6 (< c_~next_alloc_idx~0 63)) (.cse7 (< 62 c_~next_alloc_idx~0)) (.cse4 (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|))) (and (or .cse0 (and (or .cse1 (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| Int) (v_DerPreprocessor_4 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_6) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_4) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 0) 0)))) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| Int)) (or (not (= (+ (select (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17|) 0) 1) 0)) (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| Int) (v_DerPreprocessor_4 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_6) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_4) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17|) 0) 0)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17|))))))) (or (forall ((v_DerPreprocessor_4 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_4) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0))) .cse0) (or .cse2 (forall ((v_DerPreprocessor_5 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_5) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)))) (or (not .cse3) (= |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)) (or .cse0 (forall ((v_DerPreprocessor_4 (Array Int Int)) (v_DerPreprocessor_6 (Array Int Int))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_6) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_4) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)))) (not (= (select .cse4 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)) (or .cse3 (< c_~next_alloc_idx~0 6)) (or .cse2 (let ((.cse5 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| (store .cse9 0 c_~next_alloc_idx~0)))) (and (or (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| Int) (v_DerPreprocessor_4 (Array Int Int))) (not (= (select (select (store .cse5 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_4) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 0) 0))) .cse6 .cse1) (or .cse7 (and (or (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| Int) (v_DerPreprocessor_5 (Array Int Int))) (not (= (select (select (store .cse5 |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_5) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) 0) 0))) .cse1) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| Int)) (let ((.cse8 (select |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17|))) (or (not (= (+ (select .cse8 0) 1) 0)) (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| Int) (v_DerPreprocessor_5 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| (store .cse8 0 c_~next_alloc_idx~0)) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_5) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17|) 0) 0)) (= |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17|))))))))))) (or .cse2 (let ((.cse10 (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse4 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)))) (and (or (forall ((v_DerPreprocessor_4 (Array Int Int))) (not (= (select (select (store .cse10 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_4) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0))) .cse6) (or .cse7 (forall ((v_DerPreprocessor_5 (Array Int Int))) (not (= (select (select (store .cse10 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_5) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)))))))))) is different from false [2024-10-28 15:23:14,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:23:14,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 15:23:14,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:23:14,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2024-10-28 15:23:14,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-28 15:23:14,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2024-10-28 15:23:14,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2024-10-28 15:23:14,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-28 15:23:14,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2024-10-28 15:23:14,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-28 15:23:14,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-28 15:23:14,790 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 15:23:14,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:23:14,790 INFO L85 PathProgramCache]: Analyzing trace with hash 821032834, now seen corresponding path program 8 times [2024-10-28 15:23:14,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 15:23:14,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476445769] [2024-10-28 15:23:14,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 15:23:14,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 15:23:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 15:23:15,202 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-28 15:23:15,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 15:23:15,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476445769] [2024-10-28 15:23:15,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476445769] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 15:23:15,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 15:23:15,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-28 15:23:15,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996374752] [2024-10-28 15:23:15,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 15:23:15,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-28 15:23:15,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 15:23:15,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-28 15:23:15,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2024-10-28 15:23:15,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:23:15,204 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 15:23:15,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.8) internal successors, (42), 14 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 15:23:15,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:23:15,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 15:23:15,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:23:15,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2024-10-28 15:23:15,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-28 15:23:15,204 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 151 states. [2024-10-28 15:23:15,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 104 states. [2024-10-28 15:23:15,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-28 15:23:15,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 114 states. [2024-10-28 15:23:15,205 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:23:18,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:23:18,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 15:23:18,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:23:18,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2024-10-28 15:23:18,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-28 15:23:18,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2024-10-28 15:23:18,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2024-10-28 15:23:18,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-28 15:23:18,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2024-10-28 15:23:18,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-28 15:23:18,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-28 15:23:18,991 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 15:23:18,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:23:18,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1795941510, now seen corresponding path program 1 times [2024-10-28 15:23:18,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 15:23:18,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109986155] [2024-10-28 15:23:18,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 15:23:18,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 15:23:19,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 15:23:19,351 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-28 15:23:19,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 15:23:19,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109986155] [2024-10-28 15:23:19,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109986155] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 15:23:19,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 15:23:19,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-28 15:23:19,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568499070] [2024-10-28 15:23:19,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 15:23:19,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-28 15:23:19,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 15:23:19,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-28 15:23:19,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-28 15:23:19,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:23:19,353 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 15:23:19,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 12 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 15:23:19,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:23:19,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 15:23:19,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:23:19,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2024-10-28 15:23:19,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-28 15:23:19,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 151 states. [2024-10-28 15:23:19,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 104 states. [2024-10-28 15:23:19,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-28 15:23:19,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 114 states. [2024-10-28 15:23:19,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-10-28 15:23:19,353 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:23:23,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:23:23,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 15:23:23,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:23:23,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2024-10-28 15:23:23,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-28 15:23:23,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2024-10-28 15:23:23,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2024-10-28 15:23:23,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-28 15:23:23,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2024-10-28 15:23:23,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-28 15:23:23,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-28 15:23:23,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-28 15:23:23,300 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 15:23:23,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:23:23,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1701544995, now seen corresponding path program 1 times [2024-10-28 15:23:23,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 15:23:23,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738780674] [2024-10-28 15:23:23,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 15:23:23,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 15:23:23,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 15:23:23,752 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-28 15:23:23,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 15:23:23,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738780674] [2024-10-28 15:23:23,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738780674] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 15:23:23,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 15:23:23,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-28 15:23:23,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059691781] [2024-10-28 15:23:23,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 15:23:23,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-28 15:23:23,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 15:23:23,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-28 15:23:23,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-10-28 15:23:23,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:23:23,754 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 15:23:23,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 15:23:23,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:23:23,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 15:23:23,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:23:23,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 72 states. [2024-10-28 15:23:23,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-28 15:23:23,754 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 151 states. [2024-10-28 15:23:23,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 104 states. [2024-10-28 15:23:23,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-28 15:23:23,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 114 states. [2024-10-28 15:23:23,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 24 states. [2024-10-28 15:23:23,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-28 15:23:23,755 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:23:34,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:23:34,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 15:23:34,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:23:34,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-10-28 15:23:34,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-28 15:23:34,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2024-10-28 15:23:34,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2024-10-28 15:23:34,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-28 15:23:34,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2024-10-28 15:23:34,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-28 15:23:34,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-28 15:23:34,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-28 15:23:34,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-28 15:23:34,438 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 15:23:34,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:23:34,438 INFO L85 PathProgramCache]: Analyzing trace with hash -144876342, now seen corresponding path program 9 times [2024-10-28 15:23:34,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 15:23:34,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684082128] [2024-10-28 15:23:34,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 15:23:34,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 15:23:34,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 15:23:34,830 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-28 15:23:34,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 15:23:34,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684082128] [2024-10-28 15:23:34,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684082128] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 15:23:34,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 15:23:34,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-28 15:23:34,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690472375] [2024-10-28 15:23:34,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 15:23:34,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-28 15:23:34,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 15:23:34,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-28 15:23:34,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-10-28 15:23:34,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:23:34,831 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 15:23:34,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6666666666666665) internal successors, (40), 14 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 15:23:34,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:23:34,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 15:23:34,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:23:34,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 73 states. [2024-10-28 15:23:34,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-28 15:23:34,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 158 states. [2024-10-28 15:23:34,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 109 states. [2024-10-28 15:23:34,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-28 15:23:34,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 122 states. [2024-10-28 15:23:34,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-28 15:23:34,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-28 15:23:34,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-28 15:23:34,832 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:23:40,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:23:40,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 15:23:40,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:23:40,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-10-28 15:23:40,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-28 15:23:40,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2024-10-28 15:23:40,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2024-10-28 15:23:40,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-28 15:23:40,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2024-10-28 15:23:40,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-28 15:23:40,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-28 15:23:40,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-28 15:23:40,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-28 15:23:40,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-28 15:23:40,248 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 15:23:40,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:23:40,248 INFO L85 PathProgramCache]: Analyzing trace with hash 770540062, now seen corresponding path program 1 times [2024-10-28 15:23:40,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 15:23:40,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595793330] [2024-10-28 15:23:40,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 15:23:40,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 15:23:40,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 15:23:40,614 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-28 15:23:40,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 15:23:40,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595793330] [2024-10-28 15:23:40,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595793330] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 15:23:40,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 15:23:40,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-28 15:23:40,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260057013] [2024-10-28 15:23:40,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 15:23:40,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-28 15:23:40,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 15:23:40,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-28 15:23:40,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-10-28 15:23:40,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:23:40,615 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 15:23:40,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 15:23:40,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:23:40,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 15:23:40,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:23:40,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 73 states. [2024-10-28 15:23:40,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-28 15:23:40,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 158 states. [2024-10-28 15:23:40,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 109 states. [2024-10-28 15:23:40,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-28 15:23:40,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 122 states. [2024-10-28 15:23:40,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-28 15:23:40,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-28 15:23:40,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-28 15:23:40,615 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-10-28 15:23:40,616 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:23:44,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:23:44,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 15:23:44,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:23:44,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-10-28 15:23:44,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-28 15:23:44,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2024-10-28 15:23:44,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2024-10-28 15:23:44,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-28 15:23:44,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2024-10-28 15:23:44,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-28 15:23:44,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-28 15:23:44,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-28 15:23:44,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-28 15:23:44,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-28 15:23:44,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-28 15:23:44,452 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 15:23:44,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:23:44,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1075582955, now seen corresponding path program 1 times [2024-10-28 15:23:44,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 15:23:44,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898713149] [2024-10-28 15:23:44,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 15:23:44,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 15:23:44,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 15:23:44,954 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-28 15:23:44,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 15:23:44,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898713149] [2024-10-28 15:23:44,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898713149] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 15:23:44,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 15:23:44,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-28 15:23:44,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256115348] [2024-10-28 15:23:44,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 15:23:44,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-28 15:23:44,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 15:23:44,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-28 15:23:44,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-28 15:23:44,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:23:44,956 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 15:23:44,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.8333333333333335) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 15:23:44,956 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:23:44,956 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 15:23:44,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:23:44,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 73 states. [2024-10-28 15:23:44,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-28 15:23:44,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 158 states. [2024-10-28 15:23:44,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 109 states. [2024-10-28 15:23:44,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-28 15:23:44,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 122 states. [2024-10-28 15:23:44,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-28 15:23:44,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-28 15:23:44,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-28 15:23:44,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-10-28 15:23:44,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-10-28 15:23:44,958 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:23:52,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:23:52,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 15:23:52,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:23:52,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-10-28 15:23:52,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-28 15:23:52,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2024-10-28 15:23:52,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2024-10-28 15:23:52,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-28 15:23:52,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2024-10-28 15:23:52,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-28 15:23:52,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-28 15:23:52,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-28 15:23:52,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-28 15:23:52,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-28 15:23:52,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-28 15:23:52,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-28 15:23:52,958 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 15:23:52,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:23:52,958 INFO L85 PathProgramCache]: Analyzing trace with hash 599591712, now seen corresponding path program 2 times [2024-10-28 15:23:52,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 15:23:52,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191432986] [2024-10-28 15:23:52,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 15:23:52,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 15:23:53,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 15:23:53,430 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-28 15:23:53,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 15:23:53,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191432986] [2024-10-28 15:23:53,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191432986] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 15:23:53,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 15:23:53,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-28 15:23:53,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724121649] [2024-10-28 15:23:53,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 15:23:53,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-28 15:23:53,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 15:23:53,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-28 15:23:53,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-10-28 15:23:53,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:23:53,434 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 15:23:53,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 13 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 15:23:53,434 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:23:53,434 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 15:23:53,434 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:23:53,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 73 states. [2024-10-28 15:23:53,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-28 15:23:53,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 160 states. [2024-10-28 15:23:53,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 109 states. [2024-10-28 15:23:53,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-28 15:23:53,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 128 states. [2024-10-28 15:23:53,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-28 15:23:53,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-28 15:23:53,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-28 15:23:53,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-10-28 15:23:53,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-10-28 15:23:53,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-28 15:23:53,435 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:24:01,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:24:01,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 15:24:01,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:24:01,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-10-28 15:24:01,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-28 15:24:01,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2024-10-28 15:24:01,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2024-10-28 15:24:01,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-28 15:24:01,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2024-10-28 15:24:01,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-28 15:24:01,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-28 15:24:01,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-28 15:24:01,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-28 15:24:01,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-28 15:24:01,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-28 15:24:01,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-28 15:24:02,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-28 15:24:02,000 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 15:24:02,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:24:02,000 INFO L85 PathProgramCache]: Analyzing trace with hash 2096510935, now seen corresponding path program 2 times [2024-10-28 15:24:02,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 15:24:02,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657479234] [2024-10-28 15:24:02,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 15:24:02,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 15:24:02,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 15:24:02,352 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-28 15:24:02,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 15:24:02,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657479234] [2024-10-28 15:24:02,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657479234] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 15:24:02,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 15:24:02,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-28 15:24:02,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362321296] [2024-10-28 15:24:02,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 15:24:02,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-28 15:24:02,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 15:24:02,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-28 15:24:02,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-10-28 15:24:02,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:24:02,354 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 15:24:02,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 15:24:02,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:24:02,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 15:24:02,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:24:02,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 73 states. [2024-10-28 15:24:02,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-28 15:24:02,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 160 states. [2024-10-28 15:24:02,354 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 109 states. [2024-10-28 15:24:02,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-28 15:24:02,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 128 states. [2024-10-28 15:24:02,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-28 15:24:02,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-28 15:24:02,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-28 15:24:02,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-10-28 15:24:02,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-10-28 15:24:02,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-28 15:24:02,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-10-28 15:24:02,355 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:24:13,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:24:15,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:24:18,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:24:20,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:24:22,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:24:24,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:24:26,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:24:29,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:24:31,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:24:33,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-28 15:24:33,860 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|)) (.cse2 (= |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|))) (let ((.cse0 (= |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (.cse1 (not .cse2)) (.cse3 (not (= (select .cse4 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)))) (and (or (< c_~next_alloc_idx~0 65) (forall ((v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_15) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_14) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (or .cse0 .cse1) (not (= c_~top~0 0)) (or .cse2 .cse3) (or (and (or (< 62 c_~next_alloc_idx~0) (forall ((v_ArrVal_2292 Int) (v_DerPreprocessor_13 (Array Int Int))) (or (< v_ArrVal_2292 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse4 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2292)) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))) (or (< c_~next_alloc_idx~0 63) (forall ((v_ArrVal_2292 Int) (v_DerPreprocessor_14 (Array Int Int))) (or (< v_ArrVal_2292 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse4 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2292)) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_14) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))))) (< 64 c_~next_alloc_idx~0)) (or (and .cse0 (= (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) |c_thr1Thread1of3ForFork0_push_#t~mem1#1|)) .cse1) .cse3))) is different from false [2024-10-28 15:24:35,003 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|)) (.cse2 (= |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|))) (let ((.cse0 (= |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)) (.cse1 (not .cse2)) (.cse3 (not (= (select .cse4 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|) 0)))) (and (or (< c_~next_alloc_idx~0 65) (forall ((v_DerPreprocessor_15 (Array Int Int)) (v_DerPreprocessor_14 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_15) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_14) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (or .cse0 .cse1) (or .cse2 .cse3) (or (and (or (< 62 c_~next_alloc_idx~0) (forall ((v_ArrVal_2292 Int) (v_DerPreprocessor_13 (Array Int Int))) (or (< v_ArrVal_2292 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse4 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2292)) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))))) (or (< c_~next_alloc_idx~0 63) (forall ((v_ArrVal_2292 Int) (v_DerPreprocessor_14 (Array Int Int))) (or (< v_ArrVal_2292 c_~next_alloc_idx~0) (< 0 (select (select (store (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store .cse4 |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| v_ArrVal_2292)) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_14) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))))) (< 64 c_~next_alloc_idx~0)) (or (and .cse0 (= (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) |c_thr1Thread1of3ForFork0_push_#t~mem1#1|)) .cse1) .cse3))) is different from false [2024-10-28 15:24:35,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:24:35,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 15:24:35,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:24:35,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2024-10-28 15:24:35,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-28 15:24:35,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2024-10-28 15:24:35,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2024-10-28 15:24:35,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-28 15:24:35,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2024-10-28 15:24:35,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-28 15:24:35,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-28 15:24:35,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-28 15:24:35,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-28 15:24:35,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-28 15:24:35,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-28 15:24:35,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-28 15:24:35,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-28 15:24:35,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-28 15:24:35,486 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 15:24:35,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:24:35,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1556790784, now seen corresponding path program 10 times [2024-10-28 15:24:35,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 15:24:35,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426810746] [2024-10-28 15:24:35,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 15:24:35,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 15:24:35,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 15:24:35,832 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-28 15:24:35,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 15:24:35,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426810746] [2024-10-28 15:24:35,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426810746] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 15:24:35,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174493624] [2024-10-28 15:24:35,832 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-28 15:24:35,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 15:24:35,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 15:24:35,833 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-28 15:24:35,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-28 15:24:36,128 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-28 15:24:36,128 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-28 15:24:36,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-28 15:24:36,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 15:24:36,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-28 15:24:36,162 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 [2024-10-28 15:24:36,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-28 15:24:36,225 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-28 15:24:36,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-28 15:24:36,241 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 [2024-10-28 15:24:36,271 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-28 15:24:36,271 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 15:24:36,303 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_19 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_19) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) 0))) is different from false [2024-10-28 15:24:36,389 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 10 treesize of output 8 [2024-10-28 15:24:36,394 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 10 treesize of output 8 [2024-10-28 15:24:36,492 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 15:24:36,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 49 [2024-10-28 15:24:36,521 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-28 15:24:36,554 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-28 15:24:36,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174493624] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 15:24:36,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 15:24:36,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 25 [2024-10-28 15:24:36,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112974210] [2024-10-28 15:24:36,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 15:24:36,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-28 15:24:36,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 15:24:36,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-28 15:24:36,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=512, Unknown=2, NotChecked=46, Total=650 [2024-10-28 15:24:36,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:24:36,556 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 15:24:36,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.269230769230769) internal successors, (111), 25 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 15:24:36,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:24:36,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 15:24:36,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:24:36,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states. [2024-10-28 15:24:36,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-28 15:24:36,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 163 states. [2024-10-28 15:24:36,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 112 states. [2024-10-28 15:24:36,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-28 15:24:36,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 136 states. [2024-10-28 15:24:36,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-28 15:24:36,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-28 15:24:36,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-28 15:24:36,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-10-28 15:24:36,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-10-28 15:24:36,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-28 15:24:36,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-10-28 15:24:36,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-28 15:24:36,556 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:24:58,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-28 15:24:58,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:24:58,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 15:24:58,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:24:58,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2024-10-28 15:24:58,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-28 15:24:58,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2024-10-28 15:24:58,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2024-10-28 15:24:58,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-28 15:24:58,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2024-10-28 15:24:58,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-28 15:24:58,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-28 15:24:58,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-28 15:24:58,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-28 15:24:58,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-28 15:24:58,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-28 15:24:58,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-28 15:24:58,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-28 15:24:58,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-10-28 15:24:58,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-28 15:24:59,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 15:24:59,180 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 15:24:59,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:24:59,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1328557570, now seen corresponding path program 11 times [2024-10-28 15:24:59,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 15:24:59,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518934421] [2024-10-28 15:24:59,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 15:24:59,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 15:24:59,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 15:24:59,533 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-28 15:24:59,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 15:24:59,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518934421] [2024-10-28 15:24:59,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518934421] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 15:24:59,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032451590] [2024-10-28 15:24:59,534 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-28 15:24:59,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 15:24:59,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 15:24:59,536 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-28 15:24:59,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-28 15:24:59,838 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-10-28 15:24:59,838 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-28 15:24:59,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-28 15:24:59,840 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 15:24:59,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-28 15:24:59,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-28 15:24:59,935 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-28 15:24:59,935 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 25 treesize of output 22 [2024-10-28 15:24:59,973 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-28 15:24:59,973 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 15:25:00,015 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_22 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_22) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) is different from false [2024-10-28 15:25:00,222 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 15:25:00,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 49 [2024-10-28 15:25:00,298 INFO L349 Elim1Store]: treesize reduction 96, result has 38.9 percent of original size [2024-10-28 15:25:00,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 144 treesize of output 195 [2024-10-28 15:25:00,331 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 15:25:00,331 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 372 treesize of output 410 [2024-10-28 15:25:00,341 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 148 treesize of output 144 [2024-10-28 15:25:00,348 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 144 treesize of output 142 [2024-10-28 15:25:00,355 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 142 treesize of output 140 [2024-10-28 15:25:00,362 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 140 treesize of output 136 [2024-10-28 15:25:00,369 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 136 treesize of output 134 [2024-10-28 15:25:00,953 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-28 15:25:00,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032451590] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 15:25:00,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 15:25:00,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 26 [2024-10-28 15:25:00,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396992239] [2024-10-28 15:25:00,953 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 15:25:00,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-28 15:25:00,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 15:25:00,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-28 15:25:00,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=546, Unknown=5, NotChecked=48, Total=702 [2024-10-28 15:25:00,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:25:00,954 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 15:25:00,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.296296296296297) internal successors, (116), 26 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 15:25:00,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:25:00,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-28 15:25:00,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:25:00,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 74 states. [2024-10-28 15:25:00,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-28 15:25:00,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 169 states. [2024-10-28 15:25:00,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 115 states. [2024-10-28 15:25:00,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-28 15:25:00,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 138 states. [2024-10-28 15:25:00,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-28 15:25:00,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2024-10-28 15:25:00,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-28 15:25:00,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-10-28 15:25:00,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. [2024-10-28 15:25:00,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-28 15:25:00,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-10-28 15:25:00,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 22 states. [2024-10-28 15:25:00,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 96 states. [2024-10-28 15:25:00,955 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:25:12,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-10-28 15:25:18,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:25:18,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-28 15:25:18,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:25:18,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2024-10-28 15:25:18,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-28 15:25:18,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2024-10-28 15:25:18,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2024-10-28 15:25:18,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-28 15:25:18,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2024-10-28 15:25:18,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-28 15:25:18,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-28 15:25:18,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-28 15:25:18,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-28 15:25:18,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-28 15:25:18,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-28 15:25:18,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-28 15:25:18,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-28 15:25:18,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2024-10-28 15:25:18,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-10-28 15:25:18,292 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-28 15:25:18,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-28 15:25:18,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-28 15:25:18,495 INFO L407 BasicCegarLoop]: Path program histogram: [11, 2, 2, 1, 1, 1, 1] [2024-10-28 15:25:18,495 INFO L317 ceAbstractionStarter]: Result for error location thr1Thread3of3ForFork0 was SAFE (1/4) [2024-10-28 15:25:18,496 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 15:25:18,497 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-28 15:25:18,497 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-28 15:25:18,497 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6b48888c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 15:25:18,497 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-28 15:25:18,509 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 15:25:18,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:25:18,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1990028569, now seen corresponding path program 1 times [2024-10-28 15:25:18,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 15:25:18,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049807976] [2024-10-28 15:25:18,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 15:25:18,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 15:25:18,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 15:25:18,678 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-28 15:25:18,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 15:25:18,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049807976] [2024-10-28 15:25:18,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049807976] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 15:25:18,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 15:25:18,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-28 15:25:18,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127659235] [2024-10-28 15:25:18,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 15:25:18,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-28 15:25:18,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 15:25:18,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-28 15:25:18,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-28 15:25:18,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:25:18,679 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 15:25:18,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 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) [2024-10-28 15:25:18,679 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:25:18,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:25:18,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-28 15:25:18,986 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 15:25:18,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:25:18,986 INFO L85 PathProgramCache]: Analyzing trace with hash -41082935, now seen corresponding path program 1 times [2024-10-28 15:25:18,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 15:25:18,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206591764] [2024-10-28 15:25:18,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 15:25:18,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 15:25:19,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 15:25:19,237 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-28 15:25:19,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 15:25:19,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206591764] [2024-10-28 15:25:19,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206591764] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 15:25:19,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 15:25:19,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-28 15:25:19,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448770683] [2024-10-28 15:25:19,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 15:25:19,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-28 15:25:19,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 15:25:19,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-28 15:25:19,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-28 15:25:19,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:25:19,238 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 15:25:19,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 15:25:19,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:25:19,239 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:25:19,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:25:19,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:25:19,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-28 15:25:19,294 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 15:25:19,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:25:19,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1760835642, now seen corresponding path program 1 times [2024-10-28 15:25:19,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 15:25:19,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095699731] [2024-10-28 15:25:19,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 15:25:19,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 15:25:19,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-28 15:25:19,440 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-28 15:25:19,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-28 15:25:19,463 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-28 15:25:19,463 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-28 15:25:19,463 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-10-28 15:25:19,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-28 15:25:19,464 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-28 15:25:19,465 INFO L317 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/4) [2024-10-28 15:25:19,465 WARN L244 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-28 15:25:19,465 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-10-28 15:25:19,482 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-28 15:25:19,483 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 15:25:19,483 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-28 15:25:19,483 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of4ForFork0 ======== [2024-10-28 15:25:19,484 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6b48888c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 15:25:19,484 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-28 15:25:22,376 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 15:25:22,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:25:22,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1078684626, now seen corresponding path program 1 times [2024-10-28 15:25:22,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 15:25:22,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52901505] [2024-10-28 15:25:22,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 15:25:22,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 15:25:22,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 15:25:22,540 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-28 15:25:22,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 15:25:22,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52901505] [2024-10-28 15:25:22,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52901505] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 15:25:22,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 15:25:22,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-28 15:25:22,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875597187] [2024-10-28 15:25:22,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 15:25:22,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-28 15:25:22,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 15:25:22,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-28 15:25:22,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-28 15:25:22,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:25:22,541 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 15:25:22,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 15:25:22,541 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:25:23,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:25:23,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-28 15:25:23,771 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 15:25:23,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:25:23,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1293221355, now seen corresponding path program 1 times [2024-10-28 15:25:23,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 15:25:23,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529399839] [2024-10-28 15:25:23,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 15:25:23,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 15:25:23,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 15:25:24,021 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-28 15:25:24,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 15:25:24,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529399839] [2024-10-28 15:25:24,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529399839] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 15:25:24,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 15:25:24,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-28 15:25:24,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974690634] [2024-10-28 15:25:24,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 15:25:24,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-28 15:25:24,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 15:25:24,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-28 15:25:24,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-28 15:25:24,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:25:24,022 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 15:25:24,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 15:25:24,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:25:24,023 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:25:27,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:25:27,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:25:27,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-28 15:25:27,586 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 15:25:27,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:25:27,586 INFO L85 PathProgramCache]: Analyzing trace with hash -265431762, now seen corresponding path program 1 times [2024-10-28 15:25:27,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 15:25:27,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294654128] [2024-10-28 15:25:27,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 15:25:27,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 15:25:27,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 15:25:27,747 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-28 15:25:27,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 15:25:27,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294654128] [2024-10-28 15:25:27,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294654128] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 15:25:27,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 15:25:27,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-28 15:25:27,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963665991] [2024-10-28 15:25:27,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 15:25:27,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-28 15:25:27,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 15:25:27,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-28 15:25:27,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-28 15:25:27,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:25:27,748 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 15:25:27,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 15:25:27,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:25:27,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:25:27,748 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:25:30,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:25:30,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:25:30,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:25:30,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-28 15:25:30,770 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 15:25:30,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:25:30,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1703618732, now seen corresponding path program 1 times [2024-10-28 15:25:30,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 15:25:30,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942238612] [2024-10-28 15:25:30,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 15:25:30,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 15:25:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 15:25:30,935 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-28 15:25:30,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 15:25:30,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942238612] [2024-10-28 15:25:30,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942238612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 15:25:30,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 15:25:30,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-28 15:25:30,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412172430] [2024-10-28 15:25:30,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 15:25:30,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-28 15:25:30,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 15:25:30,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-28 15:25:30,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-28 15:25:30,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:25:30,936 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 15:25:30,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 15:25:30,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:25:30,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:25:30,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:25:30,937 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:25:33,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:25:33,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:25:33,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:25:33,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:25:33,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-28 15:25:33,870 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 15:25:33,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:25:33,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1911096531, now seen corresponding path program 1 times [2024-10-28 15:25:33,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-28 15:25:33,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020235929] [2024-10-28 15:25:33,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 15:25:33,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-28 15:25:34,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 15:25:34,241 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 15:25:34,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-28 15:25:34,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020235929] [2024-10-28 15:25:34,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020235929] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-28 15:25:34,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134522048] [2024-10-28 15:25:34,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 15:25:34,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-28 15:25:34,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 15:25:34,245 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-28 15:25:34,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-28 15:25:34,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 15:25:34,598 INFO L255 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-28 15:25:34,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 15:25:34,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-28 15:25:34,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-28 15:25:34,643 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 [2024-10-28 15:25:34,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-28 15:25:34,698 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-28 15:25:34,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-28 15:25:34,716 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 [2024-10-28 15:25:34,740 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 15:25:34,741 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 15:25:34,891 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 10 treesize of output 8 [2024-10-28 15:25:34,897 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 10 treesize of output 8 [2024-10-28 15:25:35,343 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 15:25:35,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 49 [2024-10-28 15:25:35,377 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-28 15:25:35,409 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 15:25:35,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134522048] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 15:25:35,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-28 15:25:35,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 9] total 28 [2024-10-28 15:25:35,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986904329] [2024-10-28 15:25:35,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-28 15:25:35,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-28 15:25:35,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-28 15:25:35,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-28 15:25:35,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=695, Unknown=5, NotChecked=0, Total=812 [2024-10-28 15:25:35,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:25:35,411 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 15:25:35,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 4.896551724137931) internal successors, (142), 28 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 15:25:35,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:25:35,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:25:35,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:25:35,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:25:35,411 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:25:42,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-10-28 15:25:42,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-10-28 15:25:42,223 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 [2024-10-28 15:25:42,224 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: different predicates with same serial number at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.BasicPredicate.equals(BasicPredicate.java:111) at java.base/java.util.HashMap.getNode(HashMap.java:574) at java.base/java.util.HashMap.get(HashMap.java:552) at de.uni_freiburg.informatik.ultimate.automata.partialorder.independence.DefaultIndependenceCache.contains(DefaultIndependenceCache.java:72) at de.uni_freiburg.informatik.ultimate.automata.partialorder.independence.CachedIndependenceRelation.isIndependent(CachedIndependenceRelation.java:99) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.SemanticConditionEliminator.isIndependent(SemanticConditionEliminator.java:93) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.SemanticConditionEliminator.isIndependent(SemanticConditionEliminator.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.independence.ConditionTransformingIndependenceRelation.isIndependent(ConditionTransformingIndependenceRelation.java:87) at de.uni_freiburg.informatik.ultimate.automata.partialorder.independence.DisjunctiveConditionalIndependenceRelation.isIndependent(DisjunctiveConditionalIndependenceRelation.java:87) at de.uni_freiburg.informatik.ultimate.automata.partialorder.independence.DisjunctiveConditionalIndependenceRelation.isIndependent(DisjunctiveConditionalIndependenceRelation.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.independence.ConditionTransformingIndependenceRelation.isIndependent(ConditionTransformingIndependenceRelation.java:87) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ThreadSeparatingIndependenceRelation.isIndependent(ThreadSeparatingIndependenceRelation.java:74) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.ThreadSeparatingIndependenceRelation.isIndependent(ThreadSeparatingIndependenceRelation.java:1) at de.uni_freiburg.informatik.ultimate.automata.partialorder.MinimalSleepSetReduction.lambda$1(MinimalSleepSetReduction.java:182) at java.base/java.util.stream.ReferencePipeline$2$1.accept(ReferencePipeline.java:176) at java.base/java.util.Iterator.forEachRemaining(Iterator.java:133) at java.base/java.util.Spliterators$IteratorSpliterator.forEachRemaining(Spliterators.java:1801) at java.base/java.util.stream.Streams$ConcatSpliterator.forEachRemaining(Streams.java:734) at java.base/java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:484) at java.base/java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:474) at java.base/java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:550) at java.base/java.util.stream.AbstractPipeline.evaluateToArrayNode(AbstractPipeline.java:260) at java.base/java.util.stream.ReferencePipeline.toArray(ReferencePipeline.java:517) at java.base/java.util.stream.ReferencePipeline.toArray(ReferencePipeline.java:523) at de.uni_freiburg.informatik.ultimate.automata.partialorder.MinimalSleepSetReduction.internalSuccessors(MinimalSleepSetReduction.java:183) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$0(INwaOutgoingLetterAndTransitionProvider.java:123) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.nextLetter(NestedIterator.java:69) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIterator.(NestedIterator.java:62) at de.uni_freiburg.informatik.ultimate.util.datastructures.relation.NestedIteratorNoopConstruction.(NestedIteratorNoopConstruction.java:48) at de.uni_freiburg.informatik.ultimate.automata.nestedword.INwaOutgoingLetterAndTransitionProvider.lambda$1(INwaOutgoingLetterAndTransitionProvider.java:124) at java.base/java.lang.Iterable.spliterator(Iterable.java:101) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.visitState(DepthFirstTraversal.java:235) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:165) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.(DepthFirstTraversal.java:98) at de.uni_freiburg.informatik.ultimate.automata.partialorder.DepthFirstTraversal.traverse(DepthFirstTraversal.java:122) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade$BasicTraversal.traverse(PartialOrderReductionFacade.java:345) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade$PersistentSetTraversal.traverse(PartialOrderReductionFacade.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade$SleepSetTraversal.traverse(PartialOrderReductionFacade.java:380) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade$StatefulOrderTraversal.traverse(PartialOrderReductionFacade.java:362) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.PartialOrderReductionFacade.apply(PartialOrderReductionFacade.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isAbstractionEmpty(PartialOrderCegarLoop.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:442) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) 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) [2024-10-28 15:25:42,227 INFO L158 Benchmark]: Toolchain (without parser) took 493857.21ms. Allocated memory was 155.2MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 96.9MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2024-10-28 15:25:42,228 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 155.2MB. Free memory is still 114.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-28 15:25:42,229 INFO L158 Benchmark]: CACSL2BoogieTranslator took 355.87ms. Allocated memory is still 155.2MB. Free memory was 96.5MB in the beginning and 73.4MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-28 15:25:42,229 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.37ms. Allocated memory is still 155.2MB. Free memory was 73.4MB in the beginning and 71.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-28 15:25:42,229 INFO L158 Benchmark]: Boogie Preprocessor took 21.93ms. Allocated memory is still 155.2MB. Free memory was 71.0MB in the beginning and 69.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-28 15:25:42,229 INFO L158 Benchmark]: RCFGBuilder took 666.91ms. Allocated memory was 155.2MB in the beginning and 199.2MB in the end (delta: 44.0MB). Free memory was 68.9MB in the beginning and 60.3MB in the end (delta: 8.6MB). Peak memory consumption was 61.0MB. Max. memory is 16.1GB. [2024-10-28 15:25:42,229 INFO L158 Benchmark]: TraceAbstraction took 492773.84ms. Allocated memory was 199.2MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 59.2MB in the beginning and 2.0GB in the end (delta: -2.0GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2024-10-28 15:25:42,230 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.16ms. Allocated memory is still 155.2MB. Free memory is still 114.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 355.87ms. Allocated memory is still 155.2MB. Free memory was 96.5MB in the beginning and 73.4MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.37ms. Allocated memory is still 155.2MB. Free memory was 73.4MB in the beginning and 71.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.93ms. Allocated memory is still 155.2MB. Free memory was 71.0MB in the beginning and 69.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 666.91ms. Allocated memory was 155.2MB in the beginning and 199.2MB in the end (delta: 44.0MB). Free memory was 68.9MB in the beginning and 60.3MB in the end (delta: 8.6MB). Peak memory consumption was 61.0MB. Max. memory is 16.1GB. * TraceAbstraction took 492773.84ms. Allocated memory was 199.2MB in the beginning and 3.8GB in the end (delta: 3.6GB). Free memory was 59.2MB in the beginning and 2.0GB in the end (delta: -2.0GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 471, independent: 435, independent conditional: 125, independent unconditional: 310, dependent: 36, dependent conditional: 23, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 448, independent: 435, independent conditional: 125, independent unconditional: 310, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 448, independent: 435, independent conditional: 125, independent unconditional: 310, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 448, independent: 435, independent conditional: 125, independent unconditional: 310, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 448, independent: 435, independent conditional: 0, independent unconditional: 435, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 448, independent: 435, independent conditional: 0, independent unconditional: 435, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 222, independent: 209, independent conditional: 0, independent unconditional: 209, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 222, independent: 201, independent conditional: 0, independent unconditional: 201, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 21, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 21, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 792, independent: 343, independent conditional: 0, independent unconditional: 343, dependent: 449, dependent conditional: 0, dependent unconditional: 449, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 448, independent: 226, independent conditional: 0, independent unconditional: 226, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 222, unknown conditional: 0, unknown unconditional: 222] , Statistics on independence cache: Total cache size (in pairs): 222, Positive cache size: 209, Positive conditional cache size: 0, Positive unconditional cache size: 209, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 125, Maximal queried relation: 0, Independence queries for same thread: 23, Persistent sets #1 benchmarks: Persistent set computation time: 0.8s, Number of persistent set computation: 83, Number of trivial persistent sets: 71, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 323, independent: 310, independent conditional: 0, independent unconditional: 310, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 471, independent: 435, independent conditional: 125, independent unconditional: 310, dependent: 36, dependent conditional: 23, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 448, independent: 435, independent conditional: 125, independent unconditional: 310, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 448, independent: 435, independent conditional: 125, independent unconditional: 310, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 448, independent: 435, independent conditional: 125, independent unconditional: 310, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 448, independent: 435, independent conditional: 0, independent unconditional: 435, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 448, independent: 435, independent conditional: 0, independent unconditional: 435, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 222, independent: 209, independent conditional: 0, independent unconditional: 209, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 222, independent: 201, independent conditional: 0, independent unconditional: 201, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 21, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 21, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 792, independent: 343, independent conditional: 0, independent unconditional: 343, dependent: 449, dependent conditional: 0, dependent unconditional: 449, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 448, independent: 226, independent conditional: 0, independent unconditional: 226, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 222, unknown conditional: 0, unknown unconditional: 222] , Statistics on independence cache: Total cache size (in pairs): 222, Positive cache size: 209, Positive conditional cache size: 0, Positive unconditional cache size: 209, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 125, Maximal queried relation: 0, Independence queries for same thread: 23 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 293, independent: 280, independent conditional: 60, independent unconditional: 220, dependent: 13, dependent conditional: 7, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 286, independent: 280, independent conditional: 60, independent unconditional: 220, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 286, independent: 280, independent conditional: 60, independent unconditional: 220, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 286, independent: 280, independent conditional: 60, independent unconditional: 220, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 286, independent: 280, independent conditional: 0, independent unconditional: 280, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 286, independent: 280, independent conditional: 0, independent unconditional: 280, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 286, independent: 280, independent conditional: 0, independent unconditional: 280, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 222, Positive cache size: 209, Positive conditional cache size: 0, Positive unconditional cache size: 209, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 60, Maximal queried relation: 0, Independence queries for same thread: 7, Persistent sets #1 benchmarks: Persistent set computation time: 0.0s, Number of persistent set computation: 25, Number of trivial persistent sets: 23, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 226, independent: 220, independent conditional: 0, independent unconditional: 220, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 293, independent: 280, independent conditional: 60, independent unconditional: 220, dependent: 13, dependent conditional: 7, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 286, independent: 280, independent conditional: 60, independent unconditional: 220, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 286, independent: 280, independent conditional: 60, independent unconditional: 220, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 286, independent: 280, independent conditional: 60, independent unconditional: 220, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 286, independent: 280, independent conditional: 0, independent unconditional: 280, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 286, independent: 280, independent conditional: 0, independent unconditional: 280, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 286, independent: 280, independent conditional: 0, independent unconditional: 280, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 222, Positive cache size: 209, Positive conditional cache size: 0, Positive unconditional cache size: 209, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 60, Maximal queried relation: 0, Independence queries for same thread: 7 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1263, independent: 1210, independent conditional: 231, independent unconditional: 979, dependent: 53, dependent conditional: 18, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1249, independent: 1210, independent conditional: 231, independent unconditional: 979, dependent: 39, dependent conditional: 4, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1249, independent: 1210, independent conditional: 231, independent unconditional: 979, dependent: 39, dependent conditional: 4, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1253, independent: 1210, independent conditional: 231, independent unconditional: 979, dependent: 43, dependent conditional: 8, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1253, independent: 1210, independent conditional: 0, independent unconditional: 1210, dependent: 43, dependent conditional: 2, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1253, independent: 1210, independent conditional: 0, independent unconditional: 1210, dependent: 43, dependent conditional: 2, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 888, independent: 851, independent conditional: 0, independent unconditional: 851, dependent: 37, dependent conditional: 2, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 888, independent: 821, independent conditional: 0, independent unconditional: 821, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 67, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 37, dependent conditional: 2, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 67, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 37, dependent conditional: 2, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1829, independent: 556, independent conditional: 0, independent unconditional: 556, dependent: 1272, dependent conditional: 131, dependent unconditional: 1141, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1253, independent: 359, independent conditional: 0, independent unconditional: 359, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 888, unknown conditional: 2, unknown unconditional: 886] , Statistics on independence cache: Total cache size (in pairs): 1110, Positive cache size: 1060, Positive conditional cache size: 0, Positive unconditional cache size: 1060, Negative cache size: 50, Negative conditional cache size: 2, Negative unconditional cache size: 48, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 237, Maximal queried relation: 1, Independence queries for same thread: 14, Persistent sets #1 benchmarks: Persistent set computation time: 1.7s, Number of persistent set computation: 80, Number of trivial persistent sets: 70, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1014, independent: 979, independent conditional: 0, independent unconditional: 979, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1263, independent: 1210, independent conditional: 231, independent unconditional: 979, dependent: 53, dependent conditional: 18, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1249, independent: 1210, independent conditional: 231, independent unconditional: 979, dependent: 39, dependent conditional: 4, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1249, independent: 1210, independent conditional: 231, independent unconditional: 979, dependent: 39, dependent conditional: 4, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1253, independent: 1210, independent conditional: 231, independent unconditional: 979, dependent: 43, dependent conditional: 8, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1253, independent: 1210, independent conditional: 0, independent unconditional: 1210, dependent: 43, dependent conditional: 2, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1253, independent: 1210, independent conditional: 0, independent unconditional: 1210, dependent: 43, dependent conditional: 2, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 888, independent: 851, independent conditional: 0, independent unconditional: 851, dependent: 37, dependent conditional: 2, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 888, independent: 821, independent conditional: 0, independent unconditional: 821, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 67, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 37, dependent conditional: 2, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 67, independent: 30, independent conditional: 0, independent unconditional: 30, dependent: 37, dependent conditional: 2, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1829, independent: 556, independent conditional: 0, independent unconditional: 556, dependent: 1272, dependent conditional: 131, dependent unconditional: 1141, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 1253, independent: 359, independent conditional: 0, independent unconditional: 359, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 888, unknown conditional: 2, unknown unconditional: 886] , Statistics on independence cache: Total cache size (in pairs): 1110, Positive cache size: 1060, Positive conditional cache size: 0, Positive unconditional cache size: 1060, Negative cache size: 50, Negative conditional cache size: 2, Negative unconditional cache size: 48, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 237, Maximal queried relation: 1, Independence queries for same thread: 14 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2899516, independent: 2807912, independent conditional: 2804056, independent unconditional: 3856, dependent: 86757, dependent conditional: 86583, dependent unconditional: 174, unknown: 4847, unknown conditional: 4847, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2842820, independent: 2807912, independent conditional: 2804056, independent unconditional: 3856, dependent: 30061, dependent conditional: 29887, dependent unconditional: 174, unknown: 4847, unknown conditional: 4847, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2842820, independent: 2807912, independent conditional: 2804056, independent unconditional: 3856, dependent: 30061, dependent conditional: 29887, dependent unconditional: 174, unknown: 4847, unknown conditional: 4847, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3223337, independent: 2807912, independent conditional: 2804056, independent unconditional: 3856, dependent: 408900, dependent conditional: 408726, dependent unconditional: 174, unknown: 6525, unknown conditional: 6525, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3223337, independent: 2807912, independent conditional: 9667, independent unconditional: 2798245, dependent: 408900, dependent conditional: 195487, dependent unconditional: 213413, unknown: 6525, unknown conditional: 6525, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3223337, independent: 2807912, independent conditional: 9667, independent unconditional: 2798245, dependent: 408900, dependent conditional: 195487, dependent unconditional: 213413, unknown: 6525, unknown conditional: 6525, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5695, independent: 3067, independent conditional: 253, independent unconditional: 2814, dependent: 2567, dependent conditional: 2393, dependent unconditional: 174, unknown: 61, unknown conditional: 61, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5695, independent: 2724, independent conditional: 0, independent unconditional: 2724, dependent: 2971, dependent conditional: 0, dependent unconditional: 2971, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 2971, independent: 343, independent conditional: 253, independent unconditional: 90, dependent: 2567, dependent conditional: 2393, dependent unconditional: 174, unknown: 61, unknown conditional: 61, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2971, independent: 343, independent conditional: 253, independent unconditional: 90, dependent: 2567, dependent conditional: 2393, dependent unconditional: 174, unknown: 61, unknown conditional: 61, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 78352, independent: 11232, independent conditional: 10232, independent unconditional: 1001, dependent: 64521, dependent conditional: 60290, dependent unconditional: 4231, unknown: 2598, unknown conditional: 2598, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3223337, independent: 2804845, independent conditional: 9414, independent unconditional: 2795431, dependent: 406333, dependent conditional: 193094, dependent unconditional: 213239, unknown: 12159, unknown conditional: 9171, unknown unconditional: 2988] , Statistics on independence cache: Total cache size (in pairs): 6744, Positive cache size: 4127, Positive conditional cache size: 253, Positive unconditional cache size: 3874, Negative cache size: 2617, Negative conditional cache size: 2395, Negative unconditional cache size: 222, Unknown cache size: 61, Unknown conditional cache size: 61, Unknown unconditional cache size: 0, Eliminated conditions: 3007628, Maximal queried relation: 19, Independence queries for same thread: 56696, Persistent sets #1 benchmarks: Persistent set computation time: 5.5s, Number of persistent set computation: 8933, Number of trivial persistent sets: 8897, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4030, independent: 3856, independent conditional: 0, independent unconditional: 3856, dependent: 174, dependent conditional: 0, dependent unconditional: 174, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2899516, independent: 2807912, independent conditional: 2804056, independent unconditional: 3856, dependent: 86757, dependent conditional: 86583, dependent unconditional: 174, unknown: 4847, unknown conditional: 4847, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2842820, independent: 2807912, independent conditional: 2804056, independent unconditional: 3856, dependent: 30061, dependent conditional: 29887, dependent unconditional: 174, unknown: 4847, unknown conditional: 4847, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2842820, independent: 2807912, independent conditional: 2804056, independent unconditional: 3856, dependent: 30061, dependent conditional: 29887, dependent unconditional: 174, unknown: 4847, unknown conditional: 4847, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 3223337, independent: 2807912, independent conditional: 2804056, independent unconditional: 3856, dependent: 408900, dependent conditional: 408726, dependent unconditional: 174, unknown: 6525, unknown conditional: 6525, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 3223337, independent: 2807912, independent conditional: 9667, independent unconditional: 2798245, dependent: 408900, dependent conditional: 195487, dependent unconditional: 213413, unknown: 6525, unknown conditional: 6525, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 3223337, independent: 2807912, independent conditional: 9667, independent unconditional: 2798245, dependent: 408900, dependent conditional: 195487, dependent unconditional: 213413, unknown: 6525, unknown conditional: 6525, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 5695, independent: 3067, independent conditional: 253, independent unconditional: 2814, dependent: 2567, dependent conditional: 2393, dependent unconditional: 174, unknown: 61, unknown conditional: 61, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 5695, independent: 2724, independent conditional: 0, independent unconditional: 2724, dependent: 2971, dependent conditional: 0, dependent unconditional: 2971, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 2971, independent: 343, independent conditional: 253, independent unconditional: 90, dependent: 2567, dependent conditional: 2393, dependent unconditional: 174, unknown: 61, unknown conditional: 61, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 2971, independent: 343, independent conditional: 253, independent unconditional: 90, dependent: 2567, dependent conditional: 2393, dependent unconditional: 174, unknown: 61, unknown conditional: 61, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 78352, independent: 11232, independent conditional: 10232, independent unconditional: 1001, dependent: 64521, dependent conditional: 60290, dependent unconditional: 4231, unknown: 2598, unknown conditional: 2598, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 3223337, independent: 2804845, independent conditional: 9414, independent unconditional: 2795431, dependent: 406333, dependent conditional: 193094, dependent unconditional: 213239, unknown: 12159, unknown conditional: 9171, unknown unconditional: 2988] , Statistics on independence cache: Total cache size (in pairs): 6744, Positive cache size: 4127, Positive conditional cache size: 253, Positive unconditional cache size: 3874, Negative cache size: 2617, Negative conditional cache size: 2395, Negative unconditional cache size: 222, Unknown cache size: 61, Unknown conditional cache size: 61, Unknown unconditional cache size: 0, Eliminated conditions: 3007628, Maximal queried relation: 19, Independence queries for same thread: 56696 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2575, independent: 2467, independent conditional: 416, independent unconditional: 2051, dependent: 108, dependent conditional: 29, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2554, independent: 2467, independent conditional: 416, independent unconditional: 2051, dependent: 87, dependent conditional: 8, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2554, independent: 2467, independent conditional: 416, independent unconditional: 2051, dependent: 87, dependent conditional: 8, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2562, independent: 2467, independent conditional: 416, independent unconditional: 2051, dependent: 95, dependent conditional: 16, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2562, independent: 2467, independent conditional: 0, independent unconditional: 2467, dependent: 95, dependent conditional: 4, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2562, independent: 2467, independent conditional: 0, independent unconditional: 2467, dependent: 95, dependent conditional: 4, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 196, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 196, dependent conditional: 196, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2562, independent: 2467, independent conditional: 0, independent unconditional: 2467, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6748, Positive cache size: 4127, Positive conditional cache size: 253, Positive unconditional cache size: 3874, Negative cache size: 2621, Negative conditional cache size: 2399, Negative unconditional cache size: 222, Unknown cache size: 61, Unknown conditional cache size: 61, Unknown unconditional cache size: 0, Eliminated conditions: 428, Maximal queried relation: 1, Independence queries for same thread: 21, Persistent sets #1 benchmarks: Persistent set computation time: 0.0s, Number of persistent set computation: 136, Number of trivial persistent sets: 118, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2130, independent: 2051, independent conditional: 0, independent unconditional: 2051, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2575, independent: 2467, independent conditional: 416, independent unconditional: 2051, dependent: 108, dependent conditional: 29, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2554, independent: 2467, independent conditional: 416, independent unconditional: 2051, dependent: 87, dependent conditional: 8, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2554, independent: 2467, independent conditional: 416, independent unconditional: 2051, dependent: 87, dependent conditional: 8, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2562, independent: 2467, independent conditional: 416, independent unconditional: 2051, dependent: 95, dependent conditional: 16, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2562, independent: 2467, independent conditional: 0, independent unconditional: 2467, dependent: 95, dependent conditional: 4, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2562, independent: 2467, independent conditional: 0, independent unconditional: 2467, dependent: 95, dependent conditional: 4, dependent unconditional: 91, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 4, dependent conditional: 4, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 196, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 196, dependent conditional: 196, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 2562, independent: 2467, independent conditional: 0, independent unconditional: 2467, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 4, unknown conditional: 4, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 6748, Positive cache size: 4127, Positive conditional cache size: 253, Positive unconditional cache size: 3874, Negative cache size: 2621, Negative conditional cache size: 2399, Negative unconditional cache size: 222, Unknown cache size: 61, Unknown conditional cache size: 61, Unknown unconditional cache size: 0, Eliminated conditions: 428, Maximal queried relation: 1, Independence queries for same thread: 21 - ExceptionOrErrorResult: UnsupportedOperationException: different predicates with same serial number de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: different predicates with same serial number: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.BasicPredicate.equals(BasicPredicate.java:111) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2024-10-28 15:25:42,450 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2024-10-28 15:25:42,491 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 137 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 ../sv-benchmarks/c/pthread-ext/37_stack_lock_p0_vs_concur.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 62bb9e4cb3fb45378d7de513612dc08e0394f3048289be85bceda07932ec1175 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-b03bd7c-m [2024-10-28 15:25:44,274 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-28 15:25:44,328 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Bitvector.epf [2024-10-28 15:25:44,331 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-28 15:25:44,331 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-28 15:25:44,354 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-28 15:25:44,356 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-28 15:25:44,357 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-28 15:25:44,358 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-28 15:25:44,358 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-28 15:25:44,359 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-28 15:25:44,359 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-28 15:25:44,359 INFO L153 SettingsManager]: * Use SBE=true [2024-10-28 15:25:44,359 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-28 15:25:44,359 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-28 15:25:44,360 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-28 15:25:44,360 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-28 15:25:44,360 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-28 15:25:44,360 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-28 15:25:44,360 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-28 15:25:44,361 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-28 15:25:44,364 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-28 15:25:44,364 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-28 15:25:44,364 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-28 15:25:44,364 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-28 15:25:44,364 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-28 15:25:44,365 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-28 15:25:44,365 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-28 15:25:44,365 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-28 15:25:44,367 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-28 15:25:44,367 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-28 15:25:44,368 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-28 15:25:44,368 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-28 15:25:44,368 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-28 15:25:44,368 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-28 15:25:44,369 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-28 15:25:44,369 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-28 15:25:44,369 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-28 15:25:44,369 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-28 15:25:44,369 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-28 15:25:44,369 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-28 15:25:44,369 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-28 15:25:44,370 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-28 15:25:44,370 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 -> 62bb9e4cb3fb45378d7de513612dc08e0394f3048289be85bceda07932ec1175 [2024-10-28 15:25:44,613 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-28 15:25:44,632 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-28 15:25:44,634 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-28 15:25:44,635 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-28 15:25:44,635 INFO L274 PluginConnector]: CDTParser initialized [2024-10-28 15:25:44,636 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/pthread-ext/37_stack_lock_p0_vs_concur.i [2024-10-28 15:25:45,830 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-28 15:25:46,033 INFO L384 CDTParser]: Found 1 translation units. [2024-10-28 15:25:46,033 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/37_stack_lock_p0_vs_concur.i [2024-10-28 15:25:46,044 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c64d35591/afd1bf21204a4119a097e39258538d20/FLAG4e9149ade [2024-10-28 15:25:46,386 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c64d35591/afd1bf21204a4119a097e39258538d20 [2024-10-28 15:25:46,388 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-28 15:25:46,389 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-28 15:25:46,390 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-28 15:25:46,390 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-28 15:25:46,393 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-28 15:25:46,394 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 03:25:46" (1/1) ... [2024-10-28 15:25:46,394 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55210b3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 03:25:46, skipping insertion in model container [2024-10-28 15:25:46,395 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 03:25:46" (1/1) ... [2024-10-28 15:25:46,425 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-28 15:25:46,718 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/37_stack_lock_p0_vs_concur.i[31044,31057] [2024-10-28 15:25:46,726 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-28 15:25:46,747 INFO L200 MainTranslator]: Completed pre-run [2024-10-28 15:25:46,792 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/37_stack_lock_p0_vs_concur.i[31044,31057] [2024-10-28 15:25:46,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-28 15:25:46,847 INFO L204 MainTranslator]: Completed translation [2024-10-28 15:25:46,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 03:25:46 WrapperNode [2024-10-28 15:25:46,848 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-28 15:25:46,848 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-28 15:25:46,849 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-28 15:25:46,849 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-28 15:25:46,854 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 03:25:46" (1/1) ... [2024-10-28 15:25:46,872 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 03:25:46" (1/1) ... [2024-10-28 15:25:46,901 INFO L138 Inliner]: procedures = 169, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 149 [2024-10-28 15:25:46,903 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-28 15:25:46,905 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-28 15:25:46,905 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-28 15:25:46,905 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-28 15:25:46,912 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 03:25:46" (1/1) ... [2024-10-28 15:25:46,912 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 03:25:46" (1/1) ... [2024-10-28 15:25:46,915 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 03:25:46" (1/1) ... [2024-10-28 15:25:46,917 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 03:25:46" (1/1) ... [2024-10-28 15:25:46,923 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 03:25:46" (1/1) ... [2024-10-28 15:25:46,928 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 03:25:46" (1/1) ... [2024-10-28 15:25:46,931 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 03:25:46" (1/1) ... [2024-10-28 15:25:46,932 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 03:25:46" (1/1) ... [2024-10-28 15:25:46,934 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-28 15:25:46,935 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-28 15:25:46,935 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-28 15:25:46,935 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-28 15:25:46,936 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 03:25:46" (1/1) ... [2024-10-28 15:25:46,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-28 15:25:46,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 15:25:46,967 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-10-28 15:25:46,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-10-28 15:25:47,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2024-10-28 15:25:47,008 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-10-28 15:25:47,008 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-10-28 15:25:47,008 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-28 15:25:47,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-28 15:25:47,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-28 15:25:47,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-28 15:25:47,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2024-10-28 15:25:47,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2024-10-28 15:25:47,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2024-10-28 15:25:47,009 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-28 15:25:47,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-28 15:25:47,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-28 15:25:47,011 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-28 15:25:47,142 INFO L238 CfgBuilder]: Building ICFG [2024-10-28 15:25:47,144 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-28 15:25:47,325 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-28 15:25:47,325 INFO L287 CfgBuilder]: Performing block encoding [2024-10-28 15:25:47,656 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-28 15:25:47,657 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-28 15:25:47,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 03:25:47 BoogieIcfgContainer [2024-10-28 15:25:47,658 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-28 15:25:47,660 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-28 15:25:47,660 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-28 15:25:47,663 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-28 15:25:47,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 03:25:46" (1/3) ... [2024-10-28 15:25:47,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15e88e35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 03:25:47, skipping insertion in model container [2024-10-28 15:25:47,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 03:25:46" (2/3) ... [2024-10-28 15:25:47,665 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15e88e35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 03:25:47, skipping insertion in model container [2024-10-28 15:25:47,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 03:25:47" (3/3) ... [2024-10-28 15:25:47,666 INFO L112 eAbstractionObserver]: Analyzing ICFG 37_stack_lock_p0_vs_concur.i [2024-10-28 15:25:47,679 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-28 15:25:47,680 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-28 15:25:47,680 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-28 15:25:47,714 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-28 15:25:47,751 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 15:25:47,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-28 15:25:47,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-28 15:25:47,753 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-28 15:25:47,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-10-28 15:25:47,770 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-28 15:25:47,780 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread1of1ForFork0 ======== [2024-10-28 15:25:47,784 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3062fff8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 15:25:47,784 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-28 15:25:48,419 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 15:25:48,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:25:48,422 INFO L85 PathProgramCache]: Analyzing trace with hash 889567315, now seen corresponding path program 1 times [2024-10-28 15:25:48,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-28 15:25:48,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1706115216] [2024-10-28 15:25:48,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 15:25:48,432 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 [2024-10-28 15:25:48,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-28 15:25:48,443 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) [2024-10-28 15:25:48,444 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 [2024-10-28 15:25:48,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 15:25:48,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-28 15:25:48,820 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 15:25:48,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-28 15:25:48,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 15:25:48,908 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-28 15:25:48,908 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-28 15:25:48,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1706115216] [2024-10-28 15:25:48,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1706115216] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 15:25:48,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 15:25:48,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-28 15:25:48,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927658454] [2024-10-28 15:25:48,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 15:25:48,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-28 15:25:48,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-28 15:25:48,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-28 15:25:48,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-28 15:25:48,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:25:48,956 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 15:25:48,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 15:25:48,957 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:25:49,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 15:25:49,878 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 (3)] Forceful destruction successful, exit code 0 [2024-10-28 15:25:50,073 WARN L453 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 [2024-10-28 15:25:50,074 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 15:25:50,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:25:50,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1387793495, now seen corresponding path program 1 times [2024-10-28 15:25:50,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-28 15:25:50,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [144563378] [2024-10-28 15:25:50,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 15:25:50,075 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 [2024-10-28 15:25:50,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-28 15:25:50,078 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) [2024-10-28 15:25:50,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 (4)] Waiting until timeout for monitored process [2024-10-28 15:25:50,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 15:25:50,483 INFO L255 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-28 15:25:50,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 15:25:50,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-10-28 15:25:50,504 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 15:25:50,506 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-28 15:25:50,506 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-28 15:25:50,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [144563378] [2024-10-28 15:25:50,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [144563378] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 15:25:50,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 15:25:50,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-28 15:25:50,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746438181] [2024-10-28 15:25:50,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 15:25:50,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-28 15:25:50,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-28 15:25:50,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-28 15:25:50,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-28 15:25:50,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:25:50,511 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 15:25:50,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 15:25:50,511 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 15:25:50,512 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:25:51,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 15:25:51,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 15:25:51,185 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-28 15:25:51,190 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 [2024-10-28 15:25:51,386 WARN L453 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 [2024-10-28 15:25:51,391 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-10-28 15:25:51,392 INFO L317 ceAbstractionStarter]: Result for error location thr1Thread1of1ForFork0 was SAFE (1/2) [2024-10-28 15:25:51,395 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 15:25:51,395 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-28 15:25:51,396 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-28 15:25:51,396 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3062fff8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 15:25:51,396 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-28 15:25:51,405 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 15:25:51,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:25:51,406 INFO L85 PathProgramCache]: Analyzing trace with hash 175709360, now seen corresponding path program 1 times [2024-10-28 15:25:51,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-28 15:25:51,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [118666813] [2024-10-28 15:25:51,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 15:25:51,407 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 [2024-10-28 15:25:51,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-28 15:25:51,409 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) [2024-10-28 15:25:51,410 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 [2024-10-28 15:25:51,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 15:25:51,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-28 15:25:51,665 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 15:25:51,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-28 15:25:51,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 15:25:51,715 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-28 15:25:51,715 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-28 15:25:51,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [118666813] [2024-10-28 15:25:51,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [118666813] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 15:25:51,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 15:25:51,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-28 15:25:51,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785827780] [2024-10-28 15:25:51,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 15:25:51,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-28 15:25:51,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-28 15:25:51,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-28 15:25:51,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-28 15:25:51,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:25:51,717 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 15:25:51,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 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) [2024-10-28 15:25:51,718 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:25:52,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 15:25:52,406 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 [2024-10-28 15:25:52,602 WARN L453 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 [2024-10-28 15:25:52,603 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 15:25:52,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:25:52,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1153032365, now seen corresponding path program 1 times [2024-10-28 15:25:52,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-28 15:25:52,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [304028260] [2024-10-28 15:25:52,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 15:25:52,604 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 [2024-10-28 15:25:52,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-28 15:25:52,606 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) [2024-10-28 15:25:52,607 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 [2024-10-28 15:25:52,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 15:25:52,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-28 15:25:52,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 15:25:52,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-10-28 15:25:52,905 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 15:25:52,906 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-28 15:25:52,906 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-28 15:25:52,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [304028260] [2024-10-28 15:25:52,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [304028260] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 15:25:52,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 15:25:52,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-28 15:25:52,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852255810] [2024-10-28 15:25:52,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 15:25:52,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-28 15:25:52,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-28 15:25:52,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-28 15:25:52,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-28 15:25:52,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:25:52,908 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 15:25:52,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 15:25:52,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 15:25:52,908 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:25:53,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 15:25:53,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 15:25:53,376 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 (6)] Ended with exit code 0 [2024-10-28 15:25:53,572 WARN L453 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 [2024-10-28 15:25:53,572 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 15:25:53,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:25:53,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1806783564, now seen corresponding path program 1 times [2024-10-28 15:25:53,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-28 15:25:53,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1998973823] [2024-10-28 15:25:53,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 15:25:53,574 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 [2024-10-28 15:25:53,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-28 15:25:53,575 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) [2024-10-28 15:25:53,576 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 [2024-10-28 15:25:53,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-28 15:25:53,841 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-28 15:25:53,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-28 15:25:53,900 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-28 15:25:53,900 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-28 15:25:53,900 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-10-28 15:25:53,906 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 [2024-10-28 15:25:54,100 WARN L453 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 [2024-10-28 15:25:54,102 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-28 15:25:54,103 INFO L317 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (2/2) [2024-10-28 15:25:54,103 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-28 15:25:54,103 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-28 15:25:54,121 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-28 15:25:54,126 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 15:25:54,127 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-28 15:25:54,127 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-28 15:25:54,128 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3062fff8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 15:25:54,128 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-28 15:25:55,580 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 15:25:55,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:25:55,581 INFO L85 PathProgramCache]: Analyzing trace with hash 2018242530, now seen corresponding path program 1 times [2024-10-28 15:25:55,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-28 15:25:55,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [228049643] [2024-10-28 15:25:55,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 15:25:55,581 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 [2024-10-28 15:25:55,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-28 15:25:55,583 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) [2024-10-28 15:25:55,584 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 [2024-10-28 15:25:55,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 15:25:55,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-28 15:25:55,900 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 15:25:55,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-28 15:25:55,939 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-28 15:25:55,939 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-28 15:25:55,939 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-28 15:25:55,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [228049643] [2024-10-28 15:25:55,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [228049643] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 15:25:55,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 15:25:55,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-28 15:25:55,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797994783] [2024-10-28 15:25:55,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 15:25:55,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-28 15:25:55,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-28 15:25:55,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-28 15:25:55,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-28 15:25:55,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:25:55,941 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 15:25:55,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 15:25:55,941 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:25:57,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 15:25:57,115 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 (8)] Forceful destruction successful, exit code 0 [2024-10-28 15:25:57,311 WARN L453 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 [2024-10-28 15:25:57,311 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 15:25:57,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:25:57,311 INFO L85 PathProgramCache]: Analyzing trace with hash 115834441, now seen corresponding path program 1 times [2024-10-28 15:25:57,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-28 15:25:57,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [443076551] [2024-10-28 15:25:57,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 15:25:57,312 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 [2024-10-28 15:25:57,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-28 15:25:57,314 INFO L229 MonitoredProcess]: Starting monitored process 9 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) [2024-10-28 15:25:57,315 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 (9)] Waiting until timeout for monitored process [2024-10-28 15:25:57,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 15:25:57,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-28 15:25:57,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 15:25:57,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-10-28 15:25:57,621 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-28 15:25:57,621 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-28 15:25:57,621 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-28 15:25:57,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [443076551] [2024-10-28 15:25:57,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [443076551] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 15:25:57,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 15:25:57,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-28 15:25:57,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208750015] [2024-10-28 15:25:57,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 15:25:57,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-28 15:25:57,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-28 15:25:57,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-28 15:25:57,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-28 15:25:57,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:25:57,623 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 15:25:57,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 15:25:57,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 15:25:57,623 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:25:58,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 15:25:58,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 15:25:58,359 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 (9)] Ended with exit code 0 [2024-10-28 15:25:58,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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 [2024-10-28 15:25:58,552 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-28 15:25:58,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:25:58,553 INFO L85 PathProgramCache]: Analyzing trace with hash 2000807455, now seen corresponding path program 1 times [2024-10-28 15:25:58,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-28 15:25:58,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [982273329] [2024-10-28 15:25:58,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 15:25:58,553 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 [2024-10-28 15:25:58,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-28 15:25:58,556 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) [2024-10-28 15:25:58,556 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 [2024-10-28 15:25:58,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-28 15:25:58,842 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-28 15:25:58,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-28 15:25:58,912 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-28 15:25:58,912 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-28 15:25:58,913 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2024-10-28 15:25:58,918 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 (10)] Ended with exit code 0 [2024-10-28 15:25:59,113 WARN L453 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 [2024-10-28 15:25:59,114 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-28 15:25:59,115 INFO L317 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/3) [2024-10-28 15:25:59,115 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-28 15:25:59,115 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-28 15:25:59,131 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-28 15:25:59,132 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 15:25:59,133 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-28 15:25:59,133 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thr1Thread3of3ForFork0 ======== [2024-10-28 15:25:59,133 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3062fff8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-28 15:25:59,134 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-28 15:26:02,009 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 15:26:02,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:26:02,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1920530814, now seen corresponding path program 1 times [2024-10-28 15:26:02,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-28 15:26:02,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1330221176] [2024-10-28 15:26:02,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 15:26:02,010 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 [2024-10-28 15:26:02,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-28 15:26:02,011 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) [2024-10-28 15:26:02,012 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 [2024-10-28 15:26:02,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 15:26:02,313 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-28 15:26:02,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 15:26:02,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-28 15:26:02,359 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-28 15:26:02,359 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-28 15:26:02,360 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-28 15:26:02,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1330221176] [2024-10-28 15:26:02,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1330221176] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 15:26:02,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 15:26:02,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-28 15:26:02,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752201545] [2024-10-28 15:26:02,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 15:26:02,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-28 15:26:02,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-28 15:26:02,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-28 15:26:02,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-28 15:26:02,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:26:02,361 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 15:26:02,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 4 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 15:26:02,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:26:03,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 15:26:03,565 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 [2024-10-28 15:26:03,759 WARN L453 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 [2024-10-28 15:26:03,759 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 15:26:03,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:26:03,759 INFO L85 PathProgramCache]: Analyzing trace with hash 54064483, now seen corresponding path program 1 times [2024-10-28 15:26:03,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-28 15:26:03,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1998943623] [2024-10-28 15:26:03,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 15:26:03,760 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 [2024-10-28 15:26:03,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-28 15:26:03,761 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) [2024-10-28 15:26:03,763 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 [2024-10-28 15:26:04,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 15:26:04,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-28 15:26:04,065 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 15:26:04,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-10-28 15:26:04,076 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-28 15:26:04,076 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-28 15:26:04,076 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-28 15:26:04,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1998943623] [2024-10-28 15:26:04,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1998943623] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 15:26:04,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 15:26:04,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-28 15:26:04,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248181788] [2024-10-28 15:26:04,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 15:26:04,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-28 15:26:04,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-28 15:26:04,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-28 15:26:04,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-28 15:26:04,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:26:04,077 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 15:26:04,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 15:26:04,077 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 15:26:04,078 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:26:07,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 15:26:07,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 15:26:07,893 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 (12)] Forceful destruction successful, exit code 0 [2024-10-28 15:26:08,088 WARN L453 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 [2024-10-28 15:26:08,089 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 15:26:08,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:26:08,089 INFO L85 PathProgramCache]: Analyzing trace with hash 209164546, now seen corresponding path program 1 times [2024-10-28 15:26:08,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-28 15:26:08,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2094644550] [2024-10-28 15:26:08,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-28 15:26:08,090 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 [2024-10-28 15:26:08,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-28 15:26:08,090 INFO L229 MonitoredProcess]: Starting monitored process 13 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) [2024-10-28 15:26:08,091 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 (13)] Waiting until timeout for monitored process [2024-10-28 15:26:08,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 15:26:08,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-28 15:26:08,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 15:26:08,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-28 15:26:08,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-28 15:26:08,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-28 15:26:08,469 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 15:26:08,470 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 15:26:08,731 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 15:26:08,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 54 [2024-10-28 15:26:08,801 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 15:26:08,801 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-28 15:26:08,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2094644550] [2024-10-28 15:26:08,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2094644550] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 15:26:08,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-28 15:26:08,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-10-28 15:26:08,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588050174] [2024-10-28 15:26:08,804 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-28 15:26:08,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-28 15:26:08,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-28 15:26:08,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-28 15:26:08,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-10-28 15:26:08,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:26:08,805 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 15:26:08,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 11 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 15:26:08,805 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 15:26:08,805 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 15:26:08,805 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:26:12,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 15:26:12,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 15:26:12,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-28 15:26:12,791 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 (13)] Ended with exit code 0 [2024-10-28 15:26:12,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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 [2024-10-28 15:26:12,987 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 15:26:12,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:26:12,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1587165906, now seen corresponding path program 2 times [2024-10-28 15:26:12,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-28 15:26:12,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1172682828] [2024-10-28 15:26:12,987 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-28 15:26:12,988 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 [2024-10-28 15:26:12,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-28 15:26:12,989 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) [2024-10-28 15:26:12,989 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 [2024-10-28 15:26:13,326 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-28 15:26:13,327 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-28 15:26:13,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-28 15:26:13,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 15:26:13,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-28 15:26:13,366 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 7 [2024-10-28 15:26:13,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-28 15:26:13,428 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-28 15:26:13,428 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 [2024-10-28 15:26:13,445 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 [2024-10-28 15:26:13,482 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 15:26:13,482 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 15:26:15,790 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 10 treesize of output 8 [2024-10-28 15:26:15,801 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 10 treesize of output 8 [2024-10-28 15:26:16,052 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 15:26:16,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 54 [2024-10-28 15:26:16,133 INFO L349 Elim1Store]: treesize reduction 12, result has 65.7 percent of original size [2024-10-28 15:26:16,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 116 [2024-10-28 15:26:16,140 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 63 treesize of output 61 [2024-10-28 15:26:16,156 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-28 15:26:16,157 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 100 treesize of output 82 [2024-10-28 15:26:16,160 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 76 treesize of output 74 [2024-10-28 15:26:16,164 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 48 treesize of output 46 [2024-10-28 15:26:16,246 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 15:26:16,247 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-28 15:26:16,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1172682828] [2024-10-28 15:26:16,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1172682828] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 15:26:16,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-28 15:26:16,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-10-28 15:26:16,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741818282] [2024-10-28 15:26:16,247 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-28 15:26:16,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-28 15:26:16,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-28 15:26:16,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-28 15:26:16,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=178, Unknown=12, NotChecked=0, Total=240 [2024-10-28 15:26:16,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:26:16,249 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 15:26:16,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.4375) internal successors, (87), 15 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 15:26:16,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 15:26:16,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 15:26:16,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-28 15:26:16,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:26:18,156 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (let ((.cse0 (not .cse2)) (.cse1 (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|))) (and .cse0 (or .cse0 (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_3) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_2) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))))) (or .cse0 (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_3) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17|)))))) (not (= (_ bv0 32) c_~top~0)) (= (_ bv3 32) (select .cse1 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)) (not (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32))) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17|))) (forall ((v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))))) (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| (store (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_2) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17|))) (not (= (_ bv0 32) (bvadd (_ bv2 32) c_~next_alloc_idx~0))) (forall ((v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32)))) (or (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17|))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))))) .cse2)))) is different from false [2024-10-28 15:26:18,403 WARN L851 $PredicateComparison]: unable to prove that (and (not (= (_ bv0 32) c_~top~0)) (not (= (_ bv0 32) (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) (= (_ bv3 32) c_~next_alloc_idx~0) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|))) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17|))) (forall ((v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))))) (forall ((v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))))) is different from false [2024-10-28 15:26:18,695 WARN L851 $PredicateComparison]: unable to prove that (and (= (_ bv3 32) c_~next_alloc_idx~0) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17|))) (forall ((v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))))))) is different from false [2024-10-28 15:26:19,117 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (let ((.cse0 (not .cse2)) (.cse1 (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|))) (and .cse0 (or .cse0 (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_3) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_2) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))))) (or .cse0 (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_3) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17|)))))) (= (_ bv3 32) (select .cse1 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)) (not (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32))) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17|))) (forall ((v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))))) (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| (store (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_2) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17|))) (not (= (_ bv0 32) (bvadd (_ bv2 32) c_~next_alloc_idx~0))) (forall ((v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32)))) (or (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17|))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))))) .cse2)))) is different from false [2024-10-28 15:26:19,225 WARN L851 $PredicateComparison]: unable to prove that (and (not (= (_ bv0 32) (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) (= (_ bv3 32) c_~next_alloc_idx~0) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|))) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17|))) (forall ((v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))))) (forall ((v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))))) is different from false [2024-10-28 15:26:20,040 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (let ((.cse0 (not .cse2)) (.cse1 (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|))) (and .cse0 (or .cse0 (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_3) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_2) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))))) (or .cse0 (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_3) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17|)))))) (= (_ bv3 32) (select .cse1 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)) (not (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32))) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17|))) (forall ((v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))))) (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| (store (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_2) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17|))) (not (= (_ bv0 32) (bvadd (_ bv2 32) c_~next_alloc_idx~0))) (forall ((v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32)))) (or (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17|))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))))) .cse2) (= (_ bv3 32) c_~top~0)))) is different from false [2024-10-28 15:26:20,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 15:26:20,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 15:26:20,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-28 15:26:20,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-28 15:26:20,910 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 [2024-10-28 15:26:21,104 WARN L453 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 [2024-10-28 15:26:21,105 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 15:26:21,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:26:21,105 INFO L85 PathProgramCache]: Analyzing trace with hash 160930762, now seen corresponding path program 3 times [2024-10-28 15:26:21,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-28 15:26:21,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [341887919] [2024-10-28 15:26:21,105 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-28 15:26:21,105 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 [2024-10-28 15:26:21,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-28 15:26:21,106 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) [2024-10-28 15:26:21,107 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 [2024-10-28 15:26:21,456 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-10-28 15:26:21,456 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-28 15:26:21,459 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-28 15:26:21,460 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 15:26:21,483 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 16 treesize of output 8 [2024-10-28 15:26:21,500 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-28 15:26:21,500 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-28 15:26:21,500 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-28 15:26:21,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [341887919] [2024-10-28 15:26:21,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [341887919] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 15:26:21,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 15:26:21,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-28 15:26:21,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759803421] [2024-10-28 15:26:21,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 15:26:21,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-28 15:26:21,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-28 15:26:21,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-28 15:26:21,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-28 15:26:21,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:26:21,501 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 15:26:21,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 15:26:21,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 15:26:21,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 15:26:21,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-28 15:26:21,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-10-28 15:26:21,501 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:26:24,141 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (let ((.cse0 (not .cse2)) (.cse1 (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|))) (and .cse0 (or .cse0 (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_3) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_2) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))))) (or .cse0 (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_3) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17|)))))) (not (= (_ bv0 32) c_~top~0)) (not (= (_ bv0 32) (select .cse1 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) (not (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32))) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17|))) (forall ((v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))))) (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| (store (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_2) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17|))) (not (= (_ bv0 32) (bvadd (_ bv2 32) c_~next_alloc_idx~0))) (or (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17|))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))))) .cse2)))) is different from false [2024-10-28 15:26:26,164 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] [2024-10-28 15:26:26,838 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (let ((.cse0 (not .cse2)) (.cse1 (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|))) (and .cse0 (or .cse0 (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_3) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_2) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))))) (or .cse0 (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_3) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17|)))))) (not (= (_ bv0 32) (select .cse1 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) (not (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32))) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17|))) (forall ((v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))))) (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| (store (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_2) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17|))) (not (= (_ bv0 32) (bvadd (_ bv2 32) c_~next_alloc_idx~0))) (or (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17|))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))))) .cse2)))) is different from false [2024-10-28 15:26:27,079 WARN L851 $PredicateComparison]: unable to prove that (and (not (= (_ bv0 32) c_~top~0)) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17|))) (forall ((v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))))))) is different from false [2024-10-28 15:26:30,002 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (not (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32))))) (and .cse0 (or .cse0 (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_3) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_2) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))))) (= (_ bv3 32) (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)) (not (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32))) (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| (store (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_2) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17|))) (not (= (_ bv0 32) (bvadd (_ bv2 32) c_~next_alloc_idx~0))) (forall ((v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32)))) (= (_ bv3 32) c_~top~0))) is different from false [2024-10-28 15:26:30,134 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (not (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32))))) (and .cse0 (or .cse0 (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_3) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_2) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))))) (= (_ bv3 32) (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)) (not (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32))) (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| (store (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_2) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17|))) (not (= (_ bv0 32) (bvadd (_ bv2 32) c_~next_alloc_idx~0))) (forall ((v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32)))))) is different from false [2024-10-28 15:26:30,223 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (not (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32))))) (and .cse0 (or .cse0 (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_3) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_2) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))))) (not (= (_ bv0 32) c_~top~0)) (= (_ bv3 32) (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)) (not (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32))) (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| (store (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_2) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17|))) (not (= (_ bv0 32) (bvadd (_ bv2 32) c_~next_alloc_idx~0))) (forall ((v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32)))))) is different from false [2024-10-28 15:26:32,381 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (let ((.cse0 (not .cse2)) (.cse1 (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|))) (and .cse0 (or .cse0 (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_3) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_2) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))))) (or .cse0 (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_3) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17|)))))) (not (= (_ bv0 32) (select .cse1 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) (not (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32))) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17|))) (forall ((v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))))) (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| (store (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_2) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_17| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17|))) (not (= (_ bv0 32) (bvadd (_ bv2 32) c_~next_alloc_idx~0))) (or (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| (_ BitVec 32)) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17|))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_17| v_DerPreprocessor_2) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))))) .cse2) (= (_ bv3 32) c_~top~0)))) is different from false [2024-10-28 15:26:32,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 15:26:32,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 15:26:32,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-28 15:26:32,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-10-28 15:26:32,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:26:32,760 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 (15)] Forceful destruction successful, exit code 0 [2024-10-28 15:26:32,956 WARN L453 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 [2024-10-28 15:26:32,956 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 15:26:32,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:26:32,956 INFO L85 PathProgramCache]: Analyzing trace with hash 987486932, now seen corresponding path program 4 times [2024-10-28 15:26:32,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-28 15:26:32,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [525487446] [2024-10-28 15:26:32,957 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-28 15:26:32,957 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 [2024-10-28 15:26:32,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-28 15:26:32,958 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) [2024-10-28 15:26:32,958 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 [2024-10-28 15:26:33,294 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-28 15:26:33,294 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-28 15:26:33,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-28 15:26:33,300 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 15:26:33,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-28 15:26:33,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-28 15:26:33,409 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-28 15:26:33,409 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 16 treesize of output 15 [2024-10-28 15:26:33,414 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 [2024-10-28 15:26:33,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-10-28 15:26:33,554 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-28 15:26:33,554 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 15:26:34,020 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-28 15:26:34,020 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-28 15:26:34,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [525487446] [2024-10-28 15:26:34,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [525487446] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-28 15:26:34,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-28 15:26:34,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 21 [2024-10-28 15:26:34,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442289169] [2024-10-28 15:26:34,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 15:26:34,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-28 15:26:34,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-28 15:26:34,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-28 15:26:34,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=344, Unknown=1, NotChecked=0, Total=420 [2024-10-28 15:26:34,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:26:34,022 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 15:26:34,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 15:26:34,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 15:26:34,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 15:26:34,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-28 15:26:34,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2024-10-28 15:26:34,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:26:34,022 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:26:48,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 15:26:48,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 15:26:48,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-28 15:26:48,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-10-28 15:26:48,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:26:48,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-28 15:26:48,166 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 (16)] Ended with exit code 0 [2024-10-28 15:26:48,360 WARN L453 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 [2024-10-28 15:26:48,361 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 15:26:48,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:26:48,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1358289298, now seen corresponding path program 5 times [2024-10-28 15:26:48,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-28 15:26:48,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1997956620] [2024-10-28 15:26:48,361 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-28 15:26:48,362 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 [2024-10-28 15:26:48,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-28 15:26:48,363 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) [2024-10-28 15:26:48,364 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 [2024-10-28 15:26:48,741 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2024-10-28 15:26:48,741 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-28 15:26:48,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-28 15:26:48,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 15:26:48,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-28 15:26:48,774 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 7 [2024-10-28 15:26:48,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-28 15:26:48,840 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-28 15:26:48,840 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 [2024-10-28 15:26:48,857 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 [2024-10-28 15:26:48,903 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 15:26:48,903 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 15:26:49,209 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 10 treesize of output 8 [2024-10-28 15:26:49,221 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 10 treesize of output 8 [2024-10-28 15:26:49,418 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 15:26:49,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 54 [2024-10-28 15:26:49,452 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-28 15:26:49,521 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 15:26:49,521 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-28 15:26:49,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1997956620] [2024-10-28 15:26:49,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1997956620] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 15:26:49,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-28 15:26:49,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-10-28 15:26:49,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421960858] [2024-10-28 15:26:49,522 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-28 15:26:49,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-28 15:26:49,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-28 15:26:49,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-28 15:26:49,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=176, Unknown=14, NotChecked=0, Total=240 [2024-10-28 15:26:49,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:26:49,522 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 15:26:49,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.4375) internal successors, (87), 15 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 15:26:49,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 15:26:49,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 15:26:49,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-28 15:26:49,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2024-10-28 15:26:49,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:26:49,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-10-28 15:26:49,523 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:26:51,204 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (let ((.cse1 (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|)) (.cse0 (not .cse2))) (and (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20|))) (forall ((v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| v_DerPreprocessor_7) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32)))))) .cse0 (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32)) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| (store (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| v_DerPreprocessor_7) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20|))) (not (= (_ bv0 32) c_~top~0)) (= (_ bv3 32) (select .cse1 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)) (forall ((v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))) (not (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32))) (or .cse0 (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32)) (v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20|))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| v_DerPreprocessor_7) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))))) (not (= (_ bv0 32) (bvadd (_ bv2 32) c_~next_alloc_idx~0))) (or (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32)) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| v_DerPreprocessor_7) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20|))))) .cse2) (or .cse0 (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32)) (v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| v_DerPreprocessor_8) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| v_DerPreprocessor_7) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20|))))))) is different from false [2024-10-28 15:26:52,043 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20|))) (forall ((v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| v_DerPreprocessor_7) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32)))))) (not (= (_ bv0 32) c_~top~0)) (not (= (_ bv0 32) (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) (forall ((v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))) (= (_ bv3 32) c_~next_alloc_idx~0) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|)))) is different from false [2024-10-28 15:26:52,449 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20|))) (forall ((v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| v_DerPreprocessor_7) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32)))))) (= (_ bv3 32) c_~next_alloc_idx~0)) is different from false [2024-10-28 15:26:52,847 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (let ((.cse1 (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|)) (.cse0 (not .cse2))) (and (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20|))) (forall ((v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| v_DerPreprocessor_7) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32)))))) .cse0 (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32)) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| (store (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| v_DerPreprocessor_7) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20|))) (= (_ bv3 32) (select .cse1 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)) (forall ((v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))) (not (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32))) (or .cse0 (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32)) (v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20|))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| v_DerPreprocessor_7) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))))) (not (= (_ bv0 32) (bvadd (_ bv2 32) c_~next_alloc_idx~0))) (or (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32)) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| v_DerPreprocessor_7) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20|))))) .cse2) (or .cse0 (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32)) (v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| v_DerPreprocessor_8) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| v_DerPreprocessor_7) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20|))))))) is different from false [2024-10-28 15:26:52,952 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20|))) (forall ((v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| v_DerPreprocessor_7) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32)))))) (not (= (_ bv0 32) (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) (forall ((v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))) (= (_ bv3 32) c_~next_alloc_idx~0) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|)))) is different from false [2024-10-28 15:26:53,641 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (let ((.cse1 (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|)) (.cse0 (not .cse2))) (and (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20|))) (forall ((v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| v_DerPreprocessor_7) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32)))))) .cse0 (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32)) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| (store (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| v_DerPreprocessor_7) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20|))) (= (_ bv3 32) (select .cse1 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)) (forall ((v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))) (not (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32))) (or .cse0 (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32)) (v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20|))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| v_DerPreprocessor_7) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))))) (not (= (_ bv0 32) (bvadd (_ bv2 32) c_~next_alloc_idx~0))) (or (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32)) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| v_DerPreprocessor_7) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20|))))) .cse2) (or .cse0 (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32)) (v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| v_DerPreprocessor_8) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| v_DerPreprocessor_7) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20|)))) (= (_ bv3 32) c_~top~0)))) is different from false [2024-10-28 15:26:54,428 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (let ((.cse1 (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|)) (.cse0 (not .cse2))) (and (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20|))) (forall ((v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| v_DerPreprocessor_7) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32)))))) .cse0 (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32)) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| (store (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| v_DerPreprocessor_7) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20|))) (not (= (_ bv0 32) c_~top~0)) (not (= (_ bv0 32) (select .cse1 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) (not (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32))) (or .cse0 (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32)) (v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20|))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| v_DerPreprocessor_7) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))))) (not (= (_ bv0 32) (bvadd (_ bv2 32) c_~next_alloc_idx~0))) (or (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32)) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| v_DerPreprocessor_7) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20|))))) .cse2) (or .cse0 (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32)) (v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| v_DerPreprocessor_8) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| v_DerPreprocessor_7) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20|))))))) is different from false [2024-10-28 15:26:55,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 15:26:56,315 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (let ((.cse1 (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|)) (.cse0 (not .cse2))) (and (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20|))) (forall ((v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| v_DerPreprocessor_7) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32)))))) .cse0 (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32)) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| (store (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| v_DerPreprocessor_7) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20|))) (not (= (_ bv0 32) (select .cse1 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) (not (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32))) (or .cse0 (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32)) (v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20|))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| v_DerPreprocessor_7) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))))) (not (= (_ bv0 32) (bvadd (_ bv2 32) c_~next_alloc_idx~0))) (or (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32)) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| v_DerPreprocessor_7) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20|))))) .cse2) (or .cse0 (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32)) (v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| v_DerPreprocessor_8) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| v_DerPreprocessor_7) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20|))))))) is different from false [2024-10-28 15:26:58,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 [1] [2024-10-28 15:27:01,543 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (not (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32))))) (and .cse0 (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32)) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| (store (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| v_DerPreprocessor_7) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20|))) (= (_ bv3 32) (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)) (forall ((v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))) (not (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32))) (not (= (_ bv0 32) (bvadd (_ bv2 32) c_~next_alloc_idx~0))) (or .cse0 (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32)) (v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| v_DerPreprocessor_8) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| v_DerPreprocessor_7) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20|)))) (= (_ bv3 32) c_~top~0))) is different from false [2024-10-28 15:27:01,623 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (not (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32))))) (and .cse0 (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32)) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| (store (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| v_DerPreprocessor_7) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20|))) (= (_ bv3 32) (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)) (forall ((v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))) (not (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32))) (not (= (_ bv0 32) (bvadd (_ bv2 32) c_~next_alloc_idx~0))) (or .cse0 (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32)) (v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| v_DerPreprocessor_8) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| v_DerPreprocessor_7) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20|)))))) is different from false [2024-10-28 15:27:01,715 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (not (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32))))) (and .cse0 (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32)) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| (store (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| v_DerPreprocessor_7) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20|))) (not (= (_ bv0 32) c_~top~0)) (= (_ bv3 32) (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)) (forall ((v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_7) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))) (not (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32))) (not (= (_ bv0 32) (bvadd (_ bv2 32) c_~next_alloc_idx~0))) (or .cse0 (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32)) (v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| v_DerPreprocessor_8) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| v_DerPreprocessor_7) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20|)))))) is different from false [2024-10-28 15:27:03,367 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (let ((.cse1 (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|)) (.cse0 (not .cse2))) (and (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20|))) (forall ((v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| v_DerPreprocessor_7) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32)))))) .cse0 (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32)) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| (store (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| v_DerPreprocessor_7) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20|))) (not (= (_ bv0 32) (select .cse1 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) (not (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32))) (or .cse0 (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32)) (v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20|))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_8) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| v_DerPreprocessor_7) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))))) (not (= (_ bv0 32) (bvadd (_ bv2 32) c_~next_alloc_idx~0))) (or (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32)) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| v_DerPreprocessor_7) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20|))))) .cse2) (or .cse0 (forall ((|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32)) (|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| (_ BitVec 32)) (v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| v_DerPreprocessor_8) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20| v_DerPreprocessor_7) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))) (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_20| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_20|)))) (= (_ bv3 32) c_~top~0)))) is different from false [2024-10-28 15:27:05,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-28 15:27:11,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 15:27:11,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 15:27:11,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-28 15:27:11,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-10-28 15:27:11,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:27:11,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-28 15:27:11,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-10-28 15:27:11,600 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 (17)] Ended with exit code 0 [2024-10-28 15:27:11,790 WARN L453 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 [2024-10-28 15:27:11,790 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 15:27:11,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:27:11,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1308608870, now seen corresponding path program 6 times [2024-10-28 15:27:11,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-28 15:27:11,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1874417179] [2024-10-28 15:27:11,791 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-28 15:27:11,791 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 [2024-10-28 15:27:11,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-28 15:27:11,792 INFO L229 MonitoredProcess]: Starting monitored process 18 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) [2024-10-28 15:27:11,794 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 (18)] Waiting until timeout for monitored process [2024-10-28 15:27:12,161 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2024-10-28 15:27:12,161 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-28 15:27:12,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-28 15:27:12,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 15:27:12,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-28 15:27:12,265 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-28 15:27:12,265 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 25 treesize of output 22 [2024-10-28 15:27:12,363 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-28 15:27:12,363 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 16 treesize of output 15 [2024-10-28 15:27:12,443 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 16 treesize of output 8 [2024-10-28 15:27:12,464 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 15:27:12,464 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 15:27:12,667 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (and (or .cse0 (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select (select (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_10) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (= (_ bv0 32) (select v_DerPreprocessor_10 (_ bv0 32)))))) (or (not .cse0) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (select v_DerPreprocessor_11 (_ bv0 32))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_11) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))))))) is different from false [2024-10-28 15:27:13,454 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 15:27:13,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 57 [2024-10-28 15:27:13,462 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 15:27:13,462 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 1 case distinctions, treesize of input 9 treesize of output 8 [2024-10-28 15:27:13,705 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 15:27:13,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 547 treesize of output 599 [2024-10-28 15:27:13,744 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 15:27:13,744 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 314 treesize of output 317 [2024-10-28 15:27:13,756 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 308 treesize of output 306 [2024-10-28 15:27:13,768 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 306 treesize of output 304 [2024-10-28 15:27:13,796 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 15:27:13,796 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 304 treesize of output 307 [2024-10-28 15:27:13,808 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 298 treesize of output 296 [2024-10-28 15:27:13,835 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 15:27:13,836 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 296 treesize of output 299 [2024-10-28 15:27:13,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 15:27:13,864 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 290 treesize of output 295 [2024-10-28 15:27:13,876 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 286 treesize of output 284 [2024-10-28 15:27:13,901 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 15:27:13,902 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 284 treesize of output 287 [2024-10-28 15:27:15,198 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-10-28 15:27:15,198 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-28 15:27:15,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1874417179] [2024-10-28 15:27:15,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1874417179] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 15:27:15,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-28 15:27:15,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2024-10-28 15:27:15,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174739061] [2024-10-28 15:27:15,199 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-28 15:27:15,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-28 15:27:15,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-28 15:27:15,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-28 15:27:15,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=271, Unknown=29, NotChecked=36, Total=420 [2024-10-28 15:27:15,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:27:15,200 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 15:27:15,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.761904761904762) internal successors, (79), 20 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) [2024-10-28 15:27:15,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 15:27:15,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 15:27:15,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-28 15:27:15,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2024-10-28 15:27:15,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:27:15,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-10-28 15:27:15,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2024-10-28 15:27:15,200 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:27:20,027 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] [2024-10-28 15:27:22,041 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] [2024-10-28 15:27:24,055 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] [2024-10-28 15:27:26,087 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] [2024-10-28 15:27:27,507 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (let ((.cse1 (not .cse0))) (and (= (_ bv1 32) (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) (_ bv0 32))) (or .cse0 (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select (select (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_10) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (= (_ bv0 32) (select v_DerPreprocessor_10 (_ bv0 32)))))) (not (= (_ bv0 32) c_~top~0)) (or .cse1 (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (select v_DerPreprocessor_11 (_ bv0 32))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_11) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))))) (= (_ bv5 32) c_~next_alloc_idx~0) (= |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| (_ bv0 32)) (or (forall ((v_DerPreprocessor_12 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (select v_DerPreprocessor_11 (_ bv0 32))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_12) |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_11) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))))) .cse1) (or (let ((.cse2 (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32)))) (and (or (not .cse2) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (select v_DerPreprocessor_11 (_ bv0 32))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_11) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))))) (or .cse2 (forall ((v_prenex_40 (_ BitVec 32)) (v_DerPreprocessor_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) v_prenex_40 v_DerPreprocessor_10) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (= (_ bv0 32) (select v_DerPreprocessor_10 (_ bv0 32)))))))) .cse0)))) is different from false [2024-10-28 15:27:29,543 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] [2024-10-28 15:27:31,575 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] [2024-10-28 15:27:33,589 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] [2024-10-28 15:27:35,607 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] [2024-10-28 15:27:37,622 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] [2024-10-28 15:27:39,635 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] [2024-10-28 15:27:41,683 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] [2024-10-28 15:27:44,728 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] [2024-10-28 15:27:47,207 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] [2024-10-28 15:27:51,721 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (let ((.cse1 (not .cse0))) (and (= (_ bv1 32) (select (select |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) (_ bv0 32))) (or .cse0 (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select (select (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_10) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (= (_ bv0 32) (select v_DerPreprocessor_10 (_ bv0 32)))))) (or .cse1 (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (select v_DerPreprocessor_11 (_ bv0 32))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_11) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))))) (= (_ bv5 32) c_~next_alloc_idx~0) (= |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset| (_ bv0 32)) (or (forall ((v_DerPreprocessor_12 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (select v_DerPreprocessor_11 (_ bv0 32))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_12) |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_11) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))))) .cse1) (or (let ((.cse2 (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32)))) (and (or (not .cse2) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_13 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (select v_DerPreprocessor_11 (_ bv0 32))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_11) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|)))))) (or .cse2 (forall ((v_prenex_40 (_ BitVec 32)) (v_DerPreprocessor_13 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_13) v_prenex_40 v_DerPreprocessor_10) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.offset|))) (= (_ bv0 32) (select v_DerPreprocessor_10 (_ bv0 32)))))))) .cse0)))) is different from false [2024-10-28 15:27:53,835 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] [2024-10-28 15:27:55,849 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] [2024-10-28 15:27:57,862 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] [2024-10-28 15:28:00,064 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] [2024-10-28 15:28:02,528 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] [2024-10-28 15:28:06,009 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] [2024-10-28 15:28:08,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 [0] [2024-10-28 15:28:10,785 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] [2024-10-28 15:28:12,799 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] [2024-10-28 15:28:17,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] [2024-10-28 15:28:20,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 15:28:20,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 15:28:20,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-28 15:28:20,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-10-28 15:28:20,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:28:20,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-28 15:28:20,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-10-28 15:28:20,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-28 15:28:20,115 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 (18)] Forceful destruction successful, exit code 0 [2024-10-28 15:28:20,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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 [2024-10-28 15:28:20,310 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 15:28:20,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:28:20,310 INFO L85 PathProgramCache]: Analyzing trace with hash 302634258, now seen corresponding path program 7 times [2024-10-28 15:28:20,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-28 15:28:20,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [978534452] [2024-10-28 15:28:20,311 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-28 15:28:20,311 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 [2024-10-28 15:28:20,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-28 15:28:20,312 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) [2024-10-28 15:28:20,313 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 [2024-10-28 15:28:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-28 15:28:20,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-28 15:28:20,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 15:28:20,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-28 15:28:20,689 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 7 [2024-10-28 15:28:20,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-28 15:28:20,769 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-28 15:28:20,769 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 [2024-10-28 15:28:20,788 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 [2024-10-28 15:28:20,834 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 15:28:20,834 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 15:28:23,139 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 10 treesize of output 8 [2024-10-28 15:28:23,147 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 10 treesize of output 8 [2024-10-28 15:28:23,285 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 15:28:23,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 54 [2024-10-28 15:28:23,326 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 15:28:23,326 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2024-10-28 15:28:23,331 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-28 15:28:23,333 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 19 treesize of output 11 [2024-10-28 15:28:23,440 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 15:28:23,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-28 15:28:23,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [978534452] [2024-10-28 15:28:23,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [978534452] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 15:28:23,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-28 15:28:23,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-10-28 15:28:23,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247927321] [2024-10-28 15:28:23,441 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-28 15:28:23,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-28 15:28:23,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-28 15:28:23,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-28 15:28:23,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=182, Unknown=8, NotChecked=0, Total=240 [2024-10-28 15:28:23,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:28:23,442 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 15:28:23,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.4375) internal successors, (87), 15 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 15:28:23,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 15:28:23,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 15:28:23,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-28 15:28:23,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2024-10-28 15:28:23,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:28:23,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-10-28 15:28:23,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2024-10-28 15:28:23,442 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-10-28 15:28:23,443 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:28:26,017 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (not (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (.cse1 (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|))) (and (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32))) (or (forall ((v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_15) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24|))))) .cse0 (forall ((v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_15) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32)))) (not (= (_ bv0 32) c_~top~0)) (= (_ bv3 32) (select .cse1 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)) (or .cse0 (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_16) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_15) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24|)))))) (not (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32))) (not (= (_ bv0 32) (bvadd (_ bv2 32) c_~next_alloc_idx~0))) (or .cse0 (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32)) (v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32))) (or (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_16) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_15) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))))) (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32)) (v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32))) (or (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| (store (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_15) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))))) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32))) (or (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_15) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24|))))))) is different from false [2024-10-28 15:28:30,130 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] [2024-10-28 15:28:30,284 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32))) (or (forall ((v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_15) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24|))))) (forall ((v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_15) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32)))) (not (= (_ bv0 32) c_~top~0)) (not (= (_ bv0 32) (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) (= (_ bv3 32) c_~next_alloc_idx~0) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|)))) is different from false [2024-10-28 15:28:37,046 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (not (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (.cse1 (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|))) (and (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32))) (or (forall ((v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_15) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24|))))) .cse0 (forall ((v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_15) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32)))) (= (_ bv3 32) (select .cse1 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)) (or .cse0 (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_16) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_15) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24|)))))) (not (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32))) (not (= (_ bv0 32) (bvadd (_ bv2 32) c_~next_alloc_idx~0))) (or .cse0 (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32)) (v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32))) (or (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_16) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_15) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))))) (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32)) (v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32))) (or (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| (store (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_15) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))))) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32))) (or (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_15) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24|))))))) is different from false [2024-10-28 15:28:37,148 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32))) (or (forall ((v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_15) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24|))))) (forall ((v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_15) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32)))) (not (= (_ bv0 32) (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) (= (_ bv3 32) c_~next_alloc_idx~0) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|)))) is different from false [2024-10-28 15:28:37,900 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (not (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (.cse1 (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|))) (and (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32))) (or (forall ((v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_15) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24|))))) .cse0 (forall ((v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_15) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32)))) (= (_ bv3 32) (select .cse1 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)) (or .cse0 (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_16) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_15) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24|)))))) (not (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32))) (not (= (_ bv0 32) (bvadd (_ bv2 32) c_~next_alloc_idx~0))) (or .cse0 (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32)) (v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32))) (or (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_16) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_15) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))))) (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32)) (v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32))) (or (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| (store (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_15) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))))) (= (_ bv3 32) c_~top~0) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32))) (or (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_15) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24|))))))) is different from false [2024-10-28 15:28:49,007 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] [2024-10-28 15:28:54,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 15:28:54,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 15:28:54,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-28 15:28:54,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-10-28 15:28:54,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:28:54,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-28 15:28:54,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-10-28 15:28:54,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-28 15:28:54,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-10-28 15:28:54,172 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 [2024-10-28 15:28:54,367 WARN L453 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 [2024-10-28 15:28:54,367 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 15:28:54,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:28:54,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1099461678, now seen corresponding path program 8 times [2024-10-28 15:28:54,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-28 15:28:54,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1159984897] [2024-10-28 15:28:54,368 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-28 15:28:54,368 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 [2024-10-28 15:28:54,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-28 15:28:54,370 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) [2024-10-28 15:28:54,371 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 [2024-10-28 15:28:54,732 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-28 15:28:54,732 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-28 15:28:54,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-28 15:28:54,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 15:28:54,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-28 15:28:54,765 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 7 [2024-10-28 15:28:54,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-28 15:28:54,837 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-28 15:28:54,837 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 [2024-10-28 15:28:54,858 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 [2024-10-28 15:28:55,009 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 15:28:55,009 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 15:28:57,239 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 10 treesize of output 8 [2024-10-28 15:28:57,350 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 15:28:57,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 54 [2024-10-28 15:28:57,392 INFO L349 Elim1Store]: treesize reduction 12, result has 65.7 percent of original size [2024-10-28 15:28:57,392 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 3 case distinctions, treesize of input 31 treesize of output 48 [2024-10-28 15:28:57,397 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-28 15:28:57,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 34 [2024-10-28 15:28:57,447 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 15:28:57,448 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-28 15:28:57,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1159984897] [2024-10-28 15:28:57,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1159984897] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 15:28:57,448 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-28 15:28:57,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2024-10-28 15:28:57,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162641855] [2024-10-28 15:28:57,448 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-28 15:28:57,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-28 15:28:57,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-28 15:28:57,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-28 15:28:57,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=303, Unknown=5, NotChecked=0, Total=380 [2024-10-28 15:28:57,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:28:57,449 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 15:28:57,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.35) internal successors, (87), 19 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 15:28:57,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 15:28:57,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 15:28:57,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-28 15:28:57,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2024-10-28 15:28:57,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:28:57,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-10-28 15:28:57,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2024-10-28 15:28:57,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-10-28 15:28:57,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-10-28 15:28:57,449 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:29:05,854 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] [2024-10-28 15:29:18,704 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] [2024-10-28 15:29:21,702 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] [2024-10-28 15:29:27,749 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] [2024-10-28 15:29:29,979 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] [2024-10-28 15:29:36,552 WARN L851 $PredicateComparison]: unable to prove that (and (= (_ bv3 32) (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)) (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_18 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_26| (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_26| (_ BitVec 32))) (or (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_26| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_26|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_26| (store (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_26|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_26| v_DerPreprocessor_18) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_26|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) (= (_ bv0 32) (select v_DerPreprocessor_18 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (exists ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32))) (and (not (= (_ bv0 32) (select (select |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (not (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|)))) (not (= |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|)) (not (= (_ bv0 32) (bvadd (_ bv2 32) c_~next_alloc_idx~0)))) is different from false [2024-10-28 15:29:50,371 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] [2024-10-28 15:29:51,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 15:29:51,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 15:29:51,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-28 15:29:51,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-10-28 15:29:51,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:29:51,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-28 15:29:51,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2024-10-28 15:29:51,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-28 15:29:51,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2024-10-28 15:29:51,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2024-10-28 15:29:51,074 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 (20)] Ended with exit code 0 [2024-10-28 15:29:51,270 WARN L453 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 [2024-10-28 15:29:51,270 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 15:29:51,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:29:51,271 INFO L85 PathProgramCache]: Analyzing trace with hash -1105937146, now seen corresponding path program 9 times [2024-10-28 15:29:51,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-28 15:29:51,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1062395055] [2024-10-28 15:29:51,271 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-28 15:29:51,271 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 [2024-10-28 15:29:51,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-28 15:29:51,272 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) [2024-10-28 15:29:51,273 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 [2024-10-28 15:29:51,639 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-28 15:29:51,639 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-28 15:29:51,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-28 15:29:51,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 15:29:51,653 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 7 [2024-10-28 15:29:51,844 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-28 15:29:51,845 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 [2024-10-28 15:29:51,904 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 0 case distinctions, treesize of input 47 treesize of output 65 [2024-10-28 15:29:51,918 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 [2024-10-28 15:29:51,982 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 [2024-10-28 15:29:52,001 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 [2024-10-28 15:29:52,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 24 treesize of output 12 [2024-10-28 15:29:52,640 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-28 15:29:52,641 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-28 15:29:52,641 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-28 15:29:52,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1062395055] [2024-10-28 15:29:52,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1062395055] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-28 15:29:52,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-28 15:29:52,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-28 15:29:52,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548721529] [2024-10-28 15:29:52,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-28 15:29:52,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-28 15:29:52,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-28 15:29:52,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-28 15:29:52,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-28 15:29:52,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:29:52,642 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 15:29:52,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 15:29:52,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 15:29:52,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 15:29:52,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-28 15:29:52,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2024-10-28 15:29:52,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:29:52,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-10-28 15:29:52,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 54 states. [2024-10-28 15:29:52,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-10-28 15:29:52,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 45 states. [2024-10-28 15:29:52,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 62 states. [2024-10-28 15:29:52,643 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:29:56,945 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] [2024-10-28 15:30:00,551 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] [2024-10-28 15:30:04,438 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] [2024-10-28 15:30:15,258 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] [2024-10-28 15:30:19,948 WARN L851 $PredicateComparison]: unable to prove that (and (not (= (_ bv0 32) (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) (= (_ bv3 32) c_~next_alloc_idx~0) (or (forall ((v_DerPreprocessor_18 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_26| (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_26|))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_26| v_DerPreprocessor_18) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) (= (_ bv0 32) (select v_DerPreprocessor_18 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) is different from false [2024-10-28 15:30:29,999 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (not (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32))))) (and .cse0 (forall ((v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_15) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32)))) (= (_ bv3 32) (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)) (not (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32))) (not (= (_ bv0 32) (bvadd (_ bv2 32) c_~next_alloc_idx~0))) (or .cse0 (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32)) (v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32))) (or (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_16) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_15) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))))) (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32)) (v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32))) (or (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| (store (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_15) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))))) (= (_ bv3 32) c_~top~0))) is different from false [2024-10-28 15:30:30,040 WARN L851 $PredicateComparison]: unable to prove that (and (= (_ bv3 32) (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)) (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_18 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_26| (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_26| (_ BitVec 32))) (or (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_26| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_26|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_26| (store (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_26|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_26| v_DerPreprocessor_18) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_26|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) (= (_ bv0 32) (select v_DerPreprocessor_18 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (exists ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32))) (and (not (= (_ bv0 32) (select (select |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (not (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|)))) (not (= |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|)) (not (= (_ bv0 32) (bvadd (_ bv2 32) c_~next_alloc_idx~0))) (= (_ bv3 32) c_~top~0)) is different from false [2024-10-28 15:30:30,374 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (not (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32))))) (and .cse0 (forall ((v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_15) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32)))) (= (_ bv3 32) (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)) (not (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32))) (not (= (_ bv0 32) (bvadd (_ bv2 32) c_~next_alloc_idx~0))) (or .cse0 (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32)) (v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32))) (or (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_16) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_15) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))))) (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32)) (v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32))) (or (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| (store (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_15) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))))))) is different from false [2024-10-28 15:30:30,718 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (not (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32))))) (and .cse0 (forall ((v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_15) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32)))) (not (= (_ bv0 32) c_~top~0)) (= (_ bv3 32) (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)) (not (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32))) (not (= (_ bv0 32) (bvadd (_ bv2 32) c_~next_alloc_idx~0))) (or .cse0 (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32)) (v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32))) (or (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_16) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_15) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))))) (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32)) (v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32))) (or (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| (store (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_15) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))))))) is different from false [2024-10-28 15:30:30,790 WARN L851 $PredicateComparison]: unable to prove that (and (not (= (_ bv0 32) c_~top~0)) (= (_ bv3 32) (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)) (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_18 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_26| (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_26| (_ BitVec 32))) (or (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_26| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_26|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_26| (store (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_26|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_26| v_DerPreprocessor_18) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_26|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) (= (_ bv0 32) (select v_DerPreprocessor_18 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (exists ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32))) (and (not (= (_ bv0 32) (select (select |c_#memory_int| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|))) (not (= |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|)))) (not (= |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|)) (not (= (_ bv0 32) (bvadd (_ bv2 32) c_~next_alloc_idx~0)))) is different from false [2024-10-28 15:30:34,978 WARN L851 $PredicateComparison]: unable to prove that (and (= (_ bv3 32) c_~next_alloc_idx~0) (or (forall ((v_DerPreprocessor_18 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_26| (_ BitVec 32)) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_26|))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_26| v_DerPreprocessor_18) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) (= (_ bv0 32) (select v_DerPreprocessor_18 |thr1Thread3of3ForFork0_push_~#newTop~0#1.offset|)))) (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) is different from false [2024-10-28 15:30:40,978 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (not (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (.cse1 (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|))) (and (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32))) (or (forall ((v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_15) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24|))))) .cse0 (forall ((v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_15) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32)))) (not (= (_ bv0 32) c_~top~0)) (or .cse0 (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_16) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_15) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24|)))))) (not (= (_ bv0 32) (select .cse1 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) (not (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32))) (not (= (_ bv0 32) (bvadd (_ bv2 32) c_~next_alloc_idx~0))) (or .cse0 (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32)) (v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32))) (or (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_16) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_15) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))))) (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32)) (v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32))) (or (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| (store (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_15) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))))) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32))) (or (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_15) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24|))))))) is different from false [2024-10-28 15:30:41,142 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (not (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (.cse1 (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|))) (and (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32))) (or (forall ((v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store |c_#memory_int| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_15) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24|))))) .cse0 (forall ((v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |c_thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_15) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32)))) (or .cse0 (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_16) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_15) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24|)))))) (not (= (_ bv0 32) (select .cse1 |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) (not (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32))) (not (= (_ bv0 32) (bvadd (_ bv2 32) c_~next_alloc_idx~0))) (or .cse0 (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_16 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32)) (v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32))) (or (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_16) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_15) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))))) (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (|v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32)) (v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32))) (|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32))) (or (= |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24|) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24| (store (select |c_#memory_int| |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_15) |v_thr1Thread2of3ForFork0_push_~#newTop~0#1.base_24|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))))) (forall ((|v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| (_ BitVec 32))) (or (forall ((|thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| (_ BitVec 32)) (v_DerPreprocessor_15 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base| (store .cse1 |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset| c_~next_alloc_idx~0)) |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24| v_DerPreprocessor_15) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|)))) (not (= (_ bv0 1) (select |c_#valid| |v_thr1Thread3of3ForFork0_push_~#newTop~0#1.base_24|))))))) is different from false [2024-10-28 15:30:41,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-28 15:30:41,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-28 15:30:41,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-28 15:30:41,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-10-28 15:30:41,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:30:41,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-10-28 15:30:41,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2024-10-28 15:30:41,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2024-10-28 15:30:41,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-10-28 15:30:41,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-10-28 15:30:41,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-28 15:30:41,607 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 (21)] Ended with exit code 0 [2024-10-28 15:30:41,803 WARN L453 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 [2024-10-28 15:30:41,803 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-28 15:30:41,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-28 15:30:41,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1611649962, now seen corresponding path program 10 times [2024-10-28 15:30:41,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-28 15:30:41,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1046720721] [2024-10-28 15:30:41,804 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-28 15:30:41,804 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 [2024-10-28 15:30:41,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/mathsat [2024-10-28 15:30:41,805 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) [2024-10-28 15:30:41,806 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 [2024-10-28 15:30:42,129 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-28 15:30:42,129 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-28 15:30:42,134 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-28 15:30:42,136 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-28 15:30:42,204 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 7 [2024-10-28 15:30:42,357 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-28 15:30:42,358 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 [2024-10-28 15:30:42,447 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 11 treesize of output 7 [2024-10-28 15:30:42,543 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 [2024-10-28 15:30:43,127 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-28 15:30:43,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2024-10-28 15:30:43,484 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 15:30:43,484 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 31 treesize of output 23 [2024-10-28 15:30:43,680 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 15:30:43,680 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-28 15:30:45,233 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (and (or (not .cse0) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_21 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_22) |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))))) (or (let ((.cse1 (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32)))) (and (or .cse1 (forall ((v_DerPreprocessor_23 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (_ BitVec 32))) (not (= (_ bv0 32) (select (select (let ((.cse2 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_23))) (store .cse2 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store (select .cse2 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) (_ bv0 32) (bvadd (_ bv2 32) c_~next_alloc_idx~0)))) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))))) (or (not .cse1) (forall ((v_DerPreprocessor_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_80 (_ BitVec 32)) (v_DerPreprocessor_21 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_23) v_prenex_80 v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))))))) .cse0))) is different from false [2024-10-28 15:30:45,287 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 15:30:45,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 57 [2024-10-28 15:30:45,312 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 15:30:45,312 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 1 case distinctions, treesize of input 9 treesize of output 8 [2024-10-28 15:30:45,485 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 226 treesize of output 212 [2024-10-28 15:30:45,514 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 [2024-10-28 15:30:45,529 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 [2024-10-28 15:30:45,687 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-28 15:30:45,687 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 381 treesize of output 369 [2024-10-28 15:30:45,717 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 302 treesize of output 294 [2024-10-28 15:30:45,794 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 294 treesize of output 290 [2024-10-28 15:30:45,812 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 290 treesize of output 288 [2024-10-28 15:30:45,831 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 288 treesize of output 284 [2024-10-28 15:30:45,850 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 284 treesize of output 282 [2024-10-28 15:30:46,276 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 57 treesize of output 51 [2024-10-28 15:30:47,429 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-28 15:30:47,429 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-28 15:30:47,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1046720721] [2024-10-28 15:30:47,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1046720721] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-28 15:30:47,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-28 15:30:47,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2024-10-28 15:30:47,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424865252] [2024-10-28 15:30:47,430 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-28 15:30:47,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-28 15:30:47,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-28 15:30:47,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-28 15:30:47,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=215, Unknown=3, NotChecked=30, Total=306 [2024-10-28 15:30:47,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:30:47,430 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-28 15:30:47,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.833333333333333) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-28 15:30:47,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-28 15:30:47,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-28 15:30:47,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. [2024-10-28 15:30:47,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2024-10-28 15:30:47,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-28 15:30:47,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 35 states. [2024-10-28 15:30:47,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 55 states. [2024-10-28 15:30:47,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 50 states. [2024-10-28 15:30:47,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 56 states. [2024-10-28 15:30:47,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 73 states. [2024-10-28 15:30:47,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2024-10-28 15:30:47,431 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-28 15:30:55,905 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (bvsgt (bvadd (_ bv1 32) c_~next_alloc_idx~0) (_ bv65 32)))) (and (not (= (_ bv0 32) (select (select |c_#memory_int| |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))) (or (not .cse0) (forall ((|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (_ BitVec 32)) (v_DerPreprocessor_22 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_21 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_22) |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))))) (or (let ((.cse1 (bvsgt (bvadd (_ bv3 32) c_~next_alloc_idx~0) (_ bv65 32)))) (and (or .cse1 (forall ((v_DerPreprocessor_23 (Array (_ BitVec 32) (_ BitVec 32))) (|thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (_ BitVec 32))) (not (= (_ bv0 32) (select (select (let ((.cse2 (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_23))) (store .cse2 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base| (store (select .cse2 |thr1Thread3of3ForFork0_push_~#newTop~0#1.base|) (_ bv0 32) (bvadd (_ bv2 32) c_~next_alloc_idx~0)))) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|))))) (or (not .cse1) (forall ((v_DerPreprocessor_23 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_80 (_ BitVec 32)) (v_DerPreprocessor_21 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_int| |c_thr1Thread1of3ForFork0_push_~#newTop~0#1.base| v_DerPreprocessor_23) v_prenex_80 v_DerPreprocessor_21) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.base|) |c_thr1Thread2of3ForFork0_push_~#newTop~0#1.offset|) (_ bv0 32))))))) .cse0))) is different from false [2024-10-28 15:31:05,064 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