/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-inc-subseq.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-a20a710-m [2023-12-09 15:26:56,709 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-09 15:26:56,797 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:26:56,830 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-09 15:26:56,831 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-09 15:26:56,831 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-09 15:26:56,832 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-09 15:26:56,832 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-09 15:26:56,833 INFO L153 SettingsManager]: * Use SBE=true [2023-12-09 15:26:56,836 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-09 15:26:56,837 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-09 15:26:56,837 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-09 15:26:56,837 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-09 15:26:56,838 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-09 15:26:56,839 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-09 15:26:56,839 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-09 15:26:56,839 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-09 15:26:56,839 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-09 15:26:56,839 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-09 15:26:56,840 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-09 15:26:56,840 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-09 15:26:56,841 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-09 15:26:56,841 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-09 15:26:56,841 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-09 15:26:56,841 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-09 15:26:56,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:26:56,842 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-09 15:26:56,843 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-09 15:26:56,843 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-09 15:26:56,843 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-09 15:26:56,844 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-09 15:26:56,844 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-09 15:26:56,844 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-09 15:26:56,844 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:26:57,087 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-09 15:26:57,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-09 15:26:57,110 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-09 15:26:57,111 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-09 15:26:57,111 INFO L274 PluginConnector]: CDTParser initialized [2023-12-09 15:26:57,113 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2023-12-09 15:26:58,295 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-09 15:26:58,511 INFO L384 CDTParser]: Found 1 translation units. [2023-12-09 15:26:58,512 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2023-12-09 15:26:58,521 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32d8d4c61/d8105bcf6b7d40458b11640599d97e54/FLAGb2a3a1379 [2023-12-09 15:26:58,536 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32d8d4c61/d8105bcf6b7d40458b11640599d97e54 [2023-12-09 15:26:58,539 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-09 15:26:58,540 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-09 15:26:58,543 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-09 15:26:58,543 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-09 15:26:58,548 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-09 15:26:58,549 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:26:58" (1/1) ... [2023-12-09 15:26:58,550 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@704717da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:26:58, skipping insertion in model container [2023-12-09 15:26:58,551 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:26:58" (1/1) ... [2023-12-09 15:26:58,576 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-09 15:26:58,747 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-inc-subseq.wvr.c[2950,2963] [2023-12-09 15:26:58,756 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:26:58,765 INFO L202 MainTranslator]: Completed pre-run [2023-12-09 15:26:58,785 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-inc-subseq.wvr.c[2950,2963] [2023-12-09 15:26:58,788 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:26:58,797 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-09 15:26:58,798 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-09 15:26:58,804 INFO L206 MainTranslator]: Completed translation [2023-12-09 15:26:58,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:26:58 WrapperNode [2023-12-09 15:26:58,804 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-09 15:26:58,805 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-09 15:26:58,805 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-09 15:26:58,805 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-09 15:26:58,810 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:26:58" (1/1) ... [2023-12-09 15:26:58,816 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:26:58" (1/1) ... [2023-12-09 15:26:58,842 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 199 [2023-12-09 15:26:58,842 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-09 15:26:58,843 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-09 15:26:58,843 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-09 15:26:58,843 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-09 15:26:58,860 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:26:58" (1/1) ... [2023-12-09 15:26:58,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:26:58" (1/1) ... [2023-12-09 15:26:58,864 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:26:58" (1/1) ... [2023-12-09 15:26:58,864 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:26:58" (1/1) ... [2023-12-09 15:26:58,870 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:26:58" (1/1) ... [2023-12-09 15:26:58,881 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:26:58" (1/1) ... [2023-12-09 15:26:58,883 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:26:58" (1/1) ... [2023-12-09 15:26:58,884 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:26:58" (1/1) ... [2023-12-09 15:26:58,887 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-09 15:26:58,888 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-09 15:26:58,888 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-09 15:26:58,888 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-09 15:26:58,889 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:26:58" (1/1) ... [2023-12-09 15:26:58,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:26:58,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:26:58,920 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:26:58,929 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:26:58,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-09 15:26:58,953 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-09 15:26:58,954 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-09 15:26:58,954 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-09 15:26:58,955 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-09 15:26:58,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-09 15:26:58,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-09 15:26:58,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-09 15:26:58,955 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-09 15:26:58,955 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-09 15:26:58,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-09 15:26:58,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-09 15:26:58,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-09 15:26:58,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-09 15:26:58,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-09 15:26:58,957 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:26:59,071 INFO L241 CfgBuilder]: Building ICFG [2023-12-09 15:26:59,074 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-09 15:26:59,444 INFO L282 CfgBuilder]: Performing block encoding [2023-12-09 15:26:59,510 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-09 15:26:59,510 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-12-09 15:26:59,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:26:59 BoogieIcfgContainer [2023-12-09 15:26:59,512 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-09 15:26:59,514 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-09 15:26:59,514 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-09 15:26:59,516 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-09 15:26:59,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:26:58" (1/3) ... [2023-12-09 15:26:59,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aad05a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:26:59, skipping insertion in model container [2023-12-09 15:26:59,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:26:58" (2/3) ... [2023-12-09 15:26:59,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aad05a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:26:59, skipping insertion in model container [2023-12-09 15:26:59,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:26:59" (3/3) ... [2023-12-09 15:26:59,519 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-inc-subseq.wvr.c [2023-12-09 15:26:59,534 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-09 15:26:59,534 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-09 15:26:59,534 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-09 15:26:59,590 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-12-09 15:26:59,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 194 transitions, 402 flow [2023-12-09 15:26:59,707 INFO L124 PetriNetUnfolderBase]: 15/192 cut-off events. [2023-12-09 15:26:59,707 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-09 15:26:59,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 192 events. 15/192 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 112 event pairs, 0 based on Foata normal form. 0/176 useless extension candidates. Maximal degree in co-relation 156. Up to 2 conditions per place. [2023-12-09 15:26:59,717 INFO L82 GeneralOperation]: Start removeDead. Operand has 186 places, 194 transitions, 402 flow [2023-12-09 15:26:59,726 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 175 places, 183 transitions, 378 flow [2023-12-09 15:26:59,736 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 15:26:59,742 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;@58387933, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 15:26:59,742 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-09 15:26:59,790 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 15:26:59,790 INFO L124 PetriNetUnfolderBase]: 15/182 cut-off events. [2023-12-09 15:26:59,790 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-09 15:26:59,791 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:26:59,791 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, 1, 1, 1, 1, 1, 1] [2023-12-09 15:26:59,792 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:26:59,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:26:59,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1247658675, now seen corresponding path program 1 times [2023-12-09 15:26:59,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:26:59,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987942679] [2023-12-09 15:26:59,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:26:59,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:27:00,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:27:00,592 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:00,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:27:00,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987942679] [2023-12-09 15:27:00,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987942679] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:27:00,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:27:00,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-09 15:27:00,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055890084] [2023-12-09 15:27:00,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:27:00,604 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-09 15:27:00,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:27:00,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-09 15:27:00,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-09 15:27:00,642 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 194 [2023-12-09 15:27:00,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 183 transitions, 378 flow. Second operand has 6 states, 6 states have (on average 131.66666666666666) internal successors, (790), 6 states have internal predecessors, (790), 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:00,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:27:00,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 194 [2023-12-09 15:27:00,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:27:00,866 INFO L124 PetriNetUnfolderBase]: 58/308 cut-off events. [2023-12-09 15:27:00,866 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2023-12-09 15:27:00,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482 conditions, 308 events. 58/308 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 787 event pairs, 12 based on Foata normal form. 20/304 useless extension candidates. Maximal degree in co-relation 270. Up to 67 conditions per place. [2023-12-09 15:27:00,871 INFO L140 encePairwiseOnDemand]: 174/194 looper letters, 57 selfloop transitions, 5 changer transitions 6/182 dead transitions. [2023-12-09 15:27:00,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 182 transitions, 515 flow [2023-12-09 15:27:00,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-09 15:27:00,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-09 15:27:00,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 949 transitions. [2023-12-09 15:27:00,887 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.698821796759941 [2023-12-09 15:27:00,888 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 949 transitions. [2023-12-09 15:27:00,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 949 transitions. [2023-12-09 15:27:00,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:27:00,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 949 transitions. [2023-12-09 15:27:00,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 135.57142857142858) internal successors, (949), 7 states have internal predecessors, (949), 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:00,905 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 194.0) internal successors, (1552), 8 states have internal predecessors, (1552), 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:00,906 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 194.0) internal successors, (1552), 8 states have internal predecessors, (1552), 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:00,909 INFO L308 CegarLoopForPetriNet]: 175 programPoint places, 6 predicate places. [2023-12-09 15:27:00,910 INFO L500 AbstractCegarLoop]: Abstraction has has 181 places, 182 transitions, 515 flow [2023-12-09 15:27:00,910 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 131.66666666666666) internal successors, (790), 6 states have internal predecessors, (790), 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:00,911 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:27:00,911 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:27:00,911 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-09 15:27:00,911 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:27:00,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:27:00,912 INFO L85 PathProgramCache]: Analyzing trace with hash -150899687, now seen corresponding path program 1 times [2023-12-09 15:27:00,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:27:00,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735955726] [2023-12-09 15:27:00,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:27:00,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:27:00,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:27:01,215 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:01,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:27:01,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735955726] [2023-12-09 15:27:01,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735955726] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:27:01,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:27:01,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-09 15:27:01,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40497953] [2023-12-09 15:27:01,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:27:01,219 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-09 15:27:01,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:27:01,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-09 15:27:01,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-12-09 15:27:01,223 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 194 [2023-12-09 15:27:01,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 182 transitions, 515 flow. Second operand has 7 states, 7 states have (on average 141.0) internal successors, (987), 7 states have internal predecessors, (987), 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:01,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:27:01,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 194 [2023-12-09 15:27:01,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:27:01,429 INFO L124 PetriNetUnfolderBase]: 59/358 cut-off events. [2023-12-09 15:27:01,429 INFO L125 PetriNetUnfolderBase]: For 80/88 co-relation queries the response was YES. [2023-12-09 15:27:01,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 693 conditions, 358 events. 59/358 cut-off events. For 80/88 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 913 event pairs, 12 based on Foata normal form. 4/335 useless extension candidates. Maximal degree in co-relation 358. Up to 67 conditions per place. [2023-12-09 15:27:01,435 INFO L140 encePairwiseOnDemand]: 181/194 looper letters, 50 selfloop transitions, 10 changer transitions 16/196 dead transitions. [2023-12-09 15:27:01,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 196 transitions, 701 flow [2023-12-09 15:27:01,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-09 15:27:01,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-09 15:27:01,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1431 transitions. [2023-12-09 15:27:01,438 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7376288659793815 [2023-12-09 15:27:01,439 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1431 transitions. [2023-12-09 15:27:01,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1431 transitions. [2023-12-09 15:27:01,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:27:01,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1431 transitions. [2023-12-09 15:27:01,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 143.1) internal successors, (1431), 10 states have internal predecessors, (1431), 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:01,446 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 194.0) internal successors, (2134), 11 states have internal predecessors, (2134), 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:01,447 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 194.0) internal successors, (2134), 11 states have internal predecessors, (2134), 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:01,448 INFO L308 CegarLoopForPetriNet]: 175 programPoint places, 15 predicate places. [2023-12-09 15:27:01,448 INFO L500 AbstractCegarLoop]: Abstraction has has 190 places, 196 transitions, 701 flow [2023-12-09 15:27:01,450 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 141.0) internal successors, (987), 7 states have internal predecessors, (987), 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:01,450 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:27:01,450 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:27:01,450 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-09 15:27:01,451 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:27:01,452 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:27:01,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1605728617, now seen corresponding path program 1 times [2023-12-09 15:27:01,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:27:01,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93138372] [2023-12-09 15:27:01,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:27:01,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:27:01,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:27:01,772 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:01,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:27:01,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93138372] [2023-12-09 15:27:01,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93138372] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:27:01,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:27:01,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-09 15:27:01,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251760134] [2023-12-09 15:27:01,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:27:01,775 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-09 15:27:01,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:27:01,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-09 15:27:01,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-09 15:27:01,781 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 194 [2023-12-09 15:27:01,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 196 transitions, 701 flow. Second operand has 4 states, 4 states have (on average 166.75) internal successors, (667), 4 states have internal predecessors, (667), 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:01,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:27:01,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 194 [2023-12-09 15:27:01,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:27:01,922 INFO L124 PetriNetUnfolderBase]: 121/576 cut-off events. [2023-12-09 15:27:01,922 INFO L125 PetriNetUnfolderBase]: For 386/426 co-relation queries the response was YES. [2023-12-09 15:27:01,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1353 conditions, 576 events. 121/576 cut-off events. For 386/426 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2427 event pairs, 8 based on Foata normal form. 0/527 useless extension candidates. Maximal degree in co-relation 912. Up to 140 conditions per place. [2023-12-09 15:27:01,926 INFO L140 encePairwiseOnDemand]: 188/194 looper letters, 52 selfloop transitions, 8 changer transitions 16/227 dead transitions. [2023-12-09 15:27:01,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 227 transitions, 1027 flow [2023-12-09 15:27:01,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-09 15:27:01,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-09 15:27:01,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 693 transitions. [2023-12-09 15:27:01,929 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8930412371134021 [2023-12-09 15:27:01,929 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 693 transitions. [2023-12-09 15:27:01,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 693 transitions. [2023-12-09 15:27:01,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:27:01,930 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 693 transitions. [2023-12-09 15:27:01,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 173.25) internal successors, (693), 4 states have internal predecessors, (693), 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:01,933 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 194.0) internal successors, (970), 5 states have internal predecessors, (970), 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:01,933 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 194.0) internal successors, (970), 5 states have internal predecessors, (970), 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:01,935 INFO L308 CegarLoopForPetriNet]: 175 programPoint places, 18 predicate places. [2023-12-09 15:27:01,935 INFO L500 AbstractCegarLoop]: Abstraction has has 193 places, 227 transitions, 1027 flow [2023-12-09 15:27:01,935 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 166.75) internal successors, (667), 4 states have internal predecessors, (667), 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:01,935 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:27:01,936 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-09 15:27:01,936 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-09 15:27:01,936 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:27:01,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:27:01,937 INFO L85 PathProgramCache]: Analyzing trace with hash -978205847, now seen corresponding path program 2 times [2023-12-09 15:27:01,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:27:01,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43070668] [2023-12-09 15:27:01,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:27:01,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:27:02,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:27:02,240 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:02,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:27:02,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43070668] [2023-12-09 15:27:02,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43070668] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:27:02,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:27:02,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-09 15:27:02,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763615402] [2023-12-09 15:27:02,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:27:02,242 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-09 15:27:02,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:27:02,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-09 15:27:02,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-09 15:27:02,244 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 194 [2023-12-09 15:27:02,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 227 transitions, 1027 flow. Second operand has 5 states, 5 states have (on average 139.6) internal successors, (698), 5 states have internal predecessors, (698), 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:02,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:27:02,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 194 [2023-12-09 15:27:02,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:27:02,450 INFO L124 PetriNetUnfolderBase]: 213/866 cut-off events. [2023-12-09 15:27:02,451 INFO L125 PetriNetUnfolderBase]: For 1118/1170 co-relation queries the response was YES. [2023-12-09 15:27:02,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2351 conditions, 866 events. 213/866 cut-off events. For 1118/1170 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4739 event pairs, 8 based on Foata normal form. 0/785 useless extension candidates. Maximal degree in co-relation 1725. Up to 236 conditions per place. [2023-12-09 15:27:02,458 INFO L140 encePairwiseOnDemand]: 183/194 looper letters, 77 selfloop transitions, 2 changer transitions 23/249 dead transitions. [2023-12-09 15:27:02,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 249 transitions, 1385 flow [2023-12-09 15:27:02,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-09 15:27:02,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-09 15:27:02,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 980 transitions. [2023-12-09 15:27:02,461 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7216494845360825 [2023-12-09 15:27:02,461 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 980 transitions. [2023-12-09 15:27:02,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 980 transitions. [2023-12-09 15:27:02,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:27:02,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 980 transitions. [2023-12-09 15:27:02,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 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:02,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 194.0) internal successors, (1552), 8 states have internal predecessors, (1552), 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:02,467 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 194.0) internal successors, (1552), 8 states have internal predecessors, (1552), 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:02,467 INFO L308 CegarLoopForPetriNet]: 175 programPoint places, 24 predicate places. [2023-12-09 15:27:02,468 INFO L500 AbstractCegarLoop]: Abstraction has has 199 places, 249 transitions, 1385 flow [2023-12-09 15:27:02,468 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 139.6) internal successors, (698), 5 states have internal predecessors, (698), 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:02,468 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:27:02,468 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, 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:02,468 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-09 15:27:02,469 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:27:02,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:27:02,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1884531504, now seen corresponding path program 1 times [2023-12-09 15:27:02,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:27:02,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864978681] [2023-12-09 15:27:02,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:27:02,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:27:02,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:27:02,569 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-09 15:27:02,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:27:02,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864978681] [2023-12-09 15:27:02,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864978681] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:27:02,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:27:02,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:27:02,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942263384] [2023-12-09 15:27:02,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:27:02,571 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:27:02,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:27:02,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:27:02,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:27:02,572 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 194 [2023-12-09 15:27:02,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 249 transitions, 1385 flow. Second operand has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 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:02,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:27:02,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 194 [2023-12-09 15:27:02,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:27:02,768 INFO L124 PetriNetUnfolderBase]: 210/898 cut-off events. [2023-12-09 15:27:02,769 INFO L125 PetriNetUnfolderBase]: For 2104/2198 co-relation queries the response was YES. [2023-12-09 15:27:02,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2681 conditions, 898 events. 210/898 cut-off events. For 2104/2198 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4849 event pairs, 11 based on Foata normal form. 16/822 useless extension candidates. Maximal degree in co-relation 1918. Up to 309 conditions per place. [2023-12-09 15:27:02,776 INFO L140 encePairwiseOnDemand]: 191/194 looper letters, 53 selfloop transitions, 7 changer transitions 27/263 dead transitions. [2023-12-09 15:27:02,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 263 transitions, 1689 flow [2023-12-09 15:27:02,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:27:02,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:27:02,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 530 transitions. [2023-12-09 15:27:02,778 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.9106529209621993 [2023-12-09 15:27:02,778 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 530 transitions. [2023-12-09 15:27:02,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 530 transitions. [2023-12-09 15:27:02,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:27:02,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 530 transitions. [2023-12-09 15:27:02,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 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:02,781 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 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:02,781 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 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:02,782 INFO L308 CegarLoopForPetriNet]: 175 programPoint places, 26 predicate places. [2023-12-09 15:27:02,782 INFO L500 AbstractCegarLoop]: Abstraction has has 201 places, 263 transitions, 1689 flow [2023-12-09 15:27:02,782 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 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:02,782 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:27:02,783 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, 1, 1, 1, 1, 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:02,783 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-09 15:27:02,783 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:27:02,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:27:02,784 INFO L85 PathProgramCache]: Analyzing trace with hash 30558781, now seen corresponding path program 1 times [2023-12-09 15:27:02,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:27:02,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712017560] [2023-12-09 15:27:02,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:27:02,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:27:02,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:27:02,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-09 15:27:02,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:27:02,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712017560] [2023-12-09 15:27:02,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712017560] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:27:02,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:27:02,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-09 15:27:02,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69378977] [2023-12-09 15:27:02,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:27:02,970 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-09 15:27:02,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:27:02,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-09 15:27:02,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-09 15:27:02,972 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 194 [2023-12-09 15:27:02,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 263 transitions, 1689 flow. Second operand has 6 states, 6 states have (on average 149.83333333333334) internal successors, (899), 6 states have internal predecessors, (899), 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:02,973 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:27:02,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 194 [2023-12-09 15:27:02,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:27:03,282 INFO L124 PetriNetUnfolderBase]: 261/1239 cut-off events. [2023-12-09 15:27:03,282 INFO L125 PetriNetUnfolderBase]: For 4164/4326 co-relation queries the response was YES. [2023-12-09 15:27:03,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3866 conditions, 1239 events. 261/1239 cut-off events. For 4164/4326 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 7114 event pairs, 37 based on Foata normal form. 16/1122 useless extension candidates. Maximal degree in co-relation 2108. Up to 389 conditions per place. [2023-12-09 15:27:03,291 INFO L140 encePairwiseOnDemand]: 183/194 looper letters, 79 selfloop transitions, 8 changer transitions 71/311 dead transitions. [2023-12-09 15:27:03,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 311 transitions, 2352 flow [2023-12-09 15:27:03,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 15:27:03,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 15:27:03,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1364 transitions. [2023-12-09 15:27:03,295 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7812142038946163 [2023-12-09 15:27:03,295 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1364 transitions. [2023-12-09 15:27:03,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1364 transitions. [2023-12-09 15:27:03,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:27:03,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1364 transitions. [2023-12-09 15:27:03,299 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 151.55555555555554) internal successors, (1364), 9 states have internal predecessors, (1364), 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:03,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 194.0) internal successors, (1940), 10 states have internal predecessors, (1940), 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:03,302 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 194.0) internal successors, (1940), 10 states have internal predecessors, (1940), 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:03,305 INFO L308 CegarLoopForPetriNet]: 175 programPoint places, 34 predicate places. [2023-12-09 15:27:03,305 INFO L500 AbstractCegarLoop]: Abstraction has has 209 places, 311 transitions, 2352 flow [2023-12-09 15:27:03,306 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 149.83333333333334) internal successors, (899), 6 states have internal predecessors, (899), 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:03,306 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:27:03,306 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03,307 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-09 15:27:03,307 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:27:03,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:27:03,307 INFO L85 PathProgramCache]: Analyzing trace with hash -829900857, now seen corresponding path program 1 times [2023-12-09 15:27:03,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:27:03,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939612485] [2023-12-09 15:27:03,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:27:03,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:27:03,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:27:04,914 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:27:04,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:27:04,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939612485] [2023-12-09 15:27:04,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939612485] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:27:04,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071103008] [2023-12-09 15:27:04,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:27:04,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:27:04,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:27:04,919 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:04,949 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:05,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:27:05,083 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 32 conjunts are in the unsatisfiable core [2023-12-09 15:27:05,093 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:27:06,555 INFO L349 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-12-09 15:27:06,555 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 34 treesize of output 10 [2023-12-09 15:27:06,576 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:27:06,577 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:27:07,231 INFO L349 Elim1Store]: treesize reduction 11, result has 87.1 percent of original size [2023-12-09 15:27:07,231 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 74 treesize of output 99 [2023-12-09 15:27:09,019 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:27:09,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071103008] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:27:09,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:27:09,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 18, 19] total 46 [2023-12-09 15:27:09,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410788835] [2023-12-09 15:27:09,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:27:09,021 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2023-12-09 15:27:09,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:27:09,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2023-12-09 15:27:09,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=1724, Unknown=0, NotChecked=0, Total=2070 [2023-12-09 15:27:09,028 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 194 [2023-12-09 15:27:09,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 311 transitions, 2352 flow. Second operand has 46 states, 46 states have (on average 59.54347826086956) internal successors, (2739), 46 states have internal predecessors, (2739), 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:09,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:27:09,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 194 [2023-12-09 15:27:09,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:27:21,183 INFO L124 PetriNetUnfolderBase]: 5626/12062 cut-off events. [2023-12-09 15:27:21,183 INFO L125 PetriNetUnfolderBase]: For 33018/33150 co-relation queries the response was YES. [2023-12-09 15:27:21,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42192 conditions, 12062 events. 5626/12062 cut-off events. For 33018/33150 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 105717 event pairs, 355 based on Foata normal form. 0/10868 useless extension candidates. Maximal degree in co-relation 23029. Up to 3274 conditions per place. [2023-12-09 15:27:21,271 INFO L140 encePairwiseOnDemand]: 143/194 looper letters, 848 selfloop transitions, 347 changer transitions 430/1669 dead transitions. [2023-12-09 15:27:21,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 1669 transitions, 16769 flow [2023-12-09 15:27:21,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2023-12-09 15:27:21,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2023-12-09 15:27:21,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 9345 transitions. [2023-12-09 15:27:21,295 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.306815943266137 [2023-12-09 15:27:21,296 INFO L72 ComplementDD]: Start complementDD. Operand 157 states and 9345 transitions. [2023-12-09 15:27:21,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 157 states and 9345 transitions. [2023-12-09 15:27:21,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:27:21,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 157 states and 9345 transitions. [2023-12-09 15:27:21,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 158 states, 157 states have (on average 59.52229299363057) internal successors, (9345), 157 states have internal predecessors, (9345), 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:21,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 158 states, 158 states have (on average 194.0) internal successors, (30652), 158 states have internal predecessors, (30652), 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:21,390 INFO L81 ComplementDD]: Finished complementDD. Result has 158 states, 158 states have (on average 194.0) internal successors, (30652), 158 states have internal predecessors, (30652), 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:21,391 INFO L308 CegarLoopForPetriNet]: 175 programPoint places, 190 predicate places. [2023-12-09 15:27:21,391 INFO L500 AbstractCegarLoop]: Abstraction has has 365 places, 1669 transitions, 16769 flow [2023-12-09 15:27:21,392 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 59.54347826086956) internal successors, (2739), 46 states have internal predecessors, (2739), 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:21,392 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:27:21,392 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-09 15:27:21,593 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:27:21,593 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:27:21,594 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:27:21,594 INFO L85 PathProgramCache]: Analyzing trace with hash 330472307, now seen corresponding path program 2 times [2023-12-09 15:27:21,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:27:21,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764061513] [2023-12-09 15:27:21,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:27:21,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:27:21,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:27:21,837 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-09 15:27:21,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:27:21,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764061513] [2023-12-09 15:27:21,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764061513] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:27:21,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993035036] [2023-12-09 15:27:21,838 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-09 15:27:21,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:27:21,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:27:21,839 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:21,842 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:21,979 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-09 15:27:21,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:27:21,982 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-09 15:27:21,994 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:27:22,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-09 15:27:22,049 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:27:22,126 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-09 15:27:22,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993035036] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:27:22,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:27:22,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 8 [2023-12-09 15:27:22,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402152316] [2023-12-09 15:27:22,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:27:22,128 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-09 15:27:22,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:27:22,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-09 15:27:22,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-09 15:27:22,129 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 194 [2023-12-09 15:27:22,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 1669 transitions, 16769 flow. Second operand has 8 states, 8 states have (on average 167.25) internal successors, (1338), 8 states have internal predecessors, (1338), 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:22,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:27:22,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 194 [2023-12-09 15:27:22,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:27:25,215 INFO L124 PetriNetUnfolderBase]: 6990/14039 cut-off events. [2023-12-09 15:27:25,215 INFO L125 PetriNetUnfolderBase]: For 54427/54629 co-relation queries the response was YES. [2023-12-09 15:27:25,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57103 conditions, 14039 events. 6990/14039 cut-off events. For 54427/54629 co-relation queries the response was YES. Maximal size of possible extension queue 651. Compared 120975 event pairs, 392 based on Foata normal form. 6/13010 useless extension candidates. Maximal degree in co-relation 32054. Up to 4281 conditions per place. [2023-12-09 15:27:25,333 INFO L140 encePairwiseOnDemand]: 188/194 looper letters, 805 selfloop transitions, 410 changer transitions 353/2065 dead transitions. [2023-12-09 15:27:25,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 2065 transitions, 25058 flow [2023-12-09 15:27:25,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-09 15:27:25,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-12-09 15:27:25,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1355 transitions. [2023-12-09 15:27:25,336 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8730670103092784 [2023-12-09 15:27:25,336 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1355 transitions. [2023-12-09 15:27:25,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1355 transitions. [2023-12-09 15:27:25,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:27:25,336 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1355 transitions. [2023-12-09 15:27:25,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 169.375) internal successors, (1355), 8 states have internal predecessors, (1355), 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:25,343 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 194.0) internal successors, (1746), 9 states have internal predecessors, (1746), 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:25,344 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 194.0) internal successors, (1746), 9 states have internal predecessors, (1746), 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:25,346 INFO L308 CegarLoopForPetriNet]: 175 programPoint places, 190 predicate places. [2023-12-09 15:27:25,346 INFO L500 AbstractCegarLoop]: Abstraction has has 365 places, 2065 transitions, 25058 flow [2023-12-09 15:27:25,347 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 167.25) internal successors, (1338), 8 states have internal predecessors, (1338), 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:25,347 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:27:25,347 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-09 15:27:25,552 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,SelfDestructingSolverStorable7 [2023-12-09 15:27:25,553 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:27:25,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:27:25,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1753418197, now seen corresponding path program 3 times [2023-12-09 15:27:25,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:27:25,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079491439] [2023-12-09 15:27:25,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:27:25,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:27:25,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:27:27,711 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:27:27,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:27:27,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079491439] [2023-12-09 15:27:27,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079491439] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:27:27,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883559977] [2023-12-09 15:27:27,711 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-09 15:27:27,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:27:27,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:27:27,713 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:27,715 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:27,977 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-09 15:27:27,977 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:27:27,979 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 58 conjunts are in the unsatisfiable core [2023-12-09 15:27:27,984 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:27:28,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-09 15:27:28,874 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 23 treesize of output 1 [2023-12-09 15:27:29,692 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-09 15:27:29,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-09 15:27:29,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-09 15:27:30,785 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 15:27:30,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-09 15:27:31,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 15:27:31,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-09 15:27:31,292 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-09 15:27:31,293 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 26 treesize of output 10 [2023-12-09 15:27:31,358 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:27:31,358 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:27:37,797 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:27:37,797 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 62 treesize of output 51 [2023-12-09 15:27:37,826 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:27:37,827 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 27126 treesize of output 25098 [2023-12-09 15:27:37,970 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:27:37,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1558 treesize of output 1383 [2023-12-09 15:27:38,003 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:27:38,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1366 treesize of output 999 [2023-12-09 15:27:38,049 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:27:38,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 982 treesize of output 903 [2023-12-09 15:27:40,575 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:27:40,576 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 116 treesize of output 80 [2023-12-09 15:27:40,639 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:27:40,640 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 15100 treesize of output 13968 [2023-12-09 15:27:40,795 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:27:40,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1856 treesize of output 1464 [2023-12-09 15:27:40,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:27:40,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1424 treesize of output 1372 [2023-12-09 15:27:40,957 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:27:40,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1201 treesize of output 1025 [2023-12-09 15:28:02,203 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:28:02,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 94 treesize of output 165 [2023-12-09 15:28:03,401 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:28:03,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883559977] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:28:03,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:28:03,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 32, 33] total 85 [2023-12-09 15:28:03,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886205348] [2023-12-09 15:28:03,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:28:03,403 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2023-12-09 15:28:03,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:28:03,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2023-12-09 15:28:03,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=733, Invalid=6341, Unknown=66, NotChecked=0, Total=7140 [2023-12-09 15:28:03,410 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 194 [2023-12-09 15:28:03,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 2065 transitions, 25058 flow. Second operand has 85 states, 85 states have (on average 47.023529411764706) internal successors, (3997), 85 states have internal predecessors, (3997), 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:03,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:28:03,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 194 [2023-12-09 15:28:03,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:28:35,758 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse12 (* c_~i~0 4)) (.cse37 (* c_~end~0 4))) (let ((.cse49 (+ c_~start~0 1)) (.cse29 (+ c_~end~0 1)) (.cse33 (* c_~start~0 4)) (.cse28 (= c_~i~0 0)) (.cse27 (= c_~start~0 c_~end~0)) (.cse2 (+ .cse37 c_~queue~0.offset)) (.cse4 (+ c_~A~0.offset .cse12)) (.cse10 (not (= (mod c_~ok~0 256) 0)))) (let ((.cse20 (select |c_#memory_int| c_~A~0.base)) (.cse25 (= c_~start~0 0)) (.cse17 (select |c_#memory_int| c_~queue~0.base)) (.cse23 (< (+ c_~start~0 c_~n~0) 2)) (.cse22 (not (= c_~end~0 0))) (.cse24 (< c_~start~0 1)) (.cse6 (or (forall ((v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int))) (not (let ((.cse69 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182))) (= (select (select .cse69 c_~queue~0.base) .cse2) (select (select .cse69 c_~A~0.base) .cse4))))) .cse10)) (.cse54 (and .cse28 .cse10 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t2~0#1.base|) .cse27 (<= |c_#StackHeapBarrier| |c_ULTIMATE.start_main_~#t1~0#1.base|))) (.cse30 (+ |c_#StackHeapBarrier| 1)) (.cse5 (+ .cse33 c_~queue~0.offset)) (.cse0 (< c_~end~0 0)) (.cse7 (< c_~start~0 0)) (.cse8 (< c_~n~0 .cse29)) (.cse9 (< c_~n~0 .cse49))) (and (or .cse0 (and (forall ((v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182))) (let ((.cse1 (select .cse3 c_~queue~0.base))) (or (not (= (select .cse1 .cse2) (select (select .cse3 c_~A~0.base) .cse4))) (< |c_ULTIMATE.start_main_#t~mem14#1| (+ (select .cse1 .cse5) 1)))))) .cse6) .cse7 .cse8 .cse9) (or (and (or .cse10 (forall ((~A~0.offset Int) (v_ArrVal_180 (Array Int Int)) (v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int)) (v_~A~0.base_24 Int) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| Int)) (or (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| v_~A~0.base_24) (not (let ((.cse11 (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| v_ArrVal_180) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182))) (= (select (select .cse11 v_~A~0.base_24) (+ ~A~0.offset .cse12)) (select (select .cse11 c_~queue~0.base) .cse2)))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| 1))))) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| 1)) (forall ((~A~0.offset Int) (v_ArrVal_180 (Array Int Int)) (v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int)) (v_~A~0.base_24 Int)) (let ((.cse13 (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| v_ArrVal_180))) (let ((.cse15 (store (store .cse13 |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182))) (let ((.cse14 (select .cse15 c_~queue~0.base))) (or (< (select (select .cse13 v_~A~0.base_24) ~A~0.offset) (+ (select .cse14 .cse5) 1)) (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| v_~A~0.base_24) (not (= (select (select .cse15 v_~A~0.base_24) (+ ~A~0.offset .cse12)) (select .cse14 .cse2))))))))))) .cse0 .cse7 .cse8 .cse9) (exists ((~A~0.offset Int) (~A~0.base Int)) (let ((.cse16 (select (select |c_#memory_int| ~A~0.base) ~A~0.offset))) (and (<= c_~v_old~0 .cse16) (= .cse16 (select .cse17 .cse5))))) (or (and (forall ((~A~0.offset Int) (v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int))) (let ((.cse18 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182))) (let ((.cse19 (select .cse18 c_~queue~0.base))) (or (not (= (select (select .cse18 c_~A~0.base) (+ ~A~0.offset .cse12)) (select .cse19 .cse2))) (< (select .cse20 ~A~0.offset) (+ (select .cse19 .cse5) 1)))))) (or (forall ((~A~0.offset Int) (v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int))) (not (let ((.cse21 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182))) (= (select (select .cse21 c_~A~0.base) (+ ~A~0.offset .cse12)) (select (select .cse21 c_~queue~0.base) .cse2))))) .cse10)) .cse0 .cse7 .cse8 .cse9) (or .cse22 (and (or .cse23 .cse24) (or (< c_~v_old~0 (+ (select .cse20 .cse4) 1)) (not .cse25)))) (or .cse0 .cse7 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse8 .cse9 (let ((.cse26 (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| 1)))))) (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| Int)) (or (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| |c_ULTIMATE.start_main_~#t1~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| 1)))) (or .cse26 .cse27) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| Int)) (or (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| |c_ULTIMATE.start_main_~#t2~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| 1)))) (or .cse28 .cse26) (or .cse26 .cse10)))) (or (< 0 .cse29) (< c_~start~0 .cse29)) .cse28 (or (and .cse25 (<= c_~v_old~0 (select .cse17 0))) .cse7) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~A~0.base)) (<= 0 c_~start~0) (or .cse23 .cse22 .cse24) (<= .cse30 |c_ULTIMATE.start_main_~#t1~0#1.base|) (or .cse0 .cse7 .cse8 .cse9 (let ((.cse34 (+ .cse37 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| 1)) (forall ((~A~0.offset Int) (v_ArrVal_180 (Array Int Int)) (v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int)) (v_~A~0.base_24 Int)) (let ((.cse31 (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| v_ArrVal_180))) (let ((.cse35 (store (store .cse31 |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182))) (let ((.cse32 (select .cse35 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| v_~A~0.base_24) (< (select (select .cse31 v_~A~0.base_24) ~A~0.offset) (+ (select .cse32 (+ .cse33 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (not (= (select .cse32 .cse34) (select (select .cse35 v_~A~0.base_24) (+ ~A~0.offset .cse12))))))))))) (or .cse10 (forall ((~A~0.offset Int) (v_ArrVal_180 (Array Int Int)) (v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int)) (v_~A~0.base_24 Int) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| Int)) (or (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| v_~A~0.base_24) (not (let ((.cse36 (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| v_ArrVal_180) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182))) (= (select (select .cse36 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse34) (select (select .cse36 v_~A~0.base_24) (+ ~A~0.offset .cse12))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| 1)))))))) (or .cse0 (and (forall ((v_~A~0.base_24 Int)) (or (< |c_ULTIMATE.start_main_#t~ret13#1.base| v_~A~0.base_24) (forall ((~A~0.offset Int) (v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int))) (let ((.cse39 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182))) (let ((.cse38 (select .cse39 c_~queue~0.base))) (or (< (select (select |c_#memory_int| v_~A~0.base_24) ~A~0.offset) (+ (select .cse38 .cse5) 1)) (not (= (select (select .cse39 v_~A~0.base_24) (+ ~A~0.offset .cse12)) (select .cse38 .cse2))))))))) (or .cse10 (forall ((~A~0.offset Int) (v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int)) (v_~A~0.base_24 Int)) (or (< |c_ULTIMATE.start_main_#t~ret13#1.base| v_~A~0.base_24) (not (let ((.cse40 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182))) (= (select (select .cse40 v_~A~0.base_24) (+ ~A~0.offset .cse12)) (select (select .cse40 c_~queue~0.base) .cse2)))))))) .cse7 .cse8 .cse9) (or (and (or (forall ((~A~0.offset Int) (v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int)) (v_~A~0.base_24 Int)) (or (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| v_~A~0.base_24) (not (let ((.cse41 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182))) (= (select (select .cse41 v_~A~0.base_24) (+ ~A~0.offset .cse12)) (select (select .cse41 c_~queue~0.base) .cse2)))))) .cse10) (forall ((~A~0.offset Int) (v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int)) (v_~A~0.base_24 Int)) (let ((.cse43 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182))) (let ((.cse42 (select .cse43 c_~queue~0.base))) (or (< |c_ULTIMATE.start_create_fresh_int_array_#res#1.base| v_~A~0.base_24) (< (select (select |c_#memory_int| v_~A~0.base_24) ~A~0.offset) (+ (select .cse42 .cse5) 1)) (not (= (select (select .cse43 v_~A~0.base_24) (+ ~A~0.offset .cse12)) (select .cse42 .cse2)))))))) .cse0 .cse7 .cse8 .cse9) (or .cse0 .cse7 .cse8 .cse9 (let ((.cse45 (+ .cse37 |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (and (or (forall ((~A~0.offset Int) (v_ArrVal_180 (Array Int Int)) (v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int)) (v_~A~0.base_24 Int) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| Int)) (or (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| v_~A~0.base_24) (not (let ((.cse44 (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| v_ArrVal_180) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182))) (= (select (select .cse44 |c_ULTIMATE.start_main_#t~ret12#1.base|) .cse45) (select (select .cse44 v_~A~0.base_24) (+ ~A~0.offset .cse12))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| 1)))) .cse10) (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| Int)) (or (forall ((~A~0.offset Int) (v_ArrVal_180 (Array Int Int)) (v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int)) (v_~A~0.base_24 Int)) (let ((.cse48 (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| v_ArrVal_180))) (let ((.cse47 (store (store .cse48 |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182))) (let ((.cse46 (select .cse47 |c_ULTIMATE.start_main_#t~ret12#1.base|))) (or (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| v_~A~0.base_24) (not (= (select .cse46 .cse45) (select (select .cse47 v_~A~0.base_24) (+ ~A~0.offset .cse12)))) (< (select (select .cse48 v_~A~0.base_24) ~A~0.offset) (+ (select .cse46 (+ .cse33 |c_ULTIMATE.start_main_#t~ret12#1.offset|)) 1))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| 1))))))) (<= c_~n~0 1) (<= .cse49 c_~n~0) (or (< c_~end~0 1) (< c_~n~0 2)) (or .cse0 (and (forall ((~A~0.offset Int) (v_ArrVal_180 (Array Int Int)) (v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int)) (v_~A~0.base_24 Int)) (let ((.cse50 (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| v_ArrVal_180))) (let ((.cse52 (store (store .cse50 |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182))) (let ((.cse51 (select .cse52 c_~queue~0.base))) (or (< (select (select .cse50 v_~A~0.base_24) ~A~0.offset) (+ (select .cse51 .cse5) 1)) (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| v_~A~0.base_24) (not (= (select (select .cse52 v_~A~0.base_24) (+ ~A~0.offset .cse12)) (select .cse51 .cse2)))))))) (or .cse10 (forall ((~A~0.offset Int) (v_ArrVal_180 (Array Int Int)) (v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int)) (v_~A~0.base_24 Int)) (or (< |c_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| v_~A~0.base_24) (not (let ((.cse53 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| v_ArrVal_180) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182))) (= (select (select .cse53 v_~A~0.base_24) (+ ~A~0.offset .cse12)) (select (select .cse53 c_~queue~0.base) .cse2)))))))) .cse7 .cse8 .cse9) (or .cse54 .cse0 .cse7 .cse8 .cse9 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (= c_~ok~0 1) (or .cse0 .cse7 .cse8 (and (or .cse10 (forall ((~A~0.offset Int) (v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int)) (v_~A~0.base_24 Int)) (or (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_~A~0.base_24) (not (let ((.cse55 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182))) (= (select (select .cse55 v_~A~0.base_24) (+ ~A~0.offset .cse12)) (select (select .cse55 c_~queue~0.base) .cse2))))))) (forall ((~A~0.offset Int) (v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int)) (v_~A~0.base_24 Int)) (let ((.cse57 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182))) (let ((.cse56 (select .cse57 c_~queue~0.base))) (or (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_~A~0.base_24) (< (select (select |c_#memory_int| v_~A~0.base_24) ~A~0.offset) (+ (select .cse56 .cse5) 1)) (not (= (select (select .cse57 v_~A~0.base_24) (+ ~A~0.offset .cse12)) (select .cse56 .cse2)))))))) .cse9) (= c_~queue~0.offset 0) (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|)) (<= c_~start~0 c_~end~0) (or (and (forall ((v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int))) (let ((.cse59 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182))) (let ((.cse58 (select .cse59 c_~queue~0.base))) (or (not (= (select .cse58 .cse2) (select (select .cse59 c_~A~0.base) .cse4))) (< c_~v_old~0 (+ (select .cse58 .cse5) 1)))))) .cse6) .cse0 .cse7 .cse8 .cse9) (or .cse54 .cse0 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse7 .cse8 .cse9) (<= .cse30 |c_ULTIMATE.start_main_~#t2~0#1.base|) (or .cse0 (and (forall ((~A~0.offset Int) (v_ArrVal_180 (Array Int Int)) (v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int)) (v_~A~0.base_24 Int)) (let ((.cse60 (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_180))) (let ((.cse62 (store (store .cse60 |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182))) (let ((.cse61 (select .cse62 c_~queue~0.base))) (or (< (select (select .cse60 v_~A~0.base_24) ~A~0.offset) (+ (select .cse61 .cse5) 1)) (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_~A~0.base_24) (not (= (select .cse61 .cse2) (select (select .cse62 v_~A~0.base_24) (+ ~A~0.offset .cse12))))))))) (or (forall ((~A~0.offset Int) (v_ArrVal_180 (Array Int Int)) (v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int)) (v_~A~0.base_24 Int)) (or (< |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_~A~0.base_24) (not (let ((.cse63 (store (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_180) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182))) (= (select (select .cse63 c_~queue~0.base) .cse2) (select (select .cse63 v_~A~0.base_24) (+ ~A~0.offset .cse12))))))) .cse10)) .cse7 .cse8 .cse9) (or .cse0 (let ((.cse67 (+ .cse37 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| Int)) (or (forall ((~A~0.offset Int) (v_ArrVal_180 (Array Int Int)) (v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int)) (v_~A~0.base_24 Int)) (let ((.cse64 (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| v_ArrVal_180))) (let ((.cse66 (store (store .cse64 |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182))) (let ((.cse65 (select .cse66 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| v_~A~0.base_24) (< (select (select .cse64 v_~A~0.base_24) ~A~0.offset) (+ (select .cse65 (+ .cse33 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)) (not (= (select (select .cse66 v_~A~0.base_24) (+ ~A~0.offset .cse12)) (select .cse65 .cse67)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| 1)))) (or .cse10 (forall ((~A~0.offset Int) (v_ArrVal_180 (Array Int Int)) (v_ArrVal_182 (Array Int Int)) (v_ArrVal_181 (Array Int Int)) (v_~A~0.base_24 Int) (|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| Int)) (or (< |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| v_~A~0.base_24) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21|) 0)) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| 1)) (not (let ((.cse68 (store (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_21| v_ArrVal_180) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_181) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_182))) (= (select (select .cse68 v_~A~0.base_24) (+ ~A~0.offset .cse12)) (select (select .cse68 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse67))))))))) .cse7 .cse8 .cse9))))) is different from false [2023-12-09 15:28:49,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:28:51,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:29:03,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:29:18,550 INFO L124 PetriNetUnfolderBase]: 23625/46014 cut-off events. [2023-12-09 15:29:18,550 INFO L125 PetriNetUnfolderBase]: For 205547/207519 co-relation queries the response was YES. [2023-12-09 15:29:18,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226132 conditions, 46014 events. 23625/46014 cut-off events. For 205547/207519 co-relation queries the response was YES. Maximal size of possible extension queue 2441. Compared 476963 event pairs, 708 based on Foata normal form. 166/42695 useless extension candidates. Maximal degree in co-relation 151225. Up to 15070 conditions per place. [2023-12-09 15:29:18,928 INFO L140 encePairwiseOnDemand]: 131/194 looper letters, 4349 selfloop transitions, 1513 changer transitions 1043/7086 dead transitions. [2023-12-09 15:29:18,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 525 places, 7086 transitions, 101469 flow [2023-12-09 15:29:18,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2023-12-09 15:29:18,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2023-12-09 15:29:18,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 7888 transitions. [2023-12-09 15:29:18,942 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.25254530319523594 [2023-12-09 15:29:18,943 INFO L72 ComplementDD]: Start complementDD. Operand 161 states and 7888 transitions. [2023-12-09 15:29:18,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 161 states and 7888 transitions. [2023-12-09 15:29:18,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:29:18,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 161 states and 7888 transitions. [2023-12-09 15:29:18,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 162 states, 161 states have (on average 48.993788819875775) internal successors, (7888), 161 states have internal predecessors, (7888), 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:18,994 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 162 states, 162 states have (on average 194.0) internal successors, (31428), 162 states have internal predecessors, (31428), 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:19,005 INFO L81 ComplementDD]: Finished complementDD. Result has 162 states, 162 states have (on average 194.0) internal successors, (31428), 162 states have internal predecessors, (31428), 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:19,006 INFO L308 CegarLoopForPetriNet]: 175 programPoint places, 350 predicate places. [2023-12-09 15:29:19,006 INFO L500 AbstractCegarLoop]: Abstraction has has 525 places, 7086 transitions, 101469 flow [2023-12-09 15:29:19,007 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 85 states have (on average 47.023529411764706) internal successors, (3997), 85 states have internal predecessors, (3997), 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:19,008 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:29:19,008 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19,016 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:29:19,214 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:29:19,214 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-09 15:29:19,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:29:19,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1720778227, now seen corresponding path program 4 times [2023-12-09 15:29:19,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:29:19,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959370831] [2023-12-09 15:29:19,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:29:19,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:29:19,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:29:21,790 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:29:21,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:29:21,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959370831] [2023-12-09 15:29:21,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959370831] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-09 15:29:21,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [556817560] [2023-12-09 15:29:21,790 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-09 15:29:21,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-09 15:29:21,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:29:21,792 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:29:21,796 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:29:21,929 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-09 15:29:21,929 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-09 15:29:21,933 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 71 conjunts are in the unsatisfiable core [2023-12-09 15:29:21,937 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-09 15:29:22,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-12-09 15:29:23,064 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 23 treesize of output 1 [2023-12-09 15:29:23,939 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-12-09 15:29:23,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-12-09 15:29:24,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-09 15:29:25,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 15:29:25,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-09 15:29:26,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-09 15:29:26,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-12-09 15:29:26,610 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-12-09 15:29:26,611 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 26 treesize of output 10 [2023-12-09 15:29:26,650 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-09 15:29:26,651 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-09 15:29:33,551 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:29:33,552 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 60 treesize of output 49 [2023-12-09 15:29:33,590 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:29:33,591 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 25078 treesize of output 23304 [2023-12-09 15:29:33,728 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:29:33,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1446 treesize of output 1301 [2023-12-09 15:29:33,775 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:29:33,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1286 treesize of output 1221 [2023-12-09 15:29:33,823 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:29:33,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1206 treesize of output 901 [2023-12-09 15:29:34,808 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:29:34,809 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 114 treesize of output 78 [2023-12-09 15:29:34,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:29:34,865 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 7028 treesize of output 6564 [2023-12-09 15:29:35,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:29:35,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1744 treesize of output 1412 [2023-12-09 15:29:35,141 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:29:35,141 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1376 treesize of output 1336 [2023-12-09 15:29:35,216 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:29:35,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1169 treesize of output 1021 [2023-12-09 15:30:04,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-09 15:30:04,218 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 94 treesize of output 165 [2023-12-09 15:30:42,095 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-09 15:30:42,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [556817560] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-09 15:30:42,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-09 15:30:42,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 35, 36] total 91 [2023-12-09 15:30:42,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914939204] [2023-12-09 15:30:42,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-09 15:30:42,096 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2023-12-09 15:30:42,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:30:42,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2023-12-09 15:30:42,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=713, Invalid=7399, Unknown=78, NotChecked=0, Total=8190 [2023-12-09 15:30:42,102 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 194 [2023-12-09 15:30:42,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 525 places, 7086 transitions, 101469 flow. Second operand has 91 states, 91 states have (on average 42.92307692307692) internal successors, (3906), 91 states have internal predecessors, (3906), 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:30:42,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:30:42,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 194 [2023-12-09 15:30:42,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:30:46,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:30:48,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:30:53,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:30:57,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:30:59,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-09 15:31:02,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2023-12-09 15:31:02,283 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:02,284 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-09 15:31:03,294 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:31:03,485 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-12-09 15:31:03,540 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-12-09 15:31:03,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2023-12-09 15:31:03,540 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-09 15:31:03,540 WARN L624 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-12-09 15:31:03,541 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-12-09 15:31:03,542 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-12-09 15:31:03,542 INFO L457 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1] [2023-12-09 15:31:03,544 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-09 15:31:03,545 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-09 15:31:03,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 03:31:03 BasicIcfg [2023-12-09 15:31:03,548 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-09 15:31:03,548 INFO L158 Benchmark]: Toolchain (without parser) took 245007.79ms. Allocated memory was 312.5MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 263.1MB in the beginning and 945.1MB in the end (delta: -682.0MB). Peak memory consumption was 889.5MB. Max. memory is 8.0GB. [2023-12-09 15:31:03,548 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 189.8MB. Free memory is still 137.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-09 15:31:03,548 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.26ms. Allocated memory is still 312.5MB. Free memory was 263.1MB in the beginning and 250.8MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-09 15:31:03,549 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.28ms. Allocated memory is still 312.5MB. Free memory was 250.8MB in the beginning and 248.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-09 15:31:03,549 INFO L158 Benchmark]: Boogie Preprocessor took 44.42ms. Allocated memory is still 312.5MB. Free memory was 248.8MB in the beginning and 247.0MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-09 15:31:03,549 INFO L158 Benchmark]: RCFGBuilder took 623.63ms. Allocated memory is still 312.5MB. Free memory was 247.0MB in the beginning and 220.8MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2023-12-09 15:31:03,549 INFO L158 Benchmark]: TraceAbstraction took 244034.06ms. Allocated memory was 312.5MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 220.1MB in the beginning and 945.1MB in the end (delta: -725.0MB). Peak memory consumption was 846.5MB. Max. memory is 8.0GB. [2023-12-09 15:31:03,550 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.13ms. Allocated memory is still 189.8MB. Free memory is still 137.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 261.26ms. Allocated memory is still 312.5MB. Free memory was 263.1MB in the beginning and 250.8MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.28ms. Allocated memory is still 312.5MB. Free memory was 250.8MB in the beginning and 248.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.42ms. Allocated memory is still 312.5MB. Free memory was 248.8MB in the beginning and 247.0MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 623.63ms. Allocated memory is still 312.5MB. Free memory was 247.0MB in the beginning and 220.8MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 244034.06ms. Allocated memory was 312.5MB in the beginning and 1.9GB in the end (delta: 1.6GB). Free memory was 220.1MB in the beginning and 945.1MB in the end (delta: -725.0MB). Peak memory consumption was 846.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 107]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 101]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 206 locations, 3 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: 243.9s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 114.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 372 mSolverCounterUnknown, 5457 SdHoareTripleChecker+Valid, 33.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5457 mSDsluCounter, 8746 SdHoareTripleChecker+Invalid, 32.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 494 IncrementalHoareTripleChecker+Unchecked, 8269 mSDsCounter, 560 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12100 IncrementalHoareTripleChecker+Invalid, 13527 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 560 mSolverCounterUnsat, 477 mSDtfsCounter, 12100 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1748 GetRequests, 1188 SyntacticMatches, 4 SemanticMatches, 556 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 34002 ImplicationChecksByTransitivity, 75.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101469occurred in iteration=9, InterpolantAutomatonStates: 366, 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.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 127.6s InterpolantComputationTime, 2201 NumberOfCodeBlocks, 2201 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 2843 ConstructedInterpolants, 190 QuantifiedInterpolants, 54008 SizeOfPredicates, 125 NumberOfNonLiveVariables, 1456 ConjunctsInSsa, 170 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 27/59 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