./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i --full-output --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking COUNTEREXAMPLE --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.tracecheck.mode.for.conditional.commutativity GENERATOR_WITH_CONTEXT -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b86fb0b7 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.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 bde6fe221f69c3fccb0f7c90e011f0b13ab5ca582ddcd328a459cbb512a8fd7f --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking COUNTEREXAMPLE --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT --traceabstraction.tracecheck.mode.for.conditional.commutativity GENERATOR_WITH_CONTEXT -tc /storage/repos/ultimate/releaseScripts/default/benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.conditional-comm-b86fb0b-m [2024-10-17 04:34:46,368 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-17 04:34:46,431 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-17 04:34:46,437 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-17 04:34:46,438 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-17 04:34:46,471 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-17 04:34:46,472 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-17 04:34:46,473 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-17 04:34:46,474 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-17 04:34:46,475 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-17 04:34:46,477 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-17 04:34:46,477 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-17 04:34:46,478 INFO L153 SettingsManager]: * Use SBE=true [2024-10-17 04:34:46,478 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-17 04:34:46,478 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-17 04:34:46,478 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-17 04:34:46,479 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-17 04:34:46,483 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-17 04:34:46,483 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-17 04:34:46,484 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-17 04:34:46,484 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-17 04:34:46,485 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-17 04:34:46,485 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-17 04:34:46,486 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-17 04:34:46,486 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-17 04:34:46,486 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-17 04:34:46,486 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-17 04:34:46,486 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-17 04:34:46,487 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-17 04:34:46,487 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-17 04:34:46,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-17 04:34:46,489 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-17 04:34:46,489 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-17 04:34:46,489 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-17 04:34:46,490 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-17 04:34:46,490 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-17 04:34:46,490 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-17 04:34:46,490 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-17 04:34:46,490 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-17 04:34:46,491 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-17 04:34:46,491 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-17 04:34:46,491 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 -> bde6fe221f69c3fccb0f7c90e011f0b13ab5ca582ddcd328a459cbb512a8fd7f Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> COUNTEREXAMPLE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: TraceCheck mode for conditional commutativity -> GENERATOR_WITH_CONTEXT [2024-10-17 04:34:46,732 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-17 04:34:46,754 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-17 04:34:46,758 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-17 04:34:46,759 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-17 04:34:46,760 INFO L274 PluginConnector]: CDTParser initialized [2024-10-17 04:34:46,761 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i [2024-10-17 04:34:48,283 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-17 04:34:48,535 INFO L384 CDTParser]: Found 1 translation units. [2024-10-17 04:34:48,536 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i [2024-10-17 04:34:48,556 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/850f4f755/23743343bd8c4270afe92db6fee92aaa/FLAGe66e2a7e9 [2024-10-17 04:34:48,570 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/850f4f755/23743343bd8c4270afe92db6fee92aaa [2024-10-17 04:34:48,572 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-17 04:34:48,573 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-17 04:34:48,574 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-17 04:34:48,574 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-17 04:34:48,579 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-17 04:34:48,580 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 04:34:48" (1/1) ... [2024-10-17 04:34:48,581 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54e3c6dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:34:48, skipping insertion in model container [2024-10-17 04:34:48,581 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 04:34:48" (1/1) ... [2024-10-17 04:34:48,643 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-17 04:34:49,137 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i[41323,41336] [2024-10-17 04:34:49,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-17 04:34:49,200 INFO L200 MainTranslator]: Completed pre-run [2024-10-17 04:34:49,246 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i[41323,41336] [2024-10-17 04:34:49,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-17 04:34:49,363 INFO L204 MainTranslator]: Completed translation [2024-10-17 04:34:49,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:34:49 WrapperNode [2024-10-17 04:34:49,363 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-17 04:34:49,365 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-17 04:34:49,365 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-17 04:34:49,366 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-17 04:34:49,372 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:34:49" (1/1) ... [2024-10-17 04:34:49,396 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:34:49" (1/1) ... [2024-10-17 04:34:49,423 INFO L138 Inliner]: procedures = 272, calls = 47, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 279 [2024-10-17 04:34:49,424 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-17 04:34:49,424 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-17 04:34:49,424 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-17 04:34:49,425 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-17 04:34:49,433 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:34:49" (1/1) ... [2024-10-17 04:34:49,433 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:34:49" (1/1) ... [2024-10-17 04:34:49,437 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:34:49" (1/1) ... [2024-10-17 04:34:49,437 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:34:49" (1/1) ... [2024-10-17 04:34:49,446 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:34:49" (1/1) ... [2024-10-17 04:34:49,454 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:34:49" (1/1) ... [2024-10-17 04:34:49,457 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:34:49" (1/1) ... [2024-10-17 04:34:49,461 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:34:49" (1/1) ... [2024-10-17 04:34:49,465 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-17 04:34:49,466 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-17 04:34:49,466 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-17 04:34:49,466 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-17 04:34:49,467 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:34:49" (1/1) ... [2024-10-17 04:34:49,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-17 04:34:49,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 04:34:49,502 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-17 04:34:49,505 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-17 04:34:49,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-17 04:34:49,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-17 04:34:49,546 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-17 04:34:49,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-17 04:34:49,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-17 04:34:49,546 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-17 04:34:49,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-17 04:34:49,546 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-17 04:34:49,546 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-17 04:34:49,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-17 04:34:49,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-17 04:34:49,547 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-17 04:34:49,549 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-17 04:34:49,673 INFO L238 CfgBuilder]: Building ICFG [2024-10-17 04:34:49,675 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-17 04:34:50,026 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-17 04:34:50,027 INFO L287 CfgBuilder]: Performing block encoding [2024-10-17 04:34:50,219 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-17 04:34:50,219 INFO L314 CfgBuilder]: Removed 35 assume(true) statements. [2024-10-17 04:34:50,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 04:34:50 BoogieIcfgContainer [2024-10-17 04:34:50,220 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-17 04:34:50,222 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-17 04:34:50,222 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-17 04:34:50,226 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-17 04:34:50,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.10 04:34:48" (1/3) ... [2024-10-17 04:34:50,227 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24feaf01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 04:34:50, skipping insertion in model container [2024-10-17 04:34:50,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 04:34:49" (2/3) ... [2024-10-17 04:34:50,228 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24feaf01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 04:34:50, skipping insertion in model container [2024-10-17 04:34:50,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 04:34:50" (3/3) ... [2024-10-17 04:34:50,229 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_71-funloop_racing.i [2024-10-17 04:34:50,242 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-17 04:34:50,242 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-17 04:34:50,242 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-17 04:34:50,284 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-17 04:34:50,330 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-17 04:34:50,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-17 04:34:50,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 04:34:50,333 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-17 04:34:50,334 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-17 04:34:50,417 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-17 04:34:50,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 04:34:50,445 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2024-10-17 04:34:50,451 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;@43795555, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR_WITH_CONTEXT, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-17 04:34:50,451 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-17 04:34:50,954 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 04:34:50,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 04:34:50,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1799044287, now seen corresponding path program 1 times [2024-10-17 04:34:50,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 04:34:50,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557049376] [2024-10-17 04:34:50,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:34:50,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 04:34:51,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 04:34:51,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 04:34:51,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 04:34:51,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557049376] [2024-10-17 04:34:51,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557049376] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 04:34:51,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 04:34:51,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-17 04:34:51,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809568565] [2024-10-17 04:34:51,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 04:34:51,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-17 04:34:51,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 04:34:51,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-17 04:34:51,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-17 04:34:51,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:34:51,267 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 04:34:51,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 04:34:51,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:34:51,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:34:51,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-17 04:34:51,334 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 04:34:51,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 04:34:51,335 INFO L85 PathProgramCache]: Analyzing trace with hash -712731850, now seen corresponding path program 1 times [2024-10-17 04:34:51,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 04:34:51,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394273815] [2024-10-17 04:34:51,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:34:51,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 04:34:51,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 04:34:51,488 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 04:34:51,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 04:34:51,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394273815] [2024-10-17 04:34:51,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394273815] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 04:34:51,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106324837] [2024-10-17 04:34:51,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:34:51,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 04:34:51,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 04:34:51,507 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-17 04:34:51,509 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-17 04:34:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 04:34:51,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-17 04:34:51,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 04:34:51,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 04:34:51,641 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 04:34:51,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 04:34:51,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106324837] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 04:34:51,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 04:34:51,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-17 04:34:51,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668550476] [2024-10-17 04:34:51,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 04:34:51,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-17 04:34:51,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 04:34:51,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-17 04:34:51,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-17 04:34:51,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:34:51,670 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 04:34:51,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 04:34:51,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:34:51,671 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:34:51,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:34:51,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:34:51,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-17 04:34:51,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-10-17 04:34:51,946 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 04:34:51,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 04:34:51,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1372350335, now seen corresponding path program 2 times [2024-10-17 04:34:51,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 04:34:51,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879794002] [2024-10-17 04:34:51,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:34:51,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 04:34:51,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 04:34:52,124 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 04:34:52,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 04:34:52,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879794002] [2024-10-17 04:34:52,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879794002] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 04:34:52,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388051437] [2024-10-17 04:34:52,125 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-17 04:34:52,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 04:34:52,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 04:34:52,127 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-17 04:34:52,129 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-17 04:34:52,217 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-17 04:34:52,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 04:34:52,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-17 04:34:52,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 04:34:52,237 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 04:34:52,241 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 04:34:52,307 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 04:34:52,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388051437] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 04:34:52,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 04:34:52,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-17 04:34:52,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856535444] [2024-10-17 04:34:52,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 04:34:52,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-17 04:34:52,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 04:34:52,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-17 04:34:52,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-17 04:34:52,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:34:52,313 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 04:34:52,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 04:34:52,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:34:52,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:34:52,313 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:34:52,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:34:52,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:34:52,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 04:34:52,423 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-17 04:34:52,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 04:34:52,609 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 04:34:52,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 04:34:52,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1114166175, now seen corresponding path program 3 times [2024-10-17 04:34:52,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 04:34:52,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980176788] [2024-10-17 04:34:52,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:34:52,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 04:34:52,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 04:34:52,994 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 04:34:52,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 04:34:52,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980176788] [2024-10-17 04:34:52,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980176788] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 04:34:52,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534017702] [2024-10-17 04:34:52,995 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-17 04:34:52,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 04:34:52,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 04:34:52,997 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-17 04:34:52,998 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-17 04:34:53,093 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-17 04:34:53,094 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 04:34:53,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-17 04:34:53,097 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 04:34:53,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-10-17 04:34:53,215 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-17 04:34:53,216 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-17 04:34:53,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2024-10-17 04:34:53,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2024-10-17 04:34:53,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2024-10-17 04:34:53,392 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 04:34:53,392 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 04:35:01,468 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_140 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_140) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2024-10-17 04:35:03,492 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_140 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_140) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2024-10-17 04:35:03,637 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2024-10-17 04:35:03,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534017702] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 04:35:03,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 04:35:03,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-10-17 04:35:03,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438745697] [2024-10-17 04:35:03,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 04:35:03,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-17 04:35:03,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 04:35:03,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-17 04:35:03,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=121, Unknown=5, NotChecked=46, Total=210 [2024-10-17 04:35:03,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:35:03,642 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 04:35:03,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 14 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-17 04:35:03,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:35:03,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:35:03,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-17 04:35:03,642 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:35:03,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:35:03,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:35:03,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 04:35:03,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:35:03,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-17 04:35:04,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 04:35:04,042 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 04:35:04,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 04:35:04,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1640418877, now seen corresponding path program 1 times [2024-10-17 04:35:04,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 04:35:04,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961101555] [2024-10-17 04:35:04,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:35:04,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 04:35:04,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 04:35:04,800 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 04:35:04,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 04:35:04,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961101555] [2024-10-17 04:35:04,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961101555] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 04:35:04,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060789483] [2024-10-17 04:35:04,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:35:04,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 04:35:04,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 04:35:04,803 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-17 04:35:04,804 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-17 04:35:04,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 04:35:04,922 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-17 04:35:04,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 04:35:04,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-10-17 04:35:05,011 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-17 04:35:05,011 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-17 04:35:05,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2024-10-17 04:35:05,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2024-10-17 04:35:05,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2024-10-17 04:35:05,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2024-10-17 04:35:05,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2024-10-17 04:35:05,363 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 04:35:05,363 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 04:35:15,458 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_26| Int)) (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_26|) 0)) is different from false [2024-10-17 04:35:21,522 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_237 (Array Int Int)) (|t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| Int)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_237) |c_~#cache~0.base|) |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 0)) is different from false [2024-10-17 04:35:21,635 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 56 trivial. 4 not checked. [2024-10-17 04:35:21,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060789483] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 04:35:21,636 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 04:35:21,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 7] total 22 [2024-10-17 04:35:21,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571936314] [2024-10-17 04:35:21,636 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 04:35:21,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-17 04:35:21,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 04:35:21,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-17 04:35:21,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=325, Unknown=5, NotChecked=78, Total=506 [2024-10-17 04:35:21,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:35:21,638 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 04:35:21,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 4.739130434782608) internal successors, (109), 22 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-17 04:35:21,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:35:21,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:35:21,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-17 04:35:21,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:35:21,638 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:35:23,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:35:23,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:35:23,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 04:35:23,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 04:35:23,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-17 04:35:23,936 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-17 04:35:24,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 04:35:24,123 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 04:35:24,218 INFO L349 Elim1Store]: treesize reduction 7, result has 36.4 percent of original size [2024-10-17 04:35:24,218 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 29 treesize of output 25 [2024-10-17 04:35:24,247 INFO L85 PathProgramCache]: Analyzing trace with hash 88156749, now seen corresponding path program 1 times [2024-10-17 04:35:24,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:35:24,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 04:35:24,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 04:35:24,358 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-10-17 04:35:24,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:35:24,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 04:35:24,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 04:35:24,449 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2024-10-17 04:35:24,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-17 04:35:24,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-17 04:35:24,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-17 04:35:24,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:35:24,451 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 04:35:24,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 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-17 04:35:24,452 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:35:24,452 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:35:24,452 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-17 04:35:24,452 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-17 04:35:24,452 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-17 04:35:24,452 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:35:24,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:35:24,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:35:24,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 04:35:24,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 04:35:24,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-17 04:35:24,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-17 04:35:24,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,SelfDestructingSolverStorable5 [2024-10-17 04:35:24,731 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 04:35:24,910 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-17 04:35:24,911 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 1291 treesize of output 1221 [2024-10-17 04:35:25,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1377925673, now seen corresponding path program 1 times [2024-10-17 04:35:25,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:35:25,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 04:35:25,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 04:35:25,434 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 04:35:25,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:35:25,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 04:35:25,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 04:35:25,691 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 04:35:25,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-17 04:35:25,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-17 04:35:25,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-17 04:35:25,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:35:25,692 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 04:35:25,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 04:35:25,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:35:25,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:35:25,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-17 04:35:25,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-17 04:35:25,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-17 04:35:25,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-17 04:35:25,693 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:35:25,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:35:25,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:35:25,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 04:35:25,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 04:35:25,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-17 04:35:25,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-17 04:35:25,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-17 04:35:25,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable7 [2024-10-17 04:35:25,801 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 04:35:25,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 04:35:25,827 INFO L85 PathProgramCache]: Analyzing trace with hash 235507773, now seen corresponding path program 2 times [2024-10-17 04:35:25,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 04:35:25,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169046721] [2024-10-17 04:35:25,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:35:25,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 04:35:25,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 04:35:26,402 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 04:35:26,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 04:35:26,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169046721] [2024-10-17 04:35:26,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169046721] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 04:35:26,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938092450] [2024-10-17 04:35:26,402 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-17 04:35:26,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 04:35:26,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 04:35:26,404 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-17 04:35:26,405 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-17 04:35:26,527 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-17 04:35:26,527 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 04:35:26,529 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-10-17 04:35:26,532 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 04:35:26,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-10-17 04:35:26,632 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-17 04:35:26,633 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-17 04:35:26,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2024-10-17 04:35:26,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2024-10-17 04:35:26,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2024-10-17 04:35:26,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 15 [2024-10-17 04:35:29,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2024-10-17 04:35:29,469 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 04:35:29,470 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 04:35:41,362 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_37| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_37| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_37|) 0))) is different from false [2024-10-17 04:35:42,993 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_37| Int) (v_ArrVal_572 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_37| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_572) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_37|) 0))) is different from false [2024-10-17 04:35:44,567 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_37| Int) (v_ArrVal_572 (Array Int Int))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_37| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= 0 (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_572) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_37|)))) is different from false [2024-10-17 04:35:46,617 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_37| Int) (v_ArrVal_572 (Array Int Int)) (v_ArrVal_569 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_37| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ v_ArrVal_569 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_572) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_37|) 0))) is different from false [2024-10-17 04:35:48,700 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_37| Int) (v_ArrVal_572 (Array Int Int)) (v_ArrVal_569 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39| Int)) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39| (+ v_ArrVal_569 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_572) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_37|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_37| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39| 28)))) is different from false [2024-10-17 04:35:50,732 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_568 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_37| Int) (v_ArrVal_572 (Array Int Int)) (v_ArrVal_569 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_37| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39| 28)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_568) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_39| (+ v_ArrVal_569 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_572) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_37|) 0))) is different from false [2024-10-17 04:35:50,908 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 7 not checked. [2024-10-17 04:35:50,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938092450] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 04:35:50,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 04:35:50,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 26 [2024-10-17 04:35:50,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821156035] [2024-10-17 04:35:50,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 04:35:50,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-17 04:35:50,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 04:35:50,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-17 04:35:50,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=331, Unknown=14, NotChecked=258, Total=702 [2024-10-17 04:35:50,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:35:50,911 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 04:35:50,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.8518518518518516) internal successors, (104), 26 states have internal predecessors, (104), 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-17 04:35:50,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:35:50,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:35:50,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-17 04:35:50,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-17 04:35:50,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-17 04:35:50,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-17 04:35:50,912 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-17 04:35:50,913 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:35:58,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:35:58,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:35:58,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 04:35:58,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 04:35:58,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-17 04:35:58,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-17 04:35:58,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-17 04:35:58,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-17 04:35:58,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-17 04:35:58,433 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,SelfDestructingSolverStorable9 [2024-10-17 04:35:58,434 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 04:35:58,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 04:35:58,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1677153127, now seen corresponding path program 3 times [2024-10-17 04:35:58,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 04:35:58,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600987246] [2024-10-17 04:35:58,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:35:58,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 04:35:58,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 04:36:00,070 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 04:36:00,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 04:36:00,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600987246] [2024-10-17 04:36:00,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600987246] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 04:36:00,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099219962] [2024-10-17 04:36:00,071 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-17 04:36:00,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 04:36:00,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 04:36:00,072 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-17 04:36:00,074 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-17 04:36:00,255 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-17 04:36:00,255 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 04:36:00,258 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-10-17 04:36:00,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 04:36:00,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-10-17 04:36:00,472 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-10-17 04:36:00,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2024-10-17 04:36:00,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2024-10-17 04:36:00,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2024-10-17 04:36:00,888 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 31 treesize of output 22 [2024-10-17 04:36:03,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2024-10-17 04:36:07,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 57 [2024-10-17 04:36:15,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 61 [2024-10-17 04:36:38,721 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 80 treesize of output 66 [2024-10-17 04:36:38,792 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 04:36:38,792 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 04:37:00,945 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)) (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43|) 0))) is different from false [2024-10-17 04:37:02,991 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_707 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_707) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-17 04:37:05,006 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_707 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_707) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-17 04:37:07,046 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_707 (Array Int Int)) (v_ArrVal_704 Int)) (or (= (select (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ v_ArrVal_704 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_707) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-17 04:37:09,110 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_707 (Array Int Int)) (v_ArrVal_704 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int)) (let ((.cse0 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| (+ .cse0 28 |c_~#cache~0.offset|)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ v_ArrVal_704 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_707) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43|) 0) (< (+ .cse0 |c_~#cache~0.offset|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|)))) is different from false [2024-10-17 04:37:09,141 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_31| Int)) (or (< |v_t_funThread1of1ForFork0_~i~0#1_31| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_707 (Array Int Int)) (v_ArrVal_704 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_31| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| (+ 28 |c_~#cache~0.offset| .cse0)) (< (+ |c_~#cache~0.offset| .cse0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ v_ArrVal_704 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_707) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43|) 0)))))) is different from false [2024-10-17 04:37:11,298 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_31| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_707 (Array Int Int)) (v_ArrVal_704 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int)) (let ((.cse2 (* |v_t_funThread1of1ForFork0_~i~0#1_31| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_31| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))))) (store .cse0 |c_~#cache~0.base| (store (select .cse0 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ v_ArrVal_704 (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_707) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| (+ 28 |c_~#cache~0.offset| .cse2)) (< (+ |c_~#cache~0.offset| .cse2) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|)))) is different from false [2024-10-17 04:37:13,392 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_31| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (v_ArrVal_707 (Array Int Int)) (v_ArrVal_704 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int) (v_ArrVal_701 Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_31| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_31| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| (+ 28 |c_~#cache~0.offset| .cse0)) (< (+ |c_~#cache~0.offset| .cse0) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45|) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ v_ArrVal_701 (- 1)))))) (store .cse1 |c_~#cache~0.base| (store (select .cse1 |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ v_ArrVal_704 (- 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_707) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43|) 0)))) is different from false [2024-10-17 04:37:15,508 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (v_ArrVal_707 (Array Int Int)) (v_ArrVal_704 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int) (v_ArrVal_701 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47|)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| (+ v_ArrVal_701 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ v_ArrVal_704 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_707) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| 28)))) is different from false [2024-10-17 04:37:17,570 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_700 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| Int) (v_ArrVal_707 (Array Int Int)) (v_ArrVal_704 Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| Int) (v_ArrVal_701 Int)) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| (+ 56 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43| (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| 28)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_700) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_47| (+ v_ArrVal_701 (- 1))) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_45| (+ v_ArrVal_704 (- 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_707) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_43|) 0))) is different from false [2024-10-17 04:37:17,897 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 32 not checked. [2024-10-17 04:37:17,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099219962] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 04:37:17,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 04:37:17,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 15] total 39 [2024-10-17 04:37:17,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327987777] [2024-10-17 04:37:17,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 04:37:17,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-10-17 04:37:17,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 04:37:17,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-10-17 04:37:17,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=695, Unknown=36, NotChecked=650, Total=1560 [2024-10-17 04:37:17,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:37:17,901 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 04:37:17,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 4.125) internal successors, (165), 39 states have internal predecessors, (165), 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-17 04:37:17,902 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:37:17,902 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:37:17,902 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-17 04:37:17,902 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-17 04:37:17,902 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-17 04:37:17,902 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-17 04:37:17,902 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-17 04:37:17,902 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-10-17 04:37:17,902 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:37:19,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:37:21,355 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-17 04:37:27,162 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-17 04:37:29,201 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-17 04:37:34,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:37:36,545 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-17 04:37:38,557 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-17 04:37:40,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-17 04:38:01,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:38:02,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:38:04,965 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-17 04:38:06,975 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-17 04:38:29,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:38:34,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:38:34,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:38:34,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 04:38:34,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 04:38:34,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-17 04:38:34,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-17 04:38:34,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-17 04:38:34,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-17 04:38:34,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-17 04:38:34,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-17 04:38:34,771 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,SelfDestructingSolverStorable10 [2024-10-17 04:38:34,772 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 04:38:34,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 04:38:34,791 INFO L85 PathProgramCache]: Analyzing trace with hash -241567285, now seen corresponding path program 4 times [2024-10-17 04:38:34,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 04:38:34,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134984033] [2024-10-17 04:38:34,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:38:34,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 04:38:34,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 04:38:57,347 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 04:38:57,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 04:38:57,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134984033] [2024-10-17 04:38:57,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134984033] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 04:38:57,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639985020] [2024-10-17 04:38:57,347 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-17 04:38:57,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 04:38:57,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 04:38:57,349 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-17 04:38:57,350 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-17 04:38:57,721 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-17 04:38:57,722 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 04:38:57,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 82 conjuncts are in the unsatisfiable core [2024-10-17 04:38:57,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 04:38:57,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2024-10-17 04:38:57,829 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-17 04:38:57,829 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-17 04:38:57,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 10 [2024-10-17 04:38:58,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2024-10-17 04:38:58,154 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 31 treesize of output 22 [2024-10-17 04:39:01,651 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 31 treesize of output 22 [2024-10-17 04:39:01,884 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 55 treesize of output 46 [2024-10-17 04:39:08,550 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 31 treesize of output 22 [2024-10-17 04:39:08,711 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 55 treesize of output 46 [2024-10-17 04:39:15,334 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 31 treesize of output 22 [2024-10-17 04:39:15,439 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 30 treesize of output 23 [2024-10-17 04:39:15,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 46 [2024-10-17 04:39:28,456 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 52 treesize of output 44 [2024-10-17 04:39:28,522 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 50 proven. 92 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 04:39:28,523 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 04:40:06,710 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int)) (or (= (select (select |c_#memory_int| |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-17 04:40:08,762 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int)) (or (= (select (select (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-17 04:40:10,811 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_912 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int)) (or (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_912))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse1 (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-17 04:40:10,825 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_912 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_912) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse0 (select (store (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse1 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse1 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_912) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (select .cse0 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|) (- 1))))) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) 28 |c_~#cache~0.offset|)))) is different from false [2024-10-17 04:40:12,893 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_912 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int)) (let ((.cse2 (* |c_t_funThread1of1ForFork0_~i~0#1| 28))) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse1 (+ .cse2 |c_~#cache~0.offset|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_912) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| (+ .cse2 28 |c_~#cache~0.offset|))))) is different from false [2024-10-17 04:40:14,909 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_39| Int)) (or (< |v_t_funThread1of1ForFork0_~i~0#1_39| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (forall ((v_ArrVal_912 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_39| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| (+ .cse0 28 |c_~#cache~0.offset|)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse1 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse2 (+ .cse0 |c_~#cache~0.offset|))) (store .cse1 .cse2 (+ (select .cse1 .cse2) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_912) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) 0)))))) is different from false [2024-10-17 04:40:16,983 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_912 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (|v_t_funThread1of1ForFork0_~i~0#1_39| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_39| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| (+ .cse0 28 |c_~#cache~0.offset|)) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse4 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))))) (store .cse1 |c_~#cache~0.base| (let ((.cse2 (select .cse1 |c_~#cache~0.base|)) (.cse3 (+ .cse0 |c_~#cache~0.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_912) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_39| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2024-10-17 04:40:19,060 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_912 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (|v_t_funThread1of1ForFork0_~i~0#1_39| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_39| 28))) (or (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| (+ .cse0 28 |c_~#cache~0.offset|)) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse4 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse4 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))))) (store .cse1 |c_~#cache~0.base| (let ((.cse2 (select .cse1 |c_~#cache~0.base|)) (.cse3 (+ .cse0 |c_~#cache~0.offset|))) (store .cse2 .cse3 (+ 1 (select .cse2 .cse3)))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_912) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_39| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2024-10-17 04:40:19,158 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_912 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (|v_t_funThread1of1ForFork0_~i~0#1_39| Int)) (let ((.cse3 (* |v_t_funThread1of1ForFork0_~i~0#1_39| 28))) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse2 (+ .cse3 |c_~#cache~0.offset|))) (store (let ((.cse1 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (store .cse0 .cse1 (select .cse0 .cse1))) .cse2 (+ (select .cse0 .cse2) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_912) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| (+ .cse3 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_39| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2024-10-17 04:40:21,183 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_40| Int)) (or (forall ((v_ArrVal_912 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (|v_t_funThread1of1ForFork0_~i~0#1_39| Int)) (let ((.cse3 (* |v_t_funThread1of1ForFork0_~i~0#1_39| 28))) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse2 (+ .cse3 |c_~#cache~0.offset|))) (store (let ((.cse1 (+ |c_~#cache~0.offset| (* |v_t_funThread1of1ForFork0_~i~0#1_40| 28)))) (store .cse0 .cse1 (select .cse0 .cse1))) .cse2 (+ (select .cse0 .cse2) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_912) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| (+ .cse3 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_39| (+ |v_t_funThread1of1ForFork0_~i~0#1_40| 1))))) (< |v_t_funThread1of1ForFork0_~i~0#1_40| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)))) is different from false [2024-10-17 04:40:23,323 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_40| Int) (v_ArrVal_912 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (|v_t_funThread1of1ForFork0_~i~0#1_39| Int)) (let ((.cse4 (* |v_t_funThread1of1ForFork0_~i~0#1_39| 28))) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse5 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))))) (store .cse0 |c_~#cache~0.base| (let ((.cse1 (select .cse0 |c_~#cache~0.base|)) (.cse3 (+ .cse4 |c_~#cache~0.offset|))) (store (let ((.cse2 (+ |c_~#cache~0.offset| (* |v_t_funThread1of1ForFork0_~i~0#1_40| 28)))) (store .cse1 .cse2 (select .cse1 .cse2))) .cse3 (+ (select .cse1 .cse3) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_912) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| (+ .cse4 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_39| (+ |v_t_funThread1of1ForFork0_~i~0#1_40| 1)) (< |v_t_funThread1of1ForFork0_~i~0#1_40| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2024-10-17 04:40:25,422 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_40| Int) (v_ArrVal_912 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (|v_t_funThread1of1ForFork0_~i~0#1_39| Int)) (let ((.cse4 (* |v_t_funThread1of1ForFork0_~i~0#1_39| 28))) (or (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse5 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (select .cse5 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)))))) (store .cse0 |c_~#cache~0.base| (let ((.cse1 (select .cse0 |c_~#cache~0.base|)) (.cse3 (+ .cse4 |c_~#cache~0.offset|))) (store (let ((.cse2 (+ |c_~#cache~0.offset| (* |v_t_funThread1of1ForFork0_~i~0#1_40| 28)))) (store .cse1 .cse2 (select .cse1 .cse2))) .cse3 (+ 1 (select .cse1 .cse3)))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_912) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| (+ .cse4 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_39| (+ |v_t_funThread1of1ForFork0_~i~0#1_40| 1)) (< |v_t_funThread1of1ForFork0_~i~0#1_40| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2024-10-17 04:40:25,548 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_40| Int) (v_ArrVal_912 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (|v_t_funThread1of1ForFork0_~i~0#1_39| Int)) (let ((.cse4 (* |v_t_funThread1of1ForFork0_~i~0#1_39| 28))) (or (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse0 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse3 (+ .cse4 |c_~#cache~0.offset|))) (store (let ((.cse2 (+ |c_~#cache~0.offset| (* |v_t_funThread1of1ForFork0_~i~0#1_40| 28)))) (store (let ((.cse1 (+ (* |c_t_funThread1of1ForFork0_~i~0#1| 28) |c_~#cache~0.offset|))) (store .cse0 .cse1 (select .cse0 .cse1))) .cse2 (select .cse0 .cse2))) .cse3 (+ (select .cse0 .cse3) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_912) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) 0) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| (+ .cse4 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_39| (+ |v_t_funThread1of1ForFork0_~i~0#1_40| 1)) (< |v_t_funThread1of1ForFork0_~i~0#1_40| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1))))) is different from false [2024-10-17 04:40:27,573 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int)) (or (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (forall ((|v_t_funThread1of1ForFork0_~i~0#1_40| Int) (v_ArrVal_912 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (|v_t_funThread1of1ForFork0_~i~0#1_39| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_39| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_40| (+ |v_t_funThread1of1ForFork0_~i~0#1_41| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| (+ .cse0 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_39| (+ |v_t_funThread1of1ForFork0_~i~0#1_40| 1)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse1 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse4 (+ .cse0 |c_~#cache~0.offset|))) (store (let ((.cse3 (+ |c_~#cache~0.offset| (* |v_t_funThread1of1ForFork0_~i~0#1_40| 28)))) (store (let ((.cse2 (+ |c_~#cache~0.offset| (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28)))) (store .cse1 .cse2 (select .cse1 .cse2))) .cse3 (select .cse1 .cse3))) .cse4 (+ (select .cse1 .cse4) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_912) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) 0)))))) is different from false [2024-10-17 04:40:29,766 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (|v_t_funThread1of1ForFork0_~i~0#1_40| Int) (v_ArrVal_912 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (|v_t_funThread1of1ForFork0_~i~0#1_39| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_39| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_40| (+ |v_t_funThread1of1ForFork0_~i~0#1_41| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| (+ .cse0 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (let ((.cse6 (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|))) (store .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ (- 1) (select .cse6 |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|))))))) (store .cse1 |c_~#cache~0.base| (let ((.cse2 (select .cse1 |c_~#cache~0.base|)) (.cse5 (+ .cse0 |c_~#cache~0.offset|))) (store (let ((.cse4 (+ |c_~#cache~0.offset| (* |v_t_funThread1of1ForFork0_~i~0#1_40| 28)))) (store (let ((.cse3 (+ |c_~#cache~0.offset| (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28)))) (store .cse2 .cse3 (select .cse2 .cse3))) .cse4 (select .cse2 .cse4))) .cse5 (+ (select .cse2 .cse5) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_912) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) 0) (< |v_t_funThread1of1ForFork0_~i~0#1_39| (+ |v_t_funThread1of1ForFork0_~i~0#1_40| 1))))) is different from false [2024-10-17 04:40:31,895 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (|v_t_funThread1of1ForFork0_~i~0#1_40| Int) (v_ArrVal_912 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_901 Int) (|v_t_funThread1of1ForFork0_~i~0#1_39| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_39| 28))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_40| (+ |v_t_funThread1of1ForFork0_~i~0#1_41| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| (+ .cse0 28 |c_~#cache~0.offset|)) (< |v_t_funThread1of1ForFork0_~i~0#1_41| (+ |c_t_funThread1of1ForFork0_~i~0#1| 1)) (< |v_t_funThread1of1ForFork0_~i~0#1_39| (+ |v_t_funThread1of1ForFork0_~i~0#1_40| 1)) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base| (store (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) |c_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset| (+ v_ArrVal_901 (- 1)))))) (store .cse1 |c_~#cache~0.base| (let ((.cse2 (select .cse1 |c_~#cache~0.base|)) (.cse5 (+ .cse0 |c_~#cache~0.offset|))) (store (let ((.cse4 (+ |c_~#cache~0.offset| (* |v_t_funThread1of1ForFork0_~i~0#1_40| 28)))) (store (let ((.cse3 (+ |c_~#cache~0.offset| (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28)))) (store .cse2 .cse3 (select .cse2 .cse3))) .cse4 (select .cse2 .cse4))) .cse5 (+ (select .cse2 .cse5) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_912) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) 0)))) is different from false [2024-10-17 04:40:34,087 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (|v_t_funThread1of1ForFork0_~i~0#1_40| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60| Int) (v_ArrVal_912 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_901 Int) (|~#cache~0.offset| Int) (|v_t_funThread1of1ForFork0_~i~0#1_39| Int)) (let ((.cse0 (* |v_t_funThread1of1ForFork0_~i~0#1_39| 28)) (.cse2 (+ |~#cache~0.offset| (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28)))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_40| (+ |v_t_funThread1of1ForFork0_~i~0#1_41| 1)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| (+ |~#cache~0.offset| .cse0 28)) (< |v_t_funThread1of1ForFork0_~i~0#1_39| (+ |v_t_funThread1of1ForFork0_~i~0#1_40| 1)) (= (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse1 (select |c_#memory_int| |c_~#cache~0.base|)) (.cse4 (+ |~#cache~0.offset| .cse0))) (store (let ((.cse3 (+ |~#cache~0.offset| (* |v_t_funThread1of1ForFork0_~i~0#1_40| 28)))) (store (store (store .cse1 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60| (+ v_ArrVal_901 (- 1))) .cse2 (select .cse1 .cse2)) .cse3 (select .cse1 .cse3))) .cse4 (+ 1 (select .cse1 .cse4))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_912) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|) 0) (< .cse2 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60| 28))))) is different from false [2024-10-17 04:40:36,199 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of1ForFork0_~i~0#1_41| Int) (|v_t_funThread1of1ForFork0_~i~0#1_40| Int) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60| Int) (v_ArrVal_899 (Array Int Int)) (v_ArrVal_912 (Array Int Int)) (|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| Int) (v_ArrVal_901 Int) (|~#cache~0.offset| Int) (|v_t_funThread1of1ForFork0_~i~0#1_39| Int)) (let ((.cse4 (* |v_t_funThread1of1ForFork0_~i~0#1_39| 28)) (.cse1 (+ |~#cache~0.offset| (* |v_t_funThread1of1ForFork0_~i~0#1_41| 28)))) (or (< |v_t_funThread1of1ForFork0_~i~0#1_40| (+ |v_t_funThread1of1ForFork0_~i~0#1_41| 1)) (= 0 (select (select (store (store |c_#memory_int| |c_~#cache~0.base| (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_899) |c_~#cache~0.base|)) (.cse3 (+ |~#cache~0.offset| .cse4))) (store (let ((.cse2 (+ |~#cache~0.offset| (* |v_t_funThread1of1ForFork0_~i~0#1_40| 28)))) (store (store (store .cse0 |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60| (+ v_ArrVal_901 (- 1))) .cse1 (select .cse0 .cse1)) .cse2 (select .cse0 .cse2))) .cse3 (+ (select .cse0 .cse3) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_912) |c_~#cache~0.base|) |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52|)) (< |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_52| (+ |~#cache~0.offset| .cse4 28)) (< |v_t_funThread1of1ForFork0_~i~0#1_39| (+ |v_t_funThread1of1ForFork0_~i~0#1_40| 1)) (< .cse1 (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_60| 28))))) is different from false [2024-10-17 04:40:36,742 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 142 not checked. [2024-10-17 04:40:36,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639985020] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 04:40:36,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 04:40:36,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 23] total 60 [2024-10-17 04:40:36,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147314243] [2024-10-17 04:40:36,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 04:40:36,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2024-10-17 04:40:36,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 04:40:36,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2024-10-17 04:40:36,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=405, Invalid=1428, Unknown=45, NotChecked=1782, Total=3660 [2024-10-17 04:40:36,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:40:36,746 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 04:40:36,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 4.639344262295082) internal successors, (283), 60 states have internal predecessors, (283), 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-17 04:40:36,747 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:40:36,747 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:40:36,747 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-17 04:40:36,747 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-17 04:40:36,747 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-10-17 04:40:36,747 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-17 04:40:36,747 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2024-10-17 04:40:36,747 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2024-10-17 04:40:36,747 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. [2024-10-17 04:40:36,747 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:40:38,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:40:42,819 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-17 04:40:44,845 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-17 04:40:48,945 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-17 04:40:52,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:40:54,548 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-17 04:40:56,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:40:57,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:40:58,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:41:13,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:41:15,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:41:17,160 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-17 04:41:18,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:41:20,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:41:21,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:41:23,522 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-17 04:41:25,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-17 04:41:31,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:41:35,232 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-17 04:41:37,252 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-17 04:41:39,273 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-17 04:41:41,286 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-17 04:41:43,295 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-17 04:41:45,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 [0] [2024-10-17 04:41:51,314 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-17 04:41:53,325 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-17 04:41:55,329 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-17 04:41:57,335 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-17 04:41:59,343 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-17 04:42:01,354 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-17 04:42:03,361 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-17 04:42:05,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:42:07,375 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-17 04:42:09,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:42:11,429 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 [0] [2024-10-17 04:42:13,444 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-17 04:42:15,450 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-17 04:42:17,454 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-17 04:42:19,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-17 04:42:21,473 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-17 04:42:23,618 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-17 04:42:25,657 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-17 04:42:31,736 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-17 04:42:33,749 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-17 04:42:35,757 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-17 04:42:37,761 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-17 04:42:39,765 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-17 04:42:41,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:42:43,775 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-17 04:42:45,779 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-17 04:42:47,786 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-17 04:42:49,792 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-17 04:42:51,799 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-17 04:42:53,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-17 04:43:14,335 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-17 04:43:16,343 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-17 04:43:30,639 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-17 04:43:32,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:43:34,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:43:36,689 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-17 04:43:50,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:43:52,774 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-17 04:43:54,785 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-17 04:43:56,797 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-17 04:43:58,807 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-17 04:44:00,825 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-17 04:44:02,832 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-17 04:44:04,836 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-17 04:44:06,840 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-17 04:44:08,845 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-17 04:44:10,851 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-17 04:44:12,857 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-17 04:44:14,866 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-17 04:44:16,880 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-17 04:44:41,679 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-17 04:44:41,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:44:41,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:44:41,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 04:44:41,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-17 04:44:41,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-17 04:44:41,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-17 04:44:41,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-17 04:44:41,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-17 04:44:41,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-17 04:44:41,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-17 04:44:41,729 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-17 04:44:41,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-17 04:44:41,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 04:44:41,935 INFO L414 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1] [2024-10-17 04:44:41,937 INFO L312 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was SAFE (1/2) [2024-10-17 04:44:41,941 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-17 04:44:41,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-17 04:44:41,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 04:44:41,943 INFO L229 MonitoredProcess]: Starting monitored process 10 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-17 04:44:41,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (10)] Waiting until timeout for monitored process [2024-10-17 04:44:41,990 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-17 04:44:41,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 04:44:41,991 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-17 04:44:41,991 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;@43795555, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR_WITH_CONTEXT, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-17 04:44:41,991 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-10-17 04:44:42,146 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-17 04:44:42,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 04:44:42,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1200789139, now seen corresponding path program 1 times [2024-10-17 04:44:42,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 04:44:42,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539882786] [2024-10-17 04:44:42,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:44:42,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 04:44:42,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 04:44:42,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 04:44:42,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 04:44:42,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539882786] [2024-10-17 04:44:42,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539882786] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 04:44:42,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 04:44:42,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-17 04:44:42,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926427494] [2024-10-17 04:44:42,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 04:44:42,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-17 04:44:42,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 04:44:42,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-17 04:44:42,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-17 04:44:42,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:44:42,173 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 04:44:42,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 04:44:42,173 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:44:42,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:44:42,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-17 04:44:42,207 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-17 04:44:42,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 04:44:42,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1217839688, now seen corresponding path program 1 times [2024-10-17 04:44:42,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 04:44:42,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334608811] [2024-10-17 04:44:42,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:44:42,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 04:44:42,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 04:44:42,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 04:44:42,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 04:44:42,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334608811] [2024-10-17 04:44:42,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334608811] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 04:44:42,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [929048913] [2024-10-17 04:44:42,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:44:42,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 04:44:42,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 04:44:42,242 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-17 04:44:42,243 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-17 04:44:42,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 04:44:42,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-17 04:44:42,380 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 04:44:42,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 04:44:42,394 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 04:44:42,416 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 04:44:42,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [929048913] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 04:44:42,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 04:44:42,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-17 04:44:42,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068502113] [2024-10-17 04:44:42,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 04:44:42,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-17 04:44:42,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 04:44:42,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-17 04:44:42,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-17 04:44:42,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:44:42,418 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 04:44:42,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 04:44:42,418 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:44:42,418 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:44:42,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:44:42,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:44:42,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-17 04:44:42,672 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,SelfDestructingSolverStorable13 [2024-10-17 04:44:42,673 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-17 04:44:42,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 04:44:42,674 INFO L85 PathProgramCache]: Analyzing trace with hash 2098879443, now seen corresponding path program 2 times [2024-10-17 04:44:42,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 04:44:42,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906491108] [2024-10-17 04:44:42,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:44:42,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 04:44:42,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 04:44:42,745 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 04:44:42,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 04:44:42,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906491108] [2024-10-17 04:44:42,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906491108] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 04:44:42,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562002225] [2024-10-17 04:44:42,747 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-17 04:44:42,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 04:44:42,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 04:44:42,749 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 04:44:42,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-17 04:44:42,864 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-17 04:44:42,864 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 04:44:42,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-17 04:44:42,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 04:44:42,890 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 04:44:42,891 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 04:44:42,971 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-17 04:44:42,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562002225] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 04:44:42,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 04:44:42,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-17 04:44:42,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669827351] [2024-10-17 04:44:42,972 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 04:44:42,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-17 04:44:42,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 04:44:42,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-17 04:44:42,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-17 04:44:42,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:44:42,974 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 04:44:42,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 04:44:42,974 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:44:42,974 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:44:42,974 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:44:43,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:44:43,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:44:43,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 04:44:43,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-17 04:44:43,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 04:44:43,233 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-17 04:44:43,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 04:44:43,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1949456307, now seen corresponding path program 3 times [2024-10-17 04:44:43,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 04:44:43,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866902229] [2024-10-17 04:44:43,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:44:43,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 04:44:43,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 04:44:43,245 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-17 04:44:43,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-17 04:44:43,289 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-17 04:44:43,290 INFO L332 BasicCegarLoop]: Counterexample is feasible [2024-10-17 04:44:43,290 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2024-10-17 04:44:43,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2024-10-17 04:44:43,290 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2024-10-17 04:44:43,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-17 04:44:43,295 INFO L414 BasicCegarLoop]: Path program histogram: [3, 1] [2024-10-17 04:44:43,295 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN (2/2) [2024-10-17 04:44:43,296 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-17 04:44:43,296 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-17 04:44:43,326 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-17 04:44:43,330 INFO L106 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-17 04:44:43,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-17 04:44:43,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 04:44:43,332 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-17 04:44:43,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (13)] Waiting until timeout for monitored process [2024-10-17 04:44:43,369 INFO L194 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-17 04:44:43,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 04:44:43,370 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of2ForFork0 ======== [2024-10-17 04:44:43,370 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;@43795555, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=COUNTEREXAMPLE, mConComCheckerCriterion=DEFAULT, mConComCheckerTraceCheckMode=GENERATOR_WITH_CONTEXT, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false [2024-10-17 04:44:43,370 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-17 04:44:44,098 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 04:44:44,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 04:44:44,099 INFO L85 PathProgramCache]: Analyzing trace with hash -270403670, now seen corresponding path program 1 times [2024-10-17 04:44:44,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 04:44:44,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673275688] [2024-10-17 04:44:44,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:44:44,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 04:44:44,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 04:44:44,132 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-17 04:44:44,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 04:44:44,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673275688] [2024-10-17 04:44:44,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673275688] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-17 04:44:44,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-17 04:44:44,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-17 04:44:44,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225345655] [2024-10-17 04:44:44,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-17 04:44:44,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-17 04:44:44,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 04:44:44,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-17 04:44:44,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-17 04:44:44,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:44:44,134 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 04:44:44,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 2 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 04:44:44,135 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:44:44,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:44:44,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-17 04:44:44,629 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 04:44:44,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 04:44:44,629 INFO L85 PathProgramCache]: Analyzing trace with hash 809126080, now seen corresponding path program 1 times [2024-10-17 04:44:44,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 04:44:44,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025895552] [2024-10-17 04:44:44,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:44:44,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 04:44:44,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 04:44:44,691 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-17 04:44:44,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 04:44:44,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025895552] [2024-10-17 04:44:44,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025895552] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 04:44:44,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710720315] [2024-10-17 04:44:44,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:44:44,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 04:44:44,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 04:44:44,694 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 04:44:44,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-17 04:44:44,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 04:44:44,858 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-17 04:44:44,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 04:44:44,873 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-17 04:44:44,874 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 04:44:44,898 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-17 04:44:44,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710720315] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 04:44:44,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 04:44:44,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-17 04:44:44,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418076714] [2024-10-17 04:44:44,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 04:44:44,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-17 04:44:44,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 04:44:44,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-17 04:44:44,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-17 04:44:44,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:44:44,903 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 04:44:44,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 04:44:44,903 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:44:44,903 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:44:45,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:44:45,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:44:45,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-17 04:44:45,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-17 04:44:45,244 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 04:44:45,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 04:44:45,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1521121900, now seen corresponding path program 2 times [2024-10-17 04:44:45,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 04:44:45,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690549849] [2024-10-17 04:44:45,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:44:45,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 04:44:45,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 04:44:45,379 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-17 04:44:45,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 04:44:45,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690549849] [2024-10-17 04:44:45,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690549849] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 04:44:45,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484371446] [2024-10-17 04:44:45,380 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-17 04:44:45,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 04:44:45,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 04:44:45,382 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 04:44:45,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-17 04:44:45,568 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-17 04:44:45,569 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 04:44:45,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-17 04:44:45,574 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 04:44:45,598 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-17 04:44:45,598 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 04:44:45,682 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2024-10-17 04:44:45,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484371446] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 04:44:45,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 04:44:45,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-17 04:44:45,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674356113] [2024-10-17 04:44:45,683 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 04:44:45,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-17 04:44:45,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 04:44:45,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-17 04:44:45,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-17 04:44:45,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:44:45,686 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 04:44:45,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 12 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-17 04:44:45,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:44:45,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:44:45,686 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:44:45,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:44:45,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:44:45,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 04:44:45,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-10-17 04:44:46,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 04:44:46,062 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 04:44:46,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 04:44:46,064 INFO L85 PathProgramCache]: Analyzing trace with hash 591796716, now seen corresponding path program 3 times [2024-10-17 04:44:46,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 04:44:46,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449155865] [2024-10-17 04:44:46,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:44:46,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 04:44:46,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-17 04:44:50,334 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 5 proven. 34 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 04:44:50,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-17 04:44:50,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449155865] [2024-10-17 04:44:50,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449155865] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-17 04:44:50,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2074639314] [2024-10-17 04:44:50,335 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-17 04:44:50,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 04:44:50,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-17 04:44:50,337 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-17 04:44:50,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-17 04:44:50,749 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-17 04:44:50,750 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-17 04:44:50,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-10-17 04:44:50,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-17 04:44:51,649 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-17 04:44:51,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-17 04:44:51,746 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-17 04:44:51,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-17 04:44:51,777 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-17 04:44:51,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-17 04:44:51,901 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 21 treesize of output 20 [2024-10-17 04:44:52,160 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 32 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-17 04:44:52,160 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-17 04:44:52,433 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1475 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1475))) (store .cse0 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base| (store (select .cse0 |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.base|) (+ |c_t_funThread2of2ForFork0_cache_entry_addref_~entry#1.offset| 4) 0))) |c_~#cache~0.base|) (+ 32 (* |c_t_funThread2of2ForFork0_~i~0#1| 28) |c_~#cache~0.offset|)) 0))) is different from false [2024-10-17 04:44:52,458 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-17 04:44:52,458 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 49 treesize of output 40 [2024-10-17 04:44:52,478 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-17 04:44:52,478 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 297 treesize of output 305 [2024-10-17 04:44:52,485 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 206 treesize of output 178 [2024-10-17 04:44:52,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-10-17 04:44:52,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2024-10-17 04:44:52,637 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-17 04:44:52,638 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 67 treesize of output 62 [2024-10-17 04:44:52,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-17 04:44:52,693 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 13 [2024-10-17 04:44:53,454 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 29 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 1 not checked. [2024-10-17 04:44:53,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2074639314] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-17 04:44:53,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-17 04:44:53,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12, 12] total 42 [2024-10-17 04:44:53,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175584541] [2024-10-17 04:44:53,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-17 04:44:53,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-10-17 04:44:53,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-17 04:44:53,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-10-17 04:44:53,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1532, Unknown=1, NotChecked=80, Total=1806 [2024-10-17 04:44:53,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:44:53,457 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-17 04:44:53,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 5.27906976744186) internal successors, (227), 42 states have internal predecessors, (227), 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-17 04:44:53,458 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:44:53,458 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:44:53,458 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-17 04:44:53,458 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-17 04:45:08,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-17 04:45:08,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-17 04:45:08,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-17 04:45:08,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-10-17 04:45:08,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-10-17 04:45:08,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-17 04:45:08,592 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-17 04:45:09,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-17 04:45:09,867 INFO L85 PathProgramCache]: Analyzing trace with hash -380579912, now seen corresponding path program 4 times [2024-10-17 04:45:09,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-17 04:45:09,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759906269] [2024-10-17 04:45:09,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-17 04:45:09,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-17 04:45:09,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat