/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true -i ../../../trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-a20a710-m [2023-12-09 15:27:26,655 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-09 15:27:26,718 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-12-09 15:27:26,744 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-09 15:27:26,745 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-09 15:27:26,746 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-09 15:27:26,746 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-09 15:27:26,746 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-09 15:27:26,747 INFO L153 SettingsManager]: * Use SBE=true [2023-12-09 15:27:26,748 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-09 15:27:26,748 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-09 15:27:26,748 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-09 15:27:26,748 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-09 15:27:26,748 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-09 15:27:26,749 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-09 15:27:26,749 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-09 15:27:26,749 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-09 15:27:26,749 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-09 15:27:26,749 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-09 15:27:26,750 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-09 15:27:26,750 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-09 15:27:26,750 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-09 15:27:26,751 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-09 15:27:26,751 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-09 15:27:26,751 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-09 15:27:26,751 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:27:26,751 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-09 15:27:26,751 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-09 15:27:26,752 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-09 15:27:26,752 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-09 15:27:26,752 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-09 15:27:26,752 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-09 15:27:26,752 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-09 15:27:26,752 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/UAutomizer-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.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true [2023-12-09 15:27:26,955 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-09 15:27:26,974 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-09 15:27:26,976 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-09 15:27:26,976 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-09 15:27:26,977 INFO L274 PluginConnector]: CDTParser initialized [2023-12-09 15:27:26,977 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c [2023-12-09 15:27:27,966 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-09 15:27:28,111 INFO L384 CDTParser]: Found 1 translation units. [2023-12-09 15:27:28,111 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c [2023-12-09 15:27:28,121 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be8132109/4b3996e3ce9f473f9392c7cc3be1ef3b/FLAG68caf9695 [2023-12-09 15:27:28,138 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be8132109/4b3996e3ce9f473f9392c7cc3be1ef3b [2023-12-09 15:27:28,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-09 15:27:28,141 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-09 15:27:28,141 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-09 15:27:28,141 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-09 15:27:28,145 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-09 15:27:28,145 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:27:28" (1/1) ... [2023-12-09 15:27:28,146 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cb6c45b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:27:28, skipping insertion in model container [2023-12-09 15:27:28,147 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:27:28" (1/1) ... [2023-12-09 15:27:28,168 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-09 15:27:28,276 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c[2625,2638] [2023-12-09 15:27:28,283 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:27:28,289 INFO L202 MainTranslator]: Completed pre-run [2023-12-09 15:27:28,306 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c[2625,2638] [2023-12-09 15:27:28,308 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:27:28,315 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-09 15:27:28,315 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-09 15:27:28,320 INFO L206 MainTranslator]: Completed translation [2023-12-09 15:27:28,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:27:28 WrapperNode [2023-12-09 15:27:28,320 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-09 15:27:28,321 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-09 15:27:28,321 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-09 15:27:28,322 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-09 15:27:28,328 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:27:28" (1/1) ... [2023-12-09 15:27:28,334 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:27:28" (1/1) ... [2023-12-09 15:27:28,351 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 105 [2023-12-09 15:27:28,351 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-09 15:27:28,352 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-09 15:27:28,352 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-09 15:27:28,352 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-09 15:27:28,357 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:27:28" (1/1) ... [2023-12-09 15:27:28,357 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:27:28" (1/1) ... [2023-12-09 15:27:28,359 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:27:28" (1/1) ... [2023-12-09 15:27:28,359 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:27:28" (1/1) ... [2023-12-09 15:27:28,366 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:27:28" (1/1) ... [2023-12-09 15:27:28,368 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:27:28" (1/1) ... [2023-12-09 15:27:28,369 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:27:28" (1/1) ... [2023-12-09 15:27:28,370 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:27:28" (1/1) ... [2023-12-09 15:27:28,372 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-09 15:27:28,373 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-09 15:27:28,373 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-09 15:27:28,373 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-09 15:27:28,373 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:27:28" (1/1) ... [2023-12-09 15:27:28,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:27:28,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:27:28,395 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-09 15:27:28,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-09 15:27:28,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-09 15:27:28,440 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-09 15:27:28,440 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-09 15:27:28,440 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-09 15:27:28,440 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-09 15:27:28,440 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-12-09 15:27:28,440 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-12-09 15:27:28,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-09 15:27:28,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-09 15:27:28,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-09 15:27:28,441 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-09 15:27:28,441 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-09 15:27:28,441 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-09 15:27:28,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-09 15:27:28,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-09 15:27:28,441 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-09 15:27:28,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-09 15:27:28,442 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-09 15:27:28,543 INFO L241 CfgBuilder]: Building ICFG [2023-12-09 15:27:28,545 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-09 15:27:28,766 INFO L282 CfgBuilder]: Performing block encoding [2023-12-09 15:27:28,817 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-09 15:27:28,817 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-09 15:27:28,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:27:28 BoogieIcfgContainer [2023-12-09 15:27:28,818 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-09 15:27:28,820 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-09 15:27:28,820 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-09 15:27:28,822 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-09 15:27:28,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:27:28" (1/3) ... [2023-12-09 15:27:28,823 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b84240f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:27:28, skipping insertion in model container [2023-12-09 15:27:28,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:27:28" (2/3) ... [2023-12-09 15:27:28,823 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b84240f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:27:28, skipping insertion in model container [2023-12-09 15:27:28,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:27:28" (3/3) ... [2023-12-09 15:27:28,824 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array-hom.wvr.c [2023-12-09 15:27:28,835 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-09 15:27:28,835 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-09 15:27:28,835 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-09 15:27:28,907 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-12-09 15:27:28,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 160 transitions, 341 flow [2023-12-09 15:27:28,988 INFO L124 PetriNetUnfolderBase]: 12/157 cut-off events. [2023-12-09 15:27:28,988 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-09 15:27:28,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 157 events. 12/157 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 105 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 117. Up to 2 conditions per place. [2023-12-09 15:27:28,993 INFO L82 GeneralOperation]: Start removeDead. Operand has 158 places, 160 transitions, 341 flow [2023-12-09 15:27:28,996 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 146 transitions, 310 flow [2023-12-09 15:27:29,003 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 15:27:29,007 INFO L362 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, 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;@723399cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 15:27:29,007 INFO L363 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-12-09 15:27:29,048 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 15:27:29,048 INFO L124 PetriNetUnfolderBase]: 12/145 cut-off events. [2023-12-09 15:27:29,048 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-09 15:27:29,048 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:27:29,049 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:27:29,049 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:27:29,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:27:29,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1087243074, now seen corresponding path program 1 times [2023-12-09 15:27:29,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:27:29,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726352545] [2023-12-09 15:27:29,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:27:29,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:27:29,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:27:29,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:27:29,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:27:29,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726352545] [2023-12-09 15:27:29,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726352545] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:27:29,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:27:29,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-09 15:27:29,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131674779] [2023-12-09 15:27:29,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:27:29,851 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-09 15:27:29,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:27:29,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-09 15:27:29,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2023-12-09 15:27:29,889 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 160 [2023-12-09 15:27:29,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 146 transitions, 310 flow. Second operand has 8 states, 8 states have (on average 95.875) internal successors, (767), 8 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:29,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:27:29,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 160 [2023-12-09 15:27:29,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:27:30,150 INFO L124 PetriNetUnfolderBase]: 295/761 cut-off events. [2023-12-09 15:27:30,150 INFO L125 PetriNetUnfolderBase]: For 99/99 co-relation queries the response was YES. [2023-12-09 15:27:30,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1288 conditions, 761 events. 295/761 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3711 event pairs, 167 based on Foata normal form. 5/599 useless extension candidates. Maximal degree in co-relation 1052. Up to 416 conditions per place. [2023-12-09 15:27:30,162 INFO L140 encePairwiseOnDemand]: 140/160 looper letters, 53 selfloop transitions, 8 changer transitions 12/150 dead transitions. [2023-12-09 15:27:30,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 150 transitions, 464 flow [2023-12-09 15:27:30,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-09 15:27:30,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-12-09 15:27:30,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 804 transitions. [2023-12-09 15:27:30,176 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.628125 [2023-12-09 15:27:30,177 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 804 transitions. [2023-12-09 15:27:30,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 804 transitions. [2023-12-09 15:27:30,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:27:30,181 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 804 transitions. [2023-12-09 15:27:30,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 100.5) internal successors, (804), 8 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:30,191 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 160.0) internal successors, (1440), 9 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:30,192 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 160.0) internal successors, (1440), 9 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:30,196 INFO L308 CegarLoopForPetriNet]: 144 programPoint places, 7 predicate places. [2023-12-09 15:27:30,196 INFO L500 AbstractCegarLoop]: Abstraction has has 151 places, 150 transitions, 464 flow [2023-12-09 15:27:30,197 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 95.875) internal successors, (767), 8 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:30,197 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:27:30,198 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:27:30,198 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-09 15:27:30,198 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:27:30,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:27:30,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1096071011, now seen corresponding path program 1 times [2023-12-09 15:27:30,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:27:30,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901243274] [2023-12-09 15:27:30,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:27:30,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:27:30,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:27:30,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:27:30,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:27:30,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901243274] [2023-12-09 15:27:30,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901243274] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:27:30,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1770295038] [2023-12-09 15:27:30,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:27:30,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:27:30,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:27:30,381 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:27:30,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-09 15:27:30,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:27:30,467 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-09 15:27:30,471 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:27:30,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:27:30,571 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:27:30,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:27:30,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1770295038] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-09 15:27:30,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-09 15:27:30,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2023-12-09 15:27:30,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095502232] [2023-12-09 15:27:30,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:27:30,704 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-09 15:27:30,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:27:30,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-09 15:27:30,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-12-09 15:27:30,705 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 160 [2023-12-09 15:27:30,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 150 transitions, 464 flow. Second operand has 7 states, 7 states have (on average 120.0) internal successors, (840), 7 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:30,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:27:30,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 160 [2023-12-09 15:27:30,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:27:30,858 INFO L124 PetriNetUnfolderBase]: 412/950 cut-off events. [2023-12-09 15:27:30,858 INFO L125 PetriNetUnfolderBase]: For 379/446 co-relation queries the response was YES. [2023-12-09 15:27:30,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2138 conditions, 950 events. 412/950 cut-off events. For 379/446 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4764 event pairs, 188 based on Foata normal form. 11/777 useless extension candidates. Maximal degree in co-relation 1830. Up to 550 conditions per place. [2023-12-09 15:27:30,895 INFO L140 encePairwiseOnDemand]: 149/160 looper letters, 39 selfloop transitions, 7 changer transitions 12/157 dead transitions. [2023-12-09 15:27:30,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 157 transitions, 600 flow [2023-12-09 15:27:30,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-09 15:27:30,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-09 15:27:30,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 861 transitions. [2023-12-09 15:27:30,899 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.76875 [2023-12-09 15:27:30,899 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 861 transitions. [2023-12-09 15:27:30,899 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 861 transitions. [2023-12-09 15:27:30,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:27:30,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 861 transitions. [2023-12-09 15:27:30,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.0) internal successors, (861), 7 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:30,903 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 160.0) internal successors, (1280), 8 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:30,903 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 160.0) internal successors, (1280), 8 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:30,904 INFO L308 CegarLoopForPetriNet]: 144 programPoint places, 13 predicate places. [2023-12-09 15:27:30,904 INFO L500 AbstractCegarLoop]: Abstraction has has 157 places, 157 transitions, 600 flow [2023-12-09 15:27:30,905 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 120.0) internal successors, (840), 7 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:30,905 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:27:30,905 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:27:30,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-09 15:27:31,111 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:27:31,112 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:27:31,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:27:31,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1056125606, now seen corresponding path program 1 times [2023-12-09 15:27:31,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:27:31,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702240419] [2023-12-09 15:27:31,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:27:31,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:27:31,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:27:31,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:27:31,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:27:31,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702240419] [2023-12-09 15:27:31,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702240419] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:27:31,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1589943361] [2023-12-09 15:27:31,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:27:31,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:27:31,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:27:31,369 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:27:31,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-09 15:27:31,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:27:31,478 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-09 15:27:31,482 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:27:31,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:27:31,599 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:27:31,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:27:31,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1589943361] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-09 15:27:31,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-09 15:27:31,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 19 [2023-12-09 15:27:31,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557765219] [2023-12-09 15:27:31,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:27:31,765 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-09 15:27:31,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:27:31,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-09 15:27:31,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2023-12-09 15:27:31,770 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 160 [2023-12-09 15:27:31,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 157 transitions, 600 flow. Second operand has 9 states, 9 states have (on average 111.88888888888889) internal successors, (1007), 9 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:31,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:27:31,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 160 [2023-12-09 15:27:31,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:27:32,186 INFO L124 PetriNetUnfolderBase]: 1734/3206 cut-off events. [2023-12-09 15:27:32,187 INFO L125 PetriNetUnfolderBase]: For 2857/3189 co-relation queries the response was YES. [2023-12-09 15:27:32,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9349 conditions, 3206 events. 1734/3206 cut-off events. For 2857/3189 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 19734 event pairs, 320 based on Foata normal form. 41/2677 useless extension candidates. Maximal degree in co-relation 8933. Up to 1714 conditions per place. [2023-12-09 15:27:32,211 INFO L140 encePairwiseOnDemand]: 143/160 looper letters, 96 selfloop transitions, 27 changer transitions 12/226 dead transitions. [2023-12-09 15:27:32,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 226 transitions, 1216 flow [2023-12-09 15:27:32,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-09 15:27:32,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-09 15:27:32,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1183 transitions. [2023-12-09 15:27:32,214 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.739375 [2023-12-09 15:27:32,214 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1183 transitions. [2023-12-09 15:27:32,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1183 transitions. [2023-12-09 15:27:32,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:27:32,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1183 transitions. [2023-12-09 15:27:32,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 118.3) internal successors, (1183), 10 states have internal predecessors, (1183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:32,219 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 160.0) internal successors, (1760), 11 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:32,219 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 160.0) internal successors, (1760), 11 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:32,220 INFO L308 CegarLoopForPetriNet]: 144 programPoint places, 22 predicate places. [2023-12-09 15:27:32,220 INFO L500 AbstractCegarLoop]: Abstraction has has 166 places, 226 transitions, 1216 flow [2023-12-09 15:27:32,222 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 111.88888888888889) internal successors, (1007), 9 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:32,222 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:27:32,222 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:27:32,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-09 15:27:32,427 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-12-09 15:27:32,427 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:27:32,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:27:32,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1861703146, now seen corresponding path program 2 times [2023-12-09 15:27:32,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:27:32,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612155717] [2023-12-09 15:27:32,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:27:32,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:27:32,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:27:32,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:27:32,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:27:32,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612155717] [2023-12-09 15:27:32,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612155717] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:27:32,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722822517] [2023-12-09 15:27:32,614 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-09 15:27:32,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:27:32,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:27:32,615 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:27:32,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-09 15:27:32,734 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-09 15:27:32,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:27:32,736 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-09 15:27:32,744 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:27:32,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:27:32,845 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:27:32,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:27:32,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722822517] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-09 15:27:32,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-09 15:27:32,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2023-12-09 15:27:32,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103167614] [2023-12-09 15:27:32,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:27:32,985 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-09 15:27:32,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:27:32,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-09 15:27:32,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2023-12-09 15:27:32,988 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 160 [2023-12-09 15:27:32,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 226 transitions, 1216 flow. Second operand has 9 states, 9 states have (on average 111.88888888888889) internal successors, (1007), 9 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:32,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:27:32,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 160 [2023-12-09 15:27:32,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:27:33,755 INFO L124 PetriNetUnfolderBase]: 3070/5428 cut-off events. [2023-12-09 15:27:33,755 INFO L125 PetriNetUnfolderBase]: For 6534/7548 co-relation queries the response was YES. [2023-12-09 15:27:33,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20448 conditions, 5428 events. 3070/5428 cut-off events. For 6534/7548 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 36309 event pairs, 391 based on Foata normal form. 126/4576 useless extension candidates. Maximal degree in co-relation 19825. Up to 3018 conditions per place. [2023-12-09 15:27:33,801 INFO L140 encePairwiseOnDemand]: 145/160 looper letters, 251 selfloop transitions, 55 changer transitions 12/409 dead transitions. [2023-12-09 15:27:33,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 409 transitions, 3249 flow [2023-12-09 15:27:33,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-09 15:27:33,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-12-09 15:27:33,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1532 transitions. [2023-12-09 15:27:33,804 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7365384615384616 [2023-12-09 15:27:33,804 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1532 transitions. [2023-12-09 15:27:33,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1532 transitions. [2023-12-09 15:27:33,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:27:33,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1532 transitions. [2023-12-09 15:27:33,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 117.84615384615384) internal successors, (1532), 13 states have internal predecessors, (1532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:33,810 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 160.0) internal successors, (2240), 14 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:33,810 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 160.0) internal successors, (2240), 14 states have internal predecessors, (2240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:33,811 INFO L308 CegarLoopForPetriNet]: 144 programPoint places, 34 predicate places. [2023-12-09 15:27:33,811 INFO L500 AbstractCegarLoop]: Abstraction has has 178 places, 409 transitions, 3249 flow [2023-12-09 15:27:33,811 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 111.88888888888889) internal successors, (1007), 9 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:33,811 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:27:33,812 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:27:33,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-09 15:27:34,016 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:27:34,017 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:27:34,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:27:34,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1949570920, now seen corresponding path program 3 times [2023-12-09 15:27:34,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:27:34,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598972891] [2023-12-09 15:27:34,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:27:34,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:27:34,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:27:34,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:27:34,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:27:34,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598972891] [2023-12-09 15:27:34,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598972891] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:27:34,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881509851] [2023-12-09 15:27:34,150 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-09 15:27:34,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:27:34,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:27:34,151 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:27:34,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-09 15:27:34,244 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-09 15:27:34,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:27:34,245 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-09 15:27:34,247 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:27:34,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:27:34,337 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:27:34,473 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:27:34,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881509851] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:27:34,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:27:34,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2023-12-09 15:27:34,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986778446] [2023-12-09 15:27:34,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:27:34,474 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-09 15:27:34,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:27:34,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-09 15:27:34,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2023-12-09 15:27:34,476 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 160 [2023-12-09 15:27:34,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 409 transitions, 3249 flow. Second operand has 18 states, 18 states have (on average 111.05555555555556) internal successors, (1999), 18 states have internal predecessors, (1999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:34,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:27:34,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 160 [2023-12-09 15:27:34,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:27:35,591 INFO L124 PetriNetUnfolderBase]: 3758/7080 cut-off events. [2023-12-09 15:27:35,591 INFO L125 PetriNetUnfolderBase]: For 7541/9659 co-relation queries the response was YES. [2023-12-09 15:27:35,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31046 conditions, 7080 events. 3758/7080 cut-off events. For 7541/9659 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 52746 event pairs, 421 based on Foata normal form. 77/6141 useless extension candidates. Maximal degree in co-relation 27529. Up to 3557 conditions per place. [2023-12-09 15:27:35,662 INFO L140 encePairwiseOnDemand]: 143/160 looper letters, 516 selfloop transitions, 112 changer transitions 12/731 dead transitions. [2023-12-09 15:27:35,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 731 transitions, 7599 flow [2023-12-09 15:27:35,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-09 15:27:35,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-12-09 15:27:35,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2320 transitions. [2023-12-09 15:27:35,667 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.725 [2023-12-09 15:27:35,667 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 2320 transitions. [2023-12-09 15:27:35,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 2320 transitions. [2023-12-09 15:27:35,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:27:35,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 2320 transitions. [2023-12-09 15:27:35,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 116.0) internal successors, (2320), 20 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:35,675 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 160.0) internal successors, (3360), 21 states have internal predecessors, (3360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:35,676 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 160.0) internal successors, (3360), 21 states have internal predecessors, (3360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:35,677 INFO L308 CegarLoopForPetriNet]: 144 programPoint places, 53 predicate places. [2023-12-09 15:27:35,677 INFO L500 AbstractCegarLoop]: Abstraction has has 197 places, 731 transitions, 7599 flow [2023-12-09 15:27:35,677 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 111.05555555555556) internal successors, (1999), 18 states have internal predecessors, (1999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:35,677 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:27:35,678 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:27:35,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-09 15:27:35,882 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:27:35,883 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:27:35,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:27:35,883 INFO L85 PathProgramCache]: Analyzing trace with hash 147853648, now seen corresponding path program 4 times [2023-12-09 15:27:35,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:27:35,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652022867] [2023-12-09 15:27:35,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:27:35,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:27:35,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:27:36,058 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:27:36,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:27:36,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652022867] [2023-12-09 15:27:36,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652022867] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:27:36,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835879172] [2023-12-09 15:27:36,058 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-09 15:27:36,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:27:36,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:27:36,073 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:27:36,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-09 15:27:36,188 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-09 15:27:36,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:27:36,189 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-09 15:27:36,191 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:27:36,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:27:36,285 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:27:36,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:27:36,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835879172] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-09 15:27:36,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-09 15:27:36,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 19 [2023-12-09 15:27:36,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759304680] [2023-12-09 15:27:36,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:27:36,417 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-09 15:27:36,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:27:36,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-09 15:27:36,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2023-12-09 15:27:36,419 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 160 [2023-12-09 15:27:36,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 731 transitions, 7599 flow. Second operand has 9 states, 9 states have (on average 111.88888888888889) internal successors, (1007), 9 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:36,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:27:36,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 160 [2023-12-09 15:27:36,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:27:37,475 INFO L124 PetriNetUnfolderBase]: 3740/7019 cut-off events. [2023-12-09 15:27:37,475 INFO L125 PetriNetUnfolderBase]: For 12048/14770 co-relation queries the response was YES. [2023-12-09 15:27:37,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36202 conditions, 7019 events. 3740/7019 cut-off events. For 12048/14770 co-relation queries the response was YES. Maximal size of possible extension queue 309. Compared 52298 event pairs, 348 based on Foata normal form. 292/6287 useless extension candidates. Maximal degree in co-relation 35256. Up to 3545 conditions per place. [2023-12-09 15:27:37,536 INFO L140 encePairwiseOnDemand]: 142/160 looper letters, 515 selfloop transitions, 115 changer transitions 12/733 dead transitions. [2023-12-09 15:27:37,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 733 transitions, 8892 flow [2023-12-09 15:27:37,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-09 15:27:37,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-12-09 15:27:37,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1310 transitions. [2023-12-09 15:27:37,539 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7443181818181818 [2023-12-09 15:27:37,539 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1310 transitions. [2023-12-09 15:27:37,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1310 transitions. [2023-12-09 15:27:37,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:27:37,539 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1310 transitions. [2023-12-09 15:27:37,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 119.0909090909091) internal successors, (1310), 11 states have internal predecessors, (1310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:37,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 160.0) internal successors, (1920), 12 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:37,544 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 160.0) internal successors, (1920), 12 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:37,546 INFO L308 CegarLoopForPetriNet]: 144 programPoint places, 63 predicate places. [2023-12-09 15:27:37,546 INFO L500 AbstractCegarLoop]: Abstraction has has 207 places, 733 transitions, 8892 flow [2023-12-09 15:27:37,546 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 111.88888888888889) internal successors, (1007), 9 states have internal predecessors, (1007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:37,546 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:27:37,546 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:27:37,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-09 15:27:37,751 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:27:37,751 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:27:37,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:27:37,752 INFO L85 PathProgramCache]: Analyzing trace with hash -963035946, now seen corresponding path program 5 times [2023-12-09 15:27:37,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:27:37,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384560205] [2023-12-09 15:27:37,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:27:37,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:27:37,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:27:37,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:27:37,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:27:37,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384560205] [2023-12-09 15:27:37,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384560205] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:27:37,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140834283] [2023-12-09 15:27:37,903 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-09 15:27:37,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:27:37,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:27:37,904 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:27:37,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-09 15:27:37,993 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-09 15:27:37,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:27:37,995 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-09 15:27:37,996 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:27:38,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:27:38,063 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:27:38,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:27:38,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140834283] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:27:38,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:27:38,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 17 [2023-12-09 15:27:38,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432634601] [2023-12-09 15:27:38,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:27:38,129 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-09 15:27:38,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:27:38,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-09 15:27:38,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2023-12-09 15:27:38,131 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 160 [2023-12-09 15:27:38,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 733 transitions, 8892 flow. Second operand has 17 states, 17 states have (on average 108.11764705882354) internal successors, (1838), 17 states have internal predecessors, (1838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:38,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:27:38,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 160 [2023-12-09 15:27:38,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:27:40,483 INFO L124 PetriNetUnfolderBase]: 7586/13325 cut-off events. [2023-12-09 15:27:40,484 INFO L125 PetriNetUnfolderBase]: For 15884/19470 co-relation queries the response was YES. [2023-12-09 15:27:40,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75805 conditions, 13325 events. 7586/13325 cut-off events. For 15884/19470 co-relation queries the response was YES. Maximal size of possible extension queue 563. Compared 101692 event pairs, 302 based on Foata normal form. 120/12072 useless extension candidates. Maximal degree in co-relation 69077. Up to 5770 conditions per place. [2023-12-09 15:27:40,598 INFO L140 encePairwiseOnDemand]: 138/160 looper letters, 982 selfloop transitions, 335 changer transitions 12/1416 dead transitions. [2023-12-09 15:27:40,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 1416 transitions, 19818 flow [2023-12-09 15:27:40,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-09 15:27:40,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-12-09 15:27:40,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 3017 transitions. [2023-12-09 15:27:40,603 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7252403846153846 [2023-12-09 15:27:40,604 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 3017 transitions. [2023-12-09 15:27:40,604 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 3017 transitions. [2023-12-09 15:27:40,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:27:40,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 3017 transitions. [2023-12-09 15:27:40,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 116.03846153846153) internal successors, (3017), 26 states have internal predecessors, (3017), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:40,613 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 160.0) internal successors, (4320), 27 states have internal predecessors, (4320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:40,614 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 160.0) internal successors, (4320), 27 states have internal predecessors, (4320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:40,615 INFO L308 CegarLoopForPetriNet]: 144 programPoint places, 88 predicate places. [2023-12-09 15:27:40,615 INFO L500 AbstractCegarLoop]: Abstraction has has 232 places, 1416 transitions, 19818 flow [2023-12-09 15:27:40,616 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 108.11764705882354) internal successors, (1838), 17 states have internal predecessors, (1838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:40,616 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:27:40,616 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:27:40,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-09 15:27:40,820 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:27:40,822 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:27:40,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:27:40,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1834185562, now seen corresponding path program 6 times [2023-12-09 15:27:40,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:27:40,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466490370] [2023-12-09 15:27:40,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:27:40,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:27:40,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:27:40,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:27:40,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:27:40,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466490370] [2023-12-09 15:27:40,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466490370] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:27:40,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834174950] [2023-12-09 15:27:40,959 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-09 15:27:40,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:27:40,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:27:40,960 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:27:40,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-09 15:27:41,042 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2023-12-09 15:27:41,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:27:41,044 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-09 15:27:41,045 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:27:41,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-09 15:27:41,203 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-09 15:27:41,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834174950] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:27:41,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-09 15:27:41,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2023-12-09 15:27:41,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475023347] [2023-12-09 15:27:41,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:27:41,205 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-09 15:27:41,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:27:41,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-09 15:27:41,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2023-12-09 15:27:41,206 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 160 [2023-12-09 15:27:41,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 1416 transitions, 19818 flow. Second operand has 6 states, 6 states have (on average 106.0) internal successors, (636), 6 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:41,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:27:41,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 160 [2023-12-09 15:27:41,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:27:43,121 INFO L124 PetriNetUnfolderBase]: 6359/10969 cut-off events. [2023-12-09 15:27:43,121 INFO L125 PetriNetUnfolderBase]: For 19956/23342 co-relation queries the response was YES. [2023-12-09 15:27:43,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69670 conditions, 10969 events. 6359/10969 cut-off events. For 19956/23342 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 78956 event pairs, 311 based on Foata normal form. 36/9994 useless extension candidates. Maximal degree in co-relation 63419. Up to 4885 conditions per place. [2023-12-09 15:27:43,215 INFO L140 encePairwiseOnDemand]: 151/160 looper letters, 725 selfloop transitions, 103 changer transitions 12/1078 dead transitions. [2023-12-09 15:27:43,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 1078 transitions, 16376 flow [2023-12-09 15:27:43,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-09 15:27:43,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-12-09 15:27:43,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 854 transitions. [2023-12-09 15:27:43,218 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6671875 [2023-12-09 15:27:43,218 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 854 transitions. [2023-12-09 15:27:43,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 854 transitions. [2023-12-09 15:27:43,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:27:43,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 854 transitions. [2023-12-09 15:27:43,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 106.75) internal successors, (854), 8 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:43,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 160.0) internal successors, (1440), 9 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:43,222 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 160.0) internal successors, (1440), 9 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:43,224 INFO L308 CegarLoopForPetriNet]: 144 programPoint places, 89 predicate places. [2023-12-09 15:27:43,224 INFO L500 AbstractCegarLoop]: Abstraction has has 233 places, 1078 transitions, 16376 flow [2023-12-09 15:27:43,224 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.0) internal successors, (636), 6 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:43,224 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:27:43,225 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:27:43,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-09 15:27:43,429 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:27:43,429 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:27:43,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:27:43,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1949756477, now seen corresponding path program 1 times [2023-12-09 15:27:43,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:27:43,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633144892] [2023-12-09 15:27:43,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:27:43,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:27:43,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:27:44,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:27:44,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:27:44,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633144892] [2023-12-09 15:27:44,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633144892] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:27:44,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594904444] [2023-12-09 15:27:44,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:27:44,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:27:44,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:27:44,998 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:27:45,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-09 15:27:45,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:27:45,109 INFO L262 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 49 conjunts are in the unsatisfiable core [2023-12-09 15:27:45,112 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:27:46,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 15:27:46,533 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 38 treesize of output 29 [2023-12-09 15:27:46,856 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:27:46,857 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 65 treesize of output 43 [2023-12-09 15:27:47,324 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:27:47,324 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:27:48,250 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~min2~0 c_~min1~0))) (and (or (forall ((~M~0 Int) (v_ArrVal_271 (Array Int Int))) (or (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< (+ ~M~0 1) c_~N~0) (< c_thread2Thread1of1ForFork0_~i~1 ~M~0))) (and (or (= c_~min1~0 c_~min3~0) (< c_~min2~0 (+ c_~min3~0 1))) (or .cse0 (< c_~min3~0 c_~min2~0)))) (or .cse0 (forall ((~M~0 Int) (v_ArrVal_271 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (< c_~min3~0 (+ .cse1 1)) (< .cse1 c_~min2~0) (< (+ ~M~0 1) c_~N~0) (< c_thread2Thread1of1ForFork0_~i~1 ~M~0))))) (forall ((~M~0 Int) (v_ArrVal_271 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_271) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (let ((.cse3 (+ .cse2 1))) (or (= c_~min1~0 .cse2) (< c_~min2~0 .cse3) (< c_~min3~0 .cse3) (< (+ ~M~0 1) c_~N~0) (< c_thread2Thread1of1ForFork0_~i~1 ~M~0))))))) is different from false [2023-12-09 15:27:48,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:27:48,880 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 282 treesize of output 258 [2023-12-09 15:27:48,892 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 182 treesize of output 176 [2023-12-09 15:27:48,901 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 176 treesize of output 164 [2023-12-09 15:27:48,909 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 164 treesize of output 146 [2023-12-09 15:27:54,439 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:27:54,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594904444] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:27:54,439 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:27:54,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30, 29] total 75 [2023-12-09 15:27:54,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761407770] [2023-12-09 15:27:54,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:27:54,440 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2023-12-09 15:27:54,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:27:54,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2023-12-09 15:27:54,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=625, Invalid=4776, Unknown=5, NotChecked=144, Total=5550 [2023-12-09 15:27:54,445 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 160 [2023-12-09 15:27:54,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 1078 transitions, 16376 flow. Second operand has 75 states, 75 states have (on average 53.2) internal successors, (3990), 75 states have internal predecessors, (3990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:27:54,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:27:54,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 160 [2023-12-09 15:27:54,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:28:12,732 INFO L124 PetriNetUnfolderBase]: 29856/46260 cut-off events. [2023-12-09 15:28:12,733 INFO L125 PetriNetUnfolderBase]: For 134462/134858 co-relation queries the response was YES. [2023-12-09 15:28:12,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 308791 conditions, 46260 events. 29856/46260 cut-off events. For 134462/134858 co-relation queries the response was YES. Maximal size of possible extension queue 2180. Compared 371240 event pairs, 1789 based on Foata normal form. 42/42389 useless extension candidates. Maximal degree in co-relation 234338. Up to 20697 conditions per place. [2023-12-09 15:28:13,313 INFO L140 encePairwiseOnDemand]: 113/160 looper letters, 3511 selfloop transitions, 1989 changer transitions 52/5592 dead transitions. [2023-12-09 15:28:13,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 5592 transitions, 96718 flow [2023-12-09 15:28:13,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2023-12-09 15:28:13,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2023-12-09 15:28:13,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 5999 transitions. [2023-12-09 15:28:13,342 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.3675857843137255 [2023-12-09 15:28:13,342 INFO L72 ComplementDD]: Start complementDD. Operand 102 states and 5999 transitions. [2023-12-09 15:28:13,342 INFO L73 IsDeterministic]: Start isDeterministic. Operand 102 states and 5999 transitions. [2023-12-09 15:28:13,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:28:13,344 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 102 states and 5999 transitions. [2023-12-09 15:28:13,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 103 states, 102 states have (on average 58.81372549019608) internal successors, (5999), 102 states have internal predecessors, (5999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:28:13,367 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 103 states, 103 states have (on average 160.0) internal successors, (16480), 103 states have internal predecessors, (16480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:28:13,369 INFO L81 ComplementDD]: Finished complementDD. Result has 103 states, 103 states have (on average 160.0) internal successors, (16480), 103 states have internal predecessors, (16480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:28:13,369 INFO L308 CegarLoopForPetriNet]: 144 programPoint places, 190 predicate places. [2023-12-09 15:28:13,370 INFO L500 AbstractCegarLoop]: Abstraction has has 334 places, 5592 transitions, 96718 flow [2023-12-09 15:28:13,370 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 53.2) internal successors, (3990), 75 states have internal predecessors, (3990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:28:13,371 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:28:13,371 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:28:13,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-09 15:28:13,576 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-12-09 15:28:13,577 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:28:13,577 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:28:13,577 INFO L85 PathProgramCache]: Analyzing trace with hash -236219745, now seen corresponding path program 2 times [2023-12-09 15:28:13,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:28:13,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086463887] [2023-12-09 15:28:13,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:28:13,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:28:13,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:28:15,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:28:15,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:28:15,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086463887] [2023-12-09 15:28:15,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086463887] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:28:15,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620959197] [2023-12-09 15:28:15,165 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-09 15:28:15,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:28:15,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:28:15,166 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:28:15,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-09 15:28:15,272 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-09 15:28:15,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:28:15,273 INFO L262 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 48 conjunts are in the unsatisfiable core [2023-12-09 15:28:15,276 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:28:15,772 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 15 treesize of output 1 [2023-12-09 15:28:16,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-09 15:28:16,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 15:28:16,374 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 38 treesize of output 29 [2023-12-09 15:28:16,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 15:28:16,507 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 38 treesize of output 29 [2023-12-09 15:28:16,695 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:28:16,695 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 71 treesize of output 43 [2023-12-09 15:28:17,375 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:28:17,375 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:28:20,039 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse15 (< c_~min2~0 (+ c_~min3~0 1))) (.cse0 (= c_~min2~0 c_~min1~0)) (.cse18 (< c_~min3~0 c_~min2~0))) (and (or .cse0 (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_305))) (let ((.cse1 (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_306) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_307) c_~A~0.base) c_~A~0.offset))) (or (< c_~min3~0 (+ .cse1 1)) (< .cse1 c_~min2~0) (< (select (select .cse2 c_~A~0.base) c_~A~0.offset) c_~min1~0)))))) (forall ((v_ArrVal_305 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_305))) (or (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (let ((.cse4 (select (select (store (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_306) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_307) c_~A~0.base) c_~A~0.offset))) (let ((.cse3 (+ .cse4 1))) (or (< c_~min3~0 .cse3) (< c_~min2~0 .cse3) (= c_~min1~0 .cse4))))) (< (select (select .cse5 c_~A~0.base) c_~A~0.offset) c_~min1~0)))) (forall ((v_ArrVal_305 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_305))) (let ((.cse8 (select (select .cse9 c_~A~0.base) c_~A~0.offset))) (or (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (let ((.cse7 (select (select (store (store .cse9 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_306) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_307) c_~A~0.base) c_~A~0.offset))) (let ((.cse6 (+ .cse7 1))) (or (< c_~min3~0 .cse6) (< c_~min2~0 .cse6) (= .cse7 .cse8))))) (< c_~min1~0 (+ .cse8 1)))))) (forall ((v_ArrVal_305 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_305))) (let ((.cse10 (select (select .cse12 c_~A~0.base) c_~A~0.offset))) (or (= c_~min2~0 .cse10) (< c_~min1~0 (+ .cse10 1)) (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (let ((.cse11 (select (select (store (store .cse12 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_306) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_307) c_~A~0.base) c_~A~0.offset))) (or (< c_~min3~0 (+ .cse11 1)) (< .cse11 c_~min2~0)))))))) (or (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_305))) (let ((.cse14 (select (select .cse13 c_~A~0.base) c_~A~0.offset))) (or (< (select (select (store (store .cse13 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_306) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_307) c_~A~0.base) c_~A~0.offset) c_~min3~0) (= c_~min3~0 .cse14) (< c_~min1~0 (+ .cse14 1)))))) .cse15) (or (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_305))) (let ((.cse16 (select (select .cse17 c_~A~0.base) c_~A~0.offset))) (or (= c_~min2~0 .cse16) (< (select (select (store (store .cse17 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_306) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_307) c_~A~0.base) c_~A~0.offset) c_~min3~0) (< c_~min1~0 (+ .cse16 1)))))) .cse18) (or (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_305))) (or (< (select (select (store (store .cse19 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_306) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_307) c_~A~0.base) c_~A~0.offset) c_~min3~0) (< (select (select .cse19 c_~A~0.base) c_~A~0.offset) c_~min1~0)))) (and (or (= c_~min1~0 c_~min3~0) .cse15) (or .cse0 .cse18))))) is different from false [2023-12-09 15:28:20,828 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse12 (= c_~min2~0 c_~min1~0)) (.cse11 (< c_~min2~0 (+ c_~min3~0 1))) (.cse13 (< c_~min3~0 c_~min2~0))) (and (forall ((v_ArrVal_305 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_305))) (or (< (select (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0) (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (let ((.cse1 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_306) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (let ((.cse2 (+ .cse1 1))) (or (= c_~min1~0 .cse1) (< c_~min2~0 .cse2) (< c_~min3~0 .cse2)))))))) (forall ((v_ArrVal_305 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_305))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (< c_~min1~0 (+ .cse3 1)) (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (let ((.cse4 (select (select (store (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_306) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (let ((.cse5 (+ .cse4 1))) (or (= .cse3 .cse4) (< c_~min2~0 .cse5) (< c_~min3~0 .cse5))))))))) (forall ((v_ArrVal_305 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_305))) (let ((.cse7 (select (select .cse9 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (< c_~min1~0 (+ .cse7 1)) (= c_~min2~0 .cse7) (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (let ((.cse8 (select (select (store (store .cse9 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_306) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (< .cse8 c_~min2~0) (< c_~min3~0 (+ .cse8 1))))))))) (or (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_305))) (or (< (select (select .cse10 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0) (< (select (select (store (store .cse10 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_306) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min3~0)))) (and (or (= c_~min1~0 c_~min3~0) .cse11) (or .cse12 .cse13))) (or .cse12 (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_305))) (let ((.cse15 (select (select (store (store .cse14 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_306) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (< (select (select .cse14 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min1~0) (< .cse15 c_~min2~0) (< c_~min3~0 (+ .cse15 1))))))) (or (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_305))) (let ((.cse16 (select (select .cse17 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (< c_~min1~0 (+ .cse16 1)) (< (select (select (store (store .cse17 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_306) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min3~0) (= .cse16 c_~min3~0))))) .cse11) (or (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_305))) (let ((.cse18 (select (select .cse19 |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (< c_~min1~0 (+ .cse18 1)) (< (select (select (store (store .cse19 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_306) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|) c_~min3~0) (= c_~min2~0 .cse18))))) .cse13))) is different from false [2023-12-09 15:28:21,044 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (< c_~min3~0 c_~min2~0)) (.cse5 (= c_~min2~0 c_~min1~0)) (.cse4 (< c_~min2~0 (+ c_~min3~0 1)))) (and (or (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_305))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (= c_~min2~0 .cse0) (< c_~min1~0 (+ .cse0 1)) (< (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_306) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min3~0))))) .cse2) (or (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_305))) (or (< (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0) (< (select (select (store (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_306) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min3~0)))) (and (or (= c_~min1~0 c_~min3~0) .cse4) (or .cse5 .cse2))) (forall ((v_ArrVal_305 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_305))) (or (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (let ((.cse6 (select (select (store (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_306) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (let ((.cse7 (+ .cse6 1))) (or (= c_~min1~0 .cse6) (< c_~min2~0 .cse7) (< c_~min3~0 .cse7))))) (< (select (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0)))) (or .cse5 (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_305))) (let ((.cse10 (select (select (store (store .cse9 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_306) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< (select (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min1~0) (< .cse10 c_~min2~0) (< c_~min3~0 (+ .cse10 1))))))) (forall ((v_ArrVal_305 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_305))) (let ((.cse11 (select (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (= c_~min2~0 .cse11) (< c_~min1~0 (+ .cse11 1)) (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (let ((.cse12 (select (select (store (store .cse13 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_306) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< .cse12 c_~min2~0) (< c_~min3~0 (+ .cse12 1))))))))) (forall ((v_ArrVal_305 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_305))) (let ((.cse16 (select (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (let ((.cse15 (select (select (store (store .cse17 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_306) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (let ((.cse14 (+ .cse15 1))) (or (< c_~min2~0 .cse14) (= .cse15 .cse16) (< c_~min3~0 .cse14))))) (< c_~min1~0 (+ .cse16 1)))))) (or (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_305))) (let ((.cse18 (select (select .cse19 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< c_~min1~0 (+ .cse18 1)) (= c_~min3~0 .cse18) (< (select (select (store (store .cse19 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_306) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|) c_~min3~0))))) .cse4))) is different from false [2023-12-09 15:28:21,122 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse12 (< c_~min2~0 (+ c_~min3~0 1))) (.cse9 (< c_~min3~0 c_~min2~0)) (.cse14 (= c_~min2~0 c_~min1~0))) (and (forall ((v_ArrVal_305 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_305))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (let ((.cse1 (select (select (store (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_306) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse0 (+ .cse1 1))) (or (< c_~min2~0 .cse0) (= .cse1 .cse2) (< c_~min3~0 .cse0))))) (< c_~min1~0 (+ .cse2 1)))))) (forall ((v_ArrVal_305 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_305))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (= c_~min2~0 .cse4) (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (let ((.cse5 (select (select (store (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_306) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse5 c_~min2~0) (< c_~min3~0 (+ .cse5 1))))) (< c_~min1~0 (+ .cse4 1)))))) (or (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_305))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (select (select (store (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_306) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min3~0) (= c_~min2~0 .cse8) (< c_~min1~0 (+ .cse8 1)))))) .cse9) (or (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_305))) (let ((.cse11 (select (select .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< (select (select (store (store .cse10 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_306) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min3~0) (< c_~min1~0 (+ .cse11 1)) (= c_~min3~0 .cse11))))) .cse12) (or (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_305))) (or (< (select (select (store (store .cse13 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_306) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min3~0) (< (select (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0)))) (and (or (= c_~min1~0 c_~min3~0) .cse12) (or .cse14 .cse9))) (forall ((v_ArrVal_305 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_305))) (or (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (let ((.cse16 (select (select (store (store .cse17 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_306) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (let ((.cse15 (+ .cse16 1))) (or (< c_~min2~0 .cse15) (< c_~min3~0 .cse15) (= c_~min1~0 .cse16))))) (< (select (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0)))) (or .cse14 (forall ((v_ArrVal_306 (Array Int Int)) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_307 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_305))) (let ((.cse18 (select (select (store (store .cse19 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_306) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_307) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse18 c_~min2~0) (< c_~min3~0 (+ .cse18 1)) (< (select (select .cse19 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) c_~min1~0)))))))) is different from false [2023-12-09 15:28:21,672 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:28:21,673 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 105 treesize of output 69 [2023-12-09 15:28:21,684 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 545 treesize of output 521 [2023-12-09 15:28:21,694 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 231 treesize of output 223 [2023-12-09 15:28:21,721 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 131 treesize of output 123 [2023-12-09 15:28:21,726 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 219 treesize of output 203 [2023-12-09 15:28:22,028 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:28:22,028 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 51 treesize of output 39 [2023-12-09 15:28:22,033 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 255 treesize of output 243 [2023-12-09 15:28:22,041 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 124 treesize of output 116 [2023-12-09 15:28:22,047 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 69 treesize of output 65 [2023-12-09 15:28:22,052 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 58 treesize of output 54 [2023-12-09 15:28:22,121 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:28:22,122 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 75 treesize of output 51 [2023-12-09 15:28:22,128 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 158 treesize of output 146 [2023-12-09 15:28:22,136 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 124 treesize of output 116 [2023-12-09 15:28:22,142 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 77 treesize of output 71 [2023-12-09 15:28:22,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 110 [2023-12-09 15:28:22,215 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:28:22,215 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 111 treesize of output 75 [2023-12-09 15:28:22,222 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 785 treesize of output 757 [2023-12-09 15:28:22,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 322 treesize of output 298 [2023-12-09 15:28:22,242 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 159 treesize of output 151 [2023-12-09 15:28:22,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 139 [2023-12-09 15:28:22,364 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-09 15:28:22,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 1 [2023-12-09 15:28:22,370 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-09 15:28:22,370 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 132 treesize of output 1 [2023-12-09 15:28:22,376 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-09 15:28:22,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 1 [2023-12-09 15:28:22,868 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-12-09 15:28:22,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620959197] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:28:22,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:28:22,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 29, 27] total 77 [2023-12-09 15:28:22,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432625685] [2023-12-09 15:28:22,869 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:28:22,870 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2023-12-09 15:28:22,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:28:22,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2023-12-09 15:28:22,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=734, Invalid=4521, Unknown=17, NotChecked=580, Total=5852 [2023-12-09 15:28:22,873 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 160 [2023-12-09 15:28:22,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 5592 transitions, 96718 flow. Second operand has 77 states, 77 states have (on average 46.116883116883116) internal successors, (3551), 77 states have internal predecessors, (3551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:28:22,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:28:22,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 160 [2023-12-09 15:28:22,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:29:29,408 INFO L124 PetriNetUnfolderBase]: 50950/79419 cut-off events. [2023-12-09 15:29:29,408 INFO L125 PetriNetUnfolderBase]: For 277644/279298 co-relation queries the response was YES. [2023-12-09 15:29:29,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 604866 conditions, 79419 events. 50950/79419 cut-off events. For 277644/279298 co-relation queries the response was YES. Maximal size of possible extension queue 4010. Compared 690494 event pairs, 988 based on Foata normal form. 277/72890 useless extension candidates. Maximal degree in co-relation 413889. Up to 39340 conditions per place. [2023-12-09 15:29:30,509 INFO L140 encePairwiseOnDemand]: 104/160 looper letters, 6314 selfloop transitions, 6224 changer transitions 158/12733 dead transitions. [2023-12-09 15:29:30,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 490 places, 12733 transitions, 240218 flow [2023-12-09 15:29:30,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2023-12-09 15:29:30,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2023-12-09 15:29:30,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 8114 transitions. [2023-12-09 15:29:30,531 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.3230095541401274 [2023-12-09 15:29:30,532 INFO L72 ComplementDD]: Start complementDD. Operand 157 states and 8114 transitions. [2023-12-09 15:29:30,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 157 states and 8114 transitions. [2023-12-09 15:29:30,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:29:30,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 157 states and 8114 transitions. [2023-12-09 15:29:30,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 158 states, 157 states have (on average 51.681528662420384) internal successors, (8114), 157 states have internal predecessors, (8114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:29:30,566 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 158 states, 158 states have (on average 160.0) internal successors, (25280), 158 states have internal predecessors, (25280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:29:30,574 INFO L81 ComplementDD]: Finished complementDD. Result has 158 states, 158 states have (on average 160.0) internal successors, (25280), 158 states have internal predecessors, (25280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:29:30,575 INFO L308 CegarLoopForPetriNet]: 144 programPoint places, 346 predicate places. [2023-12-09 15:29:30,575 INFO L500 AbstractCegarLoop]: Abstraction has has 490 places, 12733 transitions, 240218 flow [2023-12-09 15:29:30,576 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 46.116883116883116) internal successors, (3551), 77 states have internal predecessors, (3551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:29:30,576 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:29:30,576 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:29:30,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-09 15:29:30,784 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-09 15:29:30,784 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-12-09 15:29:30,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:29:30,785 INFO L85 PathProgramCache]: Analyzing trace with hash 218200177, now seen corresponding path program 3 times [2023-12-09 15:29:30,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:29:30,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916149293] [2023-12-09 15:29:30,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:29:30,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:29:30,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:29:31,983 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:29:31,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:29:31,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916149293] [2023-12-09 15:29:31,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916149293] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:29:31,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253091988] [2023-12-09 15:29:31,984 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-09 15:29:31,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:29:31,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:29:31,985 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-09 15:29:31,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-09 15:29:32,105 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-09 15:29:32,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:29:32,107 INFO L262 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 48 conjunts are in the unsatisfiable core [2023-12-09 15:29:32,111 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:29:32,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-09 15:29:32,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-09 15:29:33,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-09 15:29:33,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-09 15:29:33,788 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 59 treesize of output 35 [2023-12-09 15:29:33,936 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:29:33,937 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:29:38,112 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (< c_~min2~0 (+ c_~min3~0 1))) (.cse6 (= c_~min2~0 c_~min1~0)) (.cse0 (< c_~min3~0 c_~min2~0))) (and (or .cse0 (forall ((v_ArrVal_342 (Array Int Int)) (v_ArrVal_343 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_342) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base) c_~A~0.offset))) (or (< .cse1 c_~min3~0) (= c_~min2~0 .cse1) (< c_~min1~0 (+ .cse1 1)))))) (forall ((v_ArrVal_342 (Array Int Int)) (v_ArrVal_343 (Array Int Int))) (let ((.cse2 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_342) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base) c_~A~0.offset))) (let ((.cse3 (+ .cse2 1))) (or (= c_~min2~0 .cse2) (< .cse2 c_~min2~0) (< c_~min1~0 .cse3) (< c_~min3~0 .cse3))))) (forall ((v_ArrVal_342 (Array Int Int)) (v_ArrVal_343 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_342) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base) c_~A~0.offset))) (let ((.cse5 (+ .cse4 1))) (or (< .cse4 c_~min1~0) (= c_~min1~0 .cse4) (< c_~min3~0 .cse5) (< c_~min2~0 .cse5))))) (or .cse6 (forall ((v_ArrVal_342 (Array Int Int)) (v_ArrVal_343 (Array Int Int))) (let ((.cse7 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_342) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base) c_~A~0.offset))) (or (< .cse7 c_~min1~0) (< .cse7 c_~min2~0) (< c_~min3~0 (+ .cse7 1)))))) (or (forall ((v_ArrVal_342 (Array Int Int)) (v_ArrVal_343 (Array Int Int))) (let ((.cse8 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_342) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base) c_~A~0.offset))) (or (< .cse8 c_~min3~0) (= .cse8 c_~min3~0) (< c_~min1~0 (+ .cse8 1))))) .cse9) (or (forall ((v_ArrVal_342 (Array Int Int)) (v_ArrVal_343 (Array Int Int))) (let ((.cse10 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_342) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base) c_~A~0.offset))) (or (< .cse10 c_~min1~0) (< .cse10 c_~min3~0)))) (and (or (= c_~min1~0 c_~min3~0) .cse9) (or .cse6 .cse0))))) is different from false [2023-12-09 15:29:38,326 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (< c_~min2~0 (+ c_~min3~0 1))) (.cse4 (= c_~min2~0 c_~min1~0)) (.cse2 (< c_~min3~0 c_~min2~0))) (and (or (forall ((v_ArrVal_342 (Array Int Int)) (v_ArrVal_341 (Array Int Int)) (v_ArrVal_343 (Array Int Int))) (let ((.cse0 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_341) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_342) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base) c_~A~0.offset))) (or (< c_~min1~0 (+ .cse0 1)) (< .cse0 c_~min3~0) (= c_~min3~0 .cse0)))) .cse1) (or .cse2 (forall ((v_ArrVal_342 (Array Int Int)) (v_ArrVal_341 (Array Int Int)) (v_ArrVal_343 (Array Int Int))) (let ((.cse3 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_341) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_342) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base) c_~A~0.offset))) (or (< c_~min1~0 (+ .cse3 1)) (< .cse3 c_~min3~0) (= c_~min2~0 .cse3))))) (or .cse4 (forall ((v_ArrVal_342 (Array Int Int)) (v_ArrVal_341 (Array Int Int)) (v_ArrVal_343 (Array Int Int))) (let ((.cse5 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_341) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_342) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base) c_~A~0.offset))) (or (< .cse5 c_~min2~0) (< .cse5 c_~min1~0) (< c_~min3~0 (+ .cse5 1)))))) (or (and (or (= c_~min1~0 c_~min3~0) .cse1) (or .cse4 .cse2)) (forall ((v_ArrVal_342 (Array Int Int)) (v_ArrVal_341 (Array Int Int)) (v_ArrVal_343 (Array Int Int))) (let ((.cse6 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_341) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_342) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base) c_~A~0.offset))) (or (< .cse6 c_~min3~0) (< .cse6 c_~min1~0))))) (forall ((v_ArrVal_342 (Array Int Int)) (v_ArrVal_341 (Array Int Int)) (v_ArrVal_343 (Array Int Int))) (let ((.cse7 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_341) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_342) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base) c_~A~0.offset))) (let ((.cse8 (+ .cse7 1))) (or (< .cse7 c_~min2~0) (< c_~min1~0 .cse8) (< c_~min3~0 .cse8) (= c_~min2~0 .cse7))))) (forall ((v_ArrVal_342 (Array Int Int)) (v_ArrVal_341 (Array Int Int)) (v_ArrVal_343 (Array Int Int))) (let ((.cse9 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_341) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_342) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base) c_~A~0.offset))) (let ((.cse10 (+ .cse9 1))) (or (= c_~min1~0 .cse9) (< c_~min2~0 .cse10) (< .cse9 c_~min1~0) (< c_~min3~0 .cse10))))))) is different from false [2023-12-09 15:29:38,921 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~min2~0 c_~min1~0)) (.cse3 (< c_~min3~0 c_~min2~0)) (.cse7 (< c_~min2~0 (+ c_~min3~0 1)))) (and (or .cse0 (forall ((v_ArrVal_342 (Array Int Int)) (v_ArrVal_341 (Array Int Int)) (v_ArrVal_343 (Array Int Int))) (let ((.cse1 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_341) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_342) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (< c_~min3~0 (+ .cse1 1)) (< .cse1 c_~min1~0) (< .cse1 c_~min2~0))))) (or (forall ((v_ArrVal_342 (Array Int Int)) (v_ArrVal_341 (Array Int Int)) (v_ArrVal_343 (Array Int Int))) (let ((.cse2 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_341) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_342) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (< .cse2 c_~min3~0) (= c_~min2~0 .cse2) (< c_~min1~0 (+ .cse2 1))))) .cse3) (forall ((v_ArrVal_342 (Array Int Int)) (v_ArrVal_341 (Array Int Int)) (v_ArrVal_343 (Array Int Int))) (let ((.cse5 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_341) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_342) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (let ((.cse4 (+ .cse5 1))) (or (< c_~min3~0 .cse4) (= c_~min2~0 .cse5) (< c_~min1~0 .cse4) (< .cse5 c_~min2~0))))) (or (forall ((v_ArrVal_342 (Array Int Int)) (v_ArrVal_341 (Array Int Int)) (v_ArrVal_343 (Array Int Int))) (let ((.cse6 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_341) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_342) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (< .cse6 c_~min3~0) (< .cse6 c_~min1~0)))) (and (or (= c_~min1~0 c_~min3~0) .cse7) (or .cse0 .cse3))) (or (forall ((v_ArrVal_342 (Array Int Int)) (v_ArrVal_341 (Array Int Int)) (v_ArrVal_343 (Array Int Int))) (let ((.cse8 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_341) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_342) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (< .cse8 c_~min3~0) (= .cse8 c_~min3~0) (< c_~min1~0 (+ .cse8 1))))) .cse7) (forall ((v_ArrVal_342 (Array Int Int)) (v_ArrVal_341 (Array Int Int)) (v_ArrVal_343 (Array Int Int))) (let ((.cse10 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_341) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_342) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) |c_ULTIMATE.start_main_#t~ret12#1.base|) |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (let ((.cse9 (+ .cse10 1))) (or (< c_~min3~0 .cse9) (< .cse10 c_~min1~0) (= .cse10 c_~min1~0) (< c_~min2~0 .cse9))))))) is different from false [2023-12-09 15:29:39,885 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:29:39,886 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 57 treesize of output 45 [2023-12-09 15:29:39,889 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 223 treesize of output 215 [2023-12-09 15:29:39,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 247 treesize of output 231 [2023-12-09 15:29:39,920 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 117 treesize of output 113 [2023-12-09 15:29:39,925 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 227 treesize of output 219 [2023-12-09 15:29:39,991 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-09 15:29:39,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 1 [2023-12-09 15:29:39,996 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-09 15:29:39,997 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 87 treesize of output 1 [2023-12-09 15:29:40,002 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-09 15:29:40,002 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 87 treesize of output 1 [2023-12-09 15:29:40,032 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-09 15:29:40,032 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 117 treesize of output 1 [2023-12-09 15:29:40,036 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-09 15:29:40,037 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 117 treesize of output 1 [2023-12-09 15:29:40,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:29:40,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253091988] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:29:40,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:29:40,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29, 23] total 67 [2023-12-09 15:29:40,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751594749] [2023-12-09 15:29:40,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:29:40,257 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2023-12-09 15:29:40,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:29:40,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2023-12-09 15:29:40,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=500, Invalid=3530, Unknown=14, NotChecked=378, Total=4422 [2023-12-09 15:29:40,261 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 160 [2023-12-09 15:29:40,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 490 places, 12733 transitions, 240218 flow. Second operand has 67 states, 67 states have (on average 49.52238805970149) internal successors, (3318), 67 states have internal predecessors, (3318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:29:40,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:29:40,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 160 [2023-12-09 15:29:40,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:29:53,582 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse20 (select |c_#memory_int| c_~A~0.base)) (.cse3 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4)))) (let ((.cse37 (< c_~min2~0 (+ c_~min3~0 1))) (.cse4 (= c_~min2~0 c_~min1~0)) (.cse15 (< c_~min3~0 c_~min2~0)) (.cse18 (select .cse20 .cse3))) (let ((.cse21 (= c_~min2~0 .cse18)) (.cse16 (< c_~min1~0 (+ .cse18 1))) (.cse49 (< .cse18 c_~min1~0)) (.cse8 (and (or (= c_~min1~0 c_~min3~0) .cse37) (or .cse4 .cse15)))) (let ((.cse12 (and (or (and (or .cse21 .cse15) (or (= .cse18 c_~min3~0) .cse37)) .cse16) (or .cse49 .cse8))) (.cse22 (forall ((~M~0 Int)) (let ((.cse67 (select .cse20 (+ c_~A~0.offset (* ~M~0 4))))) (or (< c_~min3~0 (+ .cse67 1)) (< 0 ~M~0) (< .cse67 c_~min2~0) (< (+ ~M~0 1) c_~N~0)))))) (and (forall ((~M~0 Int) (v_ArrVal_342 (Array Int Int)) (v_ArrVal_343 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_342) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base))) (let ((.cse0 (select .cse2 .cse3)) (.cse1 (select .cse2 (+ c_~A~0.offset (* ~M~0 4))))) (or (< c_~min1~0 (+ .cse0 1)) (= c_~min2~0 .cse0) (< c_~min3~0 (+ .cse1 1)) (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0) (< .cse1 c_~min2~0))))) (or .cse4 (forall ((~M~0 Int) (v_ArrVal_343 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base))) (let ((.cse5 (select .cse6 (+ c_~A~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (< c_~min3~0 (+ .cse5 1)) (< (select .cse6 .cse3) c_~min1~0) (< .cse5 c_~min2~0) (< (+ ~M~0 1) c_~N~0)))))) (or (forall ((~M~0 Int) (v_ArrVal_343 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base))) (or (< (select .cse7 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0) (< (select .cse7 .cse3) c_~min1~0)))) .cse8) (forall ((v_ArrVal_343 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base))) (or (forall ((~M~0 Int)) (let ((.cse10 (select .cse11 (+ c_~A~0.offset (* ~M~0 4))))) (let ((.cse9 (+ .cse10 1))) (or (< 0 ~M~0) (< c_~min3~0 .cse9) (< c_~min2~0 .cse9) (= c_~min1~0 .cse10) (< (+ ~M~0 1) c_~N~0))))) (< (select .cse11 .cse3) c_~min1~0)))) (or (< c_thread3Thread1of1ForFork1_~i~2 c_~N~0) .cse12) (or (forall ((~M~0 Int) (v_ArrVal_343 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base))) (let ((.cse14 (select .cse13 .cse3))) (or (< (select .cse13 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< 0 ~M~0) (< c_~min1~0 (+ .cse14 1)) (= c_~min2~0 .cse14) (< (+ ~M~0 1) c_~N~0))))) .cse15) (or .cse16 (and (forall ((~M~0 Int)) (let ((.cse19 (select .cse20 (+ c_~A~0.offset (* ~M~0 4))))) (let ((.cse17 (+ .cse19 1))) (or (< c_~min2~0 .cse17) (< c_~min3~0 .cse17) (= .cse18 .cse19) (< 0 ~M~0) (< (+ ~M~0 1) c_~N~0))))) (or .cse21 .cse22))) (or (forall ((~M~0 Int) (v_ArrVal_343 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base))) (or (< (select .cse23 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< 0 ~M~0) (< (select .cse23 .cse3) c_~min1~0) (< (+ ~M~0 1) c_~N~0)))) .cse8) (forall ((~M~0 Int) (v_ArrVal_342 (Array Int Int)) (v_ArrVal_343 (Array Int Int))) (let ((.cse27 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_342) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base))) (let ((.cse26 (select .cse27 (+ c_~A~0.offset (* ~M~0 4))))) (let ((.cse25 (+ .cse26 1)) (.cse24 (select .cse27 .cse3))) (or (< c_~min1~0 (+ .cse24 1)) (< c_~min3~0 .cse25) (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0) (< c_~min2~0 .cse25) (= .cse26 .cse24)))))) (forall ((~M~0 Int) (v_ArrVal_343 (Array Int Int))) (let ((.cse31 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base))) (let ((.cse30 (select .cse31 (+ c_~A~0.offset (* ~M~0 4))))) (let ((.cse29 (+ .cse30 1)) (.cse28 (select .cse31 .cse3))) (or (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0) (< c_~min1~0 (+ .cse28 1)) (< c_~min3~0 .cse29) (< c_~min2~0 .cse29) (= .cse28 .cse30)))))) (forall ((v_ArrVal_343 (Array Int Int))) (let ((.cse34 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base))) (let ((.cse32 (select .cse34 .cse3))) (or (< c_~min1~0 (+ .cse32 1)) (forall ((~M~0 Int)) (let ((.cse33 (select .cse34 (+ c_~A~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (< c_~min3~0 (+ .cse33 1)) (< .cse33 c_~min2~0) (< (+ ~M~0 1) c_~N~0)))) (= c_~min2~0 .cse32))))) (or (forall ((~M~0 Int) (v_ArrVal_343 (Array Int Int))) (let ((.cse35 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base))) (let ((.cse36 (select .cse35 .cse3))) (or (< (select .cse35 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< 0 ~M~0) (< c_~min1~0 (+ .cse36 1)) (= .cse36 c_~min3~0) (< (+ ~M~0 1) c_~N~0))))) .cse37) (or (forall ((~M~0 Int) (v_ArrVal_342 (Array Int Int)) (v_ArrVal_343 (Array Int Int))) (let ((.cse39 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_342) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base))) (let ((.cse38 (select .cse39 .cse3))) (or (< c_~min1~0 (+ .cse38 1)) (= c_~min2~0 .cse38) (< (select .cse39 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0))))) .cse15) (or .cse12 (forall ((~M~0 Int)) (or (< (select .cse20 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< 0 ~M~0) (< (+ ~M~0 1) c_~N~0)))) (or (forall ((~M~0 Int) (v_ArrVal_342 (Array Int Int)) (v_ArrVal_343 (Array Int Int))) (let ((.cse41 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_342) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base))) (let ((.cse40 (select .cse41 (+ c_~A~0.offset (* ~M~0 4))))) (or (< c_~min3~0 (+ .cse40 1)) (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0) (< .cse40 c_~min2~0) (< (select .cse41 .cse3) c_~min1~0))))) .cse4) (forall ((v_ArrVal_343 (Array Int Int))) (let ((.cse45 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base))) (let ((.cse42 (select .cse45 .cse3))) (or (< c_~min1~0 (+ .cse42 1)) (forall ((~M~0 Int)) (let ((.cse44 (select .cse45 (+ c_~A~0.offset (* ~M~0 4))))) (let ((.cse43 (+ .cse44 1))) (or (< 0 ~M~0) (< c_~min3~0 .cse43) (< c_~min2~0 .cse43) (= .cse42 .cse44) (< (+ ~M~0 1) c_~N~0))))))))) (forall ((~M~0 Int) (v_ArrVal_343 (Array Int Int))) (let ((.cse47 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base))) (let ((.cse48 (select .cse47 (+ c_~A~0.offset (* ~M~0 4))))) (let ((.cse46 (+ .cse48 1))) (or (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0) (< c_~min3~0 .cse46) (< (select .cse47 .cse3) c_~min1~0) (< c_~min2~0 .cse46) (= c_~min1~0 .cse48)))))) (or .cse49 (and (or .cse4 .cse22) (forall ((~M~0 Int)) (let ((.cse51 (select .cse20 (+ c_~A~0.offset (* ~M~0 4))))) (let ((.cse50 (+ .cse51 1))) (or (< c_~min2~0 .cse50) (= c_~min1~0 .cse51) (< c_~min3~0 .cse50) (< 0 ~M~0) (< (+ ~M~0 1) c_~N~0))))))) (or (forall ((~M~0 Int) (v_ArrVal_342 (Array Int Int)) (v_ArrVal_343 (Array Int Int))) (let ((.cse53 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_342) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base))) (let ((.cse52 (select .cse53 .cse3))) (or (< c_~min1~0 (+ .cse52 1)) (< (select .cse53 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0) (= .cse52 c_~min3~0))))) .cse37) (or (forall ((~M~0 Int) (v_ArrVal_343 (Array Int Int))) (let ((.cse54 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base))) (let ((.cse55 (select .cse54 .cse3))) (or (< (select .cse54 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0) (< c_~min1~0 (+ .cse55 1)) (= .cse55 c_~min3~0))))) .cse37) (or .cse4 (forall ((~M~0 Int) (v_ArrVal_343 (Array Int Int))) (let ((.cse57 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base))) (let ((.cse56 (select .cse57 (+ c_~A~0.offset (* ~M~0 4))))) (or (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0) (< c_~min3~0 (+ .cse56 1)) (< (select .cse57 .cse3) c_~min1~0) (< .cse56 c_~min2~0)))))) (or (forall ((~M~0 Int) (v_ArrVal_342 (Array Int Int)) (v_ArrVal_343 (Array Int Int))) (let ((.cse58 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_342) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base))) (or (< (select .cse58 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0) (< (select .cse58 .cse3) c_~min1~0)))) .cse8) (forall ((~M~0 Int) (v_ArrVal_342 (Array Int Int)) (v_ArrVal_343 (Array Int Int))) (let ((.cse61 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_342) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base))) (let ((.cse60 (select .cse61 (+ c_~A~0.offset (* ~M~0 4))))) (let ((.cse59 (+ .cse60 1))) (or (< c_~min3~0 .cse59) (= c_~min1~0 .cse60) (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0) (< c_~min2~0 .cse59) (< (select .cse61 .cse3) c_~min1~0)))))) (forall ((~M~0 Int) (v_ArrVal_343 (Array Int Int))) (let ((.cse64 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base))) (let ((.cse62 (select .cse64 .cse3)) (.cse63 (select .cse64 (+ c_~A~0.offset (* ~M~0 4))))) (or (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0) (< c_~min1~0 (+ .cse62 1)) (= c_~min2~0 .cse62) (< c_~min3~0 (+ .cse63 1)) (< .cse63 c_~min2~0))))) (or (forall ((~M~0 Int) (v_ArrVal_343 (Array Int Int))) (let ((.cse65 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base))) (let ((.cse66 (select .cse65 .cse3))) (or (< (select .cse65 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0) (< c_~min1~0 (+ .cse66 1)) (= c_~min2~0 .cse66))))) .cse15)))))) is different from false [2023-12-09 15:29:58,602 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse20 (select |c_#memory_int| c_~A~0.base)) (.cse3 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4)))) (let ((.cse41 (< c_~min2~0 (+ c_~min3~0 1))) (.cse4 (= c_~min2~0 c_~min1~0)) (.cse15 (< c_~min3~0 c_~min2~0)) (.cse18 (select .cse20 .cse3))) (let ((.cse21 (= c_~min2~0 .cse18)) (.cse16 (< c_~min1~0 (+ .cse18 1))) (.cse27 (< .cse18 c_~min1~0)) (.cse8 (and (or (= c_~min1~0 c_~min3~0) .cse41) (or .cse4 .cse15)))) (let ((.cse22 (forall ((~M~0 Int)) (let ((.cse77 (select .cse20 (+ c_~A~0.offset (* ~M~0 4))))) (or (< c_~min3~0 (+ .cse77 1)) (< 0 ~M~0) (< .cse77 c_~min2~0) (< (+ ~M~0 1) c_~N~0))))) (.cse12 (and (or (and (or .cse21 .cse15) (or (= .cse18 c_~min3~0) .cse41)) .cse16) (or .cse27 .cse8))) (.cse26 (forall ((~M~0 Int)) (let ((.cse76 (select .cse20 (+ c_~A~0.offset (* ~M~0 4))))) (or (< c_~min3~0 (+ .cse76 1)) (< .cse76 c_~min2~0) (< (+ ~M~0 1) c_~N~0) (< c_thread2Thread1of1ForFork0_~i~1 ~M~0)))))) (and (forall ((~M~0 Int) (v_ArrVal_342 (Array Int Int)) (v_ArrVal_343 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_342) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base))) (let ((.cse0 (select .cse2 .cse3)) (.cse1 (select .cse2 (+ c_~A~0.offset (* ~M~0 4))))) (or (< c_~min1~0 (+ .cse0 1)) (= c_~min2~0 .cse0) (< c_~min3~0 (+ .cse1 1)) (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0) (< .cse1 c_~min2~0))))) (or .cse4 (forall ((~M~0 Int) (v_ArrVal_343 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base))) (let ((.cse5 (select .cse6 (+ c_~A~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (< c_~min3~0 (+ .cse5 1)) (< (select .cse6 .cse3) c_~min1~0) (< .cse5 c_~min2~0) (< (+ ~M~0 1) c_~N~0)))))) (or (forall ((~M~0 Int) (v_ArrVal_343 (Array Int Int))) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base))) (or (< (select .cse7 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0) (< (select .cse7 .cse3) c_~min1~0)))) .cse8) (forall ((v_ArrVal_343 (Array Int Int))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base))) (or (forall ((~M~0 Int)) (let ((.cse10 (select .cse11 (+ c_~A~0.offset (* ~M~0 4))))) (let ((.cse9 (+ .cse10 1))) (or (< 0 ~M~0) (< c_~min3~0 .cse9) (< c_~min2~0 .cse9) (= c_~min1~0 .cse10) (< (+ ~M~0 1) c_~N~0))))) (< (select .cse11 .cse3) c_~min1~0)))) (or (< c_thread3Thread1of1ForFork1_~i~2 c_~N~0) .cse12) (or (forall ((~M~0 Int) (v_ArrVal_343 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base))) (let ((.cse14 (select .cse13 .cse3))) (or (< (select .cse13 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< 0 ~M~0) (< c_~min1~0 (+ .cse14 1)) (= c_~min2~0 .cse14) (< (+ ~M~0 1) c_~N~0))))) .cse15) (or .cse16 (and (forall ((~M~0 Int)) (let ((.cse19 (select .cse20 (+ c_~A~0.offset (* ~M~0 4))))) (let ((.cse17 (+ .cse19 1))) (or (< c_~min2~0 .cse17) (< c_~min3~0 .cse17) (= .cse18 .cse19) (< 0 ~M~0) (< (+ ~M~0 1) c_~N~0))))) (or .cse21 .cse22))) (or (forall ((~M~0 Int) (v_ArrVal_343 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base))) (or (< (select .cse23 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< 0 ~M~0) (< (select .cse23 .cse3) c_~min1~0) (< (+ ~M~0 1) c_~N~0)))) .cse8) (or (and (forall ((~M~0 Int)) (let ((.cse25 (select .cse20 (+ c_~A~0.offset (* ~M~0 4))))) (let ((.cse24 (+ .cse25 1))) (or (< c_~min2~0 .cse24) (= c_~min1~0 .cse25) (< c_~min3~0 .cse24) (< (+ ~M~0 1) c_~N~0) (< c_thread2Thread1of1ForFork0_~i~1 ~M~0))))) (or .cse4 .cse26)) .cse27) (forall ((~M~0 Int) (v_ArrVal_342 (Array Int Int)) (v_ArrVal_343 (Array Int Int))) (let ((.cse31 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_342) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base))) (let ((.cse30 (select .cse31 (+ c_~A~0.offset (* ~M~0 4))))) (let ((.cse29 (+ .cse30 1)) (.cse28 (select .cse31 .cse3))) (or (< c_~min1~0 (+ .cse28 1)) (< c_~min3~0 .cse29) (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0) (< c_~min2~0 .cse29) (= .cse30 .cse28)))))) (forall ((~M~0 Int) (v_ArrVal_343 (Array Int Int))) (let ((.cse35 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base))) (let ((.cse34 (select .cse35 (+ c_~A~0.offset (* ~M~0 4))))) (let ((.cse33 (+ .cse34 1)) (.cse32 (select .cse35 .cse3))) (or (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0) (< c_~min1~0 (+ .cse32 1)) (< c_~min3~0 .cse33) (< c_~min2~0 .cse33) (= .cse32 .cse34)))))) (forall ((v_ArrVal_343 (Array Int Int))) (let ((.cse38 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base))) (let ((.cse36 (select .cse38 .cse3))) (or (< c_~min1~0 (+ .cse36 1)) (forall ((~M~0 Int)) (let ((.cse37 (select .cse38 (+ c_~A~0.offset (* ~M~0 4))))) (or (< 0 ~M~0) (< c_~min3~0 (+ .cse37 1)) (< .cse37 c_~min2~0) (< (+ ~M~0 1) c_~N~0)))) (= c_~min2~0 .cse36))))) (or .cse12 (forall ((~M~0 Int)) (or (< (select .cse20 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< (+ ~M~0 1) c_~N~0) (< c_thread2Thread1of1ForFork0_~i~1 ~M~0)))) (or (forall ((~M~0 Int) (v_ArrVal_343 (Array Int Int))) (let ((.cse39 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base))) (let ((.cse40 (select .cse39 .cse3))) (or (< (select .cse39 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< 0 ~M~0) (< c_~min1~0 (+ .cse40 1)) (= .cse40 c_~min3~0) (< (+ ~M~0 1) c_~N~0))))) .cse41) (or (forall ((~M~0 Int) (v_ArrVal_342 (Array Int Int)) (v_ArrVal_343 (Array Int Int))) (let ((.cse43 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_342) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base))) (let ((.cse42 (select .cse43 .cse3))) (or (< c_~min1~0 (+ .cse42 1)) (= c_~min2~0 .cse42) (< (select .cse43 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0))))) .cse15) (or .cse12 (forall ((~M~0 Int)) (or (< (select .cse20 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< 0 ~M~0) (< (+ ~M~0 1) c_~N~0)))) (or (forall ((~M~0 Int) (v_ArrVal_342 (Array Int Int)) (v_ArrVal_343 (Array Int Int))) (let ((.cse45 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_342) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base))) (let ((.cse44 (select .cse45 (+ c_~A~0.offset (* ~M~0 4))))) (or (< c_~min3~0 (+ .cse44 1)) (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0) (< .cse44 c_~min2~0) (< (select .cse45 .cse3) c_~min1~0))))) .cse4) (forall ((v_ArrVal_343 (Array Int Int))) (let ((.cse49 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base))) (let ((.cse46 (select .cse49 .cse3))) (or (< c_~min1~0 (+ .cse46 1)) (forall ((~M~0 Int)) (let ((.cse48 (select .cse49 (+ c_~A~0.offset (* ~M~0 4))))) (let ((.cse47 (+ .cse48 1))) (or (< 0 ~M~0) (< c_~min3~0 .cse47) (< c_~min2~0 .cse47) (= .cse46 .cse48) (< (+ ~M~0 1) c_~N~0))))))))) (forall ((~M~0 Int) (v_ArrVal_343 (Array Int Int))) (let ((.cse51 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base))) (let ((.cse52 (select .cse51 (+ c_~A~0.offset (* ~M~0 4))))) (let ((.cse50 (+ .cse52 1))) (or (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0) (< c_~min3~0 .cse50) (< (select .cse51 .cse3) c_~min1~0) (< c_~min2~0 .cse50) (= c_~min1~0 .cse52)))))) (or .cse27 (and (or .cse4 .cse22) (forall ((~M~0 Int)) (let ((.cse54 (select .cse20 (+ c_~A~0.offset (* ~M~0 4))))) (let ((.cse53 (+ .cse54 1))) (or (< c_~min2~0 .cse53) (= c_~min1~0 .cse54) (< c_~min3~0 .cse53) (< 0 ~M~0) (< (+ ~M~0 1) c_~N~0))))))) (or (let ((.cse56 (select .cse20 (+ c_~A~0.offset (* c_thread3Thread1of1ForFork1_~i~2 4))))) (and (let ((.cse58 (+ .cse56 1))) (or (let ((.cse57 (< .cse56 c_~min2~0)) (.cse55 (< c_~min2~0 .cse58))) (and (or .cse16 (and (or .cse55 (= .cse18 .cse56)) (or .cse21 .cse57))) (or (and (or .cse4 .cse57) (or .cse55 (= c_~min1~0 .cse56))) .cse27))) (< c_~min3~0 .cse58))) (or (< .cse56 c_~min3~0) .cse12))) (< (+ c_thread3Thread1of1ForFork1_~i~2 1) c_~N~0)) (or (forall ((~M~0 Int) (v_ArrVal_342 (Array Int Int)) (v_ArrVal_343 (Array Int Int))) (let ((.cse60 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_342) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base))) (let ((.cse59 (select .cse60 .cse3))) (or (< c_~min1~0 (+ .cse59 1)) (< (select .cse60 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0) (= .cse59 c_~min3~0))))) .cse41) (or (forall ((~M~0 Int) (v_ArrVal_343 (Array Int Int))) (let ((.cse61 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base))) (let ((.cse62 (select .cse61 .cse3))) (or (< (select .cse61 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0) (< c_~min1~0 (+ .cse62 1)) (= .cse62 c_~min3~0))))) .cse41) (or .cse4 (forall ((~M~0 Int) (v_ArrVal_343 (Array Int Int))) (let ((.cse64 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base))) (let ((.cse63 (select .cse64 (+ c_~A~0.offset (* ~M~0 4))))) (or (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0) (< c_~min3~0 (+ .cse63 1)) (< (select .cse64 .cse3) c_~min1~0) (< .cse63 c_~min2~0)))))) (or (forall ((~M~0 Int) (v_ArrVal_342 (Array Int Int)) (v_ArrVal_343 (Array Int Int))) (let ((.cse65 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_342) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base))) (or (< (select .cse65 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0) (< (select .cse65 .cse3) c_~min1~0)))) .cse8) (forall ((~M~0 Int) (v_ArrVal_342 (Array Int Int)) (v_ArrVal_343 (Array Int Int))) (let ((.cse68 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_342) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base))) (let ((.cse67 (select .cse68 (+ c_~A~0.offset (* ~M~0 4))))) (let ((.cse66 (+ .cse67 1))) (or (< c_~min3~0 .cse66) (= c_~min1~0 .cse67) (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0) (< c_~min2~0 .cse66) (< (select .cse68 .cse3) c_~min1~0)))))) (or (and (forall ((~M~0 Int)) (let ((.cse70 (select .cse20 (+ c_~A~0.offset (* ~M~0 4))))) (let ((.cse69 (+ .cse70 1))) (or (< c_~min2~0 .cse69) (< c_~min3~0 .cse69) (= .cse18 .cse70) (< (+ ~M~0 1) c_~N~0) (< c_thread2Thread1of1ForFork0_~i~1 ~M~0))))) (or .cse21 .cse26)) .cse16) (forall ((~M~0 Int) (v_ArrVal_343 (Array Int Int))) (let ((.cse73 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base))) (let ((.cse71 (select .cse73 .cse3)) (.cse72 (select .cse73 (+ c_~A~0.offset (* ~M~0 4))))) (or (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0) (< c_~min1~0 (+ .cse71 1)) (= c_~min2~0 .cse71) (< c_~min3~0 (+ .cse72 1)) (< .cse72 c_~min2~0))))) (or (forall ((~M~0 Int) (v_ArrVal_343 (Array Int Int))) (let ((.cse74 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_343) c_~A~0.base))) (let ((.cse75 (select .cse74 .cse3))) (or (< (select .cse74 (+ c_~A~0.offset (* ~M~0 4))) c_~min3~0) (< ~M~0 c_thread1Thread1of1ForFork2_~i~0) (< 0 ~M~0) (< c_~min1~0 (+ .cse75 1)) (= c_~min2~0 .cse75))))) .cse15)))))) is different from false Received shutdown request... [2023-12-09 15:31:44,373 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-09 15:31:44,373 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-09 15:31:44,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2023-12-09 15:31:44,523 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-12-09 15:31:44,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-12-09 15:31:44,728 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-12-09 15:31:44,728 WARN L624 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (67states, 46/160 universal loopers) in iteration 11,while PetriNetUnfolder was constructing finite prefix that currently has 443127 conditions, 51114 events (33580/51113 cut-off events. For 184798/185844 co-relation queries the response was YES. Maximal size of possible extension queue 5113. Compared 453990 event pairs, 334 based on Foata normal form. 107/51632 useless extension candidates. Maximal degree in co-relation 389486. Up to 28444 conditions per place.). [2023-12-09 15:31:44,729 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-12-09 15:31:44,730 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-12-09 15:31:44,730 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-12-09 15:31:44,730 INFO L457 BasicCegarLoop]: Path program histogram: [6, 3, 1, 1] [2023-12-09 15:31:44,733 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-09 15:31:44,733 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-09 15:31:44,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 03:31:44 BasicIcfg [2023-12-09 15:31:44,735 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-09 15:31:44,735 INFO L158 Benchmark]: Toolchain (without parser) took 256595.08ms. Allocated memory was 243.3MB in the beginning and 3.7GB in the end (delta: 3.4GB). Free memory was 202.6MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. [2023-12-09 15:31:44,736 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 191.9MB. Free memory is still 137.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-09 15:31:44,736 INFO L158 Benchmark]: CACSL2BoogieTranslator took 179.34ms. Allocated memory is still 243.3MB. Free memory was 202.6MB in the beginning and 190.6MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-09 15:31:44,736 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.87ms. Allocated memory is still 243.3MB. Free memory was 190.6MB in the beginning and 189.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-09 15:31:44,737 INFO L158 Benchmark]: Boogie Preprocessor took 20.48ms. Allocated memory is still 243.3MB. Free memory was 189.0MB in the beginning and 187.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-09 15:31:44,737 INFO L158 Benchmark]: RCFGBuilder took 445.73ms. Allocated memory is still 243.3MB. Free memory was 186.9MB in the beginning and 164.3MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. [2023-12-09 15:31:44,737 INFO L158 Benchmark]: TraceAbstraction took 255915.23ms. Allocated memory was 243.3MB in the beginning and 3.7GB in the end (delta: 3.4GB). Free memory was 163.8MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2023-12-09 15:31:44,738 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 191.9MB. Free memory is still 137.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 179.34ms. Allocated memory is still 243.3MB. Free memory was 202.6MB in the beginning and 190.6MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.87ms. Allocated memory is still 243.3MB. Free memory was 190.6MB in the beginning and 189.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.48ms. Allocated memory is still 243.3MB. Free memory was 189.0MB in the beginning and 187.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 445.73ms. Allocated memory is still 243.3MB. Free memory was 186.9MB in the beginning and 164.3MB in the end (delta: 22.5MB). Peak memory consumption was 22.0MB. Max. memory is 8.0GB. * TraceAbstraction took 255915.23ms. Allocated memory was 243.3MB in the beginning and 3.7GB in the end (delta: 3.4GB). Free memory was 163.8MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (67states, 46/160 universal loopers) in iteration 11,while PetriNetUnfolder was constructing finite prefix that currently has 443127 conditions, 51114 events (33580/51113 cut-off events. For 184798/185844 co-relation queries the response was YES. Maximal size of possible extension queue 5113. Compared 453990 event pairs, 334 based on Foata normal form. 107/51632 useless extension candidates. Maximal degree in co-relation 389486. Up to 28444 conditions per place.). - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (67states, 46/160 universal loopers) in iteration 11,while PetriNetUnfolder was constructing finite prefix that currently has 443127 conditions, 51114 events (33580/51113 cut-off events. For 184798/185844 co-relation queries the response was YES. Maximal size of possible extension queue 5113. Compared 453990 event pairs, 334 based on Foata normal form. 107/51632 useless extension candidates. Maximal degree in co-relation 389486. Up to 28444 conditions per place.). - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (67states, 46/160 universal loopers) in iteration 11,while PetriNetUnfolder was constructing finite prefix that currently has 443127 conditions, 51114 events (33580/51113 cut-off events. For 184798/185844 co-relation queries the response was YES. Maximal size of possible extension queue 5113. Compared 453990 event pairs, 334 based on Foata normal form. 107/51632 useless extension candidates. Maximal degree in co-relation 389486. Up to 28444 conditions per place.). - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (67states, 46/160 universal loopers) in iteration 11,while PetriNetUnfolder was constructing finite prefix that currently has 443127 conditions, 51114 events (33580/51113 cut-off events. For 184798/185844 co-relation queries the response was YES. Maximal size of possible extension queue 5113. Compared 453990 event pairs, 334 based on Foata normal form. 107/51632 useless extension candidates. Maximal degree in co-relation 389486. Up to 28444 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 185 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 255.8s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 219.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 188 mSolverCounterUnknown, 5594 SdHoareTripleChecker+Valid, 23.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5594 mSDsluCounter, 13846 SdHoareTripleChecker+Invalid, 21.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 9664 IncrementalHoareTripleChecker+Unchecked, 13108 mSDsCounter, 279 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21794 IncrementalHoareTripleChecker+Invalid, 31925 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 279 mSolverCounterUnsat, 738 mSDtfsCounter, 21794 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2956 GetRequests, 2198 SyntacticMatches, 27 SemanticMatches, 731 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 37520 ImplicationChecksByTransitivity, 53.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=240218occurred in iteration=10, InterpolantAutomatonStates: 362, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 32.4s InterpolantComputationTime, 2611 NumberOfCodeBlocks, 2588 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 3707 ConstructedInterpolants, 105 QuantifiedInterpolants, 63195 SizeOfPredicates, 149 NumberOfNonLiveVariables, 2979 ConjunctsInSsa, 196 ConjunctsInUnsatCore, 30 InterpolantComputations, 6 PerfectInterpolantSequences, 20/64 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown