/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_07-cond_racing2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-6bf5761-m [2023-12-05 21:14:24,311 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-05 21:14:24,392 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:14:24,417 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-05 21:14:24,418 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-05 21:14:24,418 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-05 21:14:24,419 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-05 21:14:24,419 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-05 21:14:24,419 INFO L153 SettingsManager]: * Use SBE=true [2023-12-05 21:14:24,422 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-05 21:14:24,422 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-05 21:14:24,422 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-05 21:14:24,423 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-05 21:14:24,423 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-05 21:14:24,424 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-05 21:14:24,424 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-05 21:14:24,424 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-05 21:14:24,424 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-05 21:14:24,424 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-05 21:14:24,424 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-05 21:14:24,424 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-05 21:14:24,425 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-05 21:14:24,425 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-05 21:14:24,425 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-12-05 21:14:24,425 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-05 21:14:24,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:14:24,426 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-05 21:14:24,426 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-05 21:14:24,426 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-05 21:14:24,426 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-05 21:14:24,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-05 21:14:24,427 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-05 21:14:24,427 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-05 21:14:24,427 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:14:24,648 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-05 21:14:24,665 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-05 21:14:24,667 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-05 21:14:24,668 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-05 21:14:24,668 INFO L274 PluginConnector]: CDTParser initialized [2023-12-05 21:14:24,669 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_07-cond_racing2.i [2023-12-05 21:14:25,746 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-05 21:14:25,945 INFO L384 CDTParser]: Found 1 translation units. [2023-12-05 21:14:25,945 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_07-cond_racing2.i [2023-12-05 21:14:25,958 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/440f05204/4ab6a22479854e7b8647871ff9dcd0c2/FLAGd9a7b34ba [2023-12-05 21:14:25,974 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/440f05204/4ab6a22479854e7b8647871ff9dcd0c2 [2023-12-05 21:14:25,976 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-05 21:14:25,978 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-05 21:14:25,979 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-05 21:14:25,979 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-05 21:14:25,983 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-05 21:14:25,983 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:14:25" (1/1) ... [2023-12-05 21:14:25,984 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13a8e485 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:14:25, skipping insertion in model container [2023-12-05 21:14:25,984 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 09:14:25" (1/1) ... [2023-12-05 21:14:26,027 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-05 21:14:26,309 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:14:26,318 INFO L202 MainTranslator]: Completed pre-run [2023-12-05 21:14:26,351 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-05 21:14:26,391 INFO L206 MainTranslator]: Completed translation [2023-12-05 21:14:26,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:14:26 WrapperNode [2023-12-05 21:14:26,392 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-05 21:14:26,392 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-05 21:14:26,393 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-05 21:14:26,393 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-05 21:14:26,397 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:14:26" (1/1) ... [2023-12-05 21:14:26,425 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:14:26" (1/1) ... [2023-12-05 21:14:26,449 INFO L138 Inliner]: procedures = 271, calls = 36, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 100 [2023-12-05 21:14:26,449 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-05 21:14:26,450 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-05 21:14:26,450 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-05 21:14:26,450 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-05 21:14:26,456 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:14:26" (1/1) ... [2023-12-05 21:14:26,456 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:14:26" (1/1) ... [2023-12-05 21:14:26,471 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:14:26" (1/1) ... [2023-12-05 21:14:26,471 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:14:26" (1/1) ... [2023-12-05 21:14:26,476 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:14:26" (1/1) ... [2023-12-05 21:14:26,478 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:14:26" (1/1) ... [2023-12-05 21:14:26,479 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:14:26" (1/1) ... [2023-12-05 21:14:26,480 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:14:26" (1/1) ... [2023-12-05 21:14:26,482 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-05 21:14:26,483 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-05 21:14:26,483 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-05 21:14:26,483 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-05 21:14:26,484 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:14:26" (1/1) ... [2023-12-05 21:14:26,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-05 21:14:26,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:14:26,518 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:14:26,537 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:14:26,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-05 21:14:26,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-05 21:14:26,548 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-05 21:14:26,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-05 21:14:26,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-05 21:14:26,548 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-05 21:14:26,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-05 21:14:26,549 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-12-05 21:14:26,549 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-12-05 21:14:26,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-05 21:14:26,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-05 21:14:26,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-05 21:14:26,551 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:14:26,673 INFO L241 CfgBuilder]: Building ICFG [2023-12-05 21:14:26,675 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-05 21:14:26,850 INFO L282 CfgBuilder]: Performing block encoding [2023-12-05 21:14:26,879 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-05 21:14:26,879 INFO L309 CfgBuilder]: Removed 10 assume(true) statements. [2023-12-05 21:14:26,880 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:14:26 BoogieIcfgContainer [2023-12-05 21:14:26,880 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-05 21:14:26,882 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-05 21:14:26,882 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-05 21:14:26,884 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-05 21:14:26,884 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 09:14:25" (1/3) ... [2023-12-05 21:14:26,885 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d8304d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:14:26, skipping insertion in model container [2023-12-05 21:14:26,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 09:14:26" (2/3) ... [2023-12-05 21:14:26,885 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d8304d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 09:14:26, skipping insertion in model container [2023-12-05 21:14:26,885 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 09:14:26" (3/3) ... [2023-12-05 21:14:26,886 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_07-cond_racing2.i [2023-12-05 21:14:26,898 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-05 21:14:26,898 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-12-05 21:14:26,899 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-05 21:14:26,937 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-12-05 21:14:26,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 139 transitions, 285 flow [2023-12-05 21:14:27,041 INFO L124 PetriNetUnfolderBase]: 25/196 cut-off events. [2023-12-05 21:14:27,041 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-12-05 21:14:27,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 196 events. 25/196 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 546 event pairs, 0 based on Foata normal form. 0/160 useless extension candidates. Maximal degree in co-relation 96. Up to 6 conditions per place. [2023-12-05 21:14:27,050 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 139 transitions, 285 flow [2023-12-05 21:14:27,057 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 139 transitions, 285 flow [2023-12-05 21:14:27,066 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:14:27,070 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;@43f836a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:14:27,070 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-12-05 21:14:27,085 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:14:27,086 INFO L124 PetriNetUnfolderBase]: 1/47 cut-off events. [2023-12-05 21:14:27,086 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:14:27,097 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:14:27,098 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:14:27,099 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:14:27,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:14:27,103 INFO L85 PathProgramCache]: Analyzing trace with hash -399990818, now seen corresponding path program 1 times [2023-12-05 21:14:27,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:14:27,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982306680] [2023-12-05 21:14:27,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:14:27,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:14:27,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:14:27,414 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:14:27,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:14:27,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982306680] [2023-12-05 21:14:27,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982306680] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:14:27,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:14:27,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:14:27,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971379844] [2023-12-05 21:14:27,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:14:27,424 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:14:27,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:14:27,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:14:27,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:14:27,453 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 139 [2023-12-05 21:14:27,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 139 transitions, 285 flow. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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:14:27,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:14:27,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 139 [2023-12-05 21:14:27,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:14:27,610 INFO L124 PetriNetUnfolderBase]: 73/456 cut-off events. [2023-12-05 21:14:27,610 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-12-05 21:14:27,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 631 conditions, 456 events. 73/456 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2671 event pairs, 48 based on Foata normal form. 79/487 useless extension candidates. Maximal degree in co-relation 513. Up to 121 conditions per place. [2023-12-05 21:14:27,618 INFO L140 encePairwiseOnDemand]: 123/139 looper letters, 22 selfloop transitions, 1 changer transitions 17/128 dead transitions. [2023-12-05 21:14:27,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 128 transitions, 327 flow [2023-12-05 21:14:27,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:14:27,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:14:27,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2023-12-05 21:14:27,635 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.829736211031175 [2023-12-05 21:14:27,643 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 346 transitions. [2023-12-05 21:14:27,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 346 transitions. [2023-12-05 21:14:27,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:14:27,647 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 346 transitions. [2023-12-05 21:14:27,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 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:14:27,653 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 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:14:27,653 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 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:14:27,656 INFO L308 CegarLoopForPetriNet]: 126 programPoint places, -3 predicate places. [2023-12-05 21:14:27,656 INFO L500 AbstractCegarLoop]: Abstraction has has 123 places, 128 transitions, 327 flow [2023-12-05 21:14:27,657 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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:14:27,657 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:14:27,657 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:14:27,657 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-05 21:14:27,657 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:14:27,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:14:27,658 INFO L85 PathProgramCache]: Analyzing trace with hash -399990817, now seen corresponding path program 1 times [2023-12-05 21:14:27,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:14:27,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957476034] [2023-12-05 21:14:27,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:14:27,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:14:27,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:14:27,778 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:14:27,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:14:27,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957476034] [2023-12-05 21:14:27,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957476034] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:14:27,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:14:27,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:14:27,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531820427] [2023-12-05 21:14:27,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:14:27,780 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:14:27,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:14:27,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:14:27,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:14:27,782 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 139 [2023-12-05 21:14:27,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 128 transitions, 327 flow. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 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:14:27,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:14:27,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 139 [2023-12-05 21:14:27,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:14:27,902 INFO L124 PetriNetUnfolderBase]: 117/551 cut-off events. [2023-12-05 21:14:27,903 INFO L125 PetriNetUnfolderBase]: For 102/102 co-relation queries the response was YES. [2023-12-05 21:14:27,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 982 conditions, 551 events. 117/551 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3079 event pairs, 6 based on Foata normal form. 0/485 useless extension candidates. Maximal degree in co-relation 877. Up to 174 conditions per place. [2023-12-05 21:14:27,908 INFO L140 encePairwiseOnDemand]: 133/139 looper letters, 33 selfloop transitions, 3 changer transitions 17/142 dead transitions. [2023-12-05 21:14:27,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 142 transitions, 483 flow [2023-12-05 21:14:27,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:14:27,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:14:27,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 419 transitions. [2023-12-05 21:14:27,911 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7535971223021583 [2023-12-05 21:14:27,911 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 419 transitions. [2023-12-05 21:14:27,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 419 transitions. [2023-12-05 21:14:27,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:14:27,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 419 transitions. [2023-12-05 21:14:27,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 104.75) internal successors, (419), 4 states have internal predecessors, (419), 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:14:27,916 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 139.0) internal successors, (695), 5 states have internal predecessors, (695), 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:14:27,916 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 139.0) internal successors, (695), 5 states have internal predecessors, (695), 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:14:27,917 INFO L308 CegarLoopForPetriNet]: 126 programPoint places, 0 predicate places. [2023-12-05 21:14:27,917 INFO L500 AbstractCegarLoop]: Abstraction has has 126 places, 142 transitions, 483 flow [2023-12-05 21:14:27,917 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 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:14:27,917 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:14:27,917 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:14:27,918 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-05 21:14:27,918 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:14:27,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:14:27,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1175489340, now seen corresponding path program 1 times [2023-12-05 21:14:27,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:14:27,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822762843] [2023-12-05 21:14:27,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:14:27,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:14:27,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:14:28,138 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:14:28,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:14:28,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822762843] [2023-12-05 21:14:28,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822762843] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:14:28,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404735097] [2023-12-05 21:14:28,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:14:28,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:14:28,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:14:28,144 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:14:28,180 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:14:28,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:14:28,229 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-05 21:14:28,235 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:14:28,291 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:14:28,402 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:14:28,402 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:14:28,551 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:14:28,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404735097] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:14:28,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:14:28,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-05 21:14:28,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653629618] [2023-12-05 21:14:28,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:14:28,552 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-05 21:14:28,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:14:28,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-05 21:14:28,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-12-05 21:14:28,554 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 139 [2023-12-05 21:14:28,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 142 transitions, 483 flow. Second operand has 11 states, 11 states have (on average 94.63636363636364) internal successors, (1041), 11 states have internal predecessors, (1041), 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:14:28,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:14:28,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 139 [2023-12-05 21:14:28,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:14:28,648 INFO L124 PetriNetUnfolderBase]: 30/200 cut-off events. [2023-12-05 21:14:28,648 INFO L125 PetriNetUnfolderBase]: For 111/120 co-relation queries the response was YES. [2023-12-05 21:14:28,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 414 conditions, 200 events. 30/200 cut-off events. For 111/120 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 580 event pairs, 6 based on Foata normal form. 6/206 useless extension candidates. Maximal degree in co-relation 330. Up to 46 conditions per place. [2023-12-05 21:14:28,649 INFO L140 encePairwiseOnDemand]: 132/139 looper letters, 34 selfloop transitions, 5 changer transitions 0/95 dead transitions. [2023-12-05 21:14:28,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 95 transitions, 416 flow [2023-12-05 21:14:28,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-05 21:14:28,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-12-05 21:14:28,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 685 transitions. [2023-12-05 21:14:28,651 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7040082219938335 [2023-12-05 21:14:28,651 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 685 transitions. [2023-12-05 21:14:28,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 685 transitions. [2023-12-05 21:14:28,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:14:28,652 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 685 transitions. [2023-12-05 21:14:28,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 97.85714285714286) internal successors, (685), 7 states have internal predecessors, (685), 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:14:28,654 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 139.0) internal successors, (1112), 8 states have internal predecessors, (1112), 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:14:28,655 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 139.0) internal successors, (1112), 8 states have internal predecessors, (1112), 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:14:28,655 INFO L308 CegarLoopForPetriNet]: 126 programPoint places, -37 predicate places. [2023-12-05 21:14:28,655 INFO L500 AbstractCegarLoop]: Abstraction has has 89 places, 95 transitions, 416 flow [2023-12-05 21:14:28,656 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 94.63636363636364) internal successors, (1041), 11 states have internal predecessors, (1041), 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:14:28,656 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:14:28,656 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:14:28,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-05 21:14:28,861 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:14:28,864 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:14:28,864 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:14:28,864 INFO L85 PathProgramCache]: Analyzing trace with hash 2080431527, now seen corresponding path program 1 times [2023-12-05 21:14:28,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:14:28,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901462184] [2023-12-05 21:14:28,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:14:28,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:14:28,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:14:28,883 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:14:28,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:14:28,908 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:14:28,909 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:14:28,909 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-12-05 21:14:28,910 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 5 remaining) [2023-12-05 21:14:28,911 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 5 remaining) [2023-12-05 21:14:28,911 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 5 remaining) [2023-12-05 21:14:28,911 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 5 remaining) [2023-12-05 21:14:28,911 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-05 21:14:28,912 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-05 21:14:28,913 WARN L227 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:14:28,913 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-12-05 21:14:28,935 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-12-05 21:14:28,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 172 transitions, 360 flow [2023-12-05 21:14:28,959 INFO L124 PetriNetUnfolderBase]: 43/314 cut-off events. [2023-12-05 21:14:28,959 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-12-05 21:14:28,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 326 conditions, 314 events. 43/314 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1054 event pairs, 0 based on Foata normal form. 0/253 useless extension candidates. Maximal degree in co-relation 198. Up to 9 conditions per place. [2023-12-05 21:14:28,961 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 172 transitions, 360 flow [2023-12-05 21:14:28,964 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 154 places, 172 transitions, 360 flow [2023-12-05 21:14:28,965 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:14:28,967 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;@43f836a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:14:28,967 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-12-05 21:14:28,970 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:14:28,970 INFO L124 PetriNetUnfolderBase]: 1/47 cut-off events. [2023-12-05 21:14:28,970 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:14:28,970 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:14:28,970 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:14:28,971 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:14:28,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:14:28,971 INFO L85 PathProgramCache]: Analyzing trace with hash 24382730, now seen corresponding path program 1 times [2023-12-05 21:14:28,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:14:28,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601946264] [2023-12-05 21:14:28,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:14:28,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:14:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:14:29,030 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:14:29,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:14:29,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601946264] [2023-12-05 21:14:29,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601946264] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:14:29,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:14:29,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:14:29,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311705313] [2023-12-05 21:14:29,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:14:29,032 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:14:29,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:14:29,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:14:29,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:14:29,033 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 172 [2023-12-05 21:14:29,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 172 transitions, 360 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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:14:29,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:14:29,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 172 [2023-12-05 21:14:29,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:14:29,378 INFO L124 PetriNetUnfolderBase]: 1122/3753 cut-off events. [2023-12-05 21:14:29,378 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2023-12-05 21:14:29,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5629 conditions, 3753 events. 1122/3753 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 35370 event pairs, 786 based on Foata normal form. 971/4361 useless extension candidates. Maximal degree in co-relation 749. Up to 1341 conditions per place. [2023-12-05 21:14:29,396 INFO L140 encePairwiseOnDemand]: 150/172 looper letters, 30 selfloop transitions, 1 changer transitions 17/161 dead transitions. [2023-12-05 21:14:29,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 161 transitions, 430 flow [2023-12-05 21:14:29,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:14:29,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:14:29,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2023-12-05 21:14:29,397 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8313953488372093 [2023-12-05 21:14:29,398 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 429 transitions. [2023-12-05 21:14:29,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 429 transitions. [2023-12-05 21:14:29,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:14:29,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 429 transitions. [2023-12-05 21:14:29,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 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:14:29,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 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:14:29,400 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 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:14:29,400 INFO L308 CegarLoopForPetriNet]: 154 programPoint places, -3 predicate places. [2023-12-05 21:14:29,401 INFO L500 AbstractCegarLoop]: Abstraction has has 151 places, 161 transitions, 430 flow [2023-12-05 21:14:29,401 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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:14:29,401 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:14:29,401 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:14:29,401 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-05 21:14:29,401 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:14:29,402 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:14:29,402 INFO L85 PathProgramCache]: Analyzing trace with hash 24382731, now seen corresponding path program 1 times [2023-12-05 21:14:29,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:14:29,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383865725] [2023-12-05 21:14:29,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:14:29,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:14:29,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:14:29,449 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:14:29,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:14:29,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383865725] [2023-12-05 21:14:29,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383865725] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:14:29,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:14:29,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:14:29,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620106311] [2023-12-05 21:14:29,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:14:29,450 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:14:29,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:14:29,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:14:29,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:14:29,451 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 172 [2023-12-05 21:14:29,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 161 transitions, 430 flow. Second operand has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 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:14:29,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:14:29,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 172 [2023-12-05 21:14:29,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:14:29,983 INFO L124 PetriNetUnfolderBase]: 1700/4892 cut-off events. [2023-12-05 21:14:29,983 INFO L125 PetriNetUnfolderBase]: For 1012/1012 co-relation queries the response was YES. [2023-12-05 21:14:29,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9737 conditions, 4892 events. 1700/4892 cut-off events. For 1012/1012 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 44132 event pairs, 570 based on Foata normal form. 0/4329 useless extension candidates. Maximal degree in co-relation 1249. Up to 2193 conditions per place. [2023-12-05 21:14:30,014 INFO L140 encePairwiseOnDemand]: 166/172 looper letters, 43 selfloop transitions, 3 changer transitions 29/183 dead transitions. [2023-12-05 21:14:30,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 183 transitions, 658 flow [2023-12-05 21:14:30,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:14:30,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:14:30,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 511 transitions. [2023-12-05 21:14:30,015 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7427325581395349 [2023-12-05 21:14:30,015 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 511 transitions. [2023-12-05 21:14:30,016 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 511 transitions. [2023-12-05 21:14:30,016 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:14:30,016 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 511 transitions. [2023-12-05 21:14:30,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 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:14:30,018 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 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:14:30,018 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 172.0) internal successors, (860), 5 states have internal predecessors, (860), 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:14:30,020 INFO L308 CegarLoopForPetriNet]: 154 programPoint places, 0 predicate places. [2023-12-05 21:14:30,021 INFO L500 AbstractCegarLoop]: Abstraction has has 154 places, 183 transitions, 658 flow [2023-12-05 21:14:30,021 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.25) internal successors, (457), 4 states have internal predecessors, (457), 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:14:30,021 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:14:30,021 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:14:30,021 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-05 21:14:30,021 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:14:30,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:14:30,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1317130153, now seen corresponding path program 1 times [2023-12-05 21:14:30,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:14:30,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812757496] [2023-12-05 21:14:30,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:14:30,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:14:30,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:14:30,130 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:14:30,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:14:30,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812757496] [2023-12-05 21:14:30,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812757496] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:14:30,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787980783] [2023-12-05 21:14:30,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:14:30,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:14:30,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:14:30,132 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:14:30,157 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:14:30,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:14:30,202 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-05 21:14:30,204 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:14:30,215 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:14:30,281 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:14:30,282 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:14:30,375 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:14:30,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787980783] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:14:30,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:14:30,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-05 21:14:30,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714160609] [2023-12-05 21:14:30,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:14:30,376 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-05 21:14:30,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:14:30,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-05 21:14:30,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-12-05 21:14:30,378 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 172 [2023-12-05 21:14:30,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 183 transitions, 658 flow. Second operand has 11 states, 11 states have (on average 113.63636363636364) internal successors, (1250), 11 states have internal predecessors, (1250), 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:14:30,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:14:30,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 172 [2023-12-05 21:14:30,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:14:31,030 INFO L124 PetriNetUnfolderBase]: 1636/4480 cut-off events. [2023-12-05 21:14:31,030 INFO L125 PetriNetUnfolderBase]: For 2377/2495 co-relation queries the response was YES. [2023-12-05 21:14:31,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11535 conditions, 4480 events. 1636/4480 cut-off events. For 2377/2495 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 38370 event pairs, 28 based on Foata normal form. 3/4106 useless extension candidates. Maximal degree in co-relation 1591. Up to 2059 conditions per place. [2023-12-05 21:14:31,055 INFO L140 encePairwiseOnDemand]: 163/172 looper letters, 100 selfloop transitions, 9 changer transitions 29/245 dead transitions. [2023-12-05 21:14:31,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 245 transitions, 1296 flow [2023-12-05 21:14:31,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-05 21:14:31,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-05 21:14:31,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1237 transitions. [2023-12-05 21:14:31,058 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7191860465116279 [2023-12-05 21:14:31,058 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1237 transitions. [2023-12-05 21:14:31,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1237 transitions. [2023-12-05 21:14:31,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:14:31,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1237 transitions. [2023-12-05 21:14:31,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 123.7) internal successors, (1237), 10 states have internal predecessors, (1237), 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:14:31,063 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 172.0) internal successors, (1892), 11 states have internal predecessors, (1892), 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:14:31,063 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 172.0) internal successors, (1892), 11 states have internal predecessors, (1892), 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:14:31,064 INFO L308 CegarLoopForPetriNet]: 154 programPoint places, 8 predicate places. [2023-12-05 21:14:31,064 INFO L500 AbstractCegarLoop]: Abstraction has has 162 places, 245 transitions, 1296 flow [2023-12-05 21:14:31,064 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 113.63636363636364) internal successors, (1250), 11 states have internal predecessors, (1250), 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:14:31,064 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:14:31,065 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:14:31,074 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:14:31,272 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:14:31,272 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:14:31,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:14:31,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1852172552, now seen corresponding path program 1 times [2023-12-05 21:14:31,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:14:31,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989189003] [2023-12-05 21:14:31,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:14:31,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:14:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:14:31,283 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:14:31,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:14:31,294 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:14:31,295 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:14:31,295 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-12-05 21:14:31,295 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 5 remaining) [2023-12-05 21:14:31,295 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 5 remaining) [2023-12-05 21:14:31,295 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 5 remaining) [2023-12-05 21:14:31,295 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 5 remaining) [2023-12-05 21:14:31,295 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-05 21:14:31,296 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-05 21:14:31,296 WARN L227 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:14:31,296 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-12-05 21:14:31,312 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-12-05 21:14:31,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 205 transitions, 437 flow [2023-12-05 21:14:31,340 INFO L124 PetriNetUnfolderBase]: 66/471 cut-off events. [2023-12-05 21:14:31,340 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-12-05 21:14:31,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 496 conditions, 471 events. 66/471 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1767 event pairs, 1 based on Foata normal form. 0/377 useless extension candidates. Maximal degree in co-relation 322. Up to 16 conditions per place. [2023-12-05 21:14:31,343 INFO L82 GeneralOperation]: Start removeDead. Operand has 182 places, 205 transitions, 437 flow [2023-12-05 21:14:31,345 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 182 places, 205 transitions, 437 flow [2023-12-05 21:14:31,346 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:14:31,347 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;@43f836a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:14:31,347 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-12-05 21:14:31,349 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:14:31,349 INFO L124 PetriNetUnfolderBase]: 1/47 cut-off events. [2023-12-05 21:14:31,349 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:14:31,349 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:14:31,349 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:14:31,349 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:14:31,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:14:31,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1966897225, now seen corresponding path program 1 times [2023-12-05 21:14:31,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:14:31,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543098114] [2023-12-05 21:14:31,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:14:31,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:14:31,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:14:31,372 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:14:31,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:14:31,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543098114] [2023-12-05 21:14:31,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543098114] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:14:31,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:14:31,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:14:31,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54284544] [2023-12-05 21:14:31,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:14:31,373 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:14:31,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:14:31,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:14:31,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:14:31,374 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 205 [2023-12-05 21:14:31,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 205 transitions, 437 flow. Second operand has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 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:14:31,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:14:31,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 205 [2023-12-05 21:14:31,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:14:34,381 INFO L124 PetriNetUnfolderBase]: 12842/32105 cut-off events. [2023-12-05 21:14:34,381 INFO L125 PetriNetUnfolderBase]: For 925/925 co-relation queries the response was YES. [2023-12-05 21:14:34,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50715 conditions, 32105 events. 12842/32105 cut-off events. For 925/925 co-relation queries the response was YES. Maximal size of possible extension queue 1268. Compared 373806 event pairs, 9043 based on Foata normal form. 10178/39589 useless extension candidates. Maximal degree in co-relation 5618. Up to 13148 conditions per place. [2023-12-05 21:14:34,690 INFO L140 encePairwiseOnDemand]: 177/205 looper letters, 38 selfloop transitions, 1 changer transitions 23/194 dead transitions. [2023-12-05 21:14:34,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 194 transitions, 535 flow [2023-12-05 21:14:34,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:14:34,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:14:34,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 512 transitions. [2023-12-05 21:14:34,692 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.832520325203252 [2023-12-05 21:14:34,692 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 512 transitions. [2023-12-05 21:14:34,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 512 transitions. [2023-12-05 21:14:34,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:14:34,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 512 transitions. [2023-12-05 21:14:34,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 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:14:34,694 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 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:14:34,695 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 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:14:34,695 INFO L308 CegarLoopForPetriNet]: 182 programPoint places, -3 predicate places. [2023-12-05 21:14:34,695 INFO L500 AbstractCegarLoop]: Abstraction has has 179 places, 194 transitions, 535 flow [2023-12-05 21:14:34,695 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 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:14:34,695 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:14:34,695 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:14:34,696 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-05 21:14:34,696 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:14:34,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:14:34,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1966897224, now seen corresponding path program 1 times [2023-12-05 21:14:34,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:14:34,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869801540] [2023-12-05 21:14:34,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:14:34,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:14:34,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:14:34,740 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:14:34,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:14:34,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869801540] [2023-12-05 21:14:34,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869801540] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:14:34,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:14:34,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:14:34,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574795333] [2023-12-05 21:14:34,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:14:34,741 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-05 21:14:34,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:14:34,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-05 21:14:34,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-05 21:14:34,742 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 205 [2023-12-05 21:14:34,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 194 transitions, 535 flow. Second operand has 4 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 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:14:34,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:14:34,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 205 [2023-12-05 21:14:34,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:14:38,736 INFO L124 PetriNetUnfolderBase]: 17746/43198 cut-off events. [2023-12-05 21:14:38,736 INFO L125 PetriNetUnfolderBase]: For 7453/8771 co-relation queries the response was YES. [2023-12-05 21:14:38,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91421 conditions, 43198 events. 17746/43198 cut-off events. For 7453/8771 co-relation queries the response was YES. Maximal size of possible extension queue 1322. Compared 507025 event pairs, 8953 based on Foata normal form. 0/40688 useless extension candidates. Maximal degree in co-relation 9905. Up to 21545 conditions per place. [2023-12-05 21:14:39,092 INFO L140 encePairwiseOnDemand]: 199/205 looper letters, 51 selfloop transitions, 3 changer transitions 41/222 dead transitions. [2023-12-05 21:14:39,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 222 transitions, 827 flow [2023-12-05 21:14:39,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-05 21:14:39,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-12-05 21:14:39,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 601 transitions. [2023-12-05 21:14:39,095 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7329268292682927 [2023-12-05 21:14:39,095 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 601 transitions. [2023-12-05 21:14:39,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 601 transitions. [2023-12-05 21:14:39,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:14:39,096 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 601 transitions. [2023-12-05 21:14:39,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 150.25) internal successors, (601), 4 states have internal predecessors, (601), 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:14:39,098 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 205.0) internal successors, (1025), 5 states have internal predecessors, (1025), 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:14:39,098 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 205.0) internal successors, (1025), 5 states have internal predecessors, (1025), 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:14:39,100 INFO L308 CegarLoopForPetriNet]: 182 programPoint places, 0 predicate places. [2023-12-05 21:14:39,100 INFO L500 AbstractCegarLoop]: Abstraction has has 182 places, 222 transitions, 827 flow [2023-12-05 21:14:39,100 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 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:14:39,100 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:14:39,100 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:14:39,100 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-05 21:14:39,100 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:14:39,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:14:39,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1081587959, now seen corresponding path program 1 times [2023-12-05 21:14:39,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:14:39,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672598576] [2023-12-05 21:14:39,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:14:39,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:14:39,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:14:39,203 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:14:39,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:14:39,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672598576] [2023-12-05 21:14:39,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672598576] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:14:39,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968496514] [2023-12-05 21:14:39,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:14:39,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:14:39,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:14:39,204 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:14:39,207 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:14:39,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:14:39,274 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-05 21:14:39,278 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:14:39,288 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:14:39,347 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:14:39,347 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:14:39,421 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:14:39,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1968496514] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:14:39,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:14:39,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-12-05 21:14:39,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652597135] [2023-12-05 21:14:39,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:14:39,422 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-05 21:14:39,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:14:39,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-05 21:14:39,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-12-05 21:14:39,424 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 205 [2023-12-05 21:14:39,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 222 transitions, 827 flow. Second operand has 11 states, 11 states have (on average 132.63636363636363) internal successors, (1459), 11 states have internal predecessors, (1459), 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:14:39,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:14:39,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 205 [2023-12-05 21:14:39,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:14:43,671 INFO L124 PetriNetUnfolderBase]: 19446/43318 cut-off events. [2023-12-05 21:14:43,671 INFO L125 PetriNetUnfolderBase]: For 22148/26790 co-relation queries the response was YES. [2023-12-05 21:14:43,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119100 conditions, 43318 events. 19446/43318 cut-off events. For 22148/26790 co-relation queries the response was YES. Maximal size of possible extension queue 1172. Compared 474536 event pairs, 1127 based on Foata normal form. 3/39247 useless extension candidates. Maximal degree in co-relation 12695. Up to 22293 conditions per place. [2023-12-05 21:14:44,035 INFO L140 encePairwiseOnDemand]: 195/205 looper letters, 120 selfloop transitions, 11 changer transitions 41/298 dead transitions. [2023-12-05 21:14:44,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 298 transitions, 1603 flow [2023-12-05 21:14:44,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-05 21:14:44,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-12-05 21:14:44,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1455 transitions. [2023-12-05 21:14:44,038 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.7097560975609756 [2023-12-05 21:14:44,038 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1455 transitions. [2023-12-05 21:14:44,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1455 transitions. [2023-12-05 21:14:44,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:14:44,039 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1455 transitions. [2023-12-05 21:14:44,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 145.5) internal successors, (1455), 10 states have internal predecessors, (1455), 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:14:44,043 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 205.0) internal successors, (2255), 11 states have internal predecessors, (2255), 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:14:44,043 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 205.0) internal successors, (2255), 11 states have internal predecessors, (2255), 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:14:44,046 INFO L308 CegarLoopForPetriNet]: 182 programPoint places, 9 predicate places. [2023-12-05 21:14:44,047 INFO L500 AbstractCegarLoop]: Abstraction has has 191 places, 298 transitions, 1603 flow [2023-12-05 21:14:44,047 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 132.63636363636363) internal successors, (1459), 11 states have internal predecessors, (1459), 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:14:44,047 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:14:44,047 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 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, 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:14:44,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-05 21:14:44,251 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:14:44,252 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:14:44,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:14:44,252 INFO L85 PathProgramCache]: Analyzing trace with hash 834964396, now seen corresponding path program 1 times [2023-12-05 21:14:44,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:14:44,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680957869] [2023-12-05 21:14:44,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:14:44,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:14:44,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:14:44,289 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-05 21:14:44,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:14:44,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680957869] [2023-12-05 21:14:44,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680957869] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:14:44,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:14:44,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:14:44,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327195390] [2023-12-05 21:14:44,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:14:44,290 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:14:44,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:14:44,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:14:44,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:14:44,291 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 205 [2023-12-05 21:14:44,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 298 transitions, 1603 flow. Second operand has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 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:14:44,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:14:44,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 205 [2023-12-05 21:14:44,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:14:51,936 INFO L124 PetriNetUnfolderBase]: 35492/74138 cut-off events. [2023-12-05 21:14:51,936 INFO L125 PetriNetUnfolderBase]: For 106689/110601 co-relation queries the response was YES. [2023-12-05 21:14:52,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250255 conditions, 74138 events. 35492/74138 cut-off events. For 106689/110601 co-relation queries the response was YES. Maximal size of possible extension queue 2044. Compared 839005 event pairs, 1895 based on Foata normal form. 7/68432 useless extension candidates. Maximal degree in co-relation 25932. Up to 39570 conditions per place. [2023-12-05 21:14:52,755 INFO L140 encePairwiseOnDemand]: 201/205 looper letters, 133 selfloop transitions, 2 changer transitions 78/362 dead transitions. [2023-12-05 21:14:52,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 362 transitions, 2524 flow [2023-12-05 21:14:52,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:14:52,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:14:52,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2023-12-05 21:14:52,756 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8048780487804879 [2023-12-05 21:14:52,756 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 495 transitions. [2023-12-05 21:14:52,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 495 transitions. [2023-12-05 21:14:52,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:14:52,757 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 495 transitions. [2023-12-05 21:14:52,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 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:14:52,759 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 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:14:52,759 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 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:14:52,759 INFO L308 CegarLoopForPetriNet]: 182 programPoint places, 11 predicate places. [2023-12-05 21:14:52,759 INFO L500 AbstractCegarLoop]: Abstraction has has 193 places, 362 transitions, 2524 flow [2023-12-05 21:14:52,759 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.33333333333334) internal successors, (436), 3 states have internal predecessors, (436), 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:14:52,760 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:14:52,760 INFO L233 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 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, 1, 1, 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:14:52,760 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-05 21:14:52,760 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:14:52,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:14:52,760 INFO L85 PathProgramCache]: Analyzing trace with hash 137572658, now seen corresponding path program 1 times [2023-12-05 21:14:52,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:14:52,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886350326] [2023-12-05 21:14:52,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:14:52,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:14:52,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:14:52,902 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-05 21:14:52,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:14:52,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886350326] [2023-12-05 21:14:52,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886350326] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:14:52,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:14:52,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-05 21:14:52,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463637109] [2023-12-05 21:14:52,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:14:52,903 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:14:52,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:14:52,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:14:52,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:14:52,904 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 205 [2023-12-05 21:14:52,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 362 transitions, 2524 flow. Second operand has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 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:14:52,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:14:52,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 205 [2023-12-05 21:14:52,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:15:02,404 INFO L124 PetriNetUnfolderBase]: 40212/84370 cut-off events. [2023-12-05 21:15:02,404 INFO L125 PetriNetUnfolderBase]: For 189366/194620 co-relation queries the response was YES. [2023-12-05 21:15:02,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 335670 conditions, 84370 events. 40212/84370 cut-off events. For 189366/194620 co-relation queries the response was YES. Maximal size of possible extension queue 2109. Compared 964633 event pairs, 1143 based on Foata normal form. 28/77884 useless extension candidates. Maximal degree in co-relation 34101. Up to 45003 conditions per place. [2023-12-05 21:15:03,298 INFO L140 encePairwiseOnDemand]: 201/205 looper letters, 171 selfloop transitions, 2 changer transitions 133/455 dead transitions. [2023-12-05 21:15:03,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 455 transitions, 4073 flow [2023-12-05 21:15:03,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-05 21:15:03,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-12-05 21:15:03,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 493 transitions. [2023-12-05 21:15:03,300 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.8016260162601626 [2023-12-05 21:15:03,300 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 493 transitions. [2023-12-05 21:15:03,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 493 transitions. [2023-12-05 21:15:03,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:15:03,300 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 493 transitions. [2023-12-05 21:15:03,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 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:15:03,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 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:15:03,302 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 205.0) internal successors, (820), 4 states have internal predecessors, (820), 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:15:03,302 INFO L308 CegarLoopForPetriNet]: 182 programPoint places, 13 predicate places. [2023-12-05 21:15:03,302 INFO L500 AbstractCegarLoop]: Abstraction has has 195 places, 455 transitions, 4073 flow [2023-12-05 21:15:03,302 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 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:15:03,302 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:15:03,303 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:15:03,303 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-05 21:15:03,303 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 2 more)] === [2023-12-05 21:15:03,303 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:15:03,303 INFO L85 PathProgramCache]: Analyzing trace with hash -734692398, now seen corresponding path program 1 times [2023-12-05 21:15:03,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:15:03,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921826231] [2023-12-05 21:15:03,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:03,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:15:03,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:15:03,468 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:15:03,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:15:03,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921826231] [2023-12-05 21:15:03,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921826231] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-05 21:15:03,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [515250926] [2023-12-05 21:15:03,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:03,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:15:03,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-05 21:15:03,470 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:15:03,472 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:15:03,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:15:03,558 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-05 21:15:03,561 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-05 21:15:03,568 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:15:03,886 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:15:03,886 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-05 21:15:04,091 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:15:04,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [515250926] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-05 21:15:04,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-05 21:15:04,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 22 [2023-12-05 21:15:04,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610313297] [2023-12-05 21:15:04,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-05 21:15:04,092 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-05 21:15:04,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:15:04,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-05 21:15:04,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2023-12-05 21:15:04,094 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 205 [2023-12-05 21:15:04,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 455 transitions, 4073 flow. Second operand has 23 states, 23 states have (on average 132.82608695652175) internal successors, (3055), 23 states have internal predecessors, (3055), 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:15:04,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:15:04,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 205 [2023-12-05 21:15:04,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-12-05 21:15:05,855 INFO L124 PetriNetUnfolderBase]: 5490/10952 cut-off events. [2023-12-05 21:15:05,856 INFO L125 PetriNetUnfolderBase]: For 43788/46379 co-relation queries the response was YES. [2023-12-05 21:15:05,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52539 conditions, 10952 events. 5490/10952 cut-off events. For 43788/46379 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 92672 event pairs, 72 based on Foata normal form. 273/11069 useless extension candidates. Maximal degree in co-relation 5440. Up to 7466 conditions per place. [2023-12-05 21:15:05,961 INFO L140 encePairwiseOnDemand]: 198/205 looper letters, 160 selfloop transitions, 11 changer transitions 0/265 dead transitions. [2023-12-05 21:15:05,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 265 transitions, 2480 flow [2023-12-05 21:15:05,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-05 21:15:05,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-12-05 21:15:05,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1846 transitions. [2023-12-05 21:15:05,964 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.6926829268292682 [2023-12-05 21:15:05,964 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1846 transitions. [2023-12-05 21:15:05,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1846 transitions. [2023-12-05 21:15:05,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-12-05 21:15:05,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1846 transitions. [2023-12-05 21:15:05,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 142.0) internal successors, (1846), 13 states have internal predecessors, (1846), 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:15:05,970 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 205.0) internal successors, (2870), 14 states have internal predecessors, (2870), 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:15:05,971 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 205.0) internal successors, (2870), 14 states have internal predecessors, (2870), 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:15:05,971 INFO L308 CegarLoopForPetriNet]: 182 programPoint places, -20 predicate places. [2023-12-05 21:15:05,971 INFO L500 AbstractCegarLoop]: Abstraction has has 162 places, 265 transitions, 2480 flow [2023-12-05 21:15:05,972 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 132.82608695652175) internal successors, (3055), 23 states have internal predecessors, (3055), 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:15:05,972 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:15:05,973 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:15:05,979 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:15:06,179 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-05 21:15:06,179 INFO L425 AbstractCegarLoop]: === Iteration 7 === 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:15:06,180 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:15:06,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1300627064, now seen corresponding path program 1 times [2023-12-05 21:15:06,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:15:06,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56738038] [2023-12-05 21:15:06,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:06,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:15:06,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:15:06,198 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-05 21:15:06,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-05 21:15:06,214 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-05 21:15:06,215 INFO L372 BasicCegarLoop]: Counterexample is feasible [2023-12-05 21:15:06,215 INFO L810 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining) [2023-12-05 21:15:06,215 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 5 remaining) [2023-12-05 21:15:06,215 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 5 remaining) [2023-12-05 21:15:06,215 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 5 remaining) [2023-12-05 21:15:06,215 INFO L810 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 5 remaining) [2023-12-05 21:15:06,215 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-05 21:15:06,215 INFO L457 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:15:06,217 WARN L227 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-12-05 21:15:06,217 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-12-05 21:15:06,238 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-12-05 21:15:06,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 210 places, 238 transitions, 516 flow [2023-12-05 21:15:06,289 INFO L124 PetriNetUnfolderBase]: 101/708 cut-off events. [2023-12-05 21:15:06,289 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-12-05 21:15:06,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 759 conditions, 708 events. 101/708 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2984 event pairs, 6 based on Foata normal form. 0/565 useless extension candidates. Maximal degree in co-relation 491. Up to 32 conditions per place. [2023-12-05 21:15:06,298 INFO L82 GeneralOperation]: Start removeDead. Operand has 210 places, 238 transitions, 516 flow [2023-12-05 21:15:06,305 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 210 places, 238 transitions, 516 flow [2023-12-05 21:15:06,307 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-05 21:15:06,308 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;@43f836a8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-05 21:15:06,308 INFO L363 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-12-05 21:15:06,310 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-12-05 21:15:06,310 INFO L124 PetriNetUnfolderBase]: 1/49 cut-off events. [2023-12-05 21:15:06,310 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-12-05 21:15:06,310 INFO L225 CegarLoopForPetriNet]: Found error trace [2023-12-05 21:15:06,310 INFO L233 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-05 21:15:06,310 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:15:06,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-05 21:15:06,310 INFO L85 PathProgramCache]: Analyzing trace with hash -2078863387, now seen corresponding path program 1 times [2023-12-05 21:15:06,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-05 21:15:06,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280618948] [2023-12-05 21:15:06,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-05 21:15:06,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-05 21:15:06,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-05 21:15:06,335 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:15:06,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-05 21:15:06,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280618948] [2023-12-05 21:15:06,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280618948] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-05 21:15:06,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-05 21:15:06,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-05 21:15:06,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276842185] [2023-12-05 21:15:06,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-05 21:15:06,336 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-05 21:15:06,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-05 21:15:06,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-05 21:15:06,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-05 21:15:06,338 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 238 [2023-12-05 21:15:06,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 238 transitions, 516 flow. Second operand has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 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:15:06,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-12-05 21:15:06,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 238 [2023-12-05 21:15:06,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand