./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_76-tricky_address3_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9a849f68 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_76-tricky_address3_racefree.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 53e3b4cf7a6885129025777f14c3b33a959debd694827832fbe127376cb0a5f9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-9a849f6-m [2024-10-25 15:42:00,303 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-25 15:42:00,386 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2024-10-25 15:42:00,393 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-25 15:42:00,396 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-25 15:42:00,415 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-25 15:42:00,415 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-25 15:42:00,416 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-25 15:42:00,416 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-25 15:42:00,417 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-25 15:42:00,417 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-25 15:42:00,417 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-25 15:42:00,418 INFO L153 SettingsManager]: * Use SBE=true [2024-10-25 15:42:00,418 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-25 15:42:00,419 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-25 15:42:00,419 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-25 15:42:00,419 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-25 15:42:00,419 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-25 15:42:00,420 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-25 15:42:00,420 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-25 15:42:00,420 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-25 15:42:00,421 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-25 15:42:00,421 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-25 15:42:00,421 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-25 15:42:00,422 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-25 15:42:00,422 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-25 15:42:00,422 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-25 15:42:00,423 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-25 15:42:00,423 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-25 15:42:00,423 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-25 15:42:00,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-25 15:42:00,424 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-25 15:42:00,424 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-25 15:42:00,425 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-25 15:42:00,425 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-25 15:42:00,425 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2024-10-25 15:42:00,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-25 15:42:00,426 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-25 15:42:00,426 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-10-25 15:42:00,426 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2024-10-25 15:42:00,426 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2024-10-25 15:42:00,430 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 -> 53e3b4cf7a6885129025777f14c3b33a959debd694827832fbe127376cb0a5f9 [2024-10-25 15:42:00,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-25 15:42:00,741 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-25 15:42:00,744 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-25 15:42:00,745 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-25 15:42:00,745 INFO L274 PluginConnector]: CDTParser initialized [2024-10-25 15:42:00,747 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_76-tricky_address3_racefree.i [2024-10-25 15:42:02,249 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-25 15:42:02,523 INFO L384 CDTParser]: Found 1 translation units. [2024-10-25 15:42:02,523 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_76-tricky_address3_racefree.i [2024-10-25 15:42:02,540 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c4a01474f/af1cd7ac72404badb6bf2eba24eadc7b/FLAGb27587e23 [2024-10-25 15:42:02,558 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/c4a01474f/af1cd7ac72404badb6bf2eba24eadc7b [2024-10-25 15:42:02,560 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-25 15:42:02,562 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-25 15:42:02,563 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-25 15:42:02,563 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-25 15:42:02,568 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-25 15:42:02,569 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 03:42:02" (1/1) ... [2024-10-25 15:42:02,570 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@222b0370 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:42:02, skipping insertion in model container [2024-10-25 15:42:02,570 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 03:42:02" (1/1) ... [2024-10-25 15:42:02,618 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-25 15:42:03,071 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_76-tricky_address3_racefree.i[41323,41336] [2024-10-25 15:42:03,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-25 15:42:03,163 INFO L200 MainTranslator]: Completed pre-run [2024-10-25 15:42:03,211 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_76-tricky_address3_racefree.i[41323,41336] [2024-10-25 15:42:03,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-25 15:42:03,350 INFO L204 MainTranslator]: Completed translation [2024-10-25 15:42:03,351 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:42:03 WrapperNode [2024-10-25 15:42:03,351 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-25 15:42:03,352 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-25 15:42:03,352 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-25 15:42:03,352 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-25 15:42:03,360 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:42:03" (1/1) ... [2024-10-25 15:42:03,386 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:42:03" (1/1) ... [2024-10-25 15:42:03,423 INFO L138 Inliner]: procedures = 271, calls = 109, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 275 [2024-10-25 15:42:03,424 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-25 15:42:03,424 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-25 15:42:03,425 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-25 15:42:03,425 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-25 15:42:03,435 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:42:03" (1/1) ... [2024-10-25 15:42:03,436 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:42:03" (1/1) ... [2024-10-25 15:42:03,442 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:42:03" (1/1) ... [2024-10-25 15:42:03,443 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:42:03" (1/1) ... [2024-10-25 15:42:03,460 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:42:03" (1/1) ... [2024-10-25 15:42:03,464 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:42:03" (1/1) ... [2024-10-25 15:42:03,467 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:42:03" (1/1) ... [2024-10-25 15:42:03,473 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:42:03" (1/1) ... [2024-10-25 15:42:03,480 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-25 15:42:03,481 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-25 15:42:03,481 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-25 15:42:03,481 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-25 15:42:03,483 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:42:03" (1/1) ... [2024-10-25 15:42:03,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-10-25 15:42:03,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:42:03,526 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-25 15:42:03,529 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-25 15:42:03,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-25 15:42:03,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-25 15:42:03,570 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-25 15:42:03,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-25 15:42:03,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-25 15:42:03,570 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-25 15:42:03,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-25 15:42:03,570 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-10-25 15:42:03,571 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-10-25 15:42:03,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-25 15:42:03,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-25 15:42:03,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-25 15:42:03,573 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-25 15:42:03,702 INFO L238 CfgBuilder]: Building ICFG [2024-10-25 15:42:03,704 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-25 15:42:04,108 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-25 15:42:04,108 INFO L287 CfgBuilder]: Performing block encoding [2024-10-25 15:42:04,652 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-25 15:42:04,652 INFO L314 CfgBuilder]: Removed 23 assume(true) statements. [2024-10-25 15:42:04,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 03:42:04 BoogieIcfgContainer [2024-10-25 15:42:04,654 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-25 15:42:04,656 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-25 15:42:04,657 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-25 15:42:04,660 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-25 15:42:04,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 03:42:02" (1/3) ... [2024-10-25 15:42:04,662 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@735233eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 03:42:04, skipping insertion in model container [2024-10-25 15:42:04,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:42:03" (2/3) ... [2024-10-25 15:42:04,663 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@735233eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 03:42:04, skipping insertion in model container [2024-10-25 15:42:04,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 03:42:04" (3/3) ... [2024-10-25 15:42:04,665 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_76-tricky_address3_racefree.i [2024-10-25 15:42:04,682 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-25 15:42:04,683 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-25 15:42:04,683 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-25 15:42:04,732 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-25 15:42:04,785 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:42:04,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 15:42:04,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:42:04,789 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-25 15:42:04,791 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-25 15:42:04,827 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 15:42:04,840 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of1ForFork0 ======== [2024-10-25 15:42:04,847 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;@29b8dbde, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:42:04,848 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-25 15:42:05,617 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-25 15:42:05,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:42:05,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1597334964, now seen corresponding path program 1 times [2024-10-25 15:42:05,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:42:05,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81009293] [2024-10-25 15:42:05,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:42:05,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:42:05,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:42:06,020 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-25 15:42:06,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:42:06,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81009293] [2024-10-25 15:42:06,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81009293] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:42:06,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:42:06,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 15:42:06,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964898014] [2024-10-25 15:42:06,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:42:06,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 15:42:06,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:42:06,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 15:42:06,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 15:42:06,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:42:06,071 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:42:06,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 15:42:06,072 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:42:08,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:42:08,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-25 15:42:08,611 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-25 15:42:08,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:42:08,612 INFO L85 PathProgramCache]: Analyzing trace with hash -253430217, now seen corresponding path program 1 times [2024-10-25 15:42:08,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:42:08,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411946363] [2024-10-25 15:42:08,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:42:08,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:42:08,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:42:08,701 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-25 15:42:08,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:42:08,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411946363] [2024-10-25 15:42:08,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411946363] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 15:42:08,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563329251] [2024-10-25 15:42:08,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:42:08,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:42:08,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:42:08,705 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-25 15:42:08,707 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-25 15:42:08,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:42:08,812 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-25 15:42:08,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 15:42:08,833 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-25 15:42:08,834 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 15:42:08,856 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-25 15:42:08,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563329251] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 15:42:08,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 15:42:08,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-25 15:42:08,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555184112] [2024-10-25 15:42:08,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 15:42:08,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-25 15:42:08,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:42:08,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-25 15:42:08,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-25 15:42:08,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:42:08,860 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:42:08,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 15:42:08,861 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:42:08,862 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:42:08,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:42:08,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:42:09,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-25 15:42:09,193 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-25 15:42:09,194 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-25 15:42:09,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:42:09,195 INFO L85 PathProgramCache]: Analyzing trace with hash -653837851, now seen corresponding path program 2 times [2024-10-25 15:42:09,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:42:09,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341368228] [2024-10-25 15:42:09,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:42:09,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:42:09,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:42:09,380 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-25 15:42:09,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:42:09,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341368228] [2024-10-25 15:42:09,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341368228] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 15:42:09,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602190819] [2024-10-25 15:42:09,381 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-25 15:42:09,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:42:09,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:42:09,384 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-25 15:42:09,385 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-25 15:42:09,485 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-25 15:42:09,485 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 15:42:09,487 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-25 15:42:09,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 15:42:09,517 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-25 15:42:09,517 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 15:42:09,583 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-25 15:42:09,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602190819] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 15:42:09,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 15:42:09,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-25 15:42:09,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217472540] [2024-10-25 15:42:09,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 15:42:09,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-25 15:42:09,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:42:09,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-25 15:42:09,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-25 15:42:09,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:42:09,585 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:42:09,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 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-25 15:42:09,585 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:42:09,586 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:42:09,586 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:42:09,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:42:09,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:42:09,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:42:09,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-25 15:42:09,927 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-25 15:42:09,928 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-25 15:42:09,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:42:09,928 INFO L85 PathProgramCache]: Analyzing trace with hash -2130085723, now seen corresponding path program 3 times [2024-10-25 15:42:09,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:42:09,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203069894] [2024-10-25 15:42:09,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:42:09,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:42:10,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:42:11,259 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-25 15:42:11,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:42:11,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203069894] [2024-10-25 15:42:11,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203069894] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 15:42:11,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149926225] [2024-10-25 15:42:11,260 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-25 15:42:11,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:42:11,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:42:11,262 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-25 15:42:11,264 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-25 15:42:11,389 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-25 15:42:11,389 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 15:42:11,393 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-10-25 15:42:11,396 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 15:42:11,963 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-25 15:42:11,964 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-25 15:42:12,036 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 79 treesize of output 56 [2024-10-25 15:42:12,519 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 79 treesize of output 56 [2024-10-25 15:42:12,766 INFO L349 Elim1Store]: treesize reduction 78, result has 3.7 percent of original size [2024-10-25 15:42:12,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 99 treesize of output 50 [2024-10-25 15:42:12,784 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-25 15:42:12,785 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 15:42:12,813 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_132 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_132) |c_t_funThread1of1ForFork0_~p~0#1.base|) |c_t_funThread1of1ForFork0_~p~0#1.offset|) 0)) is different from false [2024-10-25 15:42:13,147 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 45 trivial. 1 not checked. [2024-10-25 15:42:13,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149926225] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 15:42:13,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 15:42:13,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 7] total 16 [2024-10-25 15:42:13,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922329511] [2024-10-25 15:42:13,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 15:42:13,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-25 15:42:13,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:42:13,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-25 15:42:13,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=193, Unknown=1, NotChecked=28, Total=272 [2024-10-25 15:42:13,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:42:13,150 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:42:13,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 15:42:13,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:42:13,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:42:13,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:42:13,151 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:42:14,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:42:14,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:42:14,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:42:14,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-25 15:42:14,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-25 15:42:14,702 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-25 15:42:14,703 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-25 15:42:14,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:42:14,703 INFO L85 PathProgramCache]: Analyzing trace with hash 696865724, now seen corresponding path program 1 times [2024-10-25 15:42:14,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:42:14,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738371986] [2024-10-25 15:42:14,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:42:14,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:42:14,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:42:14,779 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-25 15:42:14,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:42:14,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738371986] [2024-10-25 15:42:14,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738371986] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 15:42:14,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305003344] [2024-10-25 15:42:14,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:42:14,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:42:14,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:42:14,782 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-25 15:42:14,784 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-25 15:42:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:42:14,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-25 15:42:14,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 15:42:14,916 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-25 15:42:14,916 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 15:42:14,943 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-25 15:42:14,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305003344] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 15:42:14,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 15:42:14,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-10-25 15:42:14,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817468145] [2024-10-25 15:42:14,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 15:42:14,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-25 15:42:14,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:42:14,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-25 15:42:14,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-25 15:42:14,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:42:14,946 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:42:14,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 15:42:14,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:42:14,946 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:42:14,949 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:42:14,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-25 15:42:14,950 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:42:15,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:42:15,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:42:15,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:42:15,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-25 15:42:15,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-25 15:42:15,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-25 15:42:15,287 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-25 15:42:15,470 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-25 15:42:15,475 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2024-10-25 15:42:15,477 INFO L312 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was SAFE (1/2) [2024-10-25 15:42:15,487 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:42:15,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 15:42:15,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:42:15,490 INFO L229 MonitoredProcess]: Starting monitored process 7 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-25 15:42:15,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Waiting until timeout for monitored process [2024-10-25 15:42:15,496 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 15:42:15,497 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 15:42:15,497 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@29b8dbde, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:42:15,498 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 15:42:15,742 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:42:15,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:42:15,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1576208778, now seen corresponding path program 1 times [2024-10-25 15:42:15,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:42:15,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653847002] [2024-10-25 15:42:15,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:42:15,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:42:15,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:42:15,782 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-25 15:42:15,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:42:15,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653847002] [2024-10-25 15:42:15,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653847002] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:42:15,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:42:15,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 15:42:15,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885811321] [2024-10-25 15:42:15,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:42:15,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 15:42:15,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:42:15,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 15:42:15,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 15:42:15,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:42:15,788 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:42:15,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 15:42:15,788 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:42:15,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:42:15,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-25 15:42:15,875 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:42:15,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:42:15,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1434973515, now seen corresponding path program 1 times [2024-10-25 15:42:15,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:42:15,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722506784] [2024-10-25 15:42:15,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:42:15,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:42:15,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:42:15,958 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-25 15:42:15,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:42:15,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722506784] [2024-10-25 15:42:15,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722506784] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 15:42:15,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152263548] [2024-10-25 15:42:15,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:42:15,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:42:15,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:42:15,962 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-25 15:42:15,963 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-25 15:42:16,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:42:16,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-25 15:42:16,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 15:42:16,067 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-25 15:42:16,067 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 15:42:16,081 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-25 15:42:16,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152263548] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 15:42:16,081 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 15:42:16,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-25 15:42:16,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145730615] [2024-10-25 15:42:16,082 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 15:42:16,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-25 15:42:16,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:42:16,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-25 15:42:16,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-25 15:42:16,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:42:16,084 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:42:16,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 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-25 15:42:16,084 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:42:16,084 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:42:16,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:42:16,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:42:16,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-25 15:42:16,323 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,SelfDestructingSolverStorable6 [2024-10-25 15:42:16,323 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:42:16,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:42:16,324 INFO L85 PathProgramCache]: Analyzing trace with hash 2060140537, now seen corresponding path program 2 times [2024-10-25 15:42:16,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:42:16,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291501651] [2024-10-25 15:42:16,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:42:16,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:42:16,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:42:16,415 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-25 15:42:16,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:42:16,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291501651] [2024-10-25 15:42:16,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291501651] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 15:42:16,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [375409604] [2024-10-25 15:42:16,416 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-25 15:42:16,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:42:16,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:42:16,419 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-25 15:42:16,420 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-25 15:42:16,523 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-25 15:42:16,524 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 15:42:16,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-25 15:42:16,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 15:42:16,541 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-25 15:42:16,541 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 15:42:16,590 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-25 15:42:16,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [375409604] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 15:42:16,590 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 15:42:16,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-25 15:42:16,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148210173] [2024-10-25 15:42:16,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 15:42:16,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-25 15:42:16,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:42:16,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-25 15:42:16,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-25 15:42:16,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:42:16,592 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:42:16,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 15:42:16,592 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:42:16,592 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:42:16,592 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:42:16,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:42:16,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:42:16,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:42:16,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-25 15:42:16,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:42:16,839 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:42:16,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:42:16,840 INFO L85 PathProgramCache]: Analyzing trace with hash 893050553, now seen corresponding path program 3 times [2024-10-25 15:42:16,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:42:16,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420509174] [2024-10-25 15:42:16,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:42:16,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:42:16,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:42:16,859 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 15:42:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:42:16,909 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 15:42:16,910 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 15:42:16,910 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 15:42:16,910 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 15:42:16,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-25 15:42:16,912 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1] [2024-10-25 15:42:16,914 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (2/2) [2024-10-25 15:42:16,915 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 15:42:16,915 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-25 15:42:16,936 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-25 15:42:16,940 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:42:16,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 15:42:16,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:42:16,947 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-25 15:42:16,949 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-25 15:42:16,952 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 15:42:16,953 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread1of2ForFork0 ======== [2024-10-25 15:42:16,954 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;@29b8dbde, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:42:16,954 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-25 15:42:18,985 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-25 15:42:18,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:42:18,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1369585024, now seen corresponding path program 1 times [2024-10-25 15:42:18,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:42:18,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900462165] [2024-10-25 15:42:18,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:42:18,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:42:18,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:42:19,027 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-25 15:42:19,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:42:19,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900462165] [2024-10-25 15:42:19,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900462165] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:42:19,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:42:19,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 15:42:19,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808001405] [2024-10-25 15:42:19,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:42:19,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 15:42:19,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:42:19,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 15:42:19,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 15:42:19,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:42:19,029 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:42:19,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 2 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 15:42:19,030 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:42:26,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:42:26,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-25 15:42:26,512 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-25 15:42:26,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:42:26,513 INFO L85 PathProgramCache]: Analyzing trace with hash -711646395, now seen corresponding path program 1 times [2024-10-25 15:42:26,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:42:26,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712456143] [2024-10-25 15:42:26,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:42:26,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:42:26,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:42:26,558 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-25 15:42:26,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:42:26,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712456143] [2024-10-25 15:42:26,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712456143] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 15:42:26,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555973214] [2024-10-25 15:42:26,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:42:26,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:42:26,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:42:26,562 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-25 15:42:26,563 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-25 15:42:26,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:42:26,677 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-25 15:42:26,678 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 15:42:26,689 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-25 15:42:26,689 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 15:42:26,699 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-25 15:42:26,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555973214] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 15:42:26,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 15:42:26,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-25 15:42:26,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2381217] [2024-10-25 15:42:26,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 15:42:26,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-25 15:42:26,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:42:26,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-25 15:42:26,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-25 15:42:26,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:42:26,701 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:42:26,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 15:42:26,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:42:26,701 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:42:27,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:42:27,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:42:27,476 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-25 15:42:27,663 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,SelfDestructingSolverStorable10 [2024-10-25 15:42:27,664 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-25 15:42:27,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:42:27,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1487557995, now seen corresponding path program 2 times [2024-10-25 15:42:27,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:42:27,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629294006] [2024-10-25 15:42:27,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:42:27,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:42:27,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:42:27,746 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-25 15:42:27,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:42:27,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629294006] [2024-10-25 15:42:27,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629294006] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 15:42:27,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764587866] [2024-10-25 15:42:27,747 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-25 15:42:27,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:42:27,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:42:27,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-25 15:42:27,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-25 15:42:27,928 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-25 15:42:27,929 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 15:42:27,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-25 15:42:27,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 15:42:27,957 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-25 15:42:27,957 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 15:42:28,045 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-25 15:42:28,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764587866] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 15:42:28,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 15:42:28,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-25 15:42:28,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834215736] [2024-10-25 15:42:28,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 15:42:28,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-25 15:42:28,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:42:28,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-25 15:42:28,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-25 15:42:28,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:42:28,046 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:42:28,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 15:42:28,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:42:28,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:42:28,047 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:42:29,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:42:29,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:42:29,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:42:29,123 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-25 15:42:29,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:42:29,312 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-25 15:42:29,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:42:29,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1990875349, now seen corresponding path program 3 times [2024-10-25 15:42:29,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:42:29,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011663269] [2024-10-25 15:42:29,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:42:29,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:42:29,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:42:32,234 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-25 15:42:32,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:42:32,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011663269] [2024-10-25 15:42:32,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011663269] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 15:42:32,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786417880] [2024-10-25 15:42:32,234 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-25 15:42:32,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:42:32,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:42:32,237 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 15:42:32,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-25 15:42:32,376 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-25 15:42:32,376 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 15:42:32,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-10-25 15:42:32,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 15:42:32,692 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-25 15:42:32,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-25 15:42:32,768 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 79 treesize of output 56 [2024-10-25 15:42:33,067 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 79 treesize of output 56 [2024-10-25 15:42:33,433 INFO L349 Elim1Store]: treesize reduction 78, result has 3.7 percent of original size [2024-10-25 15:42:33,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 99 treesize of output 50 [2024-10-25 15:42:33,448 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-25 15:42:33,449 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 15:42:33,491 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_440 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_440) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2024-10-25 15:42:33,834 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 45 trivial. 2 not checked. [2024-10-25 15:42:33,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786417880] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 15:42:33,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 15:42:33,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2024-10-25 15:42:33,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928033640] [2024-10-25 15:42:33,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 15:42:33,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-25 15:42:33,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:42:33,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-25 15:42:33,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=219, Unknown=3, NotChecked=30, Total=306 [2024-10-25 15:42:33,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:42:33,837 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:42:33,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.3333333333333335) internal successors, (60), 17 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-25 15:42:33,837 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:42:33,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:42:33,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:42:33,838 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:42:37,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:42:37,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:42:37,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:42:37,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-25 15:42:37,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-25 15:42:37,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-25 15:42:37,228 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-25 15:42:37,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:42:37,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1403528533, now seen corresponding path program 1 times [2024-10-25 15:42:37,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:42:37,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835621901] [2024-10-25 15:42:37,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:42:37,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:42:37,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:42:37,330 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-10-25 15:42:37,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:42:37,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835621901] [2024-10-25 15:42:37,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835621901] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:42:37,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:42:37,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 15:42:37,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169572805] [2024-10-25 15:42:37,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:42:37,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 15:42:37,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:42:37,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 15:42:37,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 15:42:37,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:42:37,333 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:42:37,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 15:42:37,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:42:37,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:42:37,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:42:37,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-25 15:42:37,333 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:42:39,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:42:39,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:42:39,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:42:39,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-25 15:42:39,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:42:39,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-25 15:42:39,111 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-25 15:42:39,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:42:39,111 INFO L85 PathProgramCache]: Analyzing trace with hash 490101831, now seen corresponding path program 1 times [2024-10-25 15:42:39,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:42:39,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806263084] [2024-10-25 15:42:39,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:42:39,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:42:39,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:42:43,582 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-25 15:42:43,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:42:43,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806263084] [2024-10-25 15:42:43,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806263084] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 15:42:43,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453283043] [2024-10-25 15:42:43,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:42:43,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:42:43,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:42:43,585 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-25 15:42:43,588 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-25 15:42:43,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:42:43,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 69 conjuncts are in the unsatisfiable core [2024-10-25 15:42:43,785 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 15:42:44,550 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-25 15:42:44,550 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-25 15:42:44,611 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 79 treesize of output 56 [2024-10-25 15:42:44,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-25 15:42:45,001 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 79 treesize of output 56 [2024-10-25 15:42:45,205 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-25 15:42:45,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2024-10-25 15:42:45,603 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 79 treesize of output 56 [2024-10-25 15:42:45,985 INFO L349 Elim1Store]: treesize reduction 140, result has 57.7 percent of original size [2024-10-25 15:42:45,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 46 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 20 case distinctions, treesize of input 88 treesize of output 230 [2024-10-25 15:42:47,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-25 15:42:47,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 553 treesize of output 361 [2024-10-25 15:42:48,703 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-25 15:42:48,703 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 15:42:48,785 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_562 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_562))) (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base| (let ((.cse1 (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base|))) (store .cse1 |c_t_funThread2of2ForFork0_~p~0#1.offset| (+ (select .cse1 |c_t_funThread2of2ForFork0_~p~0#1.offset|) 1))))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0)) is different from false [2024-10-25 15:42:48,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2024-10-25 15:42:49,089 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t_funThread1of2ForFork0_~i~0#1_19| Int) (v_ArrVal_562 (Array Int Int))) (or (< 9 |v_t_funThread1of2ForFork0_~i~0#1_19|) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_562) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_19| 28) |c_~#a~0.offset|))) (< |v_t_funThread1of2ForFork0_~i~0#1_19| 0))) is different from false [2024-10-25 15:42:49,768 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 6 not checked. [2024-10-25 15:42:49,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453283043] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 15:42:49,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 15:42:49,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 19, 10] total 36 [2024-10-25 15:42:49,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360339114] [2024-10-25 15:42:49,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 15:42:49,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-10-25 15:42:49,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:42:49,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-25 15:42:49,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1048, Unknown=11, NotChecked=134, Total=1332 [2024-10-25 15:42:49,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:42:49,770 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:42:49,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.4594594594594597) internal successors, (91), 36 states have internal predecessors, (91), 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-25 15:42:49,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:42:49,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:42:49,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:42:49,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-25 15:42:49,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:42:49,771 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:42:58,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:42:58,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:42:58,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:42:58,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-25 15:42:58,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:42:58,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-10-25 15:42:58,405 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-25 15:42:58,592 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,SelfDestructingSolverStorable14 [2024-10-25 15:42:58,592 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-25 15:42:58,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:42:58,592 INFO L85 PathProgramCache]: Analyzing trace with hash 894186409, now seen corresponding path program 1 times [2024-10-25 15:42:58,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:42:58,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864508600] [2024-10-25 15:42:58,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:42:58,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:42:58,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:42:58,672 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-25 15:42:58,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:42:58,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864508600] [2024-10-25 15:42:58,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864508600] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 15:42:58,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941814560] [2024-10-25 15:42:58,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:42:58,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:42:58,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:42:58,675 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-25 15:42:58,677 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-25 15:42:58,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:42:58,812 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-25 15:42:58,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 15:42:58,833 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-25 15:42:58,833 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 15:42:58,861 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-25 15:42:58,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941814560] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 15:42:58,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 15:42:58,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-10-25 15:42:58,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806286012] [2024-10-25 15:42:58,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 15:42:58,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-25 15:42:58,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:42:58,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-25 15:42:58,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2024-10-25 15:42:58,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:42:58,862 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:42:58,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 15:42:58,863 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:42:58,863 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:42:58,863 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:42:58,863 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-25 15:42:58,863 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:42:58,863 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2024-10-25 15:42:58,863 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:43:00,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:43:00,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:43:00,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:43:00,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-25 15:43:00,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:43:00,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-25 15:43:00,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-25 15:43:00,497 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-25 15:43:00,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-25 15:43:00,685 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-25 15:43:00,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:43:00,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1536729215, now seen corresponding path program 1 times [2024-10-25 15:43:00,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:43:00,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132562220] [2024-10-25 15:43:00,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:43:00,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:43:00,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:43:04,859 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-25 15:43:04,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:43:04,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132562220] [2024-10-25 15:43:04,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132562220] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 15:43:04,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170589949] [2024-10-25 15:43:04,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:43:04,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:43:04,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:43:04,863 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-25 15:43:04,864 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-25 15:43:05,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:43:05,093 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-10-25 15:43:05,095 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 15:43:05,827 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-25 15:43:05,827 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-25 15:43:05,902 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 79 treesize of output 56 [2024-10-25 15:43:06,092 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 79 treesize of output 56 [2024-10-25 15:43:06,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-25 15:43:06,557 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 79 treesize of output 56 [2024-10-25 15:43:06,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-25 15:43:06,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-10-25 15:43:07,000 INFO L349 Elim1Store]: treesize reduction 140, result has 57.7 percent of original size [2024-10-25 15:43:07,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 20 case distinctions, treesize of input 88 treesize of output 230 [2024-10-25 15:43:07,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-25 15:43:07,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-10-25 15:43:07,799 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-25 15:43:07,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2024-10-25 15:43:08,927 INFO L349 Elim1Store]: treesize reduction 160, result has 41.0 percent of original size [2024-10-25 15:43:08,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 46 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 246 treesize of output 261 [2024-10-25 15:43:12,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-25 15:43:12,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 474 treesize of output 326 [2024-10-25 15:43:13,108 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-25 15:43:13,108 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 15:43:13,512 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-25 15:43:13,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2024-10-25 15:43:13,524 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-25 15:43:13,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2024-10-25 15:43:13,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-10-25 15:43:13,560 WARN L851 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_767 (Array Int Int)) (v_ArrVal_772 Int) (|t_funThread2of2ForFork0_~p~0#1.offset| Int)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_767))) (store .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread2of2ForFork0_~p~0#1.base|) |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_772))) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0)) (not (= |c_~#__global_lock~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|))) (forall ((v_ArrVal_767 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_767) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0) (= |t_funThread2of2ForFork0_~p~0#1.offset| |c_t_funThread1of2ForFork0_~p~0#1.offset|))) (or (= |c_t_funThread2of2ForFork0_~p~0#1.base| |c_t_funThread1of2ForFork0_~p~0#1.base|) (forall ((v_ArrVal_767 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_767) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0)))) is different from false [2024-10-25 15:43:13,710 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_t_funThread1of2ForFork0_~i~0#1_25| Int)) (or (< |v_t_funThread1of2ForFork0_~i~0#1_25| 0) (forall ((v_ArrVal_767 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_767) |c_~#a~0.base|) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_25| 28) |c_~#a~0.offset|)))) (< 9 |v_t_funThread1of2ForFork0_~i~0#1_25|))) (or (forall ((v_ArrVal_767 (Array Int Int)) (v_ArrVal_772 Int) (|v_t_funThread1of2ForFork0_~i~0#1_25| Int) (|t_funThread2of2ForFork0_~p~0#1.offset| Int)) (or (< |v_t_funThread1of2ForFork0_~i~0#1_25| 0) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_767) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_772) (+ (* |v_t_funThread1of2ForFork0_~i~0#1_25| 28) |c_~#a~0.offset|)) 0) (< 9 |v_t_funThread1of2ForFork0_~i~0#1_25|))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) is different from false [2024-10-25 15:43:14,086 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 1 refuted. 2 times theorem prover too weak. 55 trivial. 4 not checked. [2024-10-25 15:43:14,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170589949] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 15:43:14,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 15:43:14,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 21, 11] total 41 [2024-10-25 15:43:14,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77495804] [2024-10-25 15:43:14,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 15:43:14,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-10-25 15:43:14,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:43:14,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-10-25 15:43:14,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1370, Unknown=34, NotChecked=154, Total=1722 [2024-10-25 15:43:14,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:43:14,089 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:43:14,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 3.0) internal successors, (126), 41 states have internal predecessors, (126), 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-25 15:43:14,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:43:14,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:43:14,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:43:14,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-25 15:43:14,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:43:14,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-10-25 15:43:14,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-25 15:43:14,090 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:43:22,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:43:22,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:43:22,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:43:22,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-25 15:43:22,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:43:22,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-25 15:43:22,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-25 15:43:22,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-25 15:43:22,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-10-25 15:43:22,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-25 15:43:22,689 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-25 15:43:22,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:43:22,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1662140169, now seen corresponding path program 2 times [2024-10-25 15:43:22,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:43:22,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123753903] [2024-10-25 15:43:22,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:43:22,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:43:22,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:43:28,498 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-25 15:43:28,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:43:28,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123753903] [2024-10-25 15:43:28,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123753903] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 15:43:28,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073955574] [2024-10-25 15:43:28,499 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-25 15:43:28,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:43:28,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:43:28,500 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 15:43:28,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-25 15:43:28,757 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-25 15:43:28,757 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 15:43:28,760 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 85 conjuncts are in the unsatisfiable core [2024-10-25 15:43:28,763 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 15:43:29,499 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-25 15:43:29,499 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-25 15:43:29,577 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 79 treesize of output 56 [2024-10-25 15:43:29,917 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 79 treesize of output 56 [2024-10-25 15:43:30,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-25 15:43:30,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-25 15:43:30,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-10-25 15:43:30,630 INFO L349 Elim1Store]: treesize reduction 140, result has 57.7 percent of original size [2024-10-25 15:43:30,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 20 case distinctions, treesize of input 88 treesize of output 230 [2024-10-25 15:43:31,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-25 15:43:31,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-10-25 15:43:31,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-25 15:43:31,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-10-25 15:43:31,647 INFO L349 Elim1Store]: treesize reduction 160, result has 41.0 percent of original size [2024-10-25 15:43:31,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 45 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 246 treesize of output 261 [2024-10-25 15:43:32,346 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 502 treesize of output 389 [2024-10-25 15:43:33,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-25 15:43:33,427 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 502 treesize of output 477 [2024-10-25 15:43:34,158 INFO L349 Elim1Store]: treesize reduction 8, result has 95.3 percent of original size [2024-10-25 15:43:34,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 45 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 21 case distinctions, treesize of input 503 treesize of output 611 [2024-10-25 15:44:57,214 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-25 15:44:57,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 1054 treesize of output 586 [2024-10-25 15:44:58,797 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 61 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-25 15:44:58,797 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 15:44:59,153 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-25 15:44:59,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2024-10-25 15:44:59,164 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-25 15:44:59,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 38 [2024-10-25 15:44:59,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-10-25 15:44:59,194 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base|))) (let ((.cse0 (forall ((v_ArrVal_878 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_877 Int)) (= (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store .cse1 |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_877)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_878) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0)))) (and (or .cse0 (= |c_t_funThread2of2ForFork0_~p~0#1.base| |c_t_funThread1of2ForFork0_~p~0#1.base|)) (forall ((v_ArrVal_878 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_877 Int)) (or (= |t_funThread2of2ForFork0_~p~0#1.offset| |c_t_funThread1of2ForFork0_~p~0#1.offset|) (= (select (select (store (store |c_#memory_int| |c_t_funThread2of2ForFork0_~p~0#1.base| (store .cse1 |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_877)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_878) |c_t_funThread1of2ForFork0_~p~0#1.base|) |c_t_funThread1of2ForFork0_~p~0#1.offset|) 0))) (or .cse0 (not (= |c_~#__global_lock~0.base| |c_t_funThread1of2ForFork0_~p~0#1.base|)))))) is different from false [2024-10-25 15:44:59,477 WARN L851 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_878 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (|v_t_funThread1of2ForFork0_~i~0#1_28| Int) (v_ArrVal_870 (Array Int Int)) (v_ArrVal_877 Int)) (or (< 9 |v_t_funThread1of2ForFork0_~i~0#1_28|) (< |v_t_funThread1of2ForFork0_~i~0#1_28| 0) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_870) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_877)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_878) |c_~#a~0.base|) (+ |c_~#a~0.offset| (* |v_t_funThread1of2ForFork0_~i~0#1_28| 28))) 0))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))) (forall ((|v_t_funThread1of2ForFork0_~i~0#1_28| Int)) (or (< 9 |v_t_funThread1of2ForFork0_~i~0#1_28|) (< |v_t_funThread1of2ForFork0_~i~0#1_28| 0) (forall ((v_ArrVal_878 (Array Int Int)) (|t_funThread2of2ForFork0_~p~0#1.offset| Int) (v_ArrVal_870 (Array Int Int)) (v_ArrVal_877 Int)) (let ((.cse0 (+ |c_~#a~0.offset| (* |v_t_funThread1of2ForFork0_~i~0#1_28| 28)))) (or (= .cse0 |t_funThread2of2ForFork0_~p~0#1.offset|) (= (select (select (store (store |c_#memory_int| |c_~#a~0.base| (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_870) |c_~#a~0.base|) |t_funThread2of2ForFork0_~p~0#1.offset| v_ArrVal_877)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_878) |c_~#a~0.base|) .cse0) 0))))))) is different from false [2024-10-25 15:44:59,976 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 4 not checked. [2024-10-25 15:44:59,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073955574] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 15:44:59,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 15:44:59,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 22, 12] total 44 [2024-10-25 15:44:59,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675462450] [2024-10-25 15:44:59,977 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 15:44:59,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2024-10-25 15:44:59,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:44:59,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2024-10-25 15:44:59,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1548, Unknown=63, NotChecked=166, Total=1980 [2024-10-25 15:44:59,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:44:59,981 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:44:59,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.5555555555555554) internal successors, (115), 44 states have internal predecessors, (115), 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-25 15:44:59,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:44:59,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:44:59,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:44:59,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-10-25 15:44:59,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:44:59,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 33 states. [2024-10-25 15:44:59,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-10-25 15:44:59,982 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. [2024-10-25 15:44:59,983 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:45:10,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:45:10,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:45:10,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:45:10,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-25 15:45:10,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:45:10,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-10-25 15:45:10,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-25 15:45:10,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2024-10-25 15:45:10,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-10-25 15:45:10,320 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-25 15:45:10,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-10-25 15:45:10,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-25 15:45:10,522 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1] [2024-10-25 15:45:10,522 INFO L312 ceAbstractionStarter]: Result for error location t_funThread1of2ForFork0 was SAFE (1/3) [2024-10-25 15:45:10,525 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:45:10,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 15:45:10,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:45:10,527 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-10-25 15:45:10,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (18)] Waiting until timeout for monitored process [2024-10-25 15:45:10,531 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 15:45:10,532 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 15:45:10,533 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;@29b8dbde, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:45:10,533 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 15:45:10,954 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:45:10,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:45:10,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1727584400, now seen corresponding path program 1 times [2024-10-25 15:45:10,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:45:10,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059335412] [2024-10-25 15:45:10,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:45:10,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:45:10,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:45:10,991 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-25 15:45:10,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:45:10,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059335412] [2024-10-25 15:45:10,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059335412] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:45:10,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:45:10,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 15:45:10,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209095751] [2024-10-25 15:45:10,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:45:10,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 15:45:10,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:45:10,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 15:45:10,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 15:45:10,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:45:10,993 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:45:10,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 15:45:10,993 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:45:11,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:45:11,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-25 15:45:11,319 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:45:11,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:45:11,319 INFO L85 PathProgramCache]: Analyzing trace with hash -716273158, now seen corresponding path program 1 times [2024-10-25 15:45:11,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:45:11,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302847817] [2024-10-25 15:45:11,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:45:11,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:45:11,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:45:11,376 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-25 15:45:11,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:45:11,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302847817] [2024-10-25 15:45:11,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302847817] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 15:45:11,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14669951] [2024-10-25 15:45:11,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:45:11,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:45:11,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:45:11,379 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 15:45:11,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-10-25 15:45:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:45:11,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-25 15:45:11,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 15:45:11,523 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-25 15:45:11,524 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 15:45:11,536 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-25 15:45:11,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14669951] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 15:45:11,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 15:45:11,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-25 15:45:11,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962139418] [2024-10-25 15:45:11,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 15:45:11,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-25 15:45:11,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:45:11,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-25 15:45:11,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-25 15:45:11,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:45:11,537 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:45:11,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 15:45:11,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:45:11,537 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:45:11,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:45:11,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:45:11,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-10-25 15:45:11,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:45:11,780 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:45:11,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:45:11,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1260413804, now seen corresponding path program 2 times [2024-10-25 15:45:11,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:45:11,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661446117] [2024-10-25 15:45:11,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:45:11,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:45:11,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:45:11,869 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-25 15:45:11,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:45:11,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661446117] [2024-10-25 15:45:11,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661446117] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 15:45:11,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757434079] [2024-10-25 15:45:11,870 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-25 15:45:11,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:45:11,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:45:11,872 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 15:45:11,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-10-25 15:45:12,008 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-25 15:45:12,008 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 15:45:12,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-25 15:45:12,011 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 15:45:12,023 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-25 15:45:12,023 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 15:45:12,073 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-25 15:45:12,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757434079] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 15:45:12,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 15:45:12,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-25 15:45:12,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339781179] [2024-10-25 15:45:12,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 15:45:12,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-25 15:45:12,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:45:12,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-25 15:45:12,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-25 15:45:12,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:45:12,075 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:45:12,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 15:45:12,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:45:12,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:45:12,075 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:45:12,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:45:12,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:45:12,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:45:12,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2024-10-25 15:45:12,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:45:12,332 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:45:12,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:45:12,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1717665068, now seen corresponding path program 3 times [2024-10-25 15:45:12,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:45:12,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121111418] [2024-10-25 15:45:12,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:45:12,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:45:12,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:45:12,357 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 15:45:12,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:45:12,391 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 15:45:12,391 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 15:45:12,391 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 15:45:12,391 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 15:45:12,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-25 15:45:12,393 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1] [2024-10-25 15:45:12,394 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (2/3) [2024-10-25 15:45:12,395 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 15:45:12,395 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-25 15:45:12,429 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-25 15:45:12,433 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:45:12,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 15:45:12,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:45:12,435 INFO L229 MonitoredProcess]: Starting monitored process 21 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-25 15:45:12,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (21)] Waiting until timeout for monitored process [2024-10-25 15:45:12,439 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 15:45:12,439 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2024-10-25 15:45:12,440 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;@29b8dbde, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:45:12,440 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-25 15:45:13,346 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:45:13,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:45:13,347 INFO L85 PathProgramCache]: Analyzing trace with hash 876181594, now seen corresponding path program 1 times [2024-10-25 15:45:13,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:45:13,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247932589] [2024-10-25 15:45:13,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:45:13,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:45:13,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:45:13,383 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-25 15:45:13,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:45:13,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247932589] [2024-10-25 15:45:13,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247932589] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:45:13,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:45:13,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 15:45:13,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950541975] [2024-10-25 15:45:13,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:45:13,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 15:45:13,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:45:13,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 15:45:13,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 15:45:13,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:45:13,385 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:45:13,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 2 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 15:45:13,385 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:45:14,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:45:14,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-25 15:45:14,146 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:45:14,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:45:14,146 INFO L85 PathProgramCache]: Analyzing trace with hash 829167225, now seen corresponding path program 1 times [2024-10-25 15:45:14,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:45:14,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327070320] [2024-10-25 15:45:14,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:45:14,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:45:14,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:45:14,192 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-25 15:45:14,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:45:14,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327070320] [2024-10-25 15:45:14,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327070320] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 15:45:14,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492714195] [2024-10-25 15:45:14,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:45:14,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:45:14,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:45:14,196 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 15:45:14,199 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-10-25 15:45:14,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:45:14,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-25 15:45:14,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 15:45:14,354 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-25 15:45:14,355 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 15:45:14,367 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-25 15:45:14,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492714195] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 15:45:14,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 15:45:14,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-25 15:45:14,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526007402] [2024-10-25 15:45:14,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 15:45:14,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-25 15:45:14,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:45:14,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-25 15:45:14,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-25 15:45:14,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:45:14,368 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:45:14,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 6 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 15:45:14,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:45:14,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:45:14,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:45:14,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:45:14,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2024-10-25 15:45:14,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,22 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:45:14,608 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:45:14,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:45:14,609 INFO L85 PathProgramCache]: Analyzing trace with hash -780346266, now seen corresponding path program 2 times [2024-10-25 15:45:14,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:45:14,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135046483] [2024-10-25 15:45:14,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:45:14,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:45:14,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:45:14,691 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-25 15:45:14,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:45:14,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135046483] [2024-10-25 15:45:14,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135046483] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 15:45:14,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668303682] [2024-10-25 15:45:14,692 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-25 15:45:14,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:45:14,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:45:14,694 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 15:45:14,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-10-25 15:45:14,856 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-25 15:45:14,856 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 15:45:14,858 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-25 15:45:14,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 15:45:14,871 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-25 15:45:14,871 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 15:45:14,918 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-25 15:45:14,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668303682] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 15:45:14,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 15:45:14,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-25 15:45:14,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406690909] [2024-10-25 15:45:14,919 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 15:45:14,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-25 15:45:14,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:45:14,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-25 15:45:14,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-25 15:45:14,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:45:14,921 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:45:14,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.230769230769231) internal successors, (42), 12 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 15:45:14,921 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:45:14,921 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:45:14,921 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:45:15,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:45:15,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:45:15,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:45:15,046 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2024-10-25 15:45:15,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-10-25 15:45:15,226 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-10-25 15:45:15,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:45:15,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1244894086, now seen corresponding path program 3 times [2024-10-25 15:45:15,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:45:15,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933291124] [2024-10-25 15:45:15,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:45:15,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:45:15,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:45:15,257 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-25 15:45:15,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-25 15:45:15,347 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-25 15:45:15,347 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-25 15:45:15,348 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2024-10-25 15:45:15,348 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2024-10-25 15:45:15,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-25 15:45:15,349 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1] [2024-10-25 15:45:15,350 INFO L312 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN (1/4) [2024-10-25 15:45:15,350 WARN L239 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-25 15:45:15,351 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2024-10-25 15:45:15,387 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-25 15:45:15,390 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:45:15,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-10-25 15:45:15,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:45:15,394 INFO L229 MonitoredProcess]: Starting monitored process 24 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-25 15:45:15,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (24)] Waiting until timeout for monitored process [2024-10-25 15:45:15,400 INFO L157 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-10-25 15:45:15,400 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t_funThread4of4ForFork0 ======== [2024-10-25 15:45:15,401 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;@29b8dbde, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-25 15:45:15,401 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-25 15:45:16,688 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-25 15:45:16,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:45:16,688 INFO L85 PathProgramCache]: Analyzing trace with hash 954032638, now seen corresponding path program 1 times [2024-10-25 15:45:16,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:45:16,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587588845] [2024-10-25 15:45:16,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:45:16,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:45:16,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:45:16,733 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-25 15:45:16,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:45:16,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587588845] [2024-10-25 15:45:16,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587588845] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:45:16,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:45:16,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-25 15:45:16,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861847978] [2024-10-25 15:45:16,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:45:16,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 15:45:16,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:45:16,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 15:45:16,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 15:45:16,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:45:16,735 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:45:16,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 15:45:16,735 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:45:43,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:45:43,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-25 15:45:43,269 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-25 15:45:43,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:45:43,269 INFO L85 PathProgramCache]: Analyzing trace with hash 538430661, now seen corresponding path program 1 times [2024-10-25 15:45:43,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:45:43,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665285254] [2024-10-25 15:45:43,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:45:43,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:45:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:45:43,338 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-25 15:45:43,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:45:43,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665285254] [2024-10-25 15:45:43,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665285254] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 15:45:43,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489598560] [2024-10-25 15:45:43,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:45:43,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:45:43,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:45:43,341 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 15:45:43,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-10-25 15:45:43,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:45:43,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-25 15:45:43,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 15:45:43,560 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-25 15:45:43,560 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 15:45:43,575 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-25 15:45:43,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489598560] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 15:45:43,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 15:45:43,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-10-25 15:45:43,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532066829] [2024-10-25 15:45:43,575 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 15:45:43,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-25 15:45:43,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:45:43,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-25 15:45:43,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-25 15:45:43,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:45:43,576 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:45:43,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 6 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 15:45:43,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:45:43,577 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:45:52,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:45:52,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:45:52,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2024-10-25 15:45:52,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,25 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:45:52,601 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-25 15:45:52,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:45:52,602 INFO L85 PathProgramCache]: Analyzing trace with hash -364500710, now seen corresponding path program 2 times [2024-10-25 15:45:52,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:45:52,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241762854] [2024-10-25 15:45:52,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:45:52,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:45:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:45:52,725 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-25 15:45:52,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:45:52,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241762854] [2024-10-25 15:45:52,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241762854] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 15:45:52,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413619765] [2024-10-25 15:45:52,726 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-25 15:45:52,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:45:52,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:45:52,727 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 15:45:52,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2024-10-25 15:45:52,925 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-25 15:45:52,925 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 15:45:52,927 INFO L255 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-25 15:45:52,929 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 15:45:52,941 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-25 15:45:52,941 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 15:45:52,983 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-25 15:45:52,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413619765] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 15:45:52,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 15:45:52,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-10-25 15:45:52,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110904676] [2024-10-25 15:45:52,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 15:45:52,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-25 15:45:52,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:45:52,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-25 15:45:52,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-25 15:45:52,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:45:52,986 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:45:52,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.230769230769231) internal successors, (81), 12 states have internal predecessors, (81), 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-25 15:45:52,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:45:52,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:45:52,986 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:46:02,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:46:02,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:46:02,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:46:02,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2024-10-25 15:46:02,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-10-25 15:46:02,618 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-25 15:46:02,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:46:02,619 INFO L85 PathProgramCache]: Analyzing trace with hash 817625402, now seen corresponding path program 3 times [2024-10-25 15:46:02,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:46:02,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290918920] [2024-10-25 15:46:02,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:46:02,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:46:02,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:46:15,875 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-25 15:46:15,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:46:15,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290918920] [2024-10-25 15:46:15,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290918920] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 15:46:15,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612144005] [2024-10-25 15:46:15,875 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-25 15:46:15,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:46:15,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:46:15,877 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 15:46:15,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2024-10-25 15:46:16,949 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-10-25 15:46:16,950 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-25 15:46:16,954 INFO L255 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 100 conjuncts are in the unsatisfiable core [2024-10-25 15:46:16,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 15:46:17,643 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-25 15:46:17,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-25 15:46:17,719 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 79 treesize of output 56 [2024-10-25 15:46:17,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-25 15:46:18,075 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 79 treesize of output 56 [2024-10-25 15:46:18,255 INFO L349 Elim1Store]: treesize reduction 22, result has 38.9 percent of original size [2024-10-25 15:46:18,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 29 [2024-10-25 15:46:18,587 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 79 treesize of output 56 [2024-10-25 15:46:18,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-25 15:46:18,824 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-10-25 15:46:18,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2024-10-25 15:46:19,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-25 15:46:19,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2024-10-25 15:46:19,510 INFO L349 Elim1Store]: treesize reduction 140, result has 57.7 percent of original size [2024-10-25 15:46:19,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 46 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 20 case distinctions, treesize of input 88 treesize of output 230 [2024-10-25 15:46:20,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-25 15:46:20,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2024-10-25 15:46:21,149 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 239 treesize of output 196 [2024-10-25 15:46:22,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-25 15:46:22,145 INFO L349 Elim1Store]: treesize reduction 28, result has 31.7 percent of original size [2024-10-25 15:46:22,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 37 treesize of output 25 [2024-10-25 15:46:23,290 INFO L349 Elim1Store]: treesize reduction 140, result has 57.7 percent of original size [2024-10-25 15:46:23,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 47 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 20 case distinctions, treesize of input 248 treesize of output 350 [2024-10-25 15:46:24,312 INFO L349 Elim1Store]: treesize reduction 140, result has 57.7 percent of original size [2024-10-25 15:46:24,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 46 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 20 case distinctions, treesize of input 88 treesize of output 230 [2024-10-25 15:46:25,731 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 239 treesize of output 196 [2024-10-25 15:46:26,597 INFO L349 Elim1Store]: treesize reduction 140, result has 57.7 percent of original size [2024-10-25 15:46:26,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 46 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 20 case distinctions, treesize of input 248 treesize of output 350 [2024-10-25 15:46:27,261 INFO L349 Elim1Store]: treesize reduction 160, result has 41.0 percent of original size [2024-10-25 15:46:27,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 46 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 86 treesize of output 141 [2024-10-25 15:46:29,482 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-25 15:46:29,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 470 treesize of output 326 [2024-10-25 15:46:30,275 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 17 proven. 36 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-25 15:46:30,275 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 15:46:30,448 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1611 Int) (v_ArrVal_1606 (Array Int Int))) (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1606))) (store .cse1 |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse2 (select .cse1 |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset|)))))))) (store .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1611))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) is different from false [2024-10-25 15:46:30,471 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1611 Int) (v_ArrVal_1606 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1606) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse1 (select (store (store |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse2 (select |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (select .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1606) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse1 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse1 |c_t_funThread2of4ForFork0_~p~0#1.offset|))))))) (store .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1611))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) is different from false [2024-10-25 15:46:30,506 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1611 Int) (v_ArrVal_1606 (Array Int Int))) (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse4 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse4 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse4 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))))) (store (store .cse1 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1606) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse2 (select (store (store .cse1 |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse3 (select .cse1 |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse3 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (select .cse3 |c_t_funThread2of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1606) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset|)))))))) (store .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1611))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) is different from false [2024-10-25 15:46:31,105 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1602 (Array Int Int)) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1611 Int) (v_ArrVal_1606 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_16| Int)) (let ((.cse7 (* |v_t_funThread4of4ForFork0_~i~0#1_16| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_16|) (= (select (select (let ((.cse0 (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1602))) (let ((.cse5 (let ((.cse6 (select .cse4 |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse6 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse6 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse5))) (store (store .cse1 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1606) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse2 (select (store (store .cse1 |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse3 (select (store .cse4 |c_t_funThread1of4ForFork0_~p~0#1.base| .cse5) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse3 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (select .cse3 |c_t_funThread2of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1606) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset|)))))))))) (store .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1611))) |c_~#a~0.base|) (+ .cse7 |c_~#a~0.offset|)) 0) (< |v_t_funThread4of4ForFork0_~i~0#1_16| 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1601) |c_~#a~0.base|) (+ .cse7 |c_~#a~0.offset| 4)) 0))))) is different from false [2024-10-25 15:46:31,136 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1602 (Array Int Int)) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1611 Int) (v_ArrVal_1606 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_16| Int)) (let ((.cse7 (* |v_t_funThread4of4ForFork0_~i~0#1_16| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_16|) (< |v_t_funThread4of4ForFork0_~i~0#1_16| 0) (= (select (select (let ((.cse0 (let ((.cse4 (let ((.cse5 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse6 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse6 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse6 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1602) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse5 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse5 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse4))) (store (store .cse1 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1606) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse2 (select (store (store .cse1 |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1602) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse4) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse3 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (select .cse3 |c_t_funThread2of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1606) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset|))))))))) (store .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1611))) |c_~#a~0.base|) (+ .cse7 |c_~#a~0.offset|)) 0) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_1601) |c_~#a~0.base|) (+ .cse7 |c_~#a~0.offset| 4)) 0))))) is different from false [2024-10-25 15:46:31,253 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1602 (Array Int Int)) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1611 Int) (v_ArrVal_1606 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_16| Int)) (let ((.cse7 (* |v_t_funThread4of4ForFork0_~i~0#1_16| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_16|) (= (select (select (let ((.cse0 (let ((.cse4 (let ((.cse5 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse6 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse6 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse6 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1602) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse5 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse5 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse4))) (store (store .cse1 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1606) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse2 (select (store (store .cse1 |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1602) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse4) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse3 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (select .cse3 |c_t_funThread2of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1606) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset|))))))))) (store .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1611))) |c_~#a~0.base|) (+ .cse7 |c_~#a~0.offset|)) 0) (< |v_t_funThread4of4ForFork0_~i~0#1_16| 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select |c_#pthreadsMutex| |c_t_funThread3of4ForFork0_~p~0#1.base|) (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_1601) |c_~#a~0.base|) (+ .cse7 |c_~#a~0.offset| 4)) 0))))) is different from false [2024-10-25 15:46:31,285 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1602 (Array Int Int)) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1611 Int) (v_ArrVal_1606 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_16| Int)) (let ((.cse0 (* |v_t_funThread4of4ForFork0_~i~0#1_16| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_16|) (< |v_t_funThread4of4ForFork0_~i~0#1_16| 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store (select |c_#pthreadsMutex| |c_~#a~0.base|) (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_1601) |c_~#a~0.base|) (+ .cse0 |c_~#a~0.offset| 4)) 0)) (= (select (store (select (let ((.cse4 (let ((.cse5 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse6 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse6 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse6 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1602) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse5 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse5 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse4))) (store (store .cse1 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1606) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse2 (select (store (store .cse1 |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1602) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse4) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse3 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (select .cse3 |c_t_funThread2of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1606) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse2 |c_t_funThread2of4ForFork0_~p~0#1.offset|))))))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1611) (+ .cse0 |c_~#a~0.offset|)) 0)))) is different from false [2024-10-25 15:46:32,460 INFO L349 Elim1Store]: treesize reduction 81, result has 27.7 percent of original size [2024-10-25 15:46:32,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 69 treesize of output 58 [2024-10-25 15:46:32,539 INFO L349 Elim1Store]: treesize reduction 30, result has 57.1 percent of original size [2024-10-25 15:46:32,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 77 [2024-10-25 15:46:32,547 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 25 treesize of output 18 [2024-10-25 15:46:32,823 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_~#a~0.base|)) (.cse5 (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) (and (or (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1602 (Array Int Int)) (v_ArrVal_1596 (Array Int Int)) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1611 Int) (v_ArrVal_1606 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_16| Int)) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_16|) (= (select (store (let ((.cse0 (select (store (let ((.cse1 (let ((.cse3 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1596) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse4 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse4 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1602) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse3 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse3 |t_funThread1of4ForFork0_~p~0#1.offset|)))))) (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse1) |c_~#a~0.base| (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1602) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse1) |c_~#a~0.base|))) (store .cse2 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (select .cse2 |t_funThread2of4ForFork0_~p~0#1.offset|) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1606) |c_~#a~0.base|))) (store .cse0 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse0 |t_funThread2of4ForFork0_~p~0#1.offset|)))) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1611) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_16| 28) |c_~#a~0.offset|)) 0) (< |v_t_funThread4of4ForFork0_~i~0#1_16| 0) (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread2of4ForFork0_~p~0#1.offset|))) .cse5) (forall ((|t_funThread1of4ForFork0_~p~0#1.offset| Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int)) (or (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread2of4ForFork0_~p~0#1.offset|) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1602 (Array Int Int)) (v_ArrVal_1596 (Array Int Int)) (v_ArrVal_1611 Int) (v_ArrVal_1606 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_16| Int)) (let ((.cse6 (+ (* |v_t_funThread4of4ForFork0_~i~0#1_16| 28) |c_~#a~0.offset|))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_16|) (= |t_funThread1of4ForFork0_~p~0#1.offset| .cse6) (= |t_funThread2of4ForFork0_~p~0#1.offset| .cse6) (= (select (store (let ((.cse7 (select (store (let ((.cse8 (let ((.cse10 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1596) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse11 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse11 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1602) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse10 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse10 |t_funThread1of4ForFork0_~p~0#1.offset|)))))) (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse8) |c_~#a~0.base| (let ((.cse9 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1602) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse8) |c_~#a~0.base|))) (store .cse9 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (select .cse9 |t_funThread2of4ForFork0_~p~0#1.offset|) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1606) |c_~#a~0.base|))) (store .cse7 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse7 |t_funThread2of4ForFork0_~p~0#1.offset|)))) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1611) .cse6) 0) (< |v_t_funThread4of4ForFork0_~i~0#1_16| 0) (= |t_funThread3of4ForFork0_~p~0#1.offset| .cse6)))))) (or .cse12 (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1602 (Array Int Int)) (v_ArrVal_1596 (Array Int Int)) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1611 Int) (v_ArrVal_1606 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_16| Int)) (let ((.cse13 (+ (* |v_t_funThread4of4ForFork0_~i~0#1_16| 28) |c_~#a~0.offset|))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_16|) (= |t_funThread2of4ForFork0_~p~0#1.offset| .cse13) (= (select (store (let ((.cse14 (select (store (let ((.cse15 (let ((.cse17 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1596) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse18 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse18 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1602) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse17 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse17 |t_funThread1of4ForFork0_~p~0#1.offset|)))))) (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse15) |c_~#a~0.base| (let ((.cse16 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1602) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse15) |c_~#a~0.base|))) (store .cse16 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (select .cse16 |t_funThread2of4ForFork0_~p~0#1.offset|) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1606) |c_~#a~0.base|))) (store .cse14 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse14 |t_funThread2of4ForFork0_~p~0#1.offset|)))) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1611) .cse13) 0) (< |v_t_funThread4of4ForFork0_~i~0#1_16| 0) (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread2of4ForFork0_~p~0#1.offset|) (= |t_funThread3of4ForFork0_~p~0#1.offset| .cse13))))) (or .cse12 (and (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1602 (Array Int Int)) (v_ArrVal_1596 (Array Int Int)) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1611 Int) (v_ArrVal_1606 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_16| Int)) (let ((.cse19 (+ (* |v_t_funThread4of4ForFork0_~i~0#1_16| 28) |c_~#a~0.offset|))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_16|) (= |t_funThread1of4ForFork0_~p~0#1.offset| .cse19) (= |t_funThread2of4ForFork0_~p~0#1.offset| .cse19) (= (select (store (let ((.cse20 (select (store (let ((.cse21 (let ((.cse23 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse24 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1596) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse24 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse24 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1602) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse23 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse23 |t_funThread1of4ForFork0_~p~0#1.offset|)))))) (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse21) |c_~#a~0.base| (let ((.cse22 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1602) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse21) |c_~#a~0.base|))) (store .cse22 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (select .cse22 |t_funThread2of4ForFork0_~p~0#1.offset|) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1606) |c_~#a~0.base|))) (store .cse20 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse20 |t_funThread2of4ForFork0_~p~0#1.offset|)))) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1611) .cse19) 0) (< |v_t_funThread4of4ForFork0_~i~0#1_16| 0) (= |t_funThread3of4ForFork0_~p~0#1.offset| .cse19)))) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1602 (Array Int Int)) (v_ArrVal_1596 (Array Int Int)) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1611 Int) (v_ArrVal_1606 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_16| Int)) (let ((.cse25 (+ (* |v_t_funThread4of4ForFork0_~i~0#1_16| 28) |c_~#a~0.offset|))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_16|) (= |t_funThread2of4ForFork0_~p~0#1.offset| .cse25) (= (select (store (let ((.cse26 (select (store (let ((.cse27 (let ((.cse29 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse30 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1596) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse30 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse30 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1602) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse29 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse29 |t_funThread1of4ForFork0_~p~0#1.offset|)))))) (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse27) |c_~#a~0.base| (let ((.cse28 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1602) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse27) |c_~#a~0.base|))) (store .cse28 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (select .cse28 |t_funThread2of4ForFork0_~p~0#1.offset|) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1606) |c_~#a~0.base|))) (store .cse26 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse26 |t_funThread2of4ForFork0_~p~0#1.offset|)))) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1611) .cse25) 0) (< |v_t_funThread4of4ForFork0_~i~0#1_16| 0) (= |t_funThread3of4ForFork0_~p~0#1.offset| .cse25)))) (or .cse5 (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1602 (Array Int Int)) (v_ArrVal_1596 (Array Int Int)) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1611 Int) (v_ArrVal_1606 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_16| Int)) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_16|) (= (select (store (let ((.cse31 (select (store (let ((.cse32 (let ((.cse34 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse35 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1596) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse35 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse35 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1602) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse34 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse34 |t_funThread1of4ForFork0_~p~0#1.offset|)))))) (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse32) |c_~#a~0.base| (let ((.cse33 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1602) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse32) |c_~#a~0.base|))) (store .cse33 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (select .cse33 |t_funThread2of4ForFork0_~p~0#1.offset|) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1606) |c_~#a~0.base|))) (store .cse31 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse31 |t_funThread2of4ForFork0_~p~0#1.offset|)))) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1611) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_16| 28) |c_~#a~0.offset|)) 0) (< |v_t_funThread4of4ForFork0_~i~0#1_16| 0)))))))) is different from false [2024-10-25 15:46:32,875 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|t_funThread1of4ForFork0_~p~0#1.offset| Int) (|t_funThread2of4ForFork0_~p~0#1.offset| Int)) (or (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1602 (Array Int Int)) (v_ArrVal_1596 (Array Int Int)) (v_ArrVal_1611 Int) (v_ArrVal_1606 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_16| Int)) (let ((.cse0 (+ (* |v_t_funThread4of4ForFork0_~i~0#1_16| 28) |c_~#a~0.offset|))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_16|) (= |t_funThread1of4ForFork0_~p~0#1.offset| .cse0) (= |t_funThread2of4ForFork0_~p~0#1.offset| .cse0) (< |v_t_funThread4of4ForFork0_~i~0#1_16| 0) (= (select (store (let ((.cse1 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse2 (let ((.cse3 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1596) |c_~#a~0.base|))) (store .cse4 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse4 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1602) |c_~#a~0.base|))) (store .cse3 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse3 |t_funThread1of4ForFork0_~p~0#1.offset|)))))) (store .cse2 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (select .cse2 |t_funThread2of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1606) |c_~#a~0.base|))) (store .cse1 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse1 |t_funThread2of4ForFork0_~p~0#1.offset|)))) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1611) .cse0) 0) (= |t_funThread3of4ForFork0_~p~0#1.offset| .cse0)))) (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread2of4ForFork0_~p~0#1.offset|))) (or (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (|t_funThread1of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1602 (Array Int Int)) (v_ArrVal_1596 (Array Int Int)) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1611 Int) (v_ArrVal_1606 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_16| Int)) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_16|) (< |v_t_funThread4of4ForFork0_~i~0#1_16| 0) (= (select (store (let ((.cse5 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse6 (let ((.cse7 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1596) |c_~#a~0.base|))) (store .cse8 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse8 |t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1602) |c_~#a~0.base|))) (store .cse7 |t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse7 |t_funThread1of4ForFork0_~p~0#1.offset|)))))) (store .cse6 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (select .cse6 |t_funThread2of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1606) |c_~#a~0.base|))) (store .cse5 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse5 |t_funThread2of4ForFork0_~p~0#1.offset|)))) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1611) (+ (* |v_t_funThread4of4ForFork0_~i~0#1_16| 28) |c_~#a~0.offset|)) 0) (= |t_funThread1of4ForFork0_~p~0#1.offset| |t_funThread2of4ForFork0_~p~0#1.offset|))))) is different from false [2024-10-25 15:46:42,554 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 2 proven. 39 refuted. 0 times theorem prover too weak. 21 trivial. 19 not checked. [2024-10-25 15:46:42,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612144005] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 15:46:42,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 15:46:42,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22, 25] total 64 [2024-10-25 15:46:42,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947826130] [2024-10-25 15:46:42,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 15:46:42,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2024-10-25 15:46:42,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:46:42,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2024-10-25 15:46:42,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=2755, Unknown=36, NotChecked=1044, Total=4160 [2024-10-25 15:46:42,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:46:42,558 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:46:42,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 3.5384615384615383) internal successors, (230), 64 states have internal predecessors, (230), 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-25 15:46:42,558 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:46:42,559 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:46:42,559 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:46:42,559 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:47:09,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:47:09,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:47:09,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:47:09,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-25 15:47:09,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2024-10-25 15:47:10,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,27 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:47:10,034 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-25 15:47:10,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:47:10,034 INFO L85 PathProgramCache]: Analyzing trace with hash 2103884891, now seen corresponding path program 1 times [2024-10-25 15:47:10,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:47:10,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189374449] [2024-10-25 15:47:10,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:47:10,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:47:10,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:47:10,158 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2024-10-25 15:47:10,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:47:10,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189374449] [2024-10-25 15:47:10,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189374449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-25 15:47:10,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-25 15:47:10,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-25 15:47:10,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845433916] [2024-10-25 15:47:10,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-25 15:47:10,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-25 15:47:10,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:47:10,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-25 15:47:10,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-25 15:47:10,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:47:10,164 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:47:10,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 15:47:10,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:47:10,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:47:10,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:47:10,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-10-25 15:47:10,164 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:47:18,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:47:18,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:47:18,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:47:18,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-25 15:47:18,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:47:18,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-25 15:47:18,198 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-25 15:47:18,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:47:18,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1548562871, now seen corresponding path program 1 times [2024-10-25 15:47:18,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:47:18,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45812355] [2024-10-25 15:47:18,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:47:18,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:47:18,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:47:18,331 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-25 15:47:18,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:47:18,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45812355] [2024-10-25 15:47:18,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45812355] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 15:47:18,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43021285] [2024-10-25 15:47:18,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:47:18,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:47:18,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:47:18,334 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 15:47:18,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2024-10-25 15:47:18,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:47:18,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-25 15:47:18,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 15:47:18,639 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-25 15:47:18,639 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 15:47:18,719 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-25 15:47:18,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43021285] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 15:47:18,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 15:47:18,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-10-25 15:47:18,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811859567] [2024-10-25 15:47:18,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 15:47:18,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-25 15:47:18,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:47:18,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-25 15:47:18,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-10-25 15:47:18,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:47:18,721 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:47:18,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.0) internal successors, (156), 13 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-25 15:47:18,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:47:18,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:47:18,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:47:18,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2024-10-25 15:47:18,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:47:18,721 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:47:28,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:47:29,209 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse29 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (let ((.cse42 (select .cse29 |c_t_funThread1of4ForFork0_~p~0#1.offset|)) (.cse8 (= |c_t_funThread4of4ForFork0_~p~0#1.offset| 0)) (.cse50 (select |c_#memory_int| 4))) (let ((.cse3 (div (* (- 1) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 28)) (.cse2 (select .cse50 28)) (.cse1 (= 28 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (.cse16 (= 140 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (.cse15 (select .cse50 140)) (.cse0 (select |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base|)) (.cse14 (select .cse50 56)) (.cse13 (= 56 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (.cse5 (select .cse50 112)) (.cse4 (= 112 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (.cse24 (select .cse50 168)) (.cse23 (= 168 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (.cse9 (= |c_t_funThread4of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|)) (.cse22 (not (= |c_t_funThread1of4ForFork0_~p~0#1.offset| 0))) (.cse21 (not .cse8)) (.cse10 (store .cse29 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) .cse42))) (.cse7 (= 224 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (.cse6 (select .cse50 224)) (.cse28 (select .cse50 0)) (.cse27 (= 0 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (.cse19 (select .cse50 252)) (.cse20 (= 252 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (.cse25 (= 84 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (.cse26 (select .cse50 84)) (.cse30 (select |c_#pthreadsMutex| |c_~#a~0.base|)) (.cse17 (= 196 |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (.cse18 (select .cse50 196)) (.cse11 (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread3of4ForFork0_~p~0#1.offset|))) (.cse12 (= |c_t_funThread2of4ForFork0_~p~0#1.base| |c_t_funThread3of4ForFork0_~p~0#1.base|))) (and (= (select .cse0 |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) (or .cse1 (= .cse2 0)) (<= 0 (+ 9 .cse3)) (or (not .cse4) (= .cse5 1)) (or (= .cse6 0) .cse7) (or .cse8 (and (<= 1 |c_t_funThread4of4ForFork0_~i~0#1|) .cse9 (= (select .cse10 |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0) .cse11 .cse12)) (or .cse13 (= .cse14 0)) (or (= .cse15 0) .cse16) (or (not .cse17) (= .cse18 1)) (not (= |c_ULTIMATE.start_main_~#t_ids~0#1.base| 4)) (not (= |c_t_funThread2of4ForFork0_~p~0#1.base| |c_ULTIMATE.start_main_~#t_ids~0#1.base|)) (or (= .cse19 0) .cse20) (<= .cse3 0) (or (= .cse2 1) (not .cse1)) (or (not .cse16) (= .cse15 1)) (or (not (= (select .cse0 |c_t_funThread2of4ForFork0_~p~0#1.offset|) 0)) .cse21 .cse22) (or (not .cse23) (= .cse24 1)) (or (not .cse25) (= .cse26 1)) (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_t_funThread2of4ForFork0_~p~0#1.base|) (not (= |c_t_funThread3of4ForFork0_~p~0#1.offset| |c_t_funThread1of4ForFork0_~p~0#1.offset|)) (or (= .cse14 1) (not .cse13)) (= |c_t_funThread4of4ForFork0_~p~0#1.base| 4) .cse9 (or (not .cse27) (= .cse28 1)) (or (= .cse5 0) .cse4) (or (= .cse24 0) .cse23) (or (and (not (= |c_t_funThread3of4ForFork0_~p~0#1.offset| 0)) (= (select .cse29 0) 0) .cse9 .cse22 .cse12) .cse21) (forall ((v_ArrVal_1611 Int) (v_ArrVal_1606 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_16| Int)) (let ((.cse31 (* |v_t_funThread4of4ForFork0_~i~0#1_16| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_16|) (not (= (select .cse30 (+ .cse31 |c_~#a~0.offset| 4)) 0)) (= (select (select (let ((.cse32 (let ((.cse33 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse10))) (store (store .cse33 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1606) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse34 (select (store (store .cse33 |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse35 (select .cse33 |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse35 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (select .cse35 |c_t_funThread2of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1606) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse34 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse34 |c_t_funThread2of4ForFork0_~p~0#1.offset|)))))))) (store .cse32 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse32 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1611))) |c_~#a~0.base|) (+ .cse31 |c_~#a~0.offset|)) 0) (< |v_t_funThread4of4ForFork0_~i~0#1_16| 0)))) (not (= |c_t_funThread4of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (= |c_t_funThread3of4ForFork0_~p~0#1.base| 4) (or (not .cse7) (= .cse6 1)) (or (= .cse28 0) .cse27) (or (= .cse19 1) (not .cse20)) (or .cse25 (= .cse26 0)) (= |c_t_funThread2of4ForFork0_~p~0#1.base| 4) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1602 (Array Int Int)) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1611 Int) (v_ArrVal_1606 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_16| Int)) (let ((.cse36 (* |v_t_funThread4of4ForFork0_~i~0#1_16| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_16|) (< |v_t_funThread4of4ForFork0_~i~0#1_16| 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store .cse30 (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_1601) |c_~#a~0.base|) (+ .cse36 |c_~#a~0.offset| 4)) 0)) (= (select (store (select (let ((.cse40 (let ((.cse41 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (store .cse29 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ .cse42 1))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1602) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse41 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse41 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (let ((.cse37 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse40))) (store (store .cse37 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1606) |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse38 (select (store (store .cse37 |c_t_funThread2of4ForFork0_~p~0#1.base| (let ((.cse39 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1602) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse40) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse39 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (select .cse39 |c_t_funThread2of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1606) |c_t_funThread2of4ForFork0_~p~0#1.base|))) (store .cse38 |c_t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse38 |c_t_funThread2of4ForFork0_~p~0#1.offset|))))))) |c_~#a~0.base|) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1611) (+ .cse36 |c_~#a~0.offset|)) 0)))) (not (= |c_t_funThread1of4ForFork0_~p~0#1.offset| |c_t_funThread2of4ForFork0_~p~0#1.offset|)) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1602 (Array Int Int)) (v_ArrVal_1601 (Array Int Int)) (v_ArrVal_1596 (Array Int Int)) (|t_funThread2of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_1611 Int) (v_ArrVal_1606 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_16| Int)) (let ((.cse48 (* |v_t_funThread4of4ForFork0_~i~0#1_16| 28)) (.cse49 (+ |t_funThread2of4ForFork0_~p~0#1.offset| 4))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_16|) (< |v_t_funThread4of4ForFork0_~i~0#1_16| 0) (= (select (store (let ((.cse43 (select (store (let ((.cse44 (let ((.cse46 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse47 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1596) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse47 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse47 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1602) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse46 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse46 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse44) |c_~#a~0.base| (let ((.cse45 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1602) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse44) |c_~#a~0.base|))) (store .cse45 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (select .cse45 |t_funThread2of4ForFork0_~p~0#1.offset|) 1))))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_1606) |c_~#a~0.base|))) (store .cse43 |t_funThread2of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse43 |t_funThread2of4ForFork0_~p~0#1.offset|)))) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_1611) (+ .cse48 |c_~#a~0.offset|)) 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_~#a~0.base| (store (store .cse30 .cse49 1) (+ |t_funThread3of4ForFork0_~p~0#1.offset| 4) 1)) |c_~#__global_lock~0.base| v_ArrVal_1601) |c_~#a~0.base|) (+ .cse48 |c_~#a~0.offset| 4)) 0)) (not (= (select .cse30 .cse49) 0))))) (or .cse17 (= .cse18 0)) .cse11 (= (mod (* |c_t_funThread4of4ForFork0_~p~0#1.offset| 27) 28) 0) .cse12)))) is different from false [2024-10-25 15:47:41,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:47:55,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:48:29,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:48:32,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:48:36,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:48:43,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:48:45,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:48:46,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:48:51,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:48:52,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:48:54,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:49:02,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:49:17,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:49:17,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:49:17,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:49:17,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2024-10-25 15:49:17,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:49:17,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-25 15:49:17,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2024-10-25 15:49:17,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,28 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:49:17,879 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONERROR_FUNCTION === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-25 15:49:17,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-25 15:49:17,880 INFO L85 PathProgramCache]: Analyzing trace with hash 716657805, now seen corresponding path program 1 times [2024-10-25 15:49:17,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-25 15:49:17,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085206469] [2024-10-25 15:49:17,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:49:17,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-25 15:49:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:49:51,372 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-25 15:49:51,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-25 15:49:51,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085206469] [2024-10-25 15:49:51,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085206469] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-25 15:49:51,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099361667] [2024-10-25 15:49:51,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-25 15:49:51,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-25 15:49:51,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-10-25 15:49:51,374 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-25 15:49:51,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2024-10-25 15:49:51,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-25 15:49:51,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 604 conjuncts, 109 conjuncts are in the unsatisfiable core [2024-10-25 15:49:51,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-25 15:49:52,788 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-25 15:49:52,788 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-25 15:49:52,877 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 79 treesize of output 56 [2024-10-25 15:49:53,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-25 15:49:53,452 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 79 treesize of output 56 [2024-10-25 15:49:53,757 INFO L349 Elim1Store]: treesize reduction 22, result has 38.9 percent of original size [2024-10-25 15:49:53,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 29 [2024-10-25 15:49:54,377 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 79 treesize of output 56 [2024-10-25 15:49:54,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-25 15:49:54,790 INFO L349 Elim1Store]: treesize reduction 44, result has 38.0 percent of original size [2024-10-25 15:49:54,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 45 [2024-10-25 15:49:55,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-25 15:49:55,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2024-10-25 15:49:55,507 INFO L349 Elim1Store]: treesize reduction 217, result has 34.4 percent of original size [2024-10-25 15:49:55,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 47 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 20 case distinctions, treesize of input 88 treesize of output 153 [2024-10-25 15:49:55,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-25 15:49:55,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2024-10-25 15:49:56,954 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 126 treesize of output 101 [2024-10-25 15:49:57,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-25 15:49:57,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2024-10-25 15:49:58,490 INFO L349 Elim1Store]: treesize reduction 120, result has 61.4 percent of original size [2024-10-25 15:49:58,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 47 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 20 case distinctions, treesize of input 129 treesize of output 271 [2024-10-25 15:49:58,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-25 15:49:58,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2024-10-25 15:49:59,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-25 15:49:59,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-25 15:49:59,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-25 15:49:59,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 28 [2024-10-25 15:49:59,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-25 15:49:59,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-10-25 15:50:00,005 INFO L349 Elim1Store]: treesize reduction 160, result has 41.0 percent of original size [2024-10-25 15:50:00,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 46 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 86 treesize of output 141 [2024-10-25 15:50:00,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-25 15:50:00,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2024-10-25 15:50:00,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-25 15:50:01,013 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-25 15:50:01,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 18 [2024-10-25 15:50:01,369 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 119 treesize of output 96 [2024-10-25 15:50:02,002 INFO L349 Elim1Store]: treesize reduction 160, result has 41.0 percent of original size [2024-10-25 15:50:02,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 47 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 126 treesize of output 181 [2024-10-25 15:50:08,067 INFO L349 Elim1Store]: treesize reduction 160, result has 41.0 percent of original size [2024-10-25 15:50:08,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 46 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 501 treesize of output 380 [2024-10-25 15:51:05,151 INFO L349 Elim1Store]: treesize reduction 160, result has 41.0 percent of original size [2024-10-25 15:51:05,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 46 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 10 case distinctions, treesize of input 3763 treesize of output 2094 [2024-10-25 15:52:04,730 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-25 15:52:04,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 2188 treesize of output 1216 [2024-10-25 15:52:08,753 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 71 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-25 15:52:08,754 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-25 15:52:09,064 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2073 Int) (v_ArrVal_2068 (Array Int Int)) (v_ArrVal_2070 Int)) (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2068))) (store .cse1 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse1 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2070))))) (store .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2073))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) is different from false [2024-10-25 15:52:09,358 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2067 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2067) |c_t_funThread4of4ForFork0_~p~0#1.base|) (+ |c_t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0))) (forall ((v_ArrVal_2073 Int) (v_ArrVal_2066 Int) (v_ArrVal_2068 (Array Int Int)) (v_ArrVal_2070 Int)) (= (select (select (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2068) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2066)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2068) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2070)))) (store .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2073))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0))) is different from false [2024-10-25 15:52:09,380 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2073 Int) (v_ArrVal_2066 Int) (v_ArrVal_2068 (Array Int Int)) (v_ArrVal_2070 Int)) (= (select (select (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2068) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2066)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2068) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2070)))) (store .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2073))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (forall ((v_ArrVal_2062 Int) (v_ArrVal_2067 (Array Int Int))) (not (= (select (select (store (store |c_#pthreadsMutex| |c_t_funThread1of4ForFork0_~p~0#1.base| (store (select |c_#pthreadsMutex| |c_t_funThread1of4ForFork0_~p~0#1.base|) (+ 4 |c_t_funThread1of4ForFork0_~p~0#1.offset|) v_ArrVal_2062)) |c_~#__global_lock~0.base| v_ArrVal_2067) |c_t_funThread4of4ForFork0_~p~0#1.base|) (+ |c_t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)))) is different from false [2024-10-25 15:52:09,418 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2073 Int) (v_ArrVal_2066 Int) (v_ArrVal_2068 (Array Int Int)) (v_ArrVal_2070 Int)) (= (select (select (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2068) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select |c_#memory_int| |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2066)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2068) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2070)))) (store .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2073))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (forall ((v_ArrVal_2061 (Array Int Int)) (v_ArrVal_2062 Int) (v_ArrVal_2067 (Array Int Int))) (not (= (select (select (store (store |c_#pthreadsMutex| |c_t_funThread1of4ForFork0_~p~0#1.base| (store (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2061) |c_t_funThread1of4ForFork0_~p~0#1.base|) (+ 4 |c_t_funThread1of4ForFork0_~p~0#1.offset|) v_ArrVal_2062)) |c_~#__global_lock~0.base| v_ArrVal_2067) |c_t_funThread4of4ForFork0_~p~0#1.base|) (+ |c_t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)))) is different from false [2024-10-25 15:52:09,432 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_2073 Int) (v_ArrVal_2066 Int) (v_ArrVal_2068 (Array Int Int)) (v_ArrVal_2070 Int)) (= (select (select (let ((.cse0 (let ((.cse1 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse2 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse2 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse2 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))))) (store (store .cse1 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2068) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse1 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse1 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2066)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2068) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2070))))) (store .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse0 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2073))) |c_t_funThread4of4ForFork0_~p~0#1.base|) |c_t_funThread4of4ForFork0_~p~0#1.offset|) 0)) (forall ((v_ArrVal_2061 (Array Int Int)) (v_ArrVal_2062 Int) (v_ArrVal_2067 (Array Int Int))) (not (= (select (select (store (store |c_#pthreadsMutex| |c_t_funThread1of4ForFork0_~p~0#1.base| (store (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2061) |c_t_funThread1of4ForFork0_~p~0#1.base|) (+ 4 |c_t_funThread1of4ForFork0_~p~0#1.offset|) v_ArrVal_2062)) |c_~#__global_lock~0.base| v_ArrVal_2067) |c_t_funThread4of4ForFork0_~p~0#1.base|) (+ |c_t_funThread4of4ForFork0_~p~0#1.offset| 4)) 0)))) is different from false [2024-10-25 15:52:09,477 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2061 (Array Int Int)) (v_ArrVal_2073 Int) (v_ArrVal_2062 Int) (v_ArrVal_2066 Int) (v_ArrVal_2068 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_22| Int) (v_ArrVal_2067 (Array Int Int)) (v_ArrVal_2070 Int)) (let ((.cse0 (* |v_t_funThread4of4ForFork0_~i~0#1_22| 28))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_22|) (< |v_t_funThread4of4ForFork0_~i~0#1_22| 0) (not (= (select (select (store (store |c_#pthreadsMutex| |c_t_funThread1of4ForFork0_~p~0#1.base| (store (select (store |c_#pthreadsMutex| |c_~#__global_lock~0.base| v_ArrVal_2061) |c_t_funThread1of4ForFork0_~p~0#1.base|) (+ 4 |c_t_funThread1of4ForFork0_~p~0#1.offset|) v_ArrVal_2062)) |c_~#__global_lock~0.base| v_ArrVal_2067) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0 4)) 0)) (= (select (select (let ((.cse1 (let ((.cse2 (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse3 (select |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse3 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse3 |c_t_funThread1of4ForFork0_~p~0#1.offset|))))))) (store (store .cse2 |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2068) |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select (store (store .cse2 |c_t_funThread2of4ForFork0_~p~0#1.base| (store (select .cse2 |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2066)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2068) |c_t_funThread2of4ForFork0_~p~0#1.base|) |c_t_funThread2of4ForFork0_~p~0#1.offset| v_ArrVal_2070))))) (store .cse1 |c_t_funThread3of4ForFork0_~p~0#1.base| (store (select .cse1 |c_t_funThread3of4ForFork0_~p~0#1.base|) |c_t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2073))) |c_~#a~0.base|) (+ |c_~#a~0.offset| .cse0)) 0)))) is different from false [2024-10-25 15:52:22,512 INFO L349 Elim1Store]: treesize reduction 108, result has 32.1 percent of original size [2024-10-25 15:52:22,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 184 treesize of output 187 [2024-10-25 15:52:22,565 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-25 15:52:22,566 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 254 treesize of output 254 [2024-10-25 15:52:22,588 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 132 treesize of output 125 [2024-10-25 15:52:22,606 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 125 treesize of output 111 [2024-10-25 15:52:22,707 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-25 15:52:22,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-25 15:52:22,753 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-25 15:52:22,806 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-25 15:52:22,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 103 treesize of output 136 [2024-10-25 15:52:23,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-10-25 15:52:23,233 INFO L349 Elim1Store]: treesize reduction 8, result has 86.9 percent of original size [2024-10-25 15:52:23,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 126 treesize of output 151 [2024-10-25 15:52:24,540 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 (= |c_t_funThread1of4ForFork0_~p~0#1.base| |c_~#a~0.base|)) (.cse4 (+ |c_~#a~0.offset| 252))) (let ((.cse9 (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2073 Int) (v_ArrVal_2066 Int) (|v_t_funThread2of4ForFork0_~p~0#1.offset_23| Int) (v_ArrVal_2058 (Array Int Int)) (v_ArrVal_2068 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_22| Int) (v_ArrVal_2070 Int) (v_ArrVal_2052 (Array Int Int))) (let ((.cse26 (+ |c_~#a~0.offset| (* |v_t_funThread4of4ForFork0_~i~0#1_22| 28)))) (or (= |t_funThread3of4ForFork0_~p~0#1.offset| .cse26) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_22|) (< |v_t_funThread4of4ForFork0_~i~0#1_22| 0) (< .cse4 |v_t_funThread2of4ForFork0_~p~0#1.offset_23|) (= .cse26 |v_t_funThread2of4ForFork0_~p~0#1.offset_23|) (= |c_t_funThread1of4ForFork0_~p~0#1.offset| |v_t_funThread2of4ForFork0_~p~0#1.offset_23|) (= |t_funThread3of4ForFork0_~p~0#1.offset| |v_t_funThread2of4ForFork0_~p~0#1.offset_23|) (= (select (store (store (select (store (let ((.cse27 (let ((.cse28 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse29 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2052) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse29 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse29 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2058) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse28 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse28 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse27) |c_~#a~0.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2058) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse27) |c_~#a~0.base|) |v_t_funThread2of4ForFork0_~p~0#1.offset_23| v_ArrVal_2066))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2068) |c_~#a~0.base|) |v_t_funThread2of4ForFork0_~p~0#1.offset_23| v_ArrVal_2070) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2073) .cse26) 0) (= |t_funThread3of4ForFork0_~p~0#1.offset| |c_t_funThread1of4ForFork0_~p~0#1.offset|))))) (.cse10 (not .cse11)) (.cse8 (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|)))) (and (or (and (let ((.cse3 (div (+ (* (- 1) |c_t_funThread1of4ForFork0_~p~0#1.offset|) |c_~#a~0.offset|) 28))) (or (not (= (mod (+ (* |c_t_funThread1of4ForFork0_~p~0#1.offset| 27) |c_~#a~0.offset|) 28) 0)) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2073 Int) (v_ArrVal_2066 Int) (|v_t_funThread2of4ForFork0_~p~0#1.offset_23| Int) (v_ArrVal_2058 (Array Int Int)) (v_ArrVal_2068 (Array Int Int)) (v_ArrVal_2070 Int) (v_ArrVal_2052 (Array Int Int))) (or (= (select (store (store (select (store (let ((.cse0 (let ((.cse1 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2052) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse2 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse2 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2058) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse1 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse1 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse0) |c_~#a~0.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2058) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse0) |c_~#a~0.base|) |v_t_funThread2of4ForFork0_~p~0#1.offset_23| v_ArrVal_2066))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2068) |c_~#a~0.base|) |v_t_funThread2of4ForFork0_~p~0#1.offset_23| v_ArrVal_2070) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2073) (+ |c_~#a~0.offset| (* (- 28) .cse3))) 0) (< .cse4 |v_t_funThread2of4ForFork0_~p~0#1.offset_23|) (= |c_t_funThread1of4ForFork0_~p~0#1.offset| |v_t_funThread2of4ForFork0_~p~0#1.offset_23|) (= |t_funThread3of4ForFork0_~p~0#1.offset| |v_t_funThread2of4ForFork0_~p~0#1.offset_23|) (= |t_funThread3of4ForFork0_~p~0#1.offset| |c_t_funThread1of4ForFork0_~p~0#1.offset|))) (< (+ .cse3 9) 0) (< 0 .cse3))) (or (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2073 Int) (v_ArrVal_2066 Int) (|v_t_funThread2of4ForFork0_~p~0#1.offset_23| Int) (v_ArrVal_2058 (Array Int Int)) (v_ArrVal_2068 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_22| Int) (v_ArrVal_2070 Int) (v_ArrVal_2052 (Array Int Int))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_22|) (< |v_t_funThread4of4ForFork0_~i~0#1_22| 0) (< .cse4 |v_t_funThread2of4ForFork0_~p~0#1.offset_23|) (= |c_t_funThread1of4ForFork0_~p~0#1.offset| |v_t_funThread2of4ForFork0_~p~0#1.offset_23|) (= |t_funThread3of4ForFork0_~p~0#1.offset| |v_t_funThread2of4ForFork0_~p~0#1.offset_23|) (= (select (store (store (select (store (let ((.cse5 (let ((.cse6 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2052) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse7 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse7 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2058) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse6 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse6 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse5) |c_~#a~0.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2058) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse5) |c_~#a~0.base|) |v_t_funThread2of4ForFork0_~p~0#1.offset_23| v_ArrVal_2066))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2068) |c_~#a~0.base|) |v_t_funThread2of4ForFork0_~p~0#1.offset_23| v_ArrVal_2070) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2073) (+ |c_~#a~0.offset| (* |v_t_funThread4of4ForFork0_~i~0#1_22| 28))) 0) (= |t_funThread3of4ForFork0_~p~0#1.offset| |c_t_funThread1of4ForFork0_~p~0#1.offset|))) .cse8) (or .cse9 .cse8)) .cse10) (or .cse11 (and (forall ((|v_t_funThread2of4ForFork0_~p~0#1.offset_23| Int)) (or (< .cse4 |v_t_funThread2of4ForFork0_~p~0#1.offset_23|) (forall ((|v_t_funThread4of4ForFork0_~i~0#1_22| Int)) (let ((.cse12 (+ |c_~#a~0.offset| (* |v_t_funThread4of4ForFork0_~i~0#1_22| 28)))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_22|) (< |v_t_funThread4of4ForFork0_~i~0#1_22| 0) (= .cse12 |v_t_funThread2of4ForFork0_~p~0#1.offset_23|) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2073 Int) (v_ArrVal_2066 Int) (v_ArrVal_2058 (Array Int Int)) (v_ArrVal_2068 (Array Int Int)) (v_ArrVal_2070 Int) (v_ArrVal_2052 (Array Int Int))) (or (= |t_funThread3of4ForFork0_~p~0#1.offset| .cse12) (= |t_funThread3of4ForFork0_~p~0#1.offset| |v_t_funThread2of4ForFork0_~p~0#1.offset_23|) (= (select (store (store (select (store (let ((.cse13 (let ((.cse14 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2052) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse15 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse15 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2058) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse14 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse14 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse13) |c_~#a~0.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2058) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse13) |c_~#a~0.base|) |v_t_funThread2of4ForFork0_~p~0#1.offset_23| v_ArrVal_2066))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2068) |c_~#a~0.base|) |v_t_funThread2of4ForFork0_~p~0#1.offset_23| v_ArrVal_2070) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2073) .cse12) 0)))))) (= |c_t_funThread1of4ForFork0_~p~0#1.offset| |v_t_funThread2of4ForFork0_~p~0#1.offset_23|))) (or .cse8 (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2073 Int) (v_ArrVal_2066 Int) (|v_t_funThread2of4ForFork0_~p~0#1.offset_23| Int) (v_ArrVal_2058 (Array Int Int)) (v_ArrVal_2068 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_22| Int) (v_ArrVal_2070 Int) (v_ArrVal_2052 (Array Int Int))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_22|) (< |v_t_funThread4of4ForFork0_~i~0#1_22| 0) (< .cse4 |v_t_funThread2of4ForFork0_~p~0#1.offset_23|) (= |c_t_funThread1of4ForFork0_~p~0#1.offset| |v_t_funThread2of4ForFork0_~p~0#1.offset_23|) (= |t_funThread3of4ForFork0_~p~0#1.offset| |v_t_funThread2of4ForFork0_~p~0#1.offset_23|) (= (select (store (store (select (store (let ((.cse16 (let ((.cse17 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2052) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse18 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse18 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2058) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse17 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse17 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse16) |c_~#a~0.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2058) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse16) |c_~#a~0.base|) |v_t_funThread2of4ForFork0_~p~0#1.offset_23| v_ArrVal_2066))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2068) |c_~#a~0.base|) |v_t_funThread2of4ForFork0_~p~0#1.offset_23| v_ArrVal_2070) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2073) (+ |c_~#a~0.offset| (* |v_t_funThread4of4ForFork0_~i~0#1_22| 28))) 0)))))) (or .cse9 .cse10) (or .cse11 (and (or .cse8 (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2073 Int) (v_ArrVal_2066 Int) (|v_t_funThread2of4ForFork0_~p~0#1.offset_23| Int) (v_ArrVal_2058 (Array Int Int)) (v_ArrVal_2068 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_22| Int) (v_ArrVal_2070 Int) (v_ArrVal_2052 (Array Int Int))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_22|) (< |v_t_funThread4of4ForFork0_~i~0#1_22| 0) (< .cse4 |v_t_funThread2of4ForFork0_~p~0#1.offset_23|) (= |t_funThread3of4ForFork0_~p~0#1.offset| |v_t_funThread2of4ForFork0_~p~0#1.offset_23|) (= (select (store (store (select (store (let ((.cse19 (let ((.cse20 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse21 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2052) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse21 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse21 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2058) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse20 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse20 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse19) |c_~#a~0.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2058) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse19) |c_~#a~0.base|) |v_t_funThread2of4ForFork0_~p~0#1.offset_23| v_ArrVal_2066))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2068) |c_~#a~0.base|) |v_t_funThread2of4ForFork0_~p~0#1.offset_23| v_ArrVal_2070) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2073) (+ |c_~#a~0.offset| (* |v_t_funThread4of4ForFork0_~i~0#1_22| 28))) 0)))) (forall ((|v_t_funThread2of4ForFork0_~p~0#1.offset_23| Int)) (or (< .cse4 |v_t_funThread2of4ForFork0_~p~0#1.offset_23|) (forall ((|v_t_funThread4of4ForFork0_~i~0#1_22| Int)) (let ((.cse22 (+ |c_~#a~0.offset| (* |v_t_funThread4of4ForFork0_~i~0#1_22| 28)))) (or (< 9 |v_t_funThread4of4ForFork0_~i~0#1_22|) (< |v_t_funThread4of4ForFork0_~i~0#1_22| 0) (= .cse22 |v_t_funThread2of4ForFork0_~p~0#1.offset_23|) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2073 Int) (v_ArrVal_2066 Int) (v_ArrVal_2058 (Array Int Int)) (v_ArrVal_2068 (Array Int Int)) (v_ArrVal_2070 Int) (v_ArrVal_2052 (Array Int Int))) (or (= |t_funThread3of4ForFork0_~p~0#1.offset| .cse22) (= |t_funThread3of4ForFork0_~p~0#1.offset| |v_t_funThread2of4ForFork0_~p~0#1.offset_23|) (= (select (store (store (select (store (let ((.cse23 (let ((.cse24 (select (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| (let ((.cse25 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2052) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse25 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (select .cse25 |c_t_funThread1of4ForFork0_~p~0#1.offset|) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2058) |c_t_funThread1of4ForFork0_~p~0#1.base|))) (store .cse24 |c_t_funThread1of4ForFork0_~p~0#1.offset| (+ (- 1) (select .cse24 |c_t_funThread1of4ForFork0_~p~0#1.offset|)))))) (store (store |c_#memory_int| |c_t_funThread1of4ForFork0_~p~0#1.base| .cse23) |c_~#a~0.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2058) |c_t_funThread1of4ForFork0_~p~0#1.base| .cse23) |c_~#a~0.base|) |v_t_funThread2of4ForFork0_~p~0#1.offset_23| v_ArrVal_2066))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2068) |c_~#a~0.base|) |v_t_funThread2of4ForFork0_~p~0#1.offset_23| v_ArrVal_2070) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2073) .cse22) 0))))))))))))) is different from false [2024-10-25 15:52:24,751 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#a~0.offset| 252))) (and (forall ((|v_t_funThread1of4ForFork0_~i~0#1_22| Int)) (or (< 9 |v_t_funThread1of4ForFork0_~i~0#1_22|) (< |v_t_funThread1of4ForFork0_~i~0#1_22| 0) (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2073 Int) (v_ArrVal_2066 Int) (|v_t_funThread2of4ForFork0_~p~0#1.offset_23| Int) (v_ArrVal_2058 (Array Int Int)) (v_ArrVal_2068 (Array Int Int)) (v_ArrVal_2070 Int) (v_ArrVal_2052 (Array Int Int))) (let ((.cse0 (+ (* |v_t_funThread1of4ForFork0_~i~0#1_22| 28) |c_~#a~0.offset|))) (or (= |v_t_funThread2of4ForFork0_~p~0#1.offset_23| .cse0) (< .cse1 |v_t_funThread2of4ForFork0_~p~0#1.offset_23|) (= |t_funThread3of4ForFork0_~p~0#1.offset| .cse0) (= (select (store (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store (let ((.cse2 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2052) |c_~#a~0.base|))) (store .cse3 .cse0 (+ (select .cse3 .cse0) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2058) |c_~#a~0.base|))) (store .cse2 .cse0 (+ (- 1) (select .cse2 .cse0)))) |v_t_funThread2of4ForFork0_~p~0#1.offset_23| v_ArrVal_2066)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2068) |c_~#a~0.base|) |v_t_funThread2of4ForFork0_~p~0#1.offset_23| v_ArrVal_2070) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2073) .cse0) 0) (= |t_funThread3of4ForFork0_~p~0#1.offset| |v_t_funThread2of4ForFork0_~p~0#1.offset_23|)))))) (forall ((|v_t_funThread1of4ForFork0_~i~0#1_22| Int)) (or (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2073 Int) (v_ArrVal_2066 Int) (|v_t_funThread2of4ForFork0_~p~0#1.offset_23| Int) (v_ArrVal_2058 (Array Int Int)) (v_ArrVal_2068 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_22| Int) (v_ArrVal_2070 Int) (v_ArrVal_2052 (Array Int Int))) (let ((.cse6 (+ (* |v_t_funThread1of4ForFork0_~i~0#1_22| 28) |c_~#a~0.offset|)) (.cse4 (+ |c_~#a~0.offset| (* |v_t_funThread4of4ForFork0_~i~0#1_22| 28)))) (or (= |t_funThread3of4ForFork0_~p~0#1.offset| .cse4) (= (select (store (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store (let ((.cse5 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2052) |c_~#a~0.base|))) (store .cse7 .cse6 (+ (select .cse7 .cse6) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2058) |c_~#a~0.base|))) (store .cse5 .cse6 (+ (- 1) (select .cse5 .cse6)))) |v_t_funThread2of4ForFork0_~p~0#1.offset_23| v_ArrVal_2066)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2068) |c_~#a~0.base|) |v_t_funThread2of4ForFork0_~p~0#1.offset_23| v_ArrVal_2070) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2073) .cse4) 0) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_22|) (< |v_t_funThread4of4ForFork0_~i~0#1_22| 0) (= |v_t_funThread2of4ForFork0_~p~0#1.offset_23| .cse6) (< .cse1 |v_t_funThread2of4ForFork0_~p~0#1.offset_23|) (= |t_funThread3of4ForFork0_~p~0#1.offset| .cse6) (= .cse4 |v_t_funThread2of4ForFork0_~p~0#1.offset_23|) (= |t_funThread3of4ForFork0_~p~0#1.offset| |v_t_funThread2of4ForFork0_~p~0#1.offset_23|)))) (< 9 |v_t_funThread1of4ForFork0_~i~0#1_22|) (< |v_t_funThread1of4ForFork0_~i~0#1_22| 0))) (or (forall ((|t_funThread3of4ForFork0_~p~0#1.offset| Int) (v_ArrVal_2073 Int) (v_ArrVal_2066 Int) (|v_t_funThread2of4ForFork0_~p~0#1.offset_23| Int) (v_ArrVal_2058 (Array Int Int)) (v_ArrVal_2068 (Array Int Int)) (|v_t_funThread4of4ForFork0_~i~0#1_22| Int) (v_ArrVal_2070 Int) (|v_t_funThread1of4ForFork0_~i~0#1_22| Int) (v_ArrVal_2052 (Array Int Int))) (let ((.cse9 (+ (* |v_t_funThread1of4ForFork0_~i~0#1_22| 28) |c_~#a~0.offset|))) (or (= (select (store (store (select (store (store |c_#memory_int| |c_~#a~0.base| (store (let ((.cse8 (select (store (store |c_#memory_int| |c_~#a~0.base| (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2052) |c_~#a~0.base|))) (store .cse10 .cse9 (+ (select .cse10 .cse9) 1)))) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2058) |c_~#a~0.base|))) (store .cse8 .cse9 (+ (- 1) (select .cse8 .cse9)))) |v_t_funThread2of4ForFork0_~p~0#1.offset_23| v_ArrVal_2066)) |c_ULTIMATE.start_main_~#t_ids~0#1.base| v_ArrVal_2068) |c_~#a~0.base|) |v_t_funThread2of4ForFork0_~p~0#1.offset_23| v_ArrVal_2070) |t_funThread3of4ForFork0_~p~0#1.offset| v_ArrVal_2073) (+ |c_~#a~0.offset| (* |v_t_funThread4of4ForFork0_~i~0#1_22| 28))) 0) (< 9 |v_t_funThread4of4ForFork0_~i~0#1_22|) (< |v_t_funThread4of4ForFork0_~i~0#1_22| 0) (= |v_t_funThread2of4ForFork0_~p~0#1.offset_23| .cse9) (< .cse1 |v_t_funThread2of4ForFork0_~p~0#1.offset_23|) (= |t_funThread3of4ForFork0_~p~0#1.offset| .cse9) (< 9 |v_t_funThread1of4ForFork0_~i~0#1_22|) (= |t_funThread3of4ForFork0_~p~0#1.offset| |v_t_funThread2of4ForFork0_~p~0#1.offset_23|) (< |v_t_funThread1of4ForFork0_~i~0#1_22| 0)))) (not (= |c_~#a~0.base| |c_~#__global_lock~0.base|))))) is different from false [2024-10-25 15:52:27,274 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 5 refuted. 4 times theorem prover too weak. 55 trivial. 17 not checked. [2024-10-25 15:52:27,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099361667] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-25 15:52:27,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-25 15:52:27,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 30, 23] total 66 [2024-10-25 15:52:27,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148588947] [2024-10-25 15:52:27,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-25 15:52:27,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2024-10-25 15:52:27,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-25 15:52:27,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2024-10-25 15:52:27,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=3052, Unknown=91, NotChecked=968, Total=4422 [2024-10-25 15:52:27,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:52:27,277 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-10-25 15:52:27,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 3.8208955223880596) internal successors, (256), 66 states have internal predecessors, (256), 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-25 15:52:27,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:52:27,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-10-25 15:52:27,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-10-25 15:52:27,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 58 states. [2024-10-25 15:52:27,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-10-25 15:52:27,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-10-25 15:52:27,278 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-10-25 15:52:44,454 WARN L286 SmtUtils]: Spent 5.28s on a formula simplification. DAG size of input: 321 DAG size of output: 235 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-25 15:52:51,189 WARN L286 SmtUtils]: Spent 5.52s on a formula simplification. DAG size of input: 387 DAG size of output: 306 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-25 15:52:53,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:53:01,461 WARN L286 SmtUtils]: Spent 5.47s on a formula simplification. DAG size of input: 323 DAG size of output: 238 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-25 15:53:06,527 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 [1] [2024-10-25 15:53:08,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:53:10,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:53:17,312 WARN L286 SmtUtils]: Spent 5.33s on a formula simplification. DAG size of input: 422 DAG size of output: 335 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-25 15:53:21,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:53:27,803 WARN L286 SmtUtils]: Spent 5.66s on a formula simplification. DAG size of input: 370 DAG size of output: 285 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-25 15:53:40,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:53:42,634 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:53:44,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:53:47,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:53:49,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:53:51,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:53:54,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:53:56,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:54:00,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:54:02,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:54:05,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:54:09,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:54:22,035 WARN L286 SmtUtils]: Spent 5.81s on a formula simplification. DAG size of input: 491 DAG size of output: 420 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-25 15:54:24,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:54:27,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:54:29,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:54:31,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 [1] [2024-10-25 15:54:33,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-10-25 15:54:35,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Killed by 15