/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -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 --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-ext/03_incdec.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 04:17:15,358 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 04:17:15,418 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-11-30 04:17:15,445 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 04:17:15,445 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 04:17:15,446 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 04:17:15,446 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 04:17:15,446 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 04:17:15,447 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 04:17:15,450 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 04:17:15,451 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 04:17:15,451 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 04:17:15,451 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 04:17:15,452 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 04:17:15,452 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 04:17:15,453 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 04:17:15,453 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 04:17:15,453 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 04:17:15,453 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 04:17:15,453 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 04:17:15,454 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 04:17:15,454 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 04:17:15,455 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 04:17:15,455 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 04:17:15,455 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 04:17:15,456 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:17:15,456 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 04:17:15,457 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 04:17:15,457 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 04:17:15,457 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 04:17:15,458 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 04:17:15,458 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 04:17:15,458 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 04:17:15,458 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-11-30 04:17:15,648 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 04:17:15,661 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 04:17:15,663 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 04:17:15,664 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 04:17:15,664 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 04:17:15,665 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/03_incdec.i [2023-11-30 04:17:16,705 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 04:17:16,889 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 04:17:16,889 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/03_incdec.i [2023-11-30 04:17:16,903 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/091a5206b/fe98529cd3ff4f5eb13ab41385beda97/FLAGf3d94cf45 [2023-11-30 04:17:16,913 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/091a5206b/fe98529cd3ff4f5eb13ab41385beda97 [2023-11-30 04:17:16,914 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 04:17:16,915 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 04:17:16,916 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 04:17:16,916 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 04:17:16,919 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 04:17:16,919 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:17:16" (1/1) ... [2023-11-30 04:17:16,920 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@645fde46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:17:16, skipping insertion in model container [2023-11-30 04:17:16,920 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 04:17:16" (1/1) ... [2023-11-30 04:17:16,962 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 04:17:17,206 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:17:17,216 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 04:17:17,249 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 04:17:17,275 INFO L206 MainTranslator]: Completed translation [2023-11-30 04:17:17,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:17:17 WrapperNode [2023-11-30 04:17:17,276 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 04:17:17,277 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 04:17:17,277 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 04:17:17,277 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 04:17:17,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:17:17" (1/1) ... [2023-11-30 04:17:17,299 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:17:17" (1/1) ... [2023-11-30 04:17:17,315 INFO L138 Inliner]: procedures = 172, calls = 26, calls flagged for inlining = 18, calls inlined = 26, statements flattened = 139 [2023-11-30 04:17:17,315 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 04:17:17,316 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 04:17:17,316 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 04:17:17,316 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 04:17:17,321 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:17:17" (1/1) ... [2023-11-30 04:17:17,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:17:17" (1/1) ... [2023-11-30 04:17:17,322 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:17:17" (1/1) ... [2023-11-30 04:17:17,322 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:17:17" (1/1) ... [2023-11-30 04:17:17,326 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:17:17" (1/1) ... [2023-11-30 04:17:17,327 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:17:17" (1/1) ... [2023-11-30 04:17:17,328 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:17:17" (1/1) ... [2023-11-30 04:17:17,329 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:17:17" (1/1) ... [2023-11-30 04:17:17,331 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 04:17:17,331 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 04:17:17,332 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 04:17:17,332 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 04:17:17,332 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:17:17" (1/1) ... [2023-11-30 04:17:17,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 04:17:17,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 04:17:17,364 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-11-30 04:17:17,372 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-11-30 04:17:17,391 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-11-30 04:17:17,392 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-11-30 04:17:17,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 04:17:17,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 04:17:17,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 04:17:17,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 04:17:17,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 04:17:17,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 04:17:17,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 04:17:17,394 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-30 04:17:17,467 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 04:17:17,469 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 04:17:17,629 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 04:17:17,701 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 04:17:17,701 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-30 04:17:17,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:17:17 BoogieIcfgContainer [2023-11-30 04:17:17,702 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 04:17:17,704 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 04:17:17,704 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 04:17:17,706 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 04:17:17,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 04:17:16" (1/3) ... [2023-11-30 04:17:17,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75435e69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:17:17, skipping insertion in model container [2023-11-30 04:17:17,706 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 04:17:17" (2/3) ... [2023-11-30 04:17:17,706 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75435e69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 04:17:17, skipping insertion in model container [2023-11-30 04:17:17,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 04:17:17" (3/3) ... [2023-11-30 04:17:17,707 INFO L112 eAbstractionObserver]: Analyzing ICFG 03_incdec.i [2023-11-30 04:17:17,719 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 04:17:17,720 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-30 04:17:17,720 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 04:17:17,756 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:17:17,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 88 places, 93 transitions, 190 flow [2023-11-30 04:17:17,825 INFO L124 PetriNetUnfolderBase]: 9/106 cut-off events. [2023-11-30 04:17:17,825 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:17:17,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 106 events. 9/106 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 224 event pairs, 0 based on Foata normal form. 0/91 useless extension candidates. Maximal degree in co-relation 78. Up to 4 conditions per place. [2023-11-30 04:17:17,829 INFO L82 GeneralOperation]: Start removeDead. Operand has 88 places, 93 transitions, 190 flow [2023-11-30 04:17:17,838 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 88 places, 93 transitions, 190 flow [2023-11-30 04:17:17,844 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:17:17,848 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;@dc12f26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:17:17,848 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:17:17,852 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:17:17,852 INFO L124 PetriNetUnfolderBase]: 1/22 cut-off events. [2023-11-30 04:17:17,852 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:17:17,852 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:17:17,852 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:17:17,853 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:17:17,855 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:17:17,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1081570145, now seen corresponding path program 1 times [2023-11-30 04:17:17,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:17:17,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961978783] [2023-11-30 04:17:17,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:17:17,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:17:17,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:17:18,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:17:18,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:17:18,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961978783] [2023-11-30 04:17:18,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961978783] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:17:18,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:17:18,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:17:18,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500279798] [2023-11-30 04:17:18,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:17:18,074 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:17:18,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:17:18,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:17:18,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:17:18,099 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 93 [2023-11-30 04:17:18,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 93 transitions, 190 flow. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 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-11-30 04:17:18,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:17:18,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 93 [2023-11-30 04:17:18,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:17:18,179 INFO L124 PetriNetUnfolderBase]: 25/162 cut-off events. [2023-11-30 04:17:18,180 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:17:18,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 162 events. 25/162 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 620 event pairs, 20 based on Foata normal form. 24/161 useless extension candidates. Maximal degree in co-relation 188. Up to 56 conditions per place. [2023-11-30 04:17:18,183 INFO L140 encePairwiseOnDemand]: 85/93 looper letters, 17 selfloop transitions, 1 changer transitions 0/75 dead transitions. [2023-11-30 04:17:18,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 75 transitions, 190 flow [2023-11-30 04:17:18,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:17:18,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:17:18,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 214 transitions. [2023-11-30 04:17:18,193 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7670250896057348 [2023-11-30 04:17:18,193 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 214 transitions. [2023-11-30 04:17:18,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 214 transitions. [2023-11-30 04:17:18,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:17:18,196 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 214 transitions. [2023-11-30 04:17:18,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 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-11-30 04:17:18,204 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 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-11-30 04:17:18,204 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 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-11-30 04:17:18,208 INFO L307 CegarLoopForPetriNet]: 88 programPoint places, -11 predicate places. [2023-11-30 04:17:18,208 INFO L500 AbstractCegarLoop]: Abstraction has has 77 places, 75 transitions, 190 flow [2023-11-30 04:17:18,208 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 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-11-30 04:17:18,208 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:17:18,208 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:17:18,209 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 04:17:18,209 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:17:18,210 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:17:18,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1081570144, now seen corresponding path program 1 times [2023-11-30 04:17:18,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:17:18,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027950295] [2023-11-30 04:17:18,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:17:18,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:17:18,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:17:18,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:17:18,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:17:18,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027950295] [2023-11-30 04:17:18,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027950295] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:17:18,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:17:18,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:17:18,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637006372] [2023-11-30 04:17:18,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:17:18,341 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:17:18,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:17:18,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:17:18,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:17:18,343 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 93 [2023-11-30 04:17:18,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 75 transitions, 190 flow. Second operand has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 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-11-30 04:17:18,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:17:18,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 93 [2023-11-30 04:17:18,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:17:18,385 INFO L124 PetriNetUnfolderBase]: 14/122 cut-off events. [2023-11-30 04:17:18,386 INFO L125 PetriNetUnfolderBase]: For 17/21 co-relation queries the response was YES. [2023-11-30 04:17:18,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 122 events. 14/122 cut-off events. For 17/21 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 352 event pairs, 10 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 159. Up to 34 conditions per place. [2023-11-30 04:17:18,387 INFO L140 encePairwiseOnDemand]: 91/93 looper letters, 15 selfloop transitions, 1 changer transitions 0/74 dead transitions. [2023-11-30 04:17:18,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 74 transitions, 218 flow [2023-11-30 04:17:18,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:17:18,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:17:18,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 209 transitions. [2023-11-30 04:17:18,391 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7491039426523297 [2023-11-30 04:17:18,391 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 209 transitions. [2023-11-30 04:17:18,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 209 transitions. [2023-11-30 04:17:18,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:17:18,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 209 transitions. [2023-11-30 04:17:18,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 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-11-30 04:17:18,393 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 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-11-30 04:17:18,393 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 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-11-30 04:17:18,394 INFO L307 CegarLoopForPetriNet]: 88 programPoint places, -10 predicate places. [2023-11-30 04:17:18,394 INFO L500 AbstractCegarLoop]: Abstraction has has 78 places, 74 transitions, 218 flow [2023-11-30 04:17:18,394 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 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-11-30 04:17:18,394 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:17:18,394 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:17:18,394 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 04:17:18,395 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:17:18,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:17:18,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1023535747, now seen corresponding path program 1 times [2023-11-30 04:17:18,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:17:18,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137394280] [2023-11-30 04:17:18,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:17:18,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:17:18,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:17:18,416 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:17:18,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:17:18,447 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:17:18,448 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:17:18,448 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:17:18,450 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:17:18,450 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:17:18,451 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 04:17:18,451 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:17:18,453 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:17:18,453 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-11-30 04:17:18,506 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:17:18,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 157 transitions, 324 flow [2023-11-30 04:17:18,531 INFO L124 PetriNetUnfolderBase]: 17/185 cut-off events. [2023-11-30 04:17:18,532 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-30 04:17:18,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193 conditions, 185 events. 17/185 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 618 event pairs, 0 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 141. Up to 6 conditions per place. [2023-11-30 04:17:18,537 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 157 transitions, 324 flow [2023-11-30 04:17:18,540 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 157 transitions, 324 flow [2023-11-30 04:17:18,541 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:17:18,545 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;@dc12f26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:17:18,545 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:17:18,548 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:17:18,548 INFO L124 PetriNetUnfolderBase]: 1/21 cut-off events. [2023-11-30 04:17:18,548 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:17:18,551 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:17:18,551 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:17:18,552 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:17:18,552 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:17:18,552 INFO L85 PathProgramCache]: Analyzing trace with hash 2004021308, now seen corresponding path program 1 times [2023-11-30 04:17:18,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:17:18,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544728187] [2023-11-30 04:17:18,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:17:18,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:17:18,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:17:18,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:17:18,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:17:18,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544728187] [2023-11-30 04:17:18,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544728187] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:17:18,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:17:18,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:17:18,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884157747] [2023-11-30 04:17:18,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:17:18,612 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:17:18,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:17:18,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:17:18,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:17:18,613 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 157 [2023-11-30 04:17:18,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 157 transitions, 324 flow. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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-11-30 04:17:18,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:17:18,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 157 [2023-11-30 04:17:18,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:17:18,863 INFO L124 PetriNetUnfolderBase]: 643/2299 cut-off events. [2023-11-30 04:17:18,863 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2023-11-30 04:17:18,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3311 conditions, 2299 events. 643/2299 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 21327 event pairs, 570 based on Foata normal form. 383/2337 useless extension candidates. Maximal degree in co-relation 846. Up to 969 conditions per place. [2023-11-30 04:17:18,877 INFO L140 encePairwiseOnDemand]: 145/157 looper letters, 28 selfloop transitions, 1 changer transitions 0/129 dead transitions. [2023-11-30 04:17:18,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 129 transitions, 326 flow [2023-11-30 04:17:18,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:17:18,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:17:18,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2023-11-30 04:17:18,879 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7855626326963907 [2023-11-30 04:17:18,879 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 370 transitions. [2023-11-30 04:17:18,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions. [2023-11-30 04:17:18,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:17:18,879 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions. [2023-11-30 04:17:18,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 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-11-30 04:17:18,882 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 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-11-30 04:17:18,882 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 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-11-30 04:17:18,884 INFO L307 CegarLoopForPetriNet]: 147 programPoint places, -17 predicate places. [2023-11-30 04:17:18,884 INFO L500 AbstractCegarLoop]: Abstraction has has 130 places, 129 transitions, 326 flow [2023-11-30 04:17:18,884 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 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-11-30 04:17:18,884 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:17:18,884 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:17:18,884 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 04:17:18,885 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:17:18,885 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:17:18,886 INFO L85 PathProgramCache]: Analyzing trace with hash 2004021309, now seen corresponding path program 1 times [2023-11-30 04:17:18,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:17:18,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458758504] [2023-11-30 04:17:18,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:17:18,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:17:18,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:17:18,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:17:18,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:17:18,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458758504] [2023-11-30 04:17:18,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458758504] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:17:18,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:17:18,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:17:18,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954937710] [2023-11-30 04:17:18,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:17:18,948 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:17:18,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:17:18,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:17:18,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:17:18,950 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 157 [2023-11-30 04:17:18,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 129 transitions, 326 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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-11-30 04:17:18,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:17:18,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 157 [2023-11-30 04:17:18,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:17:19,102 INFO L124 PetriNetUnfolderBase]: 394/1594 cut-off events. [2023-11-30 04:17:19,102 INFO L125 PetriNetUnfolderBase]: For 254/450 co-relation queries the response was YES. [2023-11-30 04:17:19,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2853 conditions, 1594 events. 394/1594 cut-off events. For 254/450 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 13732 event pairs, 340 based on Foata normal form. 0/1444 useless extension candidates. Maximal degree in co-relation 689. Up to 606 conditions per place. [2023-11-30 04:17:19,113 INFO L140 encePairwiseOnDemand]: 155/157 looper letters, 26 selfloop transitions, 1 changer transitions 0/128 dead transitions. [2023-11-30 04:17:19,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 128 transitions, 376 flow [2023-11-30 04:17:19,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:17:19,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:17:19,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2023-11-30 04:17:19,114 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7664543524416136 [2023-11-30 04:17:19,114 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 361 transitions. [2023-11-30 04:17:19,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 361 transitions. [2023-11-30 04:17:19,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:17:19,115 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 361 transitions. [2023-11-30 04:17:19,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 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-11-30 04:17:19,146 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 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-11-30 04:17:19,146 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 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-11-30 04:17:19,146 INFO L307 CegarLoopForPetriNet]: 147 programPoint places, -16 predicate places. [2023-11-30 04:17:19,147 INFO L500 AbstractCegarLoop]: Abstraction has has 131 places, 128 transitions, 376 flow [2023-11-30 04:17:19,147 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 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-11-30 04:17:19,147 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:17:19,147 INFO L232 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:17:19,147 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 04:17:19,147 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:17:19,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:17:19,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1531988794, now seen corresponding path program 1 times [2023-11-30 04:17:19,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:17:19,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292093000] [2023-11-30 04:17:19,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:17:19,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:17:19,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:17:19,159 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:17:19,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:17:19,172 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:17:19,172 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:17:19,172 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:17:19,173 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:17:19,176 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:17:19,176 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 04:17:19,176 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:17:19,176 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:17:19,176 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-11-30 04:17:19,207 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:17:19,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 206 places, 221 transitions, 460 flow [2023-11-30 04:17:19,227 INFO L124 PetriNetUnfolderBase]: 25/264 cut-off events. [2023-11-30 04:17:19,227 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-30 04:17:19,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 264 events. 25/264 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1023 event pairs, 0 based on Foata normal form. 0/227 useless extension candidates. Maximal degree in co-relation 204. Up to 8 conditions per place. [2023-11-30 04:17:19,229 INFO L82 GeneralOperation]: Start removeDead. Operand has 206 places, 221 transitions, 460 flow [2023-11-30 04:17:19,230 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 206 places, 221 transitions, 460 flow [2023-11-30 04:17:19,231 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:17:19,232 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;@dc12f26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:17:19,232 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:17:19,233 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:17:19,233 INFO L124 PetriNetUnfolderBase]: 1/21 cut-off events. [2023-11-30 04:17:19,234 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:17:19,234 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:17:19,234 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:17:19,234 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:17:19,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:17:19,234 INFO L85 PathProgramCache]: Analyzing trace with hash 958207001, now seen corresponding path program 1 times [2023-11-30 04:17:19,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:17:19,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856035868] [2023-11-30 04:17:19,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:17:19,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:17:19,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:17:19,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:17:19,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:17:19,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856035868] [2023-11-30 04:17:19,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856035868] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:17:19,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:17:19,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:17:19,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723758442] [2023-11-30 04:17:19,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:17:19,265 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:17:19,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:17:19,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:17:19,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:17:19,266 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 221 [2023-11-30 04:17:19,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 221 transitions, 460 flow. Second operand has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 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-11-30 04:17:19,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:17:19,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 221 [2023-11-30 04:17:19,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:17:22,058 INFO L124 PetriNetUnfolderBase]: 11162/31074 cut-off events. [2023-11-30 04:17:22,058 INFO L125 PetriNetUnfolderBase]: For 1627/1627 co-relation queries the response was YES. [2023-11-30 04:17:22,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46244 conditions, 31074 events. 11162/31074 cut-off events. For 1627/1627 co-relation queries the response was YES. Maximal size of possible extension queue 1733. Compared 403911 event pairs, 10250 based on Foata normal form. 5418/32329 useless extension candidates. Maximal degree in co-relation 3303. Up to 14642 conditions per place. [2023-11-30 04:17:22,272 INFO L140 encePairwiseOnDemand]: 205/221 looper letters, 39 selfloop transitions, 1 changer transitions 0/183 dead transitions. [2023-11-30 04:17:22,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 183 transitions, 464 flow [2023-11-30 04:17:22,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:17:22,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:17:22,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 526 transitions. [2023-11-30 04:17:22,274 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7933634992458521 [2023-11-30 04:17:22,274 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 526 transitions. [2023-11-30 04:17:22,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 526 transitions. [2023-11-30 04:17:22,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:17:22,274 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 526 transitions. [2023-11-30 04:17:22,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 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-11-30 04:17:22,276 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 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-11-30 04:17:22,277 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 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-11-30 04:17:22,277 INFO L307 CegarLoopForPetriNet]: 206 programPoint places, -23 predicate places. [2023-11-30 04:17:22,277 INFO L500 AbstractCegarLoop]: Abstraction has has 183 places, 183 transitions, 464 flow [2023-11-30 04:17:22,277 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 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-11-30 04:17:22,277 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:17:22,277 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:17:22,278 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 04:17:22,278 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:17:22,278 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:17:22,278 INFO L85 PathProgramCache]: Analyzing trace with hash 958207002, now seen corresponding path program 1 times [2023-11-30 04:17:22,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:17:22,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595146348] [2023-11-30 04:17:22,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:17:22,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:17:22,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:17:22,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:17:22,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:17:22,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595146348] [2023-11-30 04:17:22,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595146348] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:17:22,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:17:22,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:17:22,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131488543] [2023-11-30 04:17:22,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:17:22,305 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:17:22,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:17:22,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:17:22,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:17:22,306 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 221 [2023-11-30 04:17:22,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 183 transitions, 464 flow. Second operand has 3 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 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-11-30 04:17:22,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:17:22,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 221 [2023-11-30 04:17:22,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:17:24,138 INFO L124 PetriNetUnfolderBase]: 7036/20962 cut-off events. [2023-11-30 04:17:24,139 INFO L125 PetriNetUnfolderBase]: For 3784/8264 co-relation queries the response was YES. [2023-11-30 04:17:24,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40130 conditions, 20962 events. 7036/20962 cut-off events. For 3784/8264 co-relation queries the response was YES. Maximal size of possible extension queue 1127. Compared 263171 event pairs, 6390 based on Foata normal form. 0/19037 useless extension candidates. Maximal degree in co-relation 2840. Up to 9318 conditions per place. [2023-11-30 04:17:24,268 INFO L140 encePairwiseOnDemand]: 219/221 looper letters, 37 selfloop transitions, 1 changer transitions 0/182 dead transitions. [2023-11-30 04:17:24,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 182 transitions, 536 flow [2023-11-30 04:17:24,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:17:24,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:17:24,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 513 transitions. [2023-11-30 04:17:24,270 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7737556561085973 [2023-11-30 04:17:24,271 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 513 transitions. [2023-11-30 04:17:24,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 513 transitions. [2023-11-30 04:17:24,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:17:24,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 513 transitions. [2023-11-30 04:17:24,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 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-11-30 04:17:24,273 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 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-11-30 04:17:24,273 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 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-11-30 04:17:24,274 INFO L307 CegarLoopForPetriNet]: 206 programPoint places, -22 predicate places. [2023-11-30 04:17:24,274 INFO L500 AbstractCegarLoop]: Abstraction has has 184 places, 182 transitions, 536 flow [2023-11-30 04:17:24,275 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 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-11-30 04:17:24,275 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:17:24,275 INFO L232 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:17:24,276 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 04:17:24,276 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:17:24,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:17:24,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1241541404, now seen corresponding path program 1 times [2023-11-30 04:17:24,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:17:24,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854013636] [2023-11-30 04:17:24,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:17:24,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:17:24,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:17:24,291 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:17:24,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:17:24,303 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:17:24,304 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:17:24,304 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:17:24,304 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:17:24,304 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:17:24,304 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 04:17:24,304 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:17:24,305 WARN L227 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:17:24,305 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-11-30 04:17:24,338 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:17:24,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 265 places, 285 transitions, 598 flow [2023-11-30 04:17:24,371 INFO L124 PetriNetUnfolderBase]: 33/343 cut-off events. [2023-11-30 04:17:24,371 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-30 04:17:24,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 362 conditions, 343 events. 33/343 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1444 event pairs, 0 based on Foata normal form. 0/295 useless extension candidates. Maximal degree in co-relation 272. Up to 10 conditions per place. [2023-11-30 04:17:24,375 INFO L82 GeneralOperation]: Start removeDead. Operand has 265 places, 285 transitions, 598 flow [2023-11-30 04:17:24,377 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 265 places, 285 transitions, 598 flow [2023-11-30 04:17:24,377 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:17:24,378 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;@dc12f26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:17:24,378 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:17:24,379 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:17:24,379 INFO L124 PetriNetUnfolderBase]: 1/21 cut-off events. [2023-11-30 04:17:24,379 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:17:24,379 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:17:24,379 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:17:24,379 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:17:24,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:17:24,380 INFO L85 PathProgramCache]: Analyzing trace with hash 75954230, now seen corresponding path program 1 times [2023-11-30 04:17:24,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:17:24,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430985263] [2023-11-30 04:17:24,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:17:24,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:17:24,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:17:24,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:17:24,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:17:24,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430985263] [2023-11-30 04:17:24,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430985263] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:17:24,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:17:24,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:17:24,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112676734] [2023-11-30 04:17:24,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:17:24,401 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:17:24,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:17:24,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:17:24,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:17:24,403 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 285 [2023-11-30 04:17:24,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 285 transitions, 598 flow. Second operand has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 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-11-30 04:17:24,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:17:24,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 285 [2023-11-30 04:17:24,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:18:03,346 INFO L124 PetriNetUnfolderBase]: 166801/387725 cut-off events. [2023-11-30 04:18:03,346 INFO L125 PetriNetUnfolderBase]: For 35174/35174 co-relation queries the response was YES. [2023-11-30 04:18:06,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 599884 conditions, 387725 events. 166801/387725 cut-off events. For 35174/35174 co-relation queries the response was YES. Maximal size of possible extension queue 17896. Compared 6048528 event pairs, 156660 based on Foata normal form. 76523/418123 useless extension candidates. Maximal degree in co-relation 46356. Up to 204975 conditions per place. [2023-11-30 04:18:08,405 INFO L140 encePairwiseOnDemand]: 265/285 looper letters, 50 selfloop transitions, 1 changer transitions 0/237 dead transitions. [2023-11-30 04:18:08,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 237 transitions, 604 flow [2023-11-30 04:18:08,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:18:08,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:18:08,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 682 transitions. [2023-11-30 04:18:08,407 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7976608187134503 [2023-11-30 04:18:08,407 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 682 transitions. [2023-11-30 04:18:08,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 682 transitions. [2023-11-30 04:18:08,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:18:08,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 682 transitions. [2023-11-30 04:18:08,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 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-11-30 04:18:08,409 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 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-11-30 04:18:08,409 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 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-11-30 04:18:08,410 INFO L307 CegarLoopForPetriNet]: 265 programPoint places, -29 predicate places. [2023-11-30 04:18:08,410 INFO L500 AbstractCegarLoop]: Abstraction has has 236 places, 237 transitions, 604 flow [2023-11-30 04:18:08,410 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 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-11-30 04:18:08,410 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:18:08,410 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:18:08,410 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-30 04:18:08,410 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:18:08,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:18:08,411 INFO L85 PathProgramCache]: Analyzing trace with hash 75954231, now seen corresponding path program 1 times [2023-11-30 04:18:08,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:18:08,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540413708] [2023-11-30 04:18:08,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:18:08,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:18:08,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:18:08,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:18:08,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:18:08,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540413708] [2023-11-30 04:18:08,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540413708] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:18:08,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:18:08,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:18:08,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522156498] [2023-11-30 04:18:08,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:18:08,434 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:18:08,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:18:08,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:18:08,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:18:08,435 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 285 [2023-11-30 04:18:08,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 237 transitions, 604 flow. Second operand has 3 states, 3 states have (on average 206.66666666666666) internal successors, (620), 3 states have internal predecessors, (620), 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-11-30 04:18:08,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:18:08,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 285 [2023-11-30 04:18:08,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 04:18:35,138 INFO L124 PetriNetUnfolderBase]: 106718/260826 cut-off events. [2023-11-30 04:18:35,138 INFO L125 PetriNetUnfolderBase]: For 58976/111292 co-relation queries the response was YES. [2023-11-30 04:18:37,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 531554 conditions, 260826 events. 106718/260826 cut-off events. For 58976/111292 co-relation queries the response was YES. Maximal size of possible extension queue 11802. Compared 4026006 event pairs, 99560 based on Foata normal form. 0/239412 useless extension candidates. Maximal degree in co-relation 40237. Up to 131770 conditions per place. [2023-11-30 04:18:38,919 INFO L140 encePairwiseOnDemand]: 283/285 looper letters, 48 selfloop transitions, 1 changer transitions 0/236 dead transitions. [2023-11-30 04:18:38,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 236 transitions, 698 flow [2023-11-30 04:18:38,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 04:18:38,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 04:18:38,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 665 transitions. [2023-11-30 04:18:38,923 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7777777777777778 [2023-11-30 04:18:38,923 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 665 transitions. [2023-11-30 04:18:38,923 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 665 transitions. [2023-11-30 04:18:38,923 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 04:18:38,923 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 665 transitions. [2023-11-30 04:18:38,924 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 221.66666666666666) internal successors, (665), 3 states have internal predecessors, (665), 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-11-30 04:18:38,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 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-11-30 04:18:38,926 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 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-11-30 04:18:38,926 INFO L307 CegarLoopForPetriNet]: 265 programPoint places, -28 predicate places. [2023-11-30 04:18:38,926 INFO L500 AbstractCegarLoop]: Abstraction has has 237 places, 236 transitions, 698 flow [2023-11-30 04:18:38,926 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.66666666666666) internal successors, (620), 3 states have internal predecessors, (620), 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-11-30 04:18:38,926 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:18:38,927 INFO L232 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:18:38,927 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-30 04:18:38,927 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:18:38,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:18:38,927 INFO L85 PathProgramCache]: Analyzing trace with hash 309139011, now seen corresponding path program 1 times [2023-11-30 04:18:38,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:18:38,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707578993] [2023-11-30 04:18:38,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:18:38,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:18:38,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:18:38,967 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-30 04:18:38,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-30 04:18:38,974 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-30 04:18:38,974 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-11-30 04:18:38,974 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-11-30 04:18:38,974 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-11-30 04:18:38,974 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-11-30 04:18:38,975 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-30 04:18:38,975 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-11-30 04:18:38,975 WARN L227 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2023-11-30 04:18:38,975 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2023-11-30 04:18:39,018 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 04:18:39,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 324 places, 349 transitions, 738 flow [2023-11-30 04:18:39,057 INFO L124 PetriNetUnfolderBase]: 41/422 cut-off events. [2023-11-30 04:18:39,057 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-11-30 04:18:39,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 448 conditions, 422 events. 41/422 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1864 event pairs, 0 based on Foata normal form. 0/363 useless extension candidates. Maximal degree in co-relation 356. Up to 12 conditions per place. [2023-11-30 04:18:39,062 INFO L82 GeneralOperation]: Start removeDead. Operand has 324 places, 349 transitions, 738 flow [2023-11-30 04:18:39,064 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 324 places, 349 transitions, 738 flow [2023-11-30 04:18:39,065 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 04:18:39,068 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;@dc12f26, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 04:18:39,068 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-30 04:18:39,070 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 04:18:39,070 INFO L124 PetriNetUnfolderBase]: 1/21 cut-off events. [2023-11-30 04:18:39,070 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 04:18:39,070 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 04:18:39,070 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 04:18:39,070 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-30 04:18:39,070 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 04:18:39,070 INFO L85 PathProgramCache]: Analyzing trace with hash -642737005, now seen corresponding path program 1 times [2023-11-30 04:18:39,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 04:18:39,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512727820] [2023-11-30 04:18:39,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 04:18:39,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 04:18:39,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 04:18:39,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 04:18:39,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 04:18:39,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512727820] [2023-11-30 04:18:39,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512727820] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 04:18:39,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 04:18:39,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 04:18:39,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801625937] [2023-11-30 04:18:39,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 04:18:39,092 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 04:18:39,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 04:18:39,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 04:18:39,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 04:18:39,093 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 251 out of 349 [2023-11-30 04:18:39,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 349 transitions, 738 flow. Second operand has 3 states, 3 states have (on average 253.0) internal successors, (759), 3 states have internal predecessors, (759), 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-11-30 04:18:39,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 04:18:39,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 251 of 349 [2023-11-30 04:18:39,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand