/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --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/43_NetBSD_sysmon_power_sliced.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:05:50,777 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:05:50,846 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-12-05 21:05:50,878 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:05:50,879 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:05:50,879 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:05:50,879 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:05:50,880 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:05:50,880 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:05:50,883 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:05:50,883 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:05:50,884 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:05:50,884 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:05:50,885 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:05:50,885 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:05:50,885 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:05:50,885 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:05:50,885 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:05:50,885 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:05:50,885 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:05:50,886 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:05:50,886 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:05:50,886 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:05:50,887 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:05:50,887 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:05:50,888 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:05:50,888 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:05:50,888 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:05:50,888 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:05:50,888 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:05:50,889 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:05:50,889 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:05:50,889 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:05:50,889 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-12-05 21:05:51,082 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:05:51,100 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:05:51,102 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:05:51,103 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:05:51,103 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:05:51,104 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i [2023-12-05 21:05:52,189 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:05:52,381 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:05:52,382 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/43_NetBSD_sysmon_power_sliced.i [2023-12-05 21:05:52,392 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aca763940/e6c3cec3c4914d069a06d82d92c74150/FLAG037294ff1 [2023-12-05 21:05:52,407 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aca763940/e6c3cec3c4914d069a06d82d92c74150 [2023-12-05 21:05:52,409 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:05:52,410 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:05:52,410 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:05:52,411 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:05:52,414 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:05:52,414 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:05:52" (1/1) ... [2023-12-05 21:05:52,415 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a4ea7a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:05:52, skipping insertion in model container [2023-12-05 21:05:52,415 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:05:52" (1/1) ... [2023-12-05 21:05:52,472 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:05:52,776 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:05:52,786 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:05:52,845 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:05:52,875 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:05:52,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:05:52 WrapperNode [2023-12-05 21:05:52,875 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:05:52,877 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:05:52,877 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:05:52,877 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:05:52,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:05:52" (1/1) ... [2023-12-05 21:05:52,898 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:05:52" (1/1) ... [2023-12-05 21:05:52,941 INFO L138 Inliner]: procedures = 181, calls = 62, calls flagged for inlining = 54, calls inlined = 79, statements flattened = 491 [2023-12-05 21:05:52,941 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:05:52,942 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:05:52,942 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:05:52,942 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:05:52,951 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:05:52" (1/1) ... [2023-12-05 21:05:52,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:05:52" (1/1) ... [2023-12-05 21:05:52,964 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:05:52" (1/1) ... [2023-12-05 21:05:52,964 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:05:52" (1/1) ... [2023-12-05 21:05:52,972 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:05:52" (1/1) ... [2023-12-05 21:05:52,977 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:05:52" (1/1) ... [2023-12-05 21:05:52,979 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:05:52" (1/1) ... [2023-12-05 21:05:52,981 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:05:52" (1/1) ... [2023-12-05 21:05:52,984 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:05:52,985 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:05:52,985 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:05:52,985 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:05:52,985 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:05:52" (1/1) ... [2023-12-05 21:05:52,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:05:52,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:05:53,009 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-05 21:05:53,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-05 21:05:53,042 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-12-05 21:05:53,042 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-12-05 21:05:53,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:05:53,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:05:53,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:05:53,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:05:53,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:05:53,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:05:53,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:05:53,044 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-05 21:05:53,149 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:05:53,153 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:05:53,710 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:05:53,860 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:05:53,861 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-12-05 21:05:53,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:05:53 BoogieIcfgContainer [2023-12-05 21:05:53,862 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:05:53,864 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:05:53,864 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:05:53,867 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:05:53,867 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:05:52" (1/3) ... [2023-12-05 21:05:53,867 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27bc4120 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:05:53, skipping insertion in model container [2023-12-05 21:05:53,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:05:52" (2/3) ... [2023-12-05 21:05:53,868 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27bc4120 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:05:53, skipping insertion in model container [2023-12-05 21:05:53,868 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:05:53" (3/3) ... [2023-12-05 21:05:53,871 INFO L112 eAbstractionObserver]: Analyzing ICFG 43_NetBSD_sysmon_power_sliced.i [2023-12-05 21:05:53,885 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:05:53,885 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-12-05 21:05:53,885 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:05:53,979 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:05:54,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 301 places, 368 transitions, 740 flow [2023-12-05 21:05:54,072 INFO L124 PetriNetUnfolderBase]: 71/381 cut-off events. [2023-12-05 21:05:54,073 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:05:54,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 385 conditions, 381 events. 71/381 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1502 event pairs, 0 based on Foata normal form. 0/304 useless extension candidates. Maximal degree in co-relation 355. Up to 10 conditions per place. [2023-12-05 21:05:54,084 INFO L82 GeneralOperation]: Start removeDead. Operand has 301 places, 368 transitions, 740 flow [2023-12-05 21:05:54,090 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 301 places, 368 transitions, 740 flow [2023-12-05 21:05:54,099 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:05:54,104 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;@75c6b8d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:05:54,105 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:05:54,108 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:05:54,108 INFO L124 PetriNetUnfolderBase]: 1/20 cut-off events. [2023-12-05 21:05:54,108 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:05:54,108 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:54,109 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:05:54,109 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:05:54,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:54,113 INFO L85 PathProgramCache]: Analyzing trace with hash -517532903, now seen corresponding path program 1 times [2023-12-05 21:05:54,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:54,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890707600] [2023-12-05 21:05:54,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:54,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:54,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:05:54,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:05:54,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:05:54,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890707600] [2023-12-05 21:05:54,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890707600] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:05:54,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:05:54,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:05:54,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772138325] [2023-12-05 21:05:54,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:05:54,360 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:05:54,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:05:54,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:05:54,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:05:54,390 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 368 [2023-12-05 21:05:54,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 368 transitions, 740 flow. Second operand has 3 states, 3 states have (on average 280.0) internal successors, (840), 3 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:05:54,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:05:54,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 368 [2023-12-05 21:05:54,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:05:54,552 INFO L124 PetriNetUnfolderBase]: 120/668 cut-off events. [2023-12-05 21:05:54,552 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:05:54,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 824 conditions, 668 events. 120/668 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3450 event pairs, 38 based on Foata normal form. 137/669 useless extension candidates. Maximal degree in co-relation 776. Up to 147 conditions per place. [2023-12-05 21:05:54,561 INFO L140 encePairwiseOnDemand]: 326/368 looper letters, 34 selfloop transitions, 1 changer transitions 0/288 dead transitions. [2023-12-05 21:05:54,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 288 transitions, 650 flow [2023-12-05 21:05:54,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:05:54,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:05:54,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 910 transitions. [2023-12-05 21:05:54,577 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8242753623188406 [2023-12-05 21:05:54,577 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 910 transitions. [2023-12-05 21:05:54,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 910 transitions. [2023-12-05 21:05:54,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:05:54,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 910 transitions. [2023-12-05 21:05:54,588 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:05:54,596 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 368.0) internal successors, (1472), 4 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:05:54,597 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 368.0) internal successors, (1472), 4 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:05:54,601 INFO L308 CegarLoopForPetriNet]: 301 programPoint places, -40 predicate places. [2023-12-05 21:05:54,601 INFO L500 AbstractCegarLoop]: Abstraction has has 261 places, 288 transitions, 650 flow [2023-12-05 21:05:54,602 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 280.0) internal successors, (840), 3 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:05:54,602 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:54,603 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:05:54,603 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:05:54,603 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:05:54,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:54,605 INFO L85 PathProgramCache]: Analyzing trace with hash -517532902, now seen corresponding path program 1 times [2023-12-05 21:05:54,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:54,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022120875] [2023-12-05 21:05:54,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:54,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:54,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:05:54,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:05:54,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:05:54,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022120875] [2023-12-05 21:05:54,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022120875] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:05:54,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:05:54,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:05:54,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96511275] [2023-12-05 21:05:54,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:05:54,752 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:05:54,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:05:54,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:05:54,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:05:54,754 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 368 [2023-12-05 21:05:54,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 288 transitions, 650 flow. Second operand has 3 states, 3 states have (on average 280.6666666666667) internal successors, (842), 3 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:05:54,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:05:54,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 368 [2023-12-05 21:05:54,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:05:54,840 INFO L124 PetriNetUnfolderBase]: 76/487 cut-off events. [2023-12-05 21:05:54,840 INFO L125 PetriNetUnfolderBase]: For 58/90 co-relation queries the response was YES. [2023-12-05 21:05:54,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 676 conditions, 487 events. 76/487 cut-off events. For 58/90 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2197 event pairs, 19 based on Foata normal form. 0/408 useless extension candidates. Maximal degree in co-relation 623. Up to 88 conditions per place. [2023-12-05 21:05:54,843 INFO L140 encePairwiseOnDemand]: 366/368 looper letters, 32 selfloop transitions, 1 changer transitions 0/287 dead transitions. [2023-12-05 21:05:54,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 287 transitions, 712 flow [2023-12-05 21:05:54,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:05:54,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:05:54,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 871 transitions. [2023-12-05 21:05:54,846 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7889492753623188 [2023-12-05 21:05:54,846 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 871 transitions. [2023-12-05 21:05:54,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 871 transitions. [2023-12-05 21:05:54,847 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:05:54,847 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 871 transitions. [2023-12-05 21:05:54,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 290.3333333333333) internal successors, (871), 3 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:05:54,850 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 368.0) internal successors, (1472), 4 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:05:54,850 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 368.0) internal successors, (1472), 4 states have internal predecessors, (1472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:05:54,851 INFO L308 CegarLoopForPetriNet]: 301 programPoint places, -39 predicate places. [2023-12-05 21:05:54,851 INFO L500 AbstractCegarLoop]: Abstraction has has 262 places, 287 transitions, 712 flow [2023-12-05 21:05:54,852 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 280.6666666666667) internal successors, (842), 3 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:05:54,852 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:54,852 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:05:54,852 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:05:54,852 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-12-05 21:05:54,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:54,854 INFO L85 PathProgramCache]: Analyzing trace with hash -871233162, now seen corresponding path program 1 times [2023-12-05 21:05:54,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:54,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770649406] [2023-12-05 21:05:54,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:54,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:54,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:05:54,883 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:05:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:05:54,928 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:05:54,928 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:05:54,929 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:05:54,931 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:05:54,932 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:05:54,933 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-05 21:05:54,933 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:05:54,935 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:05:54,935 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-12-05 21:05:55,007 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:05:55,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 575 places, 709 transitions, 1428 flow [2023-12-05 21:05:55,182 INFO L124 PetriNetUnfolderBase]: 141/737 cut-off events. [2023-12-05 21:05:55,183 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-12-05 21:05:55,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 745 conditions, 737 events. 141/737 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3985 event pairs, 0 based on Foata normal form. 0/587 useless extension candidates. Maximal degree in co-relation 695. Up to 10 conditions per place. [2023-12-05 21:05:55,207 INFO L82 GeneralOperation]: Start removeDead. Operand has 575 places, 709 transitions, 1428 flow [2023-12-05 21:05:55,222 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 575 places, 709 transitions, 1428 flow [2023-12-05 21:05:55,224 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:05:55,229 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;@75c6b8d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:05:55,229 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:05:55,231 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:05:55,232 INFO L124 PetriNetUnfolderBase]: 1/19 cut-off events. [2023-12-05 21:05:55,232 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:05:55,235 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:55,235 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:05:55,235 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:05:55,235 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:55,236 INFO L85 PathProgramCache]: Analyzing trace with hash -843580034, now seen corresponding path program 1 times [2023-12-05 21:05:55,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:55,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701609956] [2023-12-05 21:05:55,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:55,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:55,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:05:55,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:05:55,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:05:55,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701609956] [2023-12-05 21:05:55,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701609956] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:05:55,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:05:55,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:05:55,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576366545] [2023-12-05 21:05:55,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:05:55,289 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:05:55,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:05:55,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:05:55,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:05:55,291 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 542 out of 709 [2023-12-05 21:05:55,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 575 places, 709 transitions, 1428 flow. Second operand has 3 states, 3 states have (on average 544.0) internal successors, (1632), 3 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:05:55,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:05:55,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 542 of 709 [2023-12-05 21:05:55,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:05:58,384 INFO L124 PetriNetUnfolderBase]: 5799/24313 cut-off events. [2023-12-05 21:05:58,385 INFO L125 PetriNetUnfolderBase]: For 393/393 co-relation queries the response was YES. [2023-12-05 21:05:58,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30446 conditions, 24313 events. 5799/24313 cut-off events. For 393/393 co-relation queries the response was YES. Maximal size of possible extension queue 670. Compared 310993 event pairs, 2382 based on Foata normal form. 6306/25996 useless extension candidates. Maximal degree in co-relation 6946. Up to 6054 conditions per place. [2023-12-05 21:05:58,639 INFO L140 encePairwiseOnDemand]: 629/709 looper letters, 62 selfloop transitions, 1 changer transitions 0/557 dead transitions. [2023-12-05 21:05:58,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 500 places, 557 transitions, 1250 flow [2023-12-05 21:05:58,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:05:58,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:05:58,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1768 transitions. [2023-12-05 21:05:58,645 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8312176774800188 [2023-12-05 21:05:58,645 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1768 transitions. [2023-12-05 21:05:58,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1768 transitions. [2023-12-05 21:05:58,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:05:58,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1768 transitions. [2023-12-05 21:05:58,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 589.3333333333334) internal successors, (1768), 3 states have internal predecessors, (1768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:05:58,653 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 709.0) internal successors, (2836), 4 states have internal predecessors, (2836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:05:58,654 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 709.0) internal successors, (2836), 4 states have internal predecessors, (2836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:05:58,655 INFO L308 CegarLoopForPetriNet]: 575 programPoint places, -75 predicate places. [2023-12-05 21:05:58,655 INFO L500 AbstractCegarLoop]: Abstraction has has 500 places, 557 transitions, 1250 flow [2023-12-05 21:05:58,656 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 544.0) internal successors, (1632), 3 states have internal predecessors, (1632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:05:58,656 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:05:58,656 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:05:58,656 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:05:58,656 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:05:58,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:05:58,657 INFO L85 PathProgramCache]: Analyzing trace with hash -843580033, now seen corresponding path program 1 times [2023-12-05 21:05:58,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:05:58,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779088084] [2023-12-05 21:05:58,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:05:58,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:05:58,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:05:58,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:05:58,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:05:58,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779088084] [2023-12-05 21:05:58,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779088084] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:05:58,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:05:58,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:05:58,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506761235] [2023-12-05 21:05:58,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:05:58,698 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:05:58,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:05:58,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:05:58,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:05:58,700 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 543 out of 709 [2023-12-05 21:05:58,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 500 places, 557 transitions, 1250 flow. Second operand has 3 states, 3 states have (on average 544.6666666666666) internal successors, (1634), 3 states have internal predecessors, (1634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:05:58,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:05:58,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 543 of 709 [2023-12-05 21:05:58,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:06:00,388 INFO L124 PetriNetUnfolderBase]: 3734/16904 cut-off events. [2023-12-05 21:06:00,390 INFO L125 PetriNetUnfolderBase]: For 2340/5034 co-relation queries the response was YES. [2023-12-05 21:06:00,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24543 conditions, 16904 events. 3734/16904 cut-off events. For 2340/5034 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 206266 event pairs, 1411 based on Foata normal form. 0/14088 useless extension candidates. Maximal degree in co-relation 5231. Up to 3778 conditions per place. [2023-12-05 21:06:00,542 INFO L140 encePairwiseOnDemand]: 707/709 looper letters, 60 selfloop transitions, 1 changer transitions 0/556 dead transitions. [2023-12-05 21:06:00,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 501 places, 556 transitions, 1368 flow [2023-12-05 21:06:00,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:06:00,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:06:00,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1691 transitions. [2023-12-05 21:06:00,545 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7950164551010813 [2023-12-05 21:06:00,545 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1691 transitions. [2023-12-05 21:06:00,545 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1691 transitions. [2023-12-05 21:06:00,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:06:00,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1691 transitions. [2023-12-05 21:06:00,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 563.6666666666666) internal successors, (1691), 3 states have internal predecessors, (1691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:00,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 709.0) internal successors, (2836), 4 states have internal predecessors, (2836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:00,553 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 709.0) internal successors, (2836), 4 states have internal predecessors, (2836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:00,554 INFO L308 CegarLoopForPetriNet]: 575 programPoint places, -74 predicate places. [2023-12-05 21:06:00,555 INFO L500 AbstractCegarLoop]: Abstraction has has 501 places, 556 transitions, 1368 flow [2023-12-05 21:06:00,555 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 544.6666666666666) internal successors, (1634), 3 states have internal predecessors, (1634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:00,555 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:00,556 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:06:00,556 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:06:00,556 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-12-05 21:06:00,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:00,556 INFO L85 PathProgramCache]: Analyzing trace with hash 2070032454, now seen corresponding path program 1 times [2023-12-05 21:06:00,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:00,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131230591] [2023-12-05 21:06:00,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:00,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:00,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:06:00,576 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:06:00,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:06:00,592 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:06:00,592 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:06:00,592 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-12-05 21:06:00,592 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 3 remaining) [2023-12-05 21:06:00,595 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 3 remaining) [2023-12-05 21:06:00,596 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:06:00,596 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-12-05 21:06:00,596 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:06:00,596 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-12-05 21:06:00,670 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-05 21:06:00,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 849 places, 1050 transitions, 2118 flow [2023-12-05 21:06:01,109 INFO L124 PetriNetUnfolderBase]: 211/1093 cut-off events. [2023-12-05 21:06:01,111 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-12-05 21:06:01,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1106 conditions, 1093 events. 211/1093 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 6726 event pairs, 0 based on Foata normal form. 0/870 useless extension candidates. Maximal degree in co-relation 1035. Up to 10 conditions per place. [2023-12-05 21:06:01,178 INFO L82 GeneralOperation]: Start removeDead. Operand has 849 places, 1050 transitions, 2118 flow [2023-12-05 21:06:01,203 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 849 places, 1050 transitions, 2118 flow [2023-12-05 21:06:01,205 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:06:01,207 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;@75c6b8d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:06:01,207 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-05 21:06:01,209 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:06:01,209 INFO L124 PetriNetUnfolderBase]: 1/19 cut-off events. [2023-12-05 21:06:01,210 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:06:01,210 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:06:01,210 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:06:01,210 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-12-05 21:06:01,211 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:06:01,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1532407080, now seen corresponding path program 1 times [2023-12-05 21:06:01,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:06:01,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474209547] [2023-12-05 21:06:01,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:06:01,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:06:01,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:06:01,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:06:01,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:06:01,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474209547] [2023-12-05 21:06:01,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474209547] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:06:01,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:06:01,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:06:01,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146559914] [2023-12-05 21:06:01,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:06:01,253 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:06:01,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:06:01,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:06:01,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:06:01,256 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 806 out of 1050 [2023-12-05 21:06:01,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 849 places, 1050 transitions, 2118 flow. Second operand has 3 states, 3 states have (on average 808.0) internal successors, (2424), 3 states have internal predecessors, (2424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-05 21:06:01,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:06:01,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 806 of 1050 [2023-12-05 21:06:01,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand