/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/test-easy6.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-a20a710-m [2023-12-09 15:36:24,706 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-09 15:36:24,777 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:36:24,800 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-09 15:36:24,802 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-09 15:36:24,802 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-09 15:36:24,802 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-09 15:36:24,803 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-09 15:36:24,803 INFO L153 SettingsManager]: * Use SBE=true [2023-12-09 15:36:24,806 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-09 15:36:24,806 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-09 15:36:24,806 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-09 15:36:24,807 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-09 15:36:24,808 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-09 15:36:24,808 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-09 15:36:24,808 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-09 15:36:24,808 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-09 15:36:24,808 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-09 15:36:24,808 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-09 15:36:24,809 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-09 15:36:24,809 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-09 15:36:24,809 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-09 15:36:24,809 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-09 15:36:24,810 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-09 15:36:24,810 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-09 15:36:24,810 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:36:24,810 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-09 15:36:24,810 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-09 15:36:24,810 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-09 15:36:24,810 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-09 15:36:24,811 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-09 15:36:24,811 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-09 15:36:24,811 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-09 15:36:24,812 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:36:24,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-09 15:36:24,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-09 15:36:24,994 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-09 15:36:24,995 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-09 15:36:24,995 INFO L274 PluginConnector]: CDTParser initialized [2023-12-09 15:36:24,996 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/test-easy6.wvr.c [2023-12-09 15:36:26,034 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-09 15:36:26,177 INFO L384 CDTParser]: Found 1 translation units. [2023-12-09 15:36:26,177 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy6.wvr.c [2023-12-09 15:36:26,183 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab27b20b3/0648a6316d814159a13a6070e35c70fb/FLAGa55d9ff67 [2023-12-09 15:36:26,194 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ab27b20b3/0648a6316d814159a13a6070e35c70fb [2023-12-09 15:36:26,196 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-09 15:36:26,197 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-09 15:36:26,199 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-09 15:36:26,199 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-09 15:36:26,202 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-09 15:36:26,202 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:36:26" (1/1) ... [2023-12-09 15:36:26,203 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4892e8fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:36:26, skipping insertion in model container [2023-12-09 15:36:26,204 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:36:26" (1/1) ... [2023-12-09 15:36:26,222 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-09 15:36:26,358 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/test-easy6.wvr.c[3072,3085] [2023-12-09 15:36:26,360 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:36:26,371 INFO L202 MainTranslator]: Completed pre-run [2023-12-09 15:36:26,384 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/test-easy6.wvr.c[3072,3085] [2023-12-09 15:36:26,386 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-09 15:36:26,393 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-12-09 15:36:26,393 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-12-09 15:36:26,397 INFO L206 MainTranslator]: Completed translation [2023-12-09 15:36:26,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:36:26 WrapperNode [2023-12-09 15:36:26,398 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-09 15:36:26,399 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-09 15:36:26,399 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-09 15:36:26,399 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-09 15:36:26,403 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:36:26" (1/1) ... [2023-12-09 15:36:26,409 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:36:26" (1/1) ... [2023-12-09 15:36:26,423 INFO L138 Inliner]: procedures = 21, calls = 59, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 124 [2023-12-09 15:36:26,424 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-09 15:36:26,424 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-09 15:36:26,424 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-09 15:36:26,424 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-09 15:36:26,429 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:36:26" (1/1) ... [2023-12-09 15:36:26,429 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:36:26" (1/1) ... [2023-12-09 15:36:26,444 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:36:26" (1/1) ... [2023-12-09 15:36:26,444 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:36:26" (1/1) ... [2023-12-09 15:36:26,448 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:36:26" (1/1) ... [2023-12-09 15:36:26,450 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:36:26" (1/1) ... [2023-12-09 15:36:26,450 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:36:26" (1/1) ... [2023-12-09 15:36:26,451 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:36:26" (1/1) ... [2023-12-09 15:36:26,452 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-09 15:36:26,453 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-09 15:36:26,453 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-09 15:36:26,453 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-09 15:36:26,454 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:36:26" (1/1) ... [2023-12-09 15:36:26,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-09 15:36:26,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-09 15:36:26,493 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:36:26,499 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:36:26,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-09 15:36:26,514 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-12-09 15:36:26,514 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-12-09 15:36:26,514 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-12-09 15:36:26,514 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-12-09 15:36:26,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-09 15:36:26,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-09 15:36:26,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-09 15:36:26,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-12-09 15:36:26,515 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-12-09 15:36:26,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-09 15:36:26,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-09 15:36:26,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-09 15:36:26,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-09 15:36:26,516 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:36:26,599 INFO L241 CfgBuilder]: Building ICFG [2023-12-09 15:36:26,601 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-09 15:36:26,759 INFO L282 CfgBuilder]: Performing block encoding [2023-12-09 15:36:26,799 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-09 15:36:26,799 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-09 15:36:26,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:36:26 BoogieIcfgContainer [2023-12-09 15:36:26,800 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-09 15:36:26,802 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-09 15:36:26,802 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-09 15:36:26,804 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-09 15:36:26,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:36:26" (1/3) ... [2023-12-09 15:36:26,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f8aae0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:36:26, skipping insertion in model container [2023-12-09 15:36:26,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:36:26" (2/3) ... [2023-12-09 15:36:26,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f8aae0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:36:26, skipping insertion in model container [2023-12-09 15:36:26,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:36:26" (3/3) ... [2023-12-09 15:36:26,806 INFO L112 eAbstractionObserver]: Analyzing ICFG test-easy6.wvr.c [2023-12-09 15:36:26,817 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-09 15:36:26,817 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-09 15:36:26,817 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-09 15:36:26,865 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-12-09 15:36:26,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 81 transitions, 176 flow [2023-12-09 15:36:26,956 INFO L124 PetriNetUnfolderBase]: 1/79 cut-off events. [2023-12-09 15:36:26,956 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-09 15:36:26,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88 conditions, 79 events. 1/79 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 35. Up to 2 conditions per place. [2023-12-09 15:36:26,960 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 81 transitions, 176 flow [2023-12-09 15:36:26,967 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 70 transitions, 152 flow [2023-12-09 15:36:26,978 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-09 15:36:26,984 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;@29db9726, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-09 15:36:26,984 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-09 15:36:27,005 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-09 15:36:27,006 INFO L124 PetriNetUnfolderBase]: 1/69 cut-off events. [2023-12-09 15:36:27,006 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-09 15:36:27,006 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:36:27,007 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] [2023-12-09 15:36:27,007 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:36:27,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:36:27,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1512615248, now seen corresponding path program 1 times [2023-12-09 15:36:27,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:36:27,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516841068] [2023-12-09 15:36:27,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:36:27,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:36:27,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:36:27,581 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:36:27,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:36:27,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516841068] [2023-12-09 15:36:27,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516841068] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:36:27,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:36:27,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-09 15:36:27,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146146252] [2023-12-09 15:36:27,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:36:27,592 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-09 15:36:27,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:36:27,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-09 15:36:27,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-09 15:36:27,621 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 81 [2023-12-09 15:36:27,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 70 transitions, 152 flow. Second operand has 9 states, 9 states have (on average 59.333333333333336) internal successors, (534), 9 states have internal predecessors, (534), 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:36:27,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:36:27,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 81 [2023-12-09 15:36:27,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:36:27,820 INFO L124 PetriNetUnfolderBase]: 22/207 cut-off events. [2023-12-09 15:36:27,820 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-12-09 15:36:27,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334 conditions, 207 events. 22/207 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 732 event pairs, 12 based on Foata normal form. 4/206 useless extension candidates. Maximal degree in co-relation 177. Up to 34 conditions per place. [2023-12-09 15:36:27,822 INFO L140 encePairwiseOnDemand]: 70/81 looper letters, 36 selfloop transitions, 7 changer transitions 15/105 dead transitions. [2023-12-09 15:36:27,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 105 transitions, 362 flow [2023-12-09 15:36:27,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-09 15:36:27,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-12-09 15:36:27,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 804 transitions. [2023-12-09 15:36:27,833 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7635327635327636 [2023-12-09 15:36:27,834 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 804 transitions. [2023-12-09 15:36:27,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 804 transitions. [2023-12-09 15:36:27,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:36:27,837 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 804 transitions. [2023-12-09 15:36:27,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 61.84615384615385) internal successors, (804), 13 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-09 15:36:27,845 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 81.0) internal successors, (1134), 14 states have internal predecessors, (1134), 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:36:27,846 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 81.0) internal successors, (1134), 14 states have internal predecessors, (1134), 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:36:27,848 INFO L308 CegarLoopForPetriNet]: 76 programPoint places, 12 predicate places. [2023-12-09 15:36:27,849 INFO L500 AbstractCegarLoop]: Abstraction has has 88 places, 105 transitions, 362 flow [2023-12-09 15:36:27,849 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 59.333333333333336) internal successors, (534), 9 states have internal predecessors, (534), 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:36:27,849 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:36:27,849 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] [2023-12-09 15:36:27,849 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-09 15:36:27,850 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:36:27,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:36:27,850 INFO L85 PathProgramCache]: Analyzing trace with hash -821315748, now seen corresponding path program 2 times [2023-12-09 15:36:27,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:36:27,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686951781] [2023-12-09 15:36:27,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:36:27,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:36:27,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:36:27,975 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:36:27,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:36:27,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686951781] [2023-12-09 15:36:27,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686951781] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:36:27,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:36:27,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-09 15:36:27,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365907579] [2023-12-09 15:36:27,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:36:27,977 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-09 15:36:27,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:36:27,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-09 15:36:27,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-09 15:36:27,980 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 81 [2023-12-09 15:36:27,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 105 transitions, 362 flow. Second operand has 7 states, 7 states have (on average 63.57142857142857) internal successors, (445), 7 states have internal predecessors, (445), 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:36:27,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:36:27,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 81 [2023-12-09 15:36:27,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:36:28,150 INFO L124 PetriNetUnfolderBase]: 95/493 cut-off events. [2023-12-09 15:36:28,151 INFO L125 PetriNetUnfolderBase]: For 285/285 co-relation queries the response was YES. [2023-12-09 15:36:28,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1001 conditions, 493 events. 95/493 cut-off events. For 285/285 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2827 event pairs, 12 based on Foata normal form. 5/486 useless extension candidates. Maximal degree in co-relation 752. Up to 83 conditions per place. [2023-12-09 15:36:28,156 INFO L140 encePairwiseOnDemand]: 72/81 looper letters, 48 selfloop transitions, 12 changer transitions 36/162 dead transitions. [2023-12-09 15:36:28,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 162 transitions, 793 flow [2023-12-09 15:36:28,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 15:36:28,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 15:36:28,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 602 transitions. [2023-12-09 15:36:28,159 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8257887517146777 [2023-12-09 15:36:28,159 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 602 transitions. [2023-12-09 15:36:28,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 602 transitions. [2023-12-09 15:36:28,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:36:28,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 602 transitions. [2023-12-09 15:36:28,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 66.88888888888889) internal successors, (602), 9 states have internal predecessors, (602), 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:36:28,162 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 81.0) internal successors, (810), 10 states have internal predecessors, (810), 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:36:28,162 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 81.0) internal successors, (810), 10 states have internal predecessors, (810), 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:36:28,163 INFO L308 CegarLoopForPetriNet]: 76 programPoint places, 20 predicate places. [2023-12-09 15:36:28,163 INFO L500 AbstractCegarLoop]: Abstraction has has 96 places, 162 transitions, 793 flow [2023-12-09 15:36:28,164 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 63.57142857142857) internal successors, (445), 7 states have internal predecessors, (445), 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:36:28,165 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:36:28,165 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] [2023-12-09 15:36:28,165 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-09 15:36:28,166 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:36:28,166 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:36:28,166 INFO L85 PathProgramCache]: Analyzing trace with hash -270337470, now seen corresponding path program 3 times [2023-12-09 15:36:28,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:36:28,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169665692] [2023-12-09 15:36:28,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:36:28,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:36:28,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:36:28,267 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:36:28,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:36:28,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169665692] [2023-12-09 15:36:28,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169665692] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:36:28,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:36:28,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:36:28,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060521798] [2023-12-09 15:36:28,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:36:28,270 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:36:28,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:36:28,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:36:28,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:36:28,272 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 81 [2023-12-09 15:36:28,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 162 transitions, 793 flow. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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:36:28,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:36:28,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 81 [2023-12-09 15:36:28,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:36:28,341 INFO L124 PetriNetUnfolderBase]: 95/496 cut-off events. [2023-12-09 15:36:28,341 INFO L125 PetriNetUnfolderBase]: For 544/546 co-relation queries the response was YES. [2023-12-09 15:36:28,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1143 conditions, 496 events. 95/496 cut-off events. For 544/546 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2807 event pairs, 20 based on Foata normal form. 8/492 useless extension candidates. Maximal degree in co-relation 707. Up to 125 conditions per place. [2023-12-09 15:36:28,344 INFO L140 encePairwiseOnDemand]: 78/81 looper letters, 39 selfloop transitions, 2 changer transitions 41/165 dead transitions. [2023-12-09 15:36:28,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 165 transitions, 955 flow [2023-12-09 15:36:28,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:36:28,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:36:28,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 218 transitions. [2023-12-09 15:36:28,346 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.897119341563786 [2023-12-09 15:36:28,346 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 218 transitions. [2023-12-09 15:36:28,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 218 transitions. [2023-12-09 15:36:28,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:36:28,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 218 transitions. [2023-12-09 15:36:28,347 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 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:36:28,348 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 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:36:28,348 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 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:36:28,349 INFO L308 CegarLoopForPetriNet]: 76 programPoint places, 22 predicate places. [2023-12-09 15:36:28,349 INFO L500 AbstractCegarLoop]: Abstraction has has 98 places, 165 transitions, 955 flow [2023-12-09 15:36:28,350 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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:36:28,350 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:36:28,350 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] [2023-12-09 15:36:28,350 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-09 15:36:28,350 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:36:28,351 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:36:28,351 INFO L85 PathProgramCache]: Analyzing trace with hash -1029432294, now seen corresponding path program 4 times [2023-12-09 15:36:28,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:36:28,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688506735] [2023-12-09 15:36:28,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:36:28,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:36:28,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:36:28,522 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:36:28,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:36:28,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688506735] [2023-12-09 15:36:28,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688506735] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:36:28,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:36:28,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-09 15:36:28,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784082367] [2023-12-09 15:36:28,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:36:28,524 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-09 15:36:28,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:36:28,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-09 15:36:28,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-09 15:36:28,526 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 81 [2023-12-09 15:36:28,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 165 transitions, 955 flow. Second operand has 8 states, 8 states have (on average 63.25) internal successors, (506), 8 states have internal predecessors, (506), 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:36:28,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:36:28,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 81 [2023-12-09 15:36:28,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:36:28,693 INFO L124 PetriNetUnfolderBase]: 101/633 cut-off events. [2023-12-09 15:36:28,694 INFO L125 PetriNetUnfolderBase]: For 1194/1225 co-relation queries the response was YES. [2023-12-09 15:36:28,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1711 conditions, 633 events. 101/633 cut-off events. For 1194/1225 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4198 event pairs, 15 based on Foata normal form. 19/637 useless extension candidates. Maximal degree in co-relation 981. Up to 158 conditions per place. [2023-12-09 15:36:28,696 INFO L140 encePairwiseOnDemand]: 71/81 looper letters, 59 selfloop transitions, 20 changer transitions 61/206 dead transitions. [2023-12-09 15:36:28,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 206 transitions, 1563 flow [2023-12-09 15:36:28,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-09 15:36:28,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-09 15:36:28,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 666 transitions. [2023-12-09 15:36:28,698 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8222222222222222 [2023-12-09 15:36:28,699 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 666 transitions. [2023-12-09 15:36:28,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 666 transitions. [2023-12-09 15:36:28,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:36:28,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 666 transitions. [2023-12-09 15:36:28,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 66.6) internal successors, (666), 10 states have internal predecessors, (666), 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:36:28,701 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 81.0) internal successors, (891), 11 states have internal predecessors, (891), 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:36:28,701 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 81.0) internal successors, (891), 11 states have internal predecessors, (891), 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:36:28,703 INFO L308 CegarLoopForPetriNet]: 76 programPoint places, 31 predicate places. [2023-12-09 15:36:28,703 INFO L500 AbstractCegarLoop]: Abstraction has has 107 places, 206 transitions, 1563 flow [2023-12-09 15:36:28,703 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 63.25) internal successors, (506), 8 states have internal predecessors, (506), 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:36:28,703 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:36:28,703 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] [2023-12-09 15:36:28,704 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-09 15:36:28,704 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:36:28,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:36:28,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1176043578, now seen corresponding path program 5 times [2023-12-09 15:36:28,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:36:28,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040473926] [2023-12-09 15:36:28,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:36:28,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:36:28,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:36:28,749 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:36:28,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:36:28,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040473926] [2023-12-09 15:36:28,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040473926] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:36:28,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:36:28,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-09 15:36:28,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657989418] [2023-12-09 15:36:28,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:36:28,751 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-09 15:36:28,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:36:28,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-09 15:36:28,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-09 15:36:28,752 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 81 [2023-12-09 15:36:28,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 206 transitions, 1563 flow. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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:36:28,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:36:28,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 81 [2023-12-09 15:36:28,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:36:28,818 INFO L124 PetriNetUnfolderBase]: 101/639 cut-off events. [2023-12-09 15:36:28,819 INFO L125 PetriNetUnfolderBase]: For 1779/1808 co-relation queries the response was YES. [2023-12-09 15:36:28,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1894 conditions, 639 events. 101/639 cut-off events. For 1779/1808 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4234 event pairs, 24 based on Foata normal form. 12/639 useless extension candidates. Maximal degree in co-relation 1306. Up to 160 conditions per place. [2023-12-09 15:36:28,821 INFO L140 encePairwiseOnDemand]: 78/81 looper letters, 54 selfloop transitions, 2 changer transitions 63/207 dead transitions. [2023-12-09 15:36:28,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 207 transitions, 1783 flow [2023-12-09 15:36:28,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-09 15:36:28,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-09 15:36:28,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 218 transitions. [2023-12-09 15:36:28,823 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.897119341563786 [2023-12-09 15:36:28,823 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 218 transitions. [2023-12-09 15:36:28,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 218 transitions. [2023-12-09 15:36:28,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:36:28,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 218 transitions. [2023-12-09 15:36:28,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 72.66666666666667) internal successors, (218), 3 states have internal predecessors, (218), 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:36:28,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 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:36:28,825 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 81.0) internal successors, (324), 4 states have internal predecessors, (324), 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:36:28,826 INFO L308 CegarLoopForPetriNet]: 76 programPoint places, 33 predicate places. [2023-12-09 15:36:28,826 INFO L500 AbstractCegarLoop]: Abstraction has has 109 places, 207 transitions, 1783 flow [2023-12-09 15:36:28,826 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 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:36:28,826 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:36:28,827 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] [2023-12-09 15:36:28,827 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-09 15:36:28,827 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:36:28,828 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:36:28,828 INFO L85 PathProgramCache]: Analyzing trace with hash 402561492, now seen corresponding path program 6 times [2023-12-09 15:36:28,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:36:28,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116740536] [2023-12-09 15:36:28,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:36:28,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:36:28,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:36:28,983 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:36:28,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:36:28,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116740536] [2023-12-09 15:36:28,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116740536] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:36:28,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:36:28,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-09 15:36:28,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63118570] [2023-12-09 15:36:28,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:36:28,985 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-09 15:36:28,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:36:28,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-09 15:36:28,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-09 15:36:28,987 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 81 [2023-12-09 15:36:28,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 207 transitions, 1783 flow. Second operand has 8 states, 8 states have (on average 63.25) internal successors, (506), 8 states have internal predecessors, (506), 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:36:28,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:36:28,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 81 [2023-12-09 15:36:28,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:36:29,136 INFO L124 PetriNetUnfolderBase]: 81/512 cut-off events. [2023-12-09 15:36:29,136 INFO L125 PetriNetUnfolderBase]: For 2033/2098 co-relation queries the response was YES. [2023-12-09 15:36:29,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1776 conditions, 512 events. 81/512 cut-off events. For 2033/2098 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3109 event pairs, 17 based on Foata normal form. 33/536 useless extension candidates. Maximal degree in co-relation 1204. Up to 137 conditions per place. [2023-12-09 15:36:29,138 INFO L140 encePairwiseOnDemand]: 71/81 looper letters, 40 selfloop transitions, 12 changer transitions 75/193 dead transitions. [2023-12-09 15:36:29,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 193 transitions, 1836 flow [2023-12-09 15:36:29,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-09 15:36:29,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-09 15:36:29,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 664 transitions. [2023-12-09 15:36:29,140 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8197530864197531 [2023-12-09 15:36:29,140 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 664 transitions. [2023-12-09 15:36:29,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 664 transitions. [2023-12-09 15:36:29,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:36:29,140 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 664 transitions. [2023-12-09 15:36:29,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 66.4) internal successors, (664), 10 states have internal predecessors, (664), 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:36:29,143 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 81.0) internal successors, (891), 11 states have internal predecessors, (891), 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:36:29,143 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 81.0) internal successors, (891), 11 states have internal predecessors, (891), 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:36:29,144 INFO L308 CegarLoopForPetriNet]: 76 programPoint places, 42 predicate places. [2023-12-09 15:36:29,145 INFO L500 AbstractCegarLoop]: Abstraction has has 118 places, 193 transitions, 1836 flow [2023-12-09 15:36:29,145 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 63.25) internal successors, (506), 8 states have internal predecessors, (506), 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:36:29,146 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:36:29,146 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] [2023-12-09 15:36:29,146 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-09 15:36:29,146 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:36:29,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:36:29,147 INFO L85 PathProgramCache]: Analyzing trace with hash 471855456, now seen corresponding path program 7 times [2023-12-09 15:36:29,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:36:29,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19451052] [2023-12-09 15:36:29,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:36:29,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:36:29,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:36:29,256 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:36:29,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:36:29,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19451052] [2023-12-09 15:36:29,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19451052] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:36:29,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:36:29,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-09 15:36:29,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42792287] [2023-12-09 15:36:29,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:36:29,259 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-09 15:36:29,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:36:29,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-09 15:36:29,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-09 15:36:29,261 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 81 [2023-12-09 15:36:29,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 193 transitions, 1836 flow. Second operand has 7 states, 7 states have (on average 63.57142857142857) internal successors, (445), 7 states have internal predecessors, (445), 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:36:29,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:36:29,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 81 [2023-12-09 15:36:29,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:36:29,370 INFO L124 PetriNetUnfolderBase]: 60/319 cut-off events. [2023-12-09 15:36:29,370 INFO L125 PetriNetUnfolderBase]: For 1675/1710 co-relation queries the response was YES. [2023-12-09 15:36:29,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1362 conditions, 319 events. 60/319 cut-off events. For 1675/1710 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1518 event pairs, 11 based on Foata normal form. 13/328 useless extension candidates. Maximal degree in co-relation 944. Up to 99 conditions per place. [2023-12-09 15:36:29,372 INFO L140 encePairwiseOnDemand]: 72/81 looper letters, 24 selfloop transitions, 12 changer transitions 66/152 dead transitions. [2023-12-09 15:36:29,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 152 transitions, 1551 flow [2023-12-09 15:36:29,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-09 15:36:29,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-12-09 15:36:29,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 596 transitions. [2023-12-09 15:36:29,374 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8175582990397805 [2023-12-09 15:36:29,374 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 596 transitions. [2023-12-09 15:36:29,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 596 transitions. [2023-12-09 15:36:29,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:36:29,374 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 596 transitions. [2023-12-09 15:36:29,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 66.22222222222223) internal successors, (596), 9 states have internal predecessors, (596), 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:36:29,377 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 81.0) internal successors, (810), 10 states have internal predecessors, (810), 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:36:29,377 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 81.0) internal successors, (810), 10 states have internal predecessors, (810), 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:36:29,378 INFO L308 CegarLoopForPetriNet]: 76 programPoint places, 48 predicate places. [2023-12-09 15:36:29,378 INFO L500 AbstractCegarLoop]: Abstraction has has 124 places, 152 transitions, 1551 flow [2023-12-09 15:36:29,378 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 63.57142857142857) internal successors, (445), 7 states have internal predecessors, (445), 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:36:29,378 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-09 15:36:29,378 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] [2023-12-09 15:36:29,378 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-09 15:36:29,379 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:36:29,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-09 15:36:29,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1766521302, now seen corresponding path program 8 times [2023-12-09 15:36:29,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-09 15:36:29,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108019741] [2023-12-09 15:36:29,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-09 15:36:29,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-09 15:36:29,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-09 15:36:29,497 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:36:29,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-09 15:36:29,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108019741] [2023-12-09 15:36:29,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108019741] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-09 15:36:29,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-09 15:36:29,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-09 15:36:29,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959411297] [2023-12-09 15:36:29,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-09 15:36:29,498 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-09 15:36:29,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-09 15:36:29,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-09 15:36:29,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-12-09 15:36:29,499 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 81 [2023-12-09 15:36:29,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 152 transitions, 1551 flow. Second operand has 9 states, 9 states have (on average 59.333333333333336) internal successors, (534), 9 states have internal predecessors, (534), 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:36:29,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-09 15:36:29,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 81 [2023-12-09 15:36:29,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-09 15:36:29,637 INFO L124 PetriNetUnfolderBase]: 60/296 cut-off events. [2023-12-09 15:36:29,637 INFO L125 PetriNetUnfolderBase]: For 2190/2224 co-relation queries the response was YES. [2023-12-09 15:36:29,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1462 conditions, 296 events. 60/296 cut-off events. For 2190/2224 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1432 event pairs, 9 based on Foata normal form. 4/297 useless extension candidates. Maximal degree in co-relation 1142. Up to 99 conditions per place. [2023-12-09 15:36:29,638 INFO L140 encePairwiseOnDemand]: 71/81 looper letters, 0 selfloop transitions, 0 changer transitions 148/148 dead transitions. [2023-12-09 15:36:29,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 148 transitions, 1697 flow [2023-12-09 15:36:29,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-09 15:36:29,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-12-09 15:36:29,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 663 transitions. [2023-12-09 15:36:29,640 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7441077441077442 [2023-12-09 15:36:29,640 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 663 transitions. [2023-12-09 15:36:29,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 663 transitions. [2023-12-09 15:36:29,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-09 15:36:29,641 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 663 transitions. [2023-12-09 15:36:29,642 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 60.27272727272727) internal successors, (663), 11 states have internal predecessors, (663), 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:36:29,643 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 81.0) internal successors, (972), 12 states have internal predecessors, (972), 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:36:29,643 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 81.0) internal successors, (972), 12 states have internal predecessors, (972), 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:36:29,645 INFO L308 CegarLoopForPetriNet]: 76 programPoint places, 54 predicate places. [2023-12-09 15:36:29,645 INFO L500 AbstractCegarLoop]: Abstraction has has 130 places, 148 transitions, 1697 flow [2023-12-09 15:36:29,645 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 59.333333333333336) internal successors, (534), 9 states have internal predecessors, (534), 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:36:29,651 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/test-easy6.wvr.c_BEv2_AllErrorsAtOnce [2023-12-09 15:36:29,685 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-12-09 15:36:29,686 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-12-09 15:36:29,686 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-12-09 15:36:29,686 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-09 15:36:29,686 INFO L457 BasicCegarLoop]: Path program histogram: [8] [2023-12-09 15:36:29,691 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-09 15:36:29,692 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-12-09 15:36:29,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 03:36:29 BasicIcfg [2023-12-09 15:36:29,700 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-09 15:36:29,700 INFO L158 Benchmark]: Toolchain (without parser) took 3503.31ms. Allocated memory was 299.9MB in the beginning and 360.7MB in the end (delta: 60.8MB). Free memory was 247.3MB in the beginning and 296.8MB in the end (delta: -49.5MB). Peak memory consumption was 12.7MB. Max. memory is 8.0GB. [2023-12-09 15:36:29,700 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 190.8MB. Free memory is still 142.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-09 15:36:29,701 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.23ms. Allocated memory is still 299.9MB. Free memory was 247.3MB in the beginning and 235.8MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-09 15:36:29,701 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.12ms. Allocated memory is still 299.9MB. Free memory was 235.8MB in the beginning and 234.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-09 15:36:29,701 INFO L158 Benchmark]: Boogie Preprocessor took 28.40ms. Allocated memory is still 299.9MB. Free memory was 234.1MB in the beginning and 232.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-09 15:36:29,701 INFO L158 Benchmark]: RCFGBuilder took 347.39ms. Allocated memory is still 299.9MB. Free memory was 232.7MB in the beginning and 216.3MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-09 15:36:29,702 INFO L158 Benchmark]: TraceAbstraction took 2897.96ms. Allocated memory was 299.9MB in the beginning and 360.7MB in the end (delta: 60.8MB). Free memory was 215.2MB in the beginning and 296.8MB in the end (delta: -81.6MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-09 15:36:29,703 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.09ms. Allocated memory is still 190.8MB. Free memory is still 142.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 199.23ms. Allocated memory is still 299.9MB. Free memory was 247.3MB in the beginning and 235.8MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.12ms. Allocated memory is still 299.9MB. Free memory was 235.8MB in the beginning and 234.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.40ms. Allocated memory is still 299.9MB. Free memory was 234.1MB in the beginning and 232.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 347.39ms. Allocated memory is still 299.9MB. Free memory was 232.7MB in the beginning and 216.3MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 2897.96ms. Allocated memory was 299.9MB in the beginning and 360.7MB in the end (delta: 60.8MB). Free memory was 215.2MB in the beginning and 296.8MB in the end (delta: -81.6MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 116]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 109 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: 2.8s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 318 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 318 mSDsluCounter, 260 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 183 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 806 IncrementalHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 77 mSDtfsCounter, 806 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1836occurred in iteration=6, InterpolantAutomatonStates: 68, 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.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 544 NumberOfCodeBlocks, 544 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 536 ConstructedInterpolants, 0 QuantifiedInterpolants, 1402 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-12-09 15:36:29,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...