/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/goblint-regression/28-race_reach_60-invariant_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:16:58,279 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:16:58,342 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:16:58,362 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:16:58,363 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:16:58,363 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:16:58,364 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:16:58,364 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:16:58,364 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:16:58,364 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:16:58,365 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:16:58,365 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:16:58,365 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:16:58,365 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:16:58,366 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:16:58,366 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:16:58,366 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:16:58,366 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:16:58,367 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:16:58,367 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:16:58,367 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:16:58,370 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:16:58,370 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:16:58,370 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:16:58,370 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:16:58,371 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:16:58,371 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:16:58,371 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:16:58,371 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:16:58,371 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:16:58,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:16:58,372 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:16:58,372 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:16:58,372 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:16:58,549 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:16:58,566 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:16:58,568 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:16:58,570 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:16:58,570 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:16:58,571 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_60-invariant_racefree.i [2023-12-05 21:16:59,600 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:16:59,836 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:16:59,837 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_60-invariant_racefree.i [2023-12-05 21:16:59,846 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a920c1ed/ed1952804ae544dd83a3802dd9ffc7de/FLAG659ac4796 [2023-12-05 21:16:59,856 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a920c1ed/ed1952804ae544dd83a3802dd9ffc7de [2023-12-05 21:16:59,858 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:16:59,859 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:16:59,859 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:16:59,860 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:16:59,863 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:16:59,863 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:16:59" (1/1) ... [2023-12-05 21:16:59,864 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@144f329b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:16:59, skipping insertion in model container [2023-12-05 21:16:59,864 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:16:59" (1/1) ... [2023-12-05 21:16:59,896 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:17:00,114 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:17:00,127 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:17:00,188 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:17:00,223 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:17:00,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:17:00 WrapperNode [2023-12-05 21:17:00,224 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:17:00,225 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:17:00,225 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:17:00,225 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:17:00,229 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:17:00" (1/1) ... [2023-12-05 21:17:00,242 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:17:00" (1/1) ... [2023-12-05 21:17:00,263 INFO L138 Inliner]: procedures = 171, calls = 44, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 174 [2023-12-05 21:17:00,263 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:17:00,263 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:17:00,264 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:17:00,264 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:17:00,272 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:17:00" (1/1) ... [2023-12-05 21:17:00,272 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:17:00" (1/1) ... [2023-12-05 21:17:00,282 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:17:00" (1/1) ... [2023-12-05 21:17:00,282 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:17:00" (1/1) ... [2023-12-05 21:17:00,286 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:17:00" (1/1) ... [2023-12-05 21:17:00,289 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:17:00" (1/1) ... [2023-12-05 21:17:00,290 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:17:00" (1/1) ... [2023-12-05 21:17:00,291 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:17:00" (1/1) ... [2023-12-05 21:17:00,293 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:17:00,293 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:17:00,293 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:17:00,293 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:17:00,294 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:17:00" (1/1) ... [2023-12-05 21:17:00,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:17:00,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:17:00,334 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:17:00,352 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:17:00,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-05 21:17:00,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:17:00,376 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-05 21:17:00,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:17:00,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:17:00,376 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-12-05 21:17:00,377 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-12-05 21:17:00,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:17:00,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:17:00,377 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-05 21:17:00,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:17:00,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:17:00,378 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:17:00,489 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:17:00,491 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:17:00,713 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:17:00,741 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:17:00,741 INFO L309 CfgBuilder]: Removed 18 assume(true) statements. [2023-12-05 21:17:00,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:17:00 BoogieIcfgContainer [2023-12-05 21:17:00,742 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:17:00,744 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:17:00,744 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:17:00,756 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:17:00,756 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:16:59" (1/3) ... [2023-12-05 21:17:00,757 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62aea9e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:17:00, skipping insertion in model container [2023-12-05 21:17:00,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:17:00" (2/3) ... [2023-12-05 21:17:00,757 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62aea9e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:17:00, skipping insertion in model container [2023-12-05 21:17:00,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:17:00" (3/3) ... [2023-12-05 21:17:00,758 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_60-invariant_racefree.i [2023-12-05 21:17:00,771 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:17:00,771 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-12-05 21:17:00,772 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:17:00,831 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-12-05 21:17:00,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 165 transitions, 337 flow [2023-12-05 21:17:00,960 INFO L124 PetriNetUnfolderBase]: 36/237 cut-off events. [2023-12-05 21:17:00,961 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-12-05 21:17:00,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 242 conditions, 237 events. 36/237 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 896 event pairs, 0 based on Foata normal form. 0/190 useless extension candidates. Maximal degree in co-relation 133. Up to 6 conditions per place. [2023-12-05 21:17:00,972 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 165 transitions, 337 flow [2023-12-05 21:17:00,981 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 165 transitions, 337 flow [2023-12-05 21:17:00,997 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:17:01,001 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;@6f06c0e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:17:01,002 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-12-05 21:17:01,006 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:17:01,006 INFO L124 PetriNetUnfolderBase]: 1/33 cut-off events. [2023-12-05 21:17:01,006 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:17:01,006 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:17:01,007 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:17:01,007 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:17:01,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:17:01,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1067944568, now seen corresponding path program 1 times [2023-12-05 21:17:01,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:17:01,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530647911] [2023-12-05 21:17:01,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:17:01,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:17:01,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:17:01,482 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:17:01,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:17:01,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530647911] [2023-12-05 21:17:01,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530647911] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:17:01,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:17:01,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:17:01,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481348734] [2023-12-05 21:17:01,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:17:01,493 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:17:01,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:17:01,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:17:01,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:17:01,522 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 165 [2023-12-05 21:17:01,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 165 transitions, 337 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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:17:01,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:17:01,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 165 [2023-12-05 21:17:01,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:17:01,729 INFO L124 PetriNetUnfolderBase]: 149/874 cut-off events. [2023-12-05 21:17:01,729 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-05 21:17:01,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1198 conditions, 874 events. 149/874 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 5744 event pairs, 108 based on Foata normal form. 200/1002 useless extension candidates. Maximal degree in co-relation 1081. Up to 252 conditions per place. [2023-12-05 21:17:01,738 INFO L140 encePairwiseOnDemand]: 139/165 looper letters, 37 selfloop transitions, 2 changer transitions 3/144 dead transitions. [2023-12-05 21:17:01,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 144 transitions, 379 flow [2023-12-05 21:17:01,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:17:01,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:17:01,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2023-12-05 21:17:01,753 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.795959595959596 [2023-12-05 21:17:01,754 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 394 transitions. [2023-12-05 21:17:01,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 394 transitions. [2023-12-05 21:17:01,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:17:01,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 394 transitions. [2023-12-05 21:17:01,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 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:17:01,766 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 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:17:01,767 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 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:17:01,770 INFO L308 CegarLoopForPetriNet]: 144 programPoint places, -6 predicate places. [2023-12-05 21:17:01,770 INFO L500 AbstractCegarLoop]: Abstraction has has 138 places, 144 transitions, 379 flow [2023-12-05 21:17:01,771 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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:17:01,771 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:17:01,771 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:17:01,771 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:17:01,771 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:17:01,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:17:01,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1067944569, now seen corresponding path program 1 times [2023-12-05 21:17:01,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:17:01,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970387868] [2023-12-05 21:17:01,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:17:01,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:17:01,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:17:01,914 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:17:01,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:17:01,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970387868] [2023-12-05 21:17:01,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970387868] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:17:01,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:17:01,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:17:01,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704971333] [2023-12-05 21:17:01,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:17:01,916 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:17:01,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:17:01,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:17:01,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:17:01,917 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 165 [2023-12-05 21:17:01,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 144 transitions, 379 flow. Second operand has 4 states, 4 states have (on average 103.25) internal successors, (413), 4 states have internal predecessors, (413), 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:17:01,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:17:01,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 165 [2023-12-05 21:17:01,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:17:02,108 INFO L124 PetriNetUnfolderBase]: 182/894 cut-off events. [2023-12-05 21:17:02,108 INFO L125 PetriNetUnfolderBase]: For 176/200 co-relation queries the response was YES. [2023-12-05 21:17:02,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1660 conditions, 894 events. 182/894 cut-off events. For 176/200 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5702 event pairs, 9 based on Foata normal form. 0/825 useless extension candidates. Maximal degree in co-relation 1566. Up to 328 conditions per place. [2023-12-05 21:17:02,113 INFO L140 encePairwiseOnDemand]: 159/165 looper letters, 57 selfloop transitions, 4 changer transitions 6/164 dead transitions. [2023-12-05 21:17:02,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 164 transitions, 591 flow [2023-12-05 21:17:02,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:17:02,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:17:02,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 464 transitions. [2023-12-05 21:17:02,115 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.703030303030303 [2023-12-05 21:17:02,115 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 464 transitions. [2023-12-05 21:17:02,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 464 transitions. [2023-12-05 21:17:02,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:17:02,116 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 464 transitions. [2023-12-05 21:17:02,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 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:17:02,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 165.0) internal successors, (825), 5 states have internal predecessors, (825), 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:17:02,120 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 165.0) internal successors, (825), 5 states have internal predecessors, (825), 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:17:02,121 INFO L308 CegarLoopForPetriNet]: 144 programPoint places, -3 predicate places. [2023-12-05 21:17:02,121 INFO L500 AbstractCegarLoop]: Abstraction has has 141 places, 164 transitions, 591 flow [2023-12-05 21:17:02,121 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.25) internal successors, (413), 4 states have internal predecessors, (413), 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:17:02,121 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:17:02,122 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:17:02,122 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:17:02,122 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:17:02,124 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:17:02,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1869070209, now seen corresponding path program 1 times [2023-12-05 21:17:02,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:17:02,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270455357] [2023-12-05 21:17:02,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:17:02,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:17:02,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:17:02,313 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:17:02,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:17:02,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270455357] [2023-12-05 21:17:02,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270455357] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:17:02,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678763028] [2023-12-05 21:17:02,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:17:02,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:17:02,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:17:02,336 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-05 21:17:02,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-05 21:17:02,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:17:02,408 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-05 21:17:02,413 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:17:02,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-05 21:17:02,535 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:17:02,535 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:17:02,625 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:17:02,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678763028] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:17:02,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:17:02,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-05 21:17:02,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801990089] [2023-12-05 21:17:02,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:17:02,627 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-05 21:17:02,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:17:02,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-05 21:17:02,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-12-05 21:17:02,629 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 165 [2023-12-05 21:17:02,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 164 transitions, 591 flow. Second operand has 11 states, 11 states have (on average 102.63636363636364) internal successors, (1129), 11 states have internal predecessors, (1129), 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:17:02,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:17:02,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 165 [2023-12-05 21:17:02,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:17:02,768 INFO L124 PetriNetUnfolderBase]: 47/223 cut-off events. [2023-12-05 21:17:02,769 INFO L125 PetriNetUnfolderBase]: For 152/184 co-relation queries the response was YES. [2023-12-05 21:17:02,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 521 conditions, 223 events. 47/223 cut-off events. For 152/184 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 926 event pairs, 0 based on Foata normal form. 13/231 useless extension candidates. Maximal degree in co-relation 445. Up to 67 conditions per place. [2023-12-05 21:17:02,770 INFO L140 encePairwiseOnDemand]: 158/165 looper letters, 46 selfloop transitions, 5 changer transitions 0/108 dead transitions. [2023-12-05 21:17:02,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 108 transitions, 514 flow [2023-12-05 21:17:02,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-05 21:17:02,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-05 21:17:02,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 753 transitions. [2023-12-05 21:17:02,772 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6519480519480519 [2023-12-05 21:17:02,772 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 753 transitions. [2023-12-05 21:17:02,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 753 transitions. [2023-12-05 21:17:02,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:17:02,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 753 transitions. [2023-12-05 21:17:02,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 107.57142857142857) internal successors, (753), 7 states have internal predecessors, (753), 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:17:02,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 165.0) internal successors, (1320), 8 states have internal predecessors, (1320), 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:17:02,776 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 165.0) internal successors, (1320), 8 states have internal predecessors, (1320), 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:17:02,777 INFO L308 CegarLoopForPetriNet]: 144 programPoint places, -52 predicate places. [2023-12-05 21:17:02,777 INFO L500 AbstractCegarLoop]: Abstraction has has 92 places, 108 transitions, 514 flow [2023-12-05 21:17:02,777 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 102.63636363636364) internal successors, (1129), 11 states have internal predecessors, (1129), 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:17:02,777 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:17:02,778 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:17:02,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-05 21:17:02,983 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:17:02,983 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:17:02,984 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:17:02,984 INFO L85 PathProgramCache]: Analyzing trace with hash -2106601143, now seen corresponding path program 1 times [2023-12-05 21:17:02,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:17:02,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278474114] [2023-12-05 21:17:02,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:17:02,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:17:02,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:17:02,995 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:17:03,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:17:03,030 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:17:03,030 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:17:03,031 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-12-05 21:17:03,032 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 5 remaining) [2023-12-05 21:17:03,032 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 5 remaining) [2023-12-05 21:17:03,032 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 5 remaining) [2023-12-05 21:17:03,033 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 5 remaining) [2023-12-05 21:17:03,033 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:17:03,033 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-05 21:17:03,035 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:17:03,035 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-12-05 21:17:03,069 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-12-05 21:17:03,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 192 places, 223 transitions, 462 flow [2023-12-05 21:17:03,096 INFO L124 PetriNetUnfolderBase]: 62/395 cut-off events. [2023-12-05 21:17:03,097 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-12-05 21:17:03,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 407 conditions, 395 events. 62/395 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1693 event pairs, 0 based on Foata normal form. 0/315 useless extension candidates. Maximal degree in co-relation 239. Up to 9 conditions per place. [2023-12-05 21:17:03,100 INFO L82 GeneralOperation]: Start removeDead. Operand has 192 places, 223 transitions, 462 flow [2023-12-05 21:17:03,102 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 192 places, 223 transitions, 462 flow [2023-12-05 21:17:03,103 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:17:03,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;@6f06c0e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:17:03,104 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-12-05 21:17:03,106 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:17:03,106 INFO L124 PetriNetUnfolderBase]: 1/33 cut-off events. [2023-12-05 21:17:03,106 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:17:03,106 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:17:03,106 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:17:03,106 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:17:03,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:17:03,107 INFO L85 PathProgramCache]: Analyzing trace with hash 722564375, now seen corresponding path program 1 times [2023-12-05 21:17:03,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:17:03,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471065427] [2023-12-05 21:17:03,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:17:03,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:17:03,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:17:03,155 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:17:03,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:17:03,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471065427] [2023-12-05 21:17:03,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471065427] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:17:03,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:17:03,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:17:03,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879783224] [2023-12-05 21:17:03,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:17:03,156 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:17:03,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:17:03,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:17:03,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:17:03,157 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 223 [2023-12-05 21:17:03,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 223 transitions, 462 flow. Second operand has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 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:17:03,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:17:03,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 223 [2023-12-05 21:17:03,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:17:04,249 INFO L124 PetriNetUnfolderBase]: 3161/10540 cut-off events. [2023-12-05 21:17:04,249 INFO L125 PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES. [2023-12-05 21:17:04,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15467 conditions, 10540 events. 3161/10540 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 112285 event pairs, 2394 based on Foata normal form. 3308/13062 useless extension candidates. Maximal degree in co-relation 1745. Up to 3897 conditions per place. [2023-12-05 21:17:04,320 INFO L140 encePairwiseOnDemand]: 187/223 looper letters, 60 selfloop transitions, 2 changer transitions 0/198 dead transitions. [2023-12-05 21:17:04,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 198 transitions, 536 flow [2023-12-05 21:17:04,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:17:04,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:17:04,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 542 transitions. [2023-12-05 21:17:04,325 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8101644245142003 [2023-12-05 21:17:04,325 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 542 transitions. [2023-12-05 21:17:04,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 542 transitions. [2023-12-05 21:17:04,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:17:04,326 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 542 transitions. [2023-12-05 21:17:04,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 180.66666666666666) internal successors, (542), 3 states have internal predecessors, (542), 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:17:04,328 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 223.0) internal successors, (892), 4 states have internal predecessors, (892), 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:17:04,328 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 223.0) internal successors, (892), 4 states have internal predecessors, (892), 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:17:04,329 INFO L308 CegarLoopForPetriNet]: 192 programPoint places, -9 predicate places. [2023-12-05 21:17:04,330 INFO L500 AbstractCegarLoop]: Abstraction has has 183 places, 198 transitions, 536 flow [2023-12-05 21:17:04,330 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 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:17:04,330 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:17:04,330 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:17:04,330 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:17:04,331 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:17:04,331 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:17:04,332 INFO L85 PathProgramCache]: Analyzing trace with hash 722564376, now seen corresponding path program 1 times [2023-12-05 21:17:04,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:17:04,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674547492] [2023-12-05 21:17:04,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:17:04,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:17:04,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:17:04,430 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:17:04,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:17:04,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674547492] [2023-12-05 21:17:04,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674547492] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:17:04,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:17:04,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:17:04,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052676823] [2023-12-05 21:17:04,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:17:04,431 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:17:04,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:17:04,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:17:04,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:17:04,432 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 223 [2023-12-05 21:17:04,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 198 transitions, 536 flow. Second operand has 4 states, 4 states have (on average 139.25) internal successors, (557), 4 states have internal predecessors, (557), 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:17:04,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:17:04,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 223 [2023-12-05 21:17:04,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:17:05,668 INFO L124 PetriNetUnfolderBase]: 3966/11538 cut-off events. [2023-12-05 21:17:05,668 INFO L125 PetriNetUnfolderBase]: For 2377/2653 co-relation queries the response was YES. [2023-12-05 21:17:05,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23704 conditions, 11538 events. 3966/11538 cut-off events. For 2377/2653 co-relation queries the response was YES. Maximal size of possible extension queue 316. Compared 120295 event pairs, 1566 based on Foata normal form. 0/10709 useless extension candidates. Maximal degree in co-relation 2843. Up to 5654 conditions per place. [2023-12-05 21:17:05,745 INFO L140 encePairwiseOnDemand]: 217/223 looper letters, 94 selfloop transitions, 4 changer transitions 0/229 dead transitions. [2023-12-05 21:17:05,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 229 transitions, 850 flow [2023-12-05 21:17:05,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:17:05,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:17:05,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 630 transitions. [2023-12-05 21:17:05,746 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7062780269058296 [2023-12-05 21:17:05,747 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 630 transitions. [2023-12-05 21:17:05,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 630 transitions. [2023-12-05 21:17:05,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:17:05,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 630 transitions. [2023-12-05 21:17:05,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 157.5) internal successors, (630), 4 states have internal predecessors, (630), 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:17:05,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 223.0) internal successors, (1115), 5 states have internal predecessors, (1115), 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:17:05,750 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 223.0) internal successors, (1115), 5 states have internal predecessors, (1115), 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:17:05,750 INFO L308 CegarLoopForPetriNet]: 192 programPoint places, -6 predicate places. [2023-12-05 21:17:05,750 INFO L500 AbstractCegarLoop]: Abstraction has has 186 places, 229 transitions, 850 flow [2023-12-05 21:17:05,750 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 139.25) internal successors, (557), 4 states have internal predecessors, (557), 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:17:05,750 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:17:05,751 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:17:05,751 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:17:05,751 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:17:05,751 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:17:05,751 INFO L85 PathProgramCache]: Analyzing trace with hash 281234054, now seen corresponding path program 1 times [2023-12-05 21:17:05,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:17:05,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894507381] [2023-12-05 21:17:05,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:17:05,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:17:05,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:17:05,837 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:17:05,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:17:05,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894507381] [2023-12-05 21:17:05,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894507381] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:17:05,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568921577] [2023-12-05 21:17:05,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:17:05,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:17:05,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:17:05,866 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-05 21:17:05,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-05 21:17:05,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:17:05,935 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-05 21:17:05,937 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:17:05,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-05 21:17:06,011 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:17:06,012 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:17:06,090 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:17:06,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568921577] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:17:06,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:17:06,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-05 21:17:06,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150892976] [2023-12-05 21:17:06,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:17:06,091 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-05 21:17:06,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:17:06,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-05 21:17:06,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-12-05 21:17:06,093 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 223 [2023-12-05 21:17:06,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 229 transitions, 850 flow. Second operand has 11 states, 11 states have (on average 138.63636363636363) internal successors, (1525), 11 states have internal predecessors, (1525), 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:17:06,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:17:06,094 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 223 [2023-12-05 21:17:06,094 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:17:07,398 INFO L124 PetriNetUnfolderBase]: 3885/10929 cut-off events. [2023-12-05 21:17:07,398 INFO L125 PetriNetUnfolderBase]: For 5774/6874 co-relation queries the response was YES. [2023-12-05 21:17:07,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28699 conditions, 10929 events. 3885/10929 cut-off events. For 5774/6874 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 110093 event pairs, 145 based on Foata normal form. 13/10381 useless extension candidates. Maximal degree in co-relation 7618. Up to 5365 conditions per place. [2023-12-05 21:17:07,471 INFO L140 encePairwiseOnDemand]: 214/223 looper letters, 175 selfloop transitions, 10 changer transitions 6/321 dead transitions. [2023-12-05 21:17:07,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 321 transitions, 1778 flow [2023-12-05 21:17:07,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-05 21:17:07,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-05 21:17:07,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1536 transitions. [2023-12-05 21:17:07,475 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6887892376681615 [2023-12-05 21:17:07,475 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1536 transitions. [2023-12-05 21:17:07,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1536 transitions. [2023-12-05 21:17:07,476 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:17:07,476 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1536 transitions. [2023-12-05 21:17:07,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 153.6) internal successors, (1536), 10 states have internal predecessors, (1536), 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:17:07,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 223.0) internal successors, (2453), 11 states have internal predecessors, (2453), 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:17:07,481 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 223.0) internal successors, (2453), 11 states have internal predecessors, (2453), 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:17:07,482 INFO L308 CegarLoopForPetriNet]: 192 programPoint places, 2 predicate places. [2023-12-05 21:17:07,482 INFO L500 AbstractCegarLoop]: Abstraction has has 194 places, 321 transitions, 1778 flow [2023-12-05 21:17:07,482 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 138.63636363636363) internal successors, (1525), 11 states have internal predecessors, (1525), 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:17:07,482 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:17:07,483 INFO L233 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:17:07,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-05 21:17:07,687 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-12-05 21:17:07,689 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:17:07,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:17:07,689 INFO L85 PathProgramCache]: Analyzing trace with hash 187094476, now seen corresponding path program 1 times [2023-12-05 21:17:07,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:17:07,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820979203] [2023-12-05 21:17:07,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:17:07,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:17:07,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:17:07,708 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:17:07,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:17:07,724 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:17:07,725 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:17:07,726 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-12-05 21:17:07,727 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 5 remaining) [2023-12-05 21:17:07,728 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 5 remaining) [2023-12-05 21:17:07,729 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 5 remaining) [2023-12-05 21:17:07,729 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 5 remaining) [2023-12-05 21:17:07,729 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:17:07,729 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-05 21:17:07,730 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:17:07,730 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-12-05 21:17:07,763 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-12-05 21:17:07,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 240 places, 281 transitions, 589 flow [2023-12-05 21:17:07,817 INFO L124 PetriNetUnfolderBase]: 93/592 cut-off events. [2023-12-05 21:17:07,817 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-12-05 21:17:07,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 617 conditions, 592 events. 93/592 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2685 event pairs, 1 based on Foata normal form. 0/471 useless extension candidates. Maximal degree in co-relation 403. Up to 16 conditions per place. [2023-12-05 21:17:07,824 INFO L82 GeneralOperation]: Start removeDead. Operand has 240 places, 281 transitions, 589 flow [2023-12-05 21:17:07,827 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 240 places, 281 transitions, 589 flow [2023-12-05 21:17:07,828 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:17:07,828 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;@6f06c0e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:17:07,828 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-12-05 21:17:07,832 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:17:07,832 INFO L124 PetriNetUnfolderBase]: 1/34 cut-off events. [2023-12-05 21:17:07,832 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:17:07,832 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:17:07,833 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:17:07,833 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:17:07,833 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:17:07,833 INFO L85 PathProgramCache]: Analyzing trace with hash 2117048944, now seen corresponding path program 1 times [2023-12-05 21:17:07,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:17:07,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928235952] [2023-12-05 21:17:07,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:17:07,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:17:07,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:17:07,860 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:17:07,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:17:07,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928235952] [2023-12-05 21:17:07,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928235952] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:17:07,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:17:07,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:17:07,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710507992] [2023-12-05 21:17:07,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:17:07,863 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:17:07,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:17:07,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:17:07,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:17:07,865 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 281 [2023-12-05 21:17:07,866 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 281 transitions, 589 flow. Second operand has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 3 states have internal predecessors, (542), 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:17:07,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:17:07,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 281 [2023-12-05 21:17:07,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:17:20,654 INFO L124 PetriNetUnfolderBase]: 49466/125145 cut-off events. [2023-12-05 21:17:20,654 INFO L125 PetriNetUnfolderBase]: For 1861/1861 co-relation queries the response was YES. [2023-12-05 21:17:21,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193169 conditions, 125145 events. 49466/125145 cut-off events. For 1861/1861 co-relation queries the response was YES. Maximal size of possible extension queue 2820. Compared 1696320 event pairs, 37891 based on Foata normal form. 47128/164097 useless extension candidates. Maximal degree in co-relation 15453. Up to 53325 conditions per place. [2023-12-05 21:17:22,099 INFO L140 encePairwiseOnDemand]: 235/281 looper letters, 80 selfloop transitions, 2 changer transitions 0/252 dead transitions. [2023-12-05 21:17:22,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 252 transitions, 695 flow [2023-12-05 21:17:22,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:17:22,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:17:22,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 690 transitions. [2023-12-05 21:17:22,101 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8185053380782918 [2023-12-05 21:17:22,101 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 690 transitions. [2023-12-05 21:17:22,101 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 690 transitions. [2023-12-05 21:17:22,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:17:22,101 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 690 transitions. [2023-12-05 21:17:22,102 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 230.0) internal successors, (690), 3 states have internal predecessors, (690), 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:17:22,103 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 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:17:22,104 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 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:17:22,104 INFO L308 CegarLoopForPetriNet]: 240 programPoint places, -12 predicate places. [2023-12-05 21:17:22,104 INFO L500 AbstractCegarLoop]: Abstraction has has 228 places, 252 transitions, 695 flow [2023-12-05 21:17:22,105 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.66666666666666) internal successors, (542), 3 states have internal predecessors, (542), 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:17:22,105 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:17:22,105 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:17:22,105 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 21:17:22,105 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:17:22,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:17:22,105 INFO L85 PathProgramCache]: Analyzing trace with hash 2117048945, now seen corresponding path program 1 times [2023-12-05 21:17:22,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:17:22,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656245421] [2023-12-05 21:17:22,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:17:22,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:17:22,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:17:22,143 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:17:22,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:17:22,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656245421] [2023-12-05 21:17:22,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656245421] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:17:22,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:17:22,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:17:22,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280157326] [2023-12-05 21:17:22,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:17:22,144 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:17:22,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:17:22,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:17:22,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:17:22,145 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 281 [2023-12-05 21:17:22,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 252 transitions, 695 flow. Second operand has 4 states, 4 states have (on average 175.25) internal successors, (701), 4 states have internal predecessors, (701), 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:17:22,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:17:22,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 281 [2023-12-05 21:17:22,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:17:38,942 INFO L124 PetriNetUnfolderBase]: 64091/159923 cut-off events. [2023-12-05 21:17:38,942 INFO L125 PetriNetUnfolderBase]: For 23878/28000 co-relation queries the response was YES. [2023-12-05 21:17:39,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 329001 conditions, 159923 events. 64091/159923 cut-off events. For 23878/28000 co-relation queries the response was YES. Maximal size of possible extension queue 3767. Compared 2212742 event pairs, 34003 based on Foata normal form. 0/150703 useless extension candidates. Maximal degree in co-relation 25688. Up to 77681 conditions per place. [2023-12-05 21:17:40,720 INFO L140 encePairwiseOnDemand]: 275/281 looper letters, 123 selfloop transitions, 4 changer transitions 0/292 dead transitions. [2023-12-05 21:17:40,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 292 transitions, 1103 flow [2023-12-05 21:17:40,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:17:40,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:17:40,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 794 transitions. [2023-12-05 21:17:40,723 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7064056939501779 [2023-12-05 21:17:40,723 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 794 transitions. [2023-12-05 21:17:40,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 794 transitions. [2023-12-05 21:17:40,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:17:40,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 794 transitions. [2023-12-05 21:17:40,725 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 198.5) internal successors, (794), 4 states have internal predecessors, (794), 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:17:40,726 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 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:17:40,726 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 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:17:40,727 INFO L308 CegarLoopForPetriNet]: 240 programPoint places, -9 predicate places. [2023-12-05 21:17:40,727 INFO L500 AbstractCegarLoop]: Abstraction has has 231 places, 292 transitions, 1103 flow [2023-12-05 21:17:40,727 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 175.25) internal successors, (701), 4 states have internal predecessors, (701), 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:17:40,727 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:17:40,728 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:17:40,728 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-05 21:17:40,728 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:17:40,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:17:40,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1042025721, now seen corresponding path program 1 times [2023-12-05 21:17:40,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:17:40,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118975448] [2023-12-05 21:17:40,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:17:40,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:17:40,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:17:40,951 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:17:40,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:17:40,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118975448] [2023-12-05 21:17:40,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118975448] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:17:40,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398452408] [2023-12-05 21:17:40,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:17:40,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:17:40,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:17:40,953 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-05 21:17:40,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-05 21:17:41,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:17:41,034 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-05 21:17:41,037 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:17:41,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-05 21:17:41,104 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:17:41,104 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:17:41,180 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:17:41,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [398452408] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:17:41,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:17:41,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-05 21:17:41,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707774763] [2023-12-05 21:17:41,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:17:41,182 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-05 21:17:41,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:17:41,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-05 21:17:41,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-12-05 21:17:41,184 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 281 [2023-12-05 21:17:41,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 292 transitions, 1103 flow. Second operand has 11 states, 11 states have (on average 174.63636363636363) internal successors, (1921), 11 states have internal predecessors, (1921), 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:17:41,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:17:41,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 281 [2023-12-05 21:17:41,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:17:57,456 INFO L124 PetriNetUnfolderBase]: 65082/142248 cut-off events. [2023-12-05 21:17:57,456 INFO L125 PetriNetUnfolderBase]: For 72794/88516 co-relation queries the response was YES. [2023-12-05 21:17:58,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 406571 conditions, 142248 events. 65082/142248 cut-off events. For 72794/88516 co-relation queries the response was YES. Maximal size of possible extension queue 3289. Compared 1793885 event pairs, 2471 based on Foata normal form. 7/134126 useless extension candidates. Maximal degree in co-relation 30765. Up to 80081 conditions per place. [2023-12-05 21:17:59,496 INFO L140 encePairwiseOnDemand]: 271/281 looper letters, 225 selfloop transitions, 12 changer transitions 0/401 dead transitions. [2023-12-05 21:17:59,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 401 transitions, 2211 flow [2023-12-05 21:17:59,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-05 21:17:59,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-05 21:17:59,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1933 transitions. [2023-12-05 21:17:59,521 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6879003558718861 [2023-12-05 21:17:59,521 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1933 transitions. [2023-12-05 21:17:59,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1933 transitions. [2023-12-05 21:17:59,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:17:59,522 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1933 transitions. [2023-12-05 21:17:59,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 193.3) internal successors, (1933), 10 states have internal predecessors, (1933), 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:17:59,528 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 281.0) internal successors, (3091), 11 states have internal predecessors, (3091), 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:17:59,545 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 281.0) internal successors, (3091), 11 states have internal predecessors, (3091), 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:17:59,546 INFO L308 CegarLoopForPetriNet]: 240 programPoint places, 0 predicate places. [2023-12-05 21:17:59,547 INFO L500 AbstractCegarLoop]: Abstraction has has 240 places, 401 transitions, 2211 flow [2023-12-05 21:17:59,547 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 174.63636363636363) internal successors, (1921), 11 states have internal predecessors, (1921), 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:17:59,547 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:17:59,547 INFO L233 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:17:59,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-05 21:17:59,748 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:17:59,748 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:17:59,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:17:59,749 INFO L85 PathProgramCache]: Analyzing trace with hash -134745520, now seen corresponding path program 1 times [2023-12-05 21:17:59,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:17:59,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024312399] [2023-12-05 21:17:59,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:17:59,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:17:59,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:17:59,946 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:17:59,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:17:59,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024312399] [2023-12-05 21:17:59,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024312399] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:17:59,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [225592724] [2023-12-05 21:17:59,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:17:59,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:17:59,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:17:59,948 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-05 21:17:59,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-05 21:18:00,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:18:00,039 INFO L262 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-05 21:18:00,045 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:18:00,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-05 21:18:00,249 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:18:00,250 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:18:00,460 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-05 21:18:00,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [225592724] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:18:00,461 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:18:00,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2023-12-05 21:18:00,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371916269] [2023-12-05 21:18:00,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:18:00,461 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-05 21:18:00,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:18:00,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-05 21:18:00,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2023-12-05 21:18:00,464 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 281 [2023-12-05 21:18:00,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 401 transitions, 2211 flow. Second operand has 23 states, 23 states have (on average 174.82608695652175) internal successors, (4021), 23 states have internal predecessors, (4021), 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:18:00,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:18:00,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 281 [2023-12-05 21:18:00,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:18:04,782 INFO L124 PetriNetUnfolderBase]: 16547/32924 cut-off events. [2023-12-05 21:18:04,782 INFO L125 PetriNetUnfolderBase]: For 40477/48574 co-relation queries the response was YES. [2023-12-05 21:18:04,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119829 conditions, 32924 events. 16547/32924 cut-off events. For 40477/48574 co-relation queries the response was YES. Maximal size of possible extension queue 1388. Compared 340174 event pairs, 264 based on Foata normal form. 966/33243 useless extension candidates. Maximal degree in co-relation 8973. Up to 21857 conditions per place. [2023-12-05 21:18:05,289 INFO L140 encePairwiseOnDemand]: 274/281 looper letters, 232 selfloop transitions, 11 changer transitions 0/368 dead transitions. [2023-12-05 21:18:05,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 368 transitions, 2666 flow [2023-12-05 21:18:05,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-05 21:18:05,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-12-05 21:18:05,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2455 transitions. [2023-12-05 21:18:05,293 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6720503695592663 [2023-12-05 21:18:05,293 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2455 transitions. [2023-12-05 21:18:05,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2455 transitions. [2023-12-05 21:18:05,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:18:05,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2455 transitions. [2023-12-05 21:18:05,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 188.84615384615384) internal successors, (2455), 13 states have internal predecessors, (2455), 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:18:05,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 281.0) internal successors, (3934), 14 states have internal predecessors, (3934), 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:18:05,303 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 281.0) internal successors, (3934), 14 states have internal predecessors, (3934), 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:18:05,304 INFO L308 CegarLoopForPetriNet]: 240 programPoint places, -43 predicate places. [2023-12-05 21:18:05,304 INFO L500 AbstractCegarLoop]: Abstraction has has 197 places, 368 transitions, 2666 flow [2023-12-05 21:18:05,306 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 174.82608695652175) internal successors, (4021), 23 states have internal predecessors, (4021), 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:18:05,306 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:18:05,306 INFO L233 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:18:05,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-05 21:18:05,510 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:18:05,510 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:18:05,511 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:18:05,511 INFO L85 PathProgramCache]: Analyzing trace with hash 117857280, now seen corresponding path program 1 times [2023-12-05 21:18:05,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:18:05,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121456369] [2023-12-05 21:18:05,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:18:05,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:18:05,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:18:05,523 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:18:05,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:18:05,560 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:18:05,560 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:18:05,561 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-12-05 21:18:05,561 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 5 remaining) [2023-12-05 21:18:05,561 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 5 remaining) [2023-12-05 21:18:05,561 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 5 remaining) [2023-12-05 21:18:05,561 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 5 remaining) [2023-12-05 21:18:05,561 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-05 21:18:05,561 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-05 21:18:05,562 WARN L227 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:18:05,562 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-12-05 21:18:05,600 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-12-05 21:18:05,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 288 places, 339 transitions, 718 flow [2023-12-05 21:18:05,758 INFO L124 PetriNetUnfolderBase]: 136/869 cut-off events. [2023-12-05 21:18:05,758 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-12-05 21:18:05,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 920 conditions, 869 events. 136/869 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4233 event pairs, 6 based on Foata normal form. 0/691 useless extension candidates. Maximal degree in co-relation 612. Up to 32 conditions per place. [2023-12-05 21:18:05,774 INFO L82 GeneralOperation]: Start removeDead. Operand has 288 places, 339 transitions, 718 flow [2023-12-05 21:18:05,797 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 288 places, 339 transitions, 718 flow [2023-12-05 21:18:05,798 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:18:05,798 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;@6f06c0e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:18:05,798 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-12-05 21:18:05,799 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:18:05,800 INFO L124 PetriNetUnfolderBase]: 1/34 cut-off events. [2023-12-05 21:18:05,800 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:18:05,800 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:18:05,800 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:18:05,800 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:18:05,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:18:05,800 INFO L85 PathProgramCache]: Analyzing trace with hash 956430979, now seen corresponding path program 1 times [2023-12-05 21:18:05,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:18:05,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869301699] [2023-12-05 21:18:05,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:18:05,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:18:05,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:18:05,851 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:18:05,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:18:05,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869301699] [2023-12-05 21:18:05,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869301699] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:18:05,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:18:05,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:18:05,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295750293] [2023-12-05 21:18:05,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:18:05,852 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:18:05,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:18:05,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:18:05,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:18:05,853 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 339 [2023-12-05 21:18:05,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 339 transitions, 718 flow. Second operand has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 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:18:05,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:18:05,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 339 [2023-12-05 21:18:05,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand