/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true -i ../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-29 21:43:30,596 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 21:43:30,663 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-29 21:43:30,684 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 21:43:30,685 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 21:43:30,685 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 21:43:30,685 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 21:43:30,686 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 21:43:30,686 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 21:43:30,686 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 21:43:30,686 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 21:43:30,687 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 21:43:30,687 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 21:43:30,687 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 21:43:30,687 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 21:43:30,687 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 21:43:30,688 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 21:43:30,688 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 21:43:30,688 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 21:43:30,688 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 21:43:30,688 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 21:43:30,689 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 21:43:30,689 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 21:43:30,689 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-29 21:43:30,689 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 21:43:30,690 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-29 21:43:30,690 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 21:43:30,690 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 21:43:30,690 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 21:43:30,690 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 21:43:30,691 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 21:43:30,691 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 21:43:30,691 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 21:43:30,691 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true [2023-11-29 21:43:30,860 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 21:43:30,879 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 21:43:30,881 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 21:43:30,882 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 21:43:30,882 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 21:43:30,883 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-2.wvr.c [2023-11-29 21:43:32,062 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 21:43:32,307 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 21:43:32,309 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-2.wvr.c [2023-11-29 21:43:32,324 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1754a7d6d/7a02d11d1fcf47cebd64d1159a9af022/FLAG9c2f8ed3f [2023-11-29 21:43:32,340 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1754a7d6d/7a02d11d1fcf47cebd64d1159a9af022 [2023-11-29 21:43:32,342 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 21:43:32,343 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-29 21:43:32,344 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 21:43:32,344 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 21:43:32,347 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 21:43:32,347 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 09:43:32" (1/1) ... [2023-11-29 21:43:32,348 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9742871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:43:32, skipping insertion in model container [2023-11-29 21:43:32,348 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 09:43:32" (1/1) ... [2023-11-29 21:43:32,365 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 21:43:32,475 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-2.wvr.c[4303,4316] [2023-11-29 21:43:32,482 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 21:43:32,489 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 21:43:32,509 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-2.wvr.c[4303,4316] [2023-11-29 21:43:32,512 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 21:43:32,517 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 21:43:32,518 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 21:43:32,522 INFO L206 MainTranslator]: Completed translation [2023-11-29 21:43:32,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:43:32 WrapperNode [2023-11-29 21:43:32,523 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 21:43:32,524 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 21:43:32,524 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 21:43:32,524 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 21:43:32,528 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:43:32" (1/1) ... [2023-11-29 21:43:32,536 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:43:32" (1/1) ... [2023-11-29 21:43:32,564 INFO L138 Inliner]: procedures = 29, calls = 88, calls flagged for inlining = 22, calls inlined = 32, statements flattened = 409 [2023-11-29 21:43:32,564 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 21:43:32,565 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 21:43:32,565 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 21:43:32,565 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 21:43:32,578 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:43:32" (1/1) ... [2023-11-29 21:43:32,578 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:43:32" (1/1) ... [2023-11-29 21:43:32,590 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:43:32" (1/1) ... [2023-11-29 21:43:32,591 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:43:32" (1/1) ... [2023-11-29 21:43:32,600 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:43:32" (1/1) ... [2023-11-29 21:43:32,603 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:43:32" (1/1) ... [2023-11-29 21:43:32,610 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:43:32" (1/1) ... [2023-11-29 21:43:32,611 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:43:32" (1/1) ... [2023-11-29 21:43:32,628 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 21:43:32,629 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 21:43:32,629 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 21:43:32,629 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 21:43:32,630 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:43:32" (1/1) ... [2023-11-29 21:43:32,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-29 21:43:32,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 21:43:32,663 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-29 21:43:32,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-29 21:43:32,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 21:43:32,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 21:43:32,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-29 21:43:32,732 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-29 21:43:32,732 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-29 21:43:32,732 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-29 21:43:32,732 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-29 21:43:32,732 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-29 21:43:32,733 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-29 21:43:32,733 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-29 21:43:32,733 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-11-29 21:43:32,733 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-11-29 21:43:32,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-29 21:43:32,733 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2023-11-29 21:43:32,733 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2023-11-29 21:43:32,733 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2023-11-29 21:43:32,733 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2023-11-29 21:43:32,733 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 21:43:32,733 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 21:43:32,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 21:43:32,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 21:43:32,734 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 21:43:32,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 21:43:32,735 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 21:43:32,825 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 21:43:32,826 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 21:43:33,262 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 21:43:33,556 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 21:43:33,557 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-29 21:43:33,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 09:43:33 BoogieIcfgContainer [2023-11-29 21:43:33,558 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 21:43:33,560 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 21:43:33,560 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 21:43:33,571 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 21:43:33,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 09:43:32" (1/3) ... [2023-11-29 21:43:33,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@303a0b2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 09:43:33, skipping insertion in model container [2023-11-29 21:43:33,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 09:43:32" (2/3) ... [2023-11-29 21:43:33,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@303a0b2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 09:43:33, skipping insertion in model container [2023-11-29 21:43:33,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 09:43:33" (3/3) ... [2023-11-29 21:43:33,573 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-2.wvr.c [2023-11-29 21:43:33,585 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 21:43:33,586 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 21:43:33,586 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 21:43:33,713 INFO L144 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2023-11-29 21:43:33,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 327 places, 331 transitions, 728 flow [2023-11-29 21:43:33,871 INFO L124 PetriNetUnfolderBase]: 21/285 cut-off events. [2023-11-29 21:43:33,871 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-29 21:43:33,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 314 conditions, 285 events. 21/285 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 325 event pairs, 0 based on Foata normal form. 0/263 useless extension candidates. Maximal degree in co-relation 243. Up to 3 conditions per place. [2023-11-29 21:43:33,879 INFO L82 GeneralOperation]: Start removeDead. Operand has 327 places, 331 transitions, 728 flow [2023-11-29 21:43:33,887 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 274 places, 276 transitions, 600 flow [2023-11-29 21:43:33,894 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 21:43:33,897 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;@76b9158e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 21:43:33,898 INFO L363 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2023-11-29 21:43:34,040 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 21:43:34,041 INFO L124 PetriNetUnfolderBase]: 21/275 cut-off events. [2023-11-29 21:43:34,041 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-29 21:43:34,041 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:43:34,042 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-29 21:43:34,042 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-11-29 21:43:34,046 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:43:34,046 INFO L85 PathProgramCache]: Analyzing trace with hash 864518925, now seen corresponding path program 1 times [2023-11-29 21:43:34,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:43:34,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382949987] [2023-11-29 21:43:34,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:43:34,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:43:34,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:43:34,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:43:34,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:43:34,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382949987] [2023-11-29 21:43:34,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382949987] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:43:34,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:43:34,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 21:43:34,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221459691] [2023-11-29 21:43:34,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:43:34,344 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 21:43:34,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:43:34,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 21:43:34,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 21:43:34,375 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 284 out of 335 [2023-11-29 21:43:34,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 276 transitions, 600 flow. Second operand has 2 states, 2 states have (on average 293.0) internal successors, (586), 2 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:43:34,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:43:34,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 284 of 335 [2023-11-29 21:43:34,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:43:35,014 INFO L124 PetriNetUnfolderBase]: 1314/3588 cut-off events. [2023-11-29 21:43:35,014 INFO L125 PetriNetUnfolderBase]: For 1072/1072 co-relation queries the response was YES. [2023-11-29 21:43:35,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6155 conditions, 3588 events. 1314/3588 cut-off events. For 1072/1072 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 26010 event pairs, 568 based on Foata normal form. 606/3559 useless extension candidates. Maximal degree in co-relation 5796. Up to 1657 conditions per place. [2023-11-29 21:43:35,047 INFO L140 encePairwiseOnDemand]: 323/335 looper letters, 26 selfloop transitions, 0 changer transitions 5/264 dead transitions. [2023-11-29 21:43:35,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 264 transitions, 628 flow [2023-11-29 21:43:35,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 21:43:35,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-29 21:43:35,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 606 transitions. [2023-11-29 21:43:35,060 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9044776119402985 [2023-11-29 21:43:35,060 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 606 transitions. [2023-11-29 21:43:35,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 606 transitions. [2023-11-29 21:43:35,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:43:35,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 606 transitions. [2023-11-29 21:43:35,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 303.0) internal successors, (606), 2 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:43:35,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 335.0) internal successors, (1005), 3 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:43:35,072 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 335.0) internal successors, (1005), 3 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:43:35,075 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 1 predicate places. [2023-11-29 21:43:35,075 INFO L500 AbstractCegarLoop]: Abstraction has has 275 places, 264 transitions, 628 flow [2023-11-29 21:43:35,075 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 293.0) internal successors, (586), 2 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:43:35,075 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:43:35,076 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-29 21:43:35,076 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 21:43:35,077 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-11-29 21:43:35,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:43:35,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1336876846, now seen corresponding path program 1 times [2023-11-29 21:43:35,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:43:35,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286408168] [2023-11-29 21:43:35,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:43:35,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:43:35,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:43:36,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:43:36,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:43:36,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286408168] [2023-11-29 21:43:36,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286408168] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:43:36,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:43:36,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-29 21:43:36,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39145711] [2023-11-29 21:43:36,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:43:36,430 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 21:43:36,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:43:36,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 21:43:36,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2023-11-29 21:43:36,435 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 335 [2023-11-29 21:43:36,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 264 transitions, 628 flow. Second operand has 13 states, 13 states have (on average 218.6153846153846) internal successors, (2842), 13 states have internal predecessors, (2842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:43:36,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:43:36,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 335 [2023-11-29 21:43:36,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:43:38,104 INFO L124 PetriNetUnfolderBase]: 3012/7511 cut-off events. [2023-11-29 21:43:38,104 INFO L125 PetriNetUnfolderBase]: For 4416/4768 co-relation queries the response was YES. [2023-11-29 21:43:38,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17359 conditions, 7511 events. 3012/7511 cut-off events. For 4416/4768 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 61828 event pairs, 668 based on Foata normal form. 116/6486 useless extension candidates. Maximal degree in co-relation 13142. Up to 3651 conditions per place. [2023-11-29 21:43:38,154 INFO L140 encePairwiseOnDemand]: 316/335 looper letters, 120 selfloop transitions, 9 changer transitions 112/410 dead transitions. [2023-11-29 21:43:38,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 410 transitions, 1792 flow [2023-11-29 21:43:38,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 21:43:38,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-11-29 21:43:38,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 4294 transitions. [2023-11-29 21:43:38,161 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6746268656716418 [2023-11-29 21:43:38,161 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 4294 transitions. [2023-11-29 21:43:38,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 4294 transitions. [2023-11-29 21:43:38,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:43:38,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 4294 transitions. [2023-11-29 21:43:38,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 226.0) internal successors, (4294), 19 states have internal predecessors, (4294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:43:38,177 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 335.0) internal successors, (6700), 20 states have internal predecessors, (6700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:43:38,180 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 335.0) internal successors, (6700), 20 states have internal predecessors, (6700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:43:38,180 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 19 predicate places. [2023-11-29 21:43:38,180 INFO L500 AbstractCegarLoop]: Abstraction has has 293 places, 410 transitions, 1792 flow [2023-11-29 21:43:38,182 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 218.6153846153846) internal successors, (2842), 13 states have internal predecessors, (2842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:43:38,182 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:43:38,182 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-29 21:43:38,182 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 21:43:38,183 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-11-29 21:43:38,184 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:43:38,184 INFO L85 PathProgramCache]: Analyzing trace with hash 2053968197, now seen corresponding path program 1 times [2023-11-29 21:43:38,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:43:38,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795629467] [2023-11-29 21:43:38,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:43:38,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:43:38,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:43:39,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 21:43:39,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:43:39,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795629467] [2023-11-29 21:43:39,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795629467] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:43:39,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:43:39,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 21:43:39,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438980129] [2023-11-29 21:43:39,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:43:39,049 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 21:43:39,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:43:39,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 21:43:39,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-11-29 21:43:39,052 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 335 [2023-11-29 21:43:39,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 410 transitions, 1792 flow. Second operand has 10 states, 10 states have (on average 243.5) internal successors, (2435), 10 states have internal predecessors, (2435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:43:39,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:43:39,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 335 [2023-11-29 21:43:39,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:43:40,717 INFO L124 PetriNetUnfolderBase]: 3693/9335 cut-off events. [2023-11-29 21:43:40,717 INFO L125 PetriNetUnfolderBase]: For 9643/10971 co-relation queries the response was YES. [2023-11-29 21:43:40,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26038 conditions, 9335 events. 3693/9335 cut-off events. For 9643/10971 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 82045 event pairs, 468 based on Foata normal form. 81/7982 useless extension candidates. Maximal degree in co-relation 19846. Up to 4484 conditions per place. [2023-11-29 21:43:40,791 INFO L140 encePairwiseOnDemand]: 317/335 looper letters, 124 selfloop transitions, 12 changer transitions 161/499 dead transitions. [2023-11-29 21:43:40,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 499 transitions, 3002 flow [2023-11-29 21:43:40,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 21:43:40,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-29 21:43:40,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 3485 transitions. [2023-11-29 21:43:40,796 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7430703624733476 [2023-11-29 21:43:40,796 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 3485 transitions. [2023-11-29 21:43:40,796 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 3485 transitions. [2023-11-29 21:43:40,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:43:40,797 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 3485 transitions. [2023-11-29 21:43:40,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 248.92857142857142) internal successors, (3485), 14 states have internal predecessors, (3485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:43:40,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 335.0) internal successors, (5025), 15 states have internal predecessors, (5025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:43:40,808 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 335.0) internal successors, (5025), 15 states have internal predecessors, (5025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:43:40,809 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 32 predicate places. [2023-11-29 21:43:40,809 INFO L500 AbstractCegarLoop]: Abstraction has has 306 places, 499 transitions, 3002 flow [2023-11-29 21:43:40,810 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 243.5) internal successors, (2435), 10 states have internal predecessors, (2435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:43:40,810 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:43:40,810 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-29 21:43:40,810 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 21:43:40,810 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-11-29 21:43:40,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:43:40,811 INFO L85 PathProgramCache]: Analyzing trace with hash -748075625, now seen corresponding path program 2 times [2023-11-29 21:43:40,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:43:40,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399940325] [2023-11-29 21:43:40,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:43:40,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:43:40,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:43:41,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 21:43:41,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:43:41,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399940325] [2023-11-29 21:43:41,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399940325] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:43:41,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 21:43:41,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 21:43:41,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128937329] [2023-11-29 21:43:41,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:43:41,847 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 21:43:41,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:43:41,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 21:43:41,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-29 21:43:41,850 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 335 [2023-11-29 21:43:41,851 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 499 transitions, 3002 flow. Second operand has 10 states, 10 states have (on average 243.5) internal successors, (2435), 10 states have internal predecessors, (2435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:43:41,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:43:41,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 335 [2023-11-29 21:43:41,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:43:44,175 INFO L124 PetriNetUnfolderBase]: 3693/9307 cut-off events. [2023-11-29 21:43:44,175 INFO L125 PetriNetUnfolderBase]: For 15216/16958 co-relation queries the response was YES. [2023-11-29 21:43:44,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30556 conditions, 9307 events. 3693/9307 cut-off events. For 15216/16958 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 81777 event pairs, 465 based on Foata normal form. 104/7994 useless extension candidates. Maximal degree in co-relation 23374. Up to 4484 conditions per place. [2023-11-29 21:43:44,367 INFO L140 encePairwiseOnDemand]: 317/335 looper letters, 123 selfloop transitions, 14 changer transitions 169/508 dead transitions. [2023-11-29 21:43:44,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 508 transitions, 3673 flow [2023-11-29 21:43:44,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 21:43:44,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-29 21:43:44,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 3482 transitions. [2023-11-29 21:43:44,375 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7424307036247335 [2023-11-29 21:43:44,375 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 3482 transitions. [2023-11-29 21:43:44,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 3482 transitions. [2023-11-29 21:43:44,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:43:44,377 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 3482 transitions. [2023-11-29 21:43:44,381 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 248.71428571428572) internal successors, (3482), 14 states have internal predecessors, (3482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:43:44,399 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 335.0) internal successors, (5025), 15 states have internal predecessors, (5025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:43:44,400 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 335.0) internal successors, (5025), 15 states have internal predecessors, (5025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:43:44,402 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 45 predicate places. [2023-11-29 21:43:44,402 INFO L500 AbstractCegarLoop]: Abstraction has has 319 places, 508 transitions, 3673 flow [2023-11-29 21:43:44,403 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 243.5) internal successors, (2435), 10 states have internal predecessors, (2435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:43:44,403 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:43:44,403 INFO L232 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-29 21:43:44,403 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 21:43:44,403 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-11-29 21:43:44,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:43:44,404 INFO L85 PathProgramCache]: Analyzing trace with hash -856657859, now seen corresponding path program 1 times [2023-11-29 21:43:44,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:43:44,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322469745] [2023-11-29 21:43:44,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:43:44,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:43:44,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:43:44,869 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:43:44,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:43:44,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322469745] [2023-11-29 21:43:44,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322469745] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 21:43:44,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266954782] [2023-11-29 21:43:44,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:43:44,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:43:44,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 21:43:44,872 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-11-29 21:43:44,910 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-11-29 21:43:45,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:43:45,059 INFO L262 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-29 21:43:45,069 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 21:43:45,385 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 21:43:45,386 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 21:43:45,561 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 21:43:45,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266954782] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 21:43:45,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-29 21:43:45,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13, 8] total 23 [2023-11-29 21:43:45,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172406160] [2023-11-29 21:43:45,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:43:45,562 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 21:43:45,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:43:45,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 21:43:45,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2023-11-29 21:43:45,564 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 335 [2023-11-29 21:43:45,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 508 transitions, 3673 flow. Second operand has 8 states, 8 states have (on average 239.5) internal successors, (1916), 8 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:43:45,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:43:45,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 335 [2023-11-29 21:43:45,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:43:48,495 INFO L124 PetriNetUnfolderBase]: 5246/12030 cut-off events. [2023-11-29 21:43:48,495 INFO L125 PetriNetUnfolderBase]: For 34440/36494 co-relation queries the response was YES. [2023-11-29 21:43:48,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47505 conditions, 12030 events. 5246/12030 cut-off events. For 34440/36494 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 105835 event pairs, 457 based on Foata normal form. 6/10191 useless extension candidates. Maximal degree in co-relation 37745. Up to 6007 conditions per place. [2023-11-29 21:43:48,665 INFO L140 encePairwiseOnDemand]: 319/335 looper letters, 247 selfloop transitions, 18 changer transitions 275/737 dead transitions. [2023-11-29 21:43:48,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 737 transitions, 7173 flow [2023-11-29 21:43:48,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 21:43:48,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-29 21:43:48,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2735 transitions. [2023-11-29 21:43:48,679 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7421981004070556 [2023-11-29 21:43:48,682 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2735 transitions. [2023-11-29 21:43:48,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2735 transitions. [2023-11-29 21:43:48,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:43:48,691 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2735 transitions. [2023-11-29 21:43:48,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 248.63636363636363) internal successors, (2735), 11 states have internal predecessors, (2735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:43:48,717 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 335.0) internal successors, (4020), 12 states have internal predecessors, (4020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:43:48,718 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 335.0) internal successors, (4020), 12 states have internal predecessors, (4020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:43:48,719 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 55 predicate places. [2023-11-29 21:43:48,719 INFO L500 AbstractCegarLoop]: Abstraction has has 329 places, 737 transitions, 7173 flow [2023-11-29 21:43:48,720 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 239.5) internal successors, (1916), 8 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:43:48,720 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:43:48,720 INFO L232 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-29 21:43:48,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-29 21:43:48,928 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:43:48,940 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-11-29 21:43:48,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:43:48,941 INFO L85 PathProgramCache]: Analyzing trace with hash 36927202, now seen corresponding path program 1 times [2023-11-29 21:43:48,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:43:48,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745700256] [2023-11-29 21:43:48,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:43:48,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:43:49,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:43:49,559 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:43:49,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:43:49,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745700256] [2023-11-29 21:43:49,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745700256] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 21:43:49,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628162449] [2023-11-29 21:43:49,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:43:49,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:43:49,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 21:43:49,561 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-11-29 21:43:49,591 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-11-29 21:43:49,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:43:49,735 INFO L262 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-29 21:43:49,746 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 21:43:50,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 21:43:50,034 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 21:43:50,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628162449] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:43:50,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 21:43:50,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [13] total 19 [2023-11-29 21:43:50,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226138762] [2023-11-29 21:43:50,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:43:50,037 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 21:43:50,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:43:50,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 21:43:50,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2023-11-29 21:43:50,039 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 335 [2023-11-29 21:43:50,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 737 transitions, 7173 flow. Second operand has 8 states, 8 states have (on average 239.5) internal successors, (1916), 8 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:43:50,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:43:50,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 335 [2023-11-29 21:43:50,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:43:52,514 INFO L124 PetriNetUnfolderBase]: 5223/11423 cut-off events. [2023-11-29 21:43:52,515 INFO L125 PetriNetUnfolderBase]: For 40340/42037 co-relation queries the response was YES. [2023-11-29 21:43:52,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53871 conditions, 11423 events. 5223/11423 cut-off events. For 40340/42037 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 96557 event pairs, 395 based on Foata normal form. 63/9793 useless extension candidates. Maximal degree in co-relation 42735. Up to 6522 conditions per place. [2023-11-29 21:43:52,600 INFO L140 encePairwiseOnDemand]: 315/335 looper letters, 276 selfloop transitions, 15 changer transitions 353/841 dead transitions. [2023-11-29 21:43:52,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 841 transitions, 9780 flow [2023-11-29 21:43:52,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 21:43:52,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-11-29 21:43:52,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 3644 transitions. [2023-11-29 21:43:52,606 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7251741293532338 [2023-11-29 21:43:52,606 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 3644 transitions. [2023-11-29 21:43:52,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 3644 transitions. [2023-11-29 21:43:52,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:43:52,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 3644 transitions. [2023-11-29 21:43:52,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 242.93333333333334) internal successors, (3644), 15 states have internal predecessors, (3644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:43:52,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 335.0) internal successors, (5360), 16 states have internal predecessors, (5360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:43:52,617 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 335.0) internal successors, (5360), 16 states have internal predecessors, (5360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:43:52,619 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 69 predicate places. [2023-11-29 21:43:52,619 INFO L500 AbstractCegarLoop]: Abstraction has has 343 places, 841 transitions, 9780 flow [2023-11-29 21:43:52,619 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 239.5) internal successors, (1916), 8 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:43:52,619 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:43:52,619 INFO L232 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-29 21:43:52,627 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-11-29 21:43:52,824 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,SelfDestructingSolverStorable5 [2023-11-29 21:43:52,825 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-11-29 21:43:52,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:43:52,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1884158370, now seen corresponding path program 2 times [2023-11-29 21:43:52,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:43:52,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561634811] [2023-11-29 21:43:52,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:43:52,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:43:52,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:43:53,357 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:43:53,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:43:53,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561634811] [2023-11-29 21:43:53,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561634811] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 21:43:53,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94293143] [2023-11-29 21:43:53,358 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 21:43:53,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:43:53,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 21:43:53,359 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-11-29 21:43:53,376 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-11-29 21:43:53,586 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 21:43:53,586 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 21:43:53,588 INFO L262 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 21:43:53,591 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 21:43:53,865 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 21:43:53,865 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 21:43:54,032 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 21:43:54,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94293143] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 21:43:54,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 21:43:54,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 23 [2023-11-29 21:43:54,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088783077] [2023-11-29 21:43:54,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 21:43:54,034 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 21:43:54,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:43:54,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 21:43:54,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2023-11-29 21:43:54,038 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 335 [2023-11-29 21:43:54,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 841 transitions, 9780 flow. Second operand has 23 states, 23 states have (on average 219.30434782608697) internal successors, (5044), 23 states have internal predecessors, (5044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:43:54,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:43:54,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 335 [2023-11-29 21:43:54,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:43:57,278 INFO L124 PetriNetUnfolderBase]: 4790/11155 cut-off events. [2023-11-29 21:43:57,278 INFO L125 PetriNetUnfolderBase]: For 46375/49204 co-relation queries the response was YES. [2023-11-29 21:43:57,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57072 conditions, 11155 events. 4790/11155 cut-off events. For 46375/49204 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 95899 event pairs, 433 based on Foata normal form. 250/9773 useless extension candidates. Maximal degree in co-relation 49582. Up to 5690 conditions per place. [2023-11-29 21:43:57,476 INFO L140 encePairwiseOnDemand]: 301/335 looper letters, 248 selfloop transitions, 34 changer transitions 468/923 dead transitions. [2023-11-29 21:43:57,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 923 transitions, 12338 flow [2023-11-29 21:43:57,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-11-29 21:43:57,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2023-11-29 21:43:57,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 8190 transitions. [2023-11-29 21:43:57,496 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6607503025413474 [2023-11-29 21:43:57,496 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 8190 transitions. [2023-11-29 21:43:57,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 8190 transitions. [2023-11-29 21:43:57,499 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:43:57,499 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 8190 transitions. [2023-11-29 21:43:57,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 38 states, 37 states have (on average 221.35135135135135) internal successors, (8190), 37 states have internal predecessors, (8190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:43:57,561 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 38 states, 38 states have (on average 335.0) internal successors, (12730), 38 states have internal predecessors, (12730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:43:57,562 INFO L81 ComplementDD]: Finished complementDD. Result has 38 states, 38 states have (on average 335.0) internal successors, (12730), 38 states have internal predecessors, (12730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:43:57,563 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 102 predicate places. [2023-11-29 21:43:57,563 INFO L500 AbstractCegarLoop]: Abstraction has has 376 places, 923 transitions, 12338 flow [2023-11-29 21:43:57,574 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 219.30434782608697) internal successors, (5044), 23 states have internal predecessors, (5044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:43:57,574 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:43:57,575 INFO L232 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-29 21:43:57,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 21:43:57,779 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:43:57,780 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-11-29 21:43:57,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:43:57,781 INFO L85 PathProgramCache]: Analyzing trace with hash 671877501, now seen corresponding path program 3 times [2023-11-29 21:43:57,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:43:57,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122830467] [2023-11-29 21:43:57,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:43:57,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:43:57,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:43:58,733 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:43:58,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:43:58,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122830467] [2023-11-29 21:43:58,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122830467] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 21:43:58,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274128779] [2023-11-29 21:43:58,734 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 21:43:58,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:43:58,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 21:43:58,735 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-11-29 21:43:58,787 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-11-29 21:43:58,993 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-29 21:43:58,993 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 21:43:58,995 INFO L262 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 21:43:58,998 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 21:43:59,280 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 21:43:59,281 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 21:43:59,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274128779] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:43:59,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 21:43:59,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15] total 21 [2023-11-29 21:43:59,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113739155] [2023-11-29 21:43:59,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:43:59,284 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 21:43:59,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:43:59,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 21:43:59,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2023-11-29 21:43:59,286 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 335 [2023-11-29 21:43:59,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 923 transitions, 12338 flow. Second operand has 8 states, 8 states have (on average 239.5) internal successors, (1916), 8 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:43:59,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:43:59,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 335 [2023-11-29 21:43:59,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:44:01,638 INFO L124 PetriNetUnfolderBase]: 4580/10550 cut-off events. [2023-11-29 21:44:01,638 INFO L125 PetriNetUnfolderBase]: For 51134/54151 co-relation queries the response was YES. [2023-11-29 21:44:01,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60756 conditions, 10550 events. 4580/10550 cut-off events. For 51134/54151 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 89062 event pairs, 391 based on Foata normal form. 111/9148 useless extension candidates. Maximal degree in co-relation 52590. Up to 5385 conditions per place. [2023-11-29 21:44:01,723 INFO L140 encePairwiseOnDemand]: 314/335 looper letters, 188 selfloop transitions, 12 changer transitions 535/936 dead transitions. [2023-11-29 21:44:01,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 936 transitions, 14049 flow [2023-11-29 21:44:01,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 21:44:01,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-29 21:44:01,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2941 transitions. [2023-11-29 21:44:01,749 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7315920398009951 [2023-11-29 21:44:01,749 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2941 transitions. [2023-11-29 21:44:01,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2941 transitions. [2023-11-29 21:44:01,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:44:01,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2941 transitions. [2023-11-29 21:44:01,754 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 245.08333333333334) internal successors, (2941), 12 states have internal predecessors, (2941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:44:01,757 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 335.0) internal successors, (4355), 13 states have internal predecessors, (4355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:44:01,757 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 335.0) internal successors, (4355), 13 states have internal predecessors, (4355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:44:01,758 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 112 predicate places. [2023-11-29 21:44:01,758 INFO L500 AbstractCegarLoop]: Abstraction has has 386 places, 936 transitions, 14049 flow [2023-11-29 21:44:01,758 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 239.5) internal successors, (1916), 8 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:44:01,758 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:44:01,758 INFO L232 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-29 21:44:01,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 21:44:01,980 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:44:01,981 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-11-29 21:44:01,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:44:01,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1106664551, now seen corresponding path program 1 times [2023-11-29 21:44:01,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:44:01,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514444696] [2023-11-29 21:44:01,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:44:01,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:44:02,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:44:02,542 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:44:02,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:44:02,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514444696] [2023-11-29 21:44:02,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514444696] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 21:44:02,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172979930] [2023-11-29 21:44:02,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:44:02,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:44:02,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 21:44:02,543 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 21:44:02,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 21:44:02,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:44:02,827 INFO L262 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 21:44:02,829 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 21:44:03,146 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 21:44:03,146 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 21:44:03,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172979930] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 21:44:03,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 21:44:03,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15] total 21 [2023-11-29 21:44:03,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67650559] [2023-11-29 21:44:03,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:44:03,147 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 21:44:03,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:44:03,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 21:44:03,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2023-11-29 21:44:03,149 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 335 [2023-11-29 21:44:03,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 936 transitions, 14049 flow. Second operand has 8 states, 8 states have (on average 239.5) internal successors, (1916), 8 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:44:03,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:44:03,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 335 [2023-11-29 21:44:03,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:44:05,710 INFO L124 PetriNetUnfolderBase]: 5005/12038 cut-off events. [2023-11-29 21:44:05,710 INFO L125 PetriNetUnfolderBase]: For 75069/79282 co-relation queries the response was YES. [2023-11-29 21:44:05,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73103 conditions, 12038 events. 5005/12038 cut-off events. For 75069/79282 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 106618 event pairs, 266 based on Foata normal form. 49/10420 useless extension candidates. Maximal degree in co-relation 63998. Up to 5874 conditions per place. [2023-11-29 21:44:05,811 INFO L140 encePairwiseOnDemand]: 315/335 looper letters, 255 selfloop transitions, 18 changer transitions 624/1100 dead transitions. [2023-11-29 21:44:05,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 1100 transitions, 18618 flow [2023-11-29 21:44:05,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 21:44:05,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-29 21:44:05,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 3190 transitions. [2023-11-29 21:44:05,833 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7324913892078071 [2023-11-29 21:44:05,833 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 3190 transitions. [2023-11-29 21:44:05,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 3190 transitions. [2023-11-29 21:44:05,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:44:05,836 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 3190 transitions. [2023-11-29 21:44:05,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 245.3846153846154) internal successors, (3190), 13 states have internal predecessors, (3190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:44:05,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 335.0) internal successors, (4690), 14 states have internal predecessors, (4690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:44:05,843 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 335.0) internal successors, (4690), 14 states have internal predecessors, (4690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:44:05,844 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 124 predicate places. [2023-11-29 21:44:05,844 INFO L500 AbstractCegarLoop]: Abstraction has has 398 places, 1100 transitions, 18618 flow [2023-11-29 21:44:05,844 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 239.5) internal successors, (1916), 8 states have internal predecessors, (1916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:44:05,844 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:44:05,844 INFO L232 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-29 21:44:05,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 21:44:06,049 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:44:06,050 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-11-29 21:44:06,050 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:44:06,050 INFO L85 PathProgramCache]: Analyzing trace with hash -338035767, now seen corresponding path program 2 times [2023-11-29 21:44:06,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:44:06,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101844024] [2023-11-29 21:44:06,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:44:06,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:44:06,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:44:06,780 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 21:44:06,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:44:06,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101844024] [2023-11-29 21:44:06,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101844024] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 21:44:06,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132639229] [2023-11-29 21:44:06,781 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 21:44:06,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:44:06,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 21:44:06,802 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 21:44:06,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 21:44:06,978 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 21:44:06,978 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 21:44:06,980 INFO L262 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-29 21:44:06,982 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 21:44:07,362 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 21:44:07,363 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 21:44:07,714 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 21:44:07,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132639229] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 21:44:07,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-29 21:44:07,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [15, 13] total 35 [2023-11-29 21:44:07,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407633002] [2023-11-29 21:44:07,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 21:44:07,717 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 21:44:07,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:44:07,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 21:44:07,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1049, Unknown=0, NotChecked=0, Total=1190 [2023-11-29 21:44:07,719 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 335 [2023-11-29 21:44:07,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 1100 transitions, 18618 flow. Second operand has 13 states, 13 states have (on average 226.84615384615384) internal successors, (2949), 13 states have internal predecessors, (2949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:44:07,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:44:07,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 335 [2023-11-29 21:44:07,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:44:10,679 INFO L124 PetriNetUnfolderBase]: 5087/11584 cut-off events. [2023-11-29 21:44:10,679 INFO L125 PetriNetUnfolderBase]: For 90712/95272 co-relation queries the response was YES. [2023-11-29 21:44:10,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80443 conditions, 11584 events. 5087/11584 cut-off events. For 90712/95272 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 99773 event pairs, 175 based on Foata normal form. 114/10067 useless extension candidates. Maximal degree in co-relation 71202. Up to 6109 conditions per place. [2023-11-29 21:44:10,795 INFO L140 encePairwiseOnDemand]: 310/335 looper letters, 224 selfloop transitions, 20 changer transitions 812/1238 dead transitions. [2023-11-29 21:44:10,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 1238 transitions, 23521 flow [2023-11-29 21:44:10,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 21:44:10,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-11-29 21:44:10,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 4407 transitions. [2023-11-29 21:44:10,815 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6923802042419481 [2023-11-29 21:44:10,815 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 4407 transitions. [2023-11-29 21:44:10,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 4407 transitions. [2023-11-29 21:44:10,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:44:10,816 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 4407 transitions. [2023-11-29 21:44:10,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 231.94736842105263) internal successors, (4407), 19 states have internal predecessors, (4407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:44:10,824 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 335.0) internal successors, (6700), 20 states have internal predecessors, (6700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:44:10,825 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 335.0) internal successors, (6700), 20 states have internal predecessors, (6700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:44:10,825 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 142 predicate places. [2023-11-29 21:44:10,825 INFO L500 AbstractCegarLoop]: Abstraction has has 416 places, 1238 transitions, 23521 flow [2023-11-29 21:44:10,826 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 226.84615384615384) internal successors, (2949), 13 states have internal predecessors, (2949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:44:10,826 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:44:10,826 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-29 21:44:10,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 21:44:11,034 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:44:11,035 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-11-29 21:44:11,035 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:44:11,035 INFO L85 PathProgramCache]: Analyzing trace with hash -398408715, now seen corresponding path program 1 times [2023-11-29 21:44:11,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:44:11,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568631747] [2023-11-29 21:44:11,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:44:11,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:44:11,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:44:13,630 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:44:13,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:44:13,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568631747] [2023-11-29 21:44:13,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568631747] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 21:44:13,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599300984] [2023-11-29 21:44:13,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:44:13,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:44:13,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 21:44:13,632 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 21:44:13,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 21:44:13,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:44:13,834 INFO L262 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 66 conjunts are in the unsatisfiable core [2023-11-29 21:44:13,838 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 21:44:15,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 21:44:15,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 21:44:16,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 21:44:16,309 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:44:16,309 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 21:44:16,709 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 21:44:16,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 43 [2023-11-29 21:44:16,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 13 [2023-11-29 21:44:17,684 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:44:17,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599300984] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 21:44:17,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 21:44:17,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 32, 29] total 84 [2023-11-29 21:44:17,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890093044] [2023-11-29 21:44:17,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 21:44:17,685 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 84 states [2023-11-29 21:44:17,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:44:17,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2023-11-29 21:44:17,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=433, Invalid=6538, Unknown=1, NotChecked=0, Total=6972 [2023-11-29 21:44:17,692 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 335 [2023-11-29 21:44:17,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 1238 transitions, 23521 flow. Second operand has 84 states, 84 states have (on average 163.08333333333334) internal successors, (13699), 84 states have internal predecessors, (13699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:44:17,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:44:17,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 335 [2023-11-29 21:44:17,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:45:22,345 INFO L124 PetriNetUnfolderBase]: 107459/204140 cut-off events. [2023-11-29 21:45:22,345 INFO L125 PetriNetUnfolderBase]: For 1851564/1885307 co-relation queries the response was YES. [2023-11-29 21:45:23,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1298919 conditions, 204140 events. 107459/204140 cut-off events. For 1851564/1885307 co-relation queries the response was YES. Maximal size of possible extension queue 4484. Compared 2284713 event pairs, 4518 based on Foata normal form. 1058/186278 useless extension candidates. Maximal degree in co-relation 744495. Up to 87226 conditions per place. [2023-11-29 21:45:25,431 INFO L140 encePairwiseOnDemand]: 270/335 looper letters, 1256 selfloop transitions, 314 changer transitions 3727/5425 dead transitions. [2023-11-29 21:45:25,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 562 places, 5425 transitions, 112148 flow [2023-11-29 21:45:25,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2023-11-29 21:45:25,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2023-11-29 21:45:25,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 25415 transitions. [2023-11-29 21:45:25,447 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5160930043659254 [2023-11-29 21:45:25,447 INFO L72 ComplementDD]: Start complementDD. Operand 147 states and 25415 transitions. [2023-11-29 21:45:25,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 147 states and 25415 transitions. [2023-11-29 21:45:25,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:45:25,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 147 states and 25415 transitions. [2023-11-29 21:45:25,472 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 148 states, 147 states have (on average 172.89115646258503) internal successors, (25415), 147 states have internal predecessors, (25415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:45:25,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 148 states, 148 states have (on average 335.0) internal successors, (49580), 148 states have internal predecessors, (49580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:45:25,511 INFO L81 ComplementDD]: Finished complementDD. Result has 148 states, 148 states have (on average 335.0) internal successors, (49580), 148 states have internal predecessors, (49580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:45:25,512 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 288 predicate places. [2023-11-29 21:45:25,512 INFO L500 AbstractCegarLoop]: Abstraction has has 562 places, 5425 transitions, 112148 flow [2023-11-29 21:45:25,514 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 84 states, 84 states have (on average 163.08333333333334) internal successors, (13699), 84 states have internal predecessors, (13699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:45:25,514 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:45:25,515 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-29 21:45:25,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-29 21:45:25,720 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:45:25,721 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-11-29 21:45:25,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:45:25,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1209050500, now seen corresponding path program 1 times [2023-11-29 21:45:25,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:45:25,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444880098] [2023-11-29 21:45:25,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:45:25,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:45:25,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:45:26,357 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 21:45:26,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:45:26,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444880098] [2023-11-29 21:45:26,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444880098] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 21:45:26,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1948691626] [2023-11-29 21:45:26,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:45:26,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:45:26,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 21:45:26,365 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 21:45:26,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 21:45:26,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:45:26,557 INFO L262 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 71 conjunts are in the unsatisfiable core [2023-11-29 21:45:26,560 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 21:45:27,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 21:45:28,415 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 21:45:28,416 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 21:45:29,140 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 21:45:29,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1948691626] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 21:45:29,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 21:45:29,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 33, 19] total 54 [2023-11-29 21:45:29,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21268111] [2023-11-29 21:45:29,142 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 21:45:29,143 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-11-29 21:45:29,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:45:29,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-11-29 21:45:29,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=2580, Unknown=0, NotChecked=0, Total=2862 [2023-11-29 21:45:29,149 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 335 [2023-11-29 21:45:29,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 562 places, 5425 transitions, 112148 flow. Second operand has 54 states, 54 states have (on average 177.5185185185185) internal successors, (9586), 54 states have internal predecessors, (9586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:45:29,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:45:29,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 335 [2023-11-29 21:45:29,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 21:48:30,903 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1280] thread1EXIT-->L162-2: Formula: (and (= v_thread1Thread1of1ForFork4_thidvar1_4 0) (= v_thread1Thread1of1ForFork4_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread1Thread1of1ForFork4_thidvar4_4 0) (= v_thread1Thread1of1ForFork4_thidvar5_4 0) (= v_thread1Thread1of1ForFork4_thidvar2_4 0) (= v_thread1Thread1of1ForFork4_thidvar3_4 0)) InVars {thread1Thread1of1ForFork4_thidvar2=v_thread1Thread1of1ForFork4_thidvar2_4, thread1Thread1of1ForFork4_thidvar3=v_thread1Thread1of1ForFork4_thidvar3_4, thread1Thread1of1ForFork4_thidvar4=v_thread1Thread1of1ForFork4_thidvar4_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_6|, thread1Thread1of1ForFork4_thidvar5=v_thread1Thread1of1ForFork4_thidvar5_4, thread1Thread1of1ForFork4_thidvar0=v_thread1Thread1of1ForFork4_thidvar0_4, thread1Thread1of1ForFork4_thidvar1=v_thread1Thread1of1ForFork4_thidvar1_4} OutVars{thread1Thread1of1ForFork4_thidvar2=v_thread1Thread1of1ForFork4_thidvar2_4, thread1Thread1of1ForFork4_thidvar3=v_thread1Thread1of1ForFork4_thidvar3_4, thread1Thread1of1ForFork4_thidvar4=v_thread1Thread1of1ForFork4_thidvar4_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_6|, thread1Thread1of1ForFork4_thidvar5=v_thread1Thread1of1ForFork4_thidvar5_4, thread1Thread1of1ForFork4_thidvar0=v_thread1Thread1of1ForFork4_thidvar0_4, thread1Thread1of1ForFork4_thidvar1=v_thread1Thread1of1ForFork4_thidvar1_4} AuxVars[] AssignedVars[][11136], [406#true, thread1Thread1of1ForFork4NotInUse, thread2Thread1of1ForFork2NotInUse, thread6Thread1of1ForFork3NotInUse, 1116#(= |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0), thread4Thread1of1ForFork0InUse, 6932#(not (= ~n~0 0)), 4991#true, 3359#(= |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0), 11015#(and (or (= |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0) (= (+ ~s12~0 ~s22~0) ~x1~0)) (or (= (+ ~s12~0 ~s22~0) (+ ~s11~0 ~s21~0)) (not (= ~n~0 (+ ~i2~0 1))) (not (= (+ ~i1~0 1) ~n~0)))), 1915#true, 4806#(= |thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0), 377#true, thread5Thread1of1ForFork1NotInUse, 330#true, 216#L38-1true, 68#L162-2true, 333#true, 9061#(and (or (not (= ~n~0 1)) (not (= ~s12~0 0)) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| (+ |#StackHeapBarrier| 1))) (or (< ~x~0.base (+ |#StackHeapBarrier| 1)) (not (= ~n~0 1)) (not (= ~s12~0 0)))), thread3Thread1of1ForFork5NotInUse]) [2023-11-29 21:48:30,903 INFO L294 olderBase$Statistics]: this new event has 235 ancestors and is cut-off event [2023-11-29 21:48:30,903 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2023-11-29 21:48:30,903 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2023-11-29 21:48:30,903 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2023-11-29 21:48:30,904 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1280] thread1EXIT-->L162-2: Formula: (and (= v_thread1Thread1of1ForFork4_thidvar1_4 0) (= v_thread1Thread1of1ForFork4_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread1Thread1of1ForFork4_thidvar4_4 0) (= v_thread1Thread1of1ForFork4_thidvar5_4 0) (= v_thread1Thread1of1ForFork4_thidvar2_4 0) (= v_thread1Thread1of1ForFork4_thidvar3_4 0)) InVars {thread1Thread1of1ForFork4_thidvar2=v_thread1Thread1of1ForFork4_thidvar2_4, thread1Thread1of1ForFork4_thidvar3=v_thread1Thread1of1ForFork4_thidvar3_4, thread1Thread1of1ForFork4_thidvar4=v_thread1Thread1of1ForFork4_thidvar4_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_6|, thread1Thread1of1ForFork4_thidvar5=v_thread1Thread1of1ForFork4_thidvar5_4, thread1Thread1of1ForFork4_thidvar0=v_thread1Thread1of1ForFork4_thidvar0_4, thread1Thread1of1ForFork4_thidvar1=v_thread1Thread1of1ForFork4_thidvar1_4} OutVars{thread1Thread1of1ForFork4_thidvar2=v_thread1Thread1of1ForFork4_thidvar2_4, thread1Thread1of1ForFork4_thidvar3=v_thread1Thread1of1ForFork4_thidvar3_4, thread1Thread1of1ForFork4_thidvar4=v_thread1Thread1of1ForFork4_thidvar4_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_6|, thread1Thread1of1ForFork4_thidvar5=v_thread1Thread1of1ForFork4_thidvar5_4, thread1Thread1of1ForFork4_thidvar0=v_thread1Thread1of1ForFork4_thidvar0_4, thread1Thread1of1ForFork4_thidvar1=v_thread1Thread1of1ForFork4_thidvar1_4} AuxVars[] AssignedVars[][8044], [406#true, thread1Thread1of1ForFork4NotInUse, thread2Thread1of1ForFork2NotInUse, 2678#true, thread6Thread1of1ForFork3NotInUse, 10266#(or (= (+ ~s12~0 ~s22~0) (+ ~s11~0 ~s21~0)) (not (= ~n~0 (+ ~i2~0 1))) (not (= (+ ~i1~0 1) ~n~0))), thread4Thread1of1ForFork0InUse, 4991#true, 6932#(not (= ~n~0 0)), 435#true, 195#L37-1true, 1915#true, 4210#true, 377#true, thread5Thread1of1ForFork1NotInUse, 330#true, 68#L162-2true, 333#true, 9061#(and (or (not (= ~n~0 1)) (not (= ~s12~0 0)) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| (+ |#StackHeapBarrier| 1))) (or (< ~x~0.base (+ |#StackHeapBarrier| 1)) (not (= ~n~0 1)) (not (= ~s12~0 0)))), thread3Thread1of1ForFork5NotInUse]) [2023-11-29 21:48:30,904 INFO L294 olderBase$Statistics]: this new event has 235 ancestors and is cut-off event [2023-11-29 21:48:30,904 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2023-11-29 21:48:30,904 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2023-11-29 21:48:30,904 INFO L297 olderBase$Statistics]: existing Event has 235 ancestors and is cut-off event [2023-11-29 21:48:31,409 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1280] thread1EXIT-->L162-2: Formula: (and (= v_thread1Thread1of1ForFork4_thidvar1_4 0) (= v_thread1Thread1of1ForFork4_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread1Thread1of1ForFork4_thidvar4_4 0) (= v_thread1Thread1of1ForFork4_thidvar5_4 0) (= v_thread1Thread1of1ForFork4_thidvar2_4 0) (= v_thread1Thread1of1ForFork4_thidvar3_4 0)) InVars {thread1Thread1of1ForFork4_thidvar2=v_thread1Thread1of1ForFork4_thidvar2_4, thread1Thread1of1ForFork4_thidvar3=v_thread1Thread1of1ForFork4_thidvar3_4, thread1Thread1of1ForFork4_thidvar4=v_thread1Thread1of1ForFork4_thidvar4_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_6|, thread1Thread1of1ForFork4_thidvar5=v_thread1Thread1of1ForFork4_thidvar5_4, thread1Thread1of1ForFork4_thidvar0=v_thread1Thread1of1ForFork4_thidvar0_4, thread1Thread1of1ForFork4_thidvar1=v_thread1Thread1of1ForFork4_thidvar1_4} OutVars{thread1Thread1of1ForFork4_thidvar2=v_thread1Thread1of1ForFork4_thidvar2_4, thread1Thread1of1ForFork4_thidvar3=v_thread1Thread1of1ForFork4_thidvar3_4, thread1Thread1of1ForFork4_thidvar4=v_thread1Thread1of1ForFork4_thidvar4_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_6|, thread1Thread1of1ForFork4_thidvar5=v_thread1Thread1of1ForFork4_thidvar5_4, thread1Thread1of1ForFork4_thidvar0=v_thread1Thread1of1ForFork4_thidvar0_4, thread1Thread1of1ForFork4_thidvar1=v_thread1Thread1of1ForFork4_thidvar1_4} AuxVars[] AssignedVars[][8044], [406#true, thread1Thread1of1ForFork4NotInUse, 2678#true, thread2Thread1of1ForFork2NotInUse, thread6Thread1of1ForFork3NotInUse, 10266#(or (= (+ ~s12~0 ~s22~0) (+ ~s11~0 ~s21~0)) (not (= ~n~0 (+ ~i2~0 1))) (not (= (+ ~i1~0 1) ~n~0))), thread4Thread1of1ForFork0InUse, 4991#true, 6932#(not (= ~n~0 0)), 435#true, 1915#true, 4210#true, 242#L131-2true, 377#true, thread5Thread1of1ForFork1NotInUse, 68#L162-2true, 330#true, 333#true, 9061#(and (or (not (= ~n~0 1)) (not (= ~s12~0 0)) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| (+ |#StackHeapBarrier| 1))) (or (< ~x~0.base (+ |#StackHeapBarrier| 1)) (not (= ~n~0 1)) (not (= ~s12~0 0)))), thread3Thread1of1ForFork5NotInUse]) [2023-11-29 21:48:31,409 INFO L294 olderBase$Statistics]: this new event has 236 ancestors and is cut-off event [2023-11-29 21:48:31,409 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2023-11-29 21:48:31,409 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2023-11-29 21:48:31,410 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2023-11-29 21:48:31,444 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1223] L132-->L134: Formula: (let ((.cse0 (+ v_~s22~0_31 v_~s12~0_36))) (and (<= 0 (+ |v_thread4Thread1of1ForFork0_plus_#res#1_1| 2147483648)) (not (= (ite (or (<= .cse0 2147483647) (<= v_~s22~0_31 0)) 1 0) 0)) (not (= (ite (or (<= 0 v_~s22~0_31) (<= 0 (+ v_~s22~0_31 2147483648 v_~s12~0_36))) 1 0) 0)) (= v_~x2~0_11 |v_thread4Thread1of1ForFork0_plus_#res#1_1|) (= .cse0 |v_thread4Thread1of1ForFork0_plus_#res#1_1|) (<= |v_thread4Thread1of1ForFork0_plus_#res#1_1| 2147483647))) InVars {~s12~0=v_~s12~0_36, ~s22~0=v_~s22~0_31} OutVars{~s12~0=v_~s12~0_36, ~x2~0=v_~x2~0_11, thread4Thread1of1ForFork0_#t~ret30#1=|v_thread4Thread1of1ForFork0_#t~ret30#1_1|, thread4Thread1of1ForFork0_plus_#in~b#1=|v_thread4Thread1of1ForFork0_plus_#in~b#1_1|, thread4Thread1of1ForFork0_plus_#in~a#1=|v_thread4Thread1of1ForFork0_plus_#in~a#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_7|, thread4Thread1of1ForFork0_plus_#res#1=|v_thread4Thread1of1ForFork0_plus_#res#1_1|, thread4Thread1of1ForFork0_plus_~a#1=|v_thread4Thread1of1ForFork0_plus_~a#1_1|, thread4Thread1of1ForFork0_plus_~b#1=|v_thread4Thread1of1ForFork0_plus_~b#1_1|, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, ~s22~0=v_~s22~0_31} AuxVars[] AssignedVars[~x2~0, thread4Thread1of1ForFork0_#t~ret30#1, thread4Thread1of1ForFork0_plus_#in~b#1, thread4Thread1of1ForFork0_plus_#in~a#1, thread4Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, thread4Thread1of1ForFork0_plus_#res#1, thread4Thread1of1ForFork0_plus_~a#1, thread4Thread1of1ForFork0_plus_~b#1, thread4Thread1of1ForFork0_assume_abort_if_not_~cond#1][5343], [406#true, thread1Thread1of1ForFork4InUse, 2678#true, thread2Thread1of1ForFork2NotInUse, thread6Thread1of1ForFork3NotInUse, 10266#(or (= (+ ~s12~0 ~s22~0) (+ ~s11~0 ~s21~0)) (not (= ~n~0 (+ ~i2~0 1))) (not (= (+ ~i1~0 1) ~n~0))), 243#L134true, thread4Thread1of1ForFork0InUse, 6932#(not (= ~n~0 0)), 4991#true, 218#L162-1true, 435#true, 1915#true, 4210#true, 377#true, thread5Thread1of1ForFork1NotInUse, 264#thread1FINALtrue, 330#true, 9061#(and (or (not (= ~n~0 1)) (not (= ~s12~0 0)) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| (+ |#StackHeapBarrier| 1))) (or (< ~x~0.base (+ |#StackHeapBarrier| 1)) (not (= ~n~0 1)) (not (= ~s12~0 0)))), 333#true, thread3Thread1of1ForFork5NotInUse]) [2023-11-29 21:48:31,445 INFO L294 olderBase$Statistics]: this new event has 236 ancestors and is cut-off event [2023-11-29 21:48:31,445 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2023-11-29 21:48:31,445 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2023-11-29 21:48:31,445 INFO L297 olderBase$Statistics]: existing Event has 236 ancestors and is cut-off event [2023-11-29 21:48:31,876 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1280] thread1EXIT-->L162-2: Formula: (and (= v_thread1Thread1of1ForFork4_thidvar1_4 0) (= v_thread1Thread1of1ForFork4_thidvar0_4 (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem48#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296))))) (= v_thread1Thread1of1ForFork4_thidvar4_4 0) (= v_thread1Thread1of1ForFork4_thidvar5_4 0) (= v_thread1Thread1of1ForFork4_thidvar2_4 0) (= v_thread1Thread1of1ForFork4_thidvar3_4 0)) InVars {thread1Thread1of1ForFork4_thidvar2=v_thread1Thread1of1ForFork4_thidvar2_4, thread1Thread1of1ForFork4_thidvar3=v_thread1Thread1of1ForFork4_thidvar3_4, thread1Thread1of1ForFork4_thidvar4=v_thread1Thread1of1ForFork4_thidvar4_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_6|, thread1Thread1of1ForFork4_thidvar5=v_thread1Thread1of1ForFork4_thidvar5_4, thread1Thread1of1ForFork4_thidvar0=v_thread1Thread1of1ForFork4_thidvar0_4, thread1Thread1of1ForFork4_thidvar1=v_thread1Thread1of1ForFork4_thidvar1_4} OutVars{thread1Thread1of1ForFork4_thidvar2=v_thread1Thread1of1ForFork4_thidvar2_4, thread1Thread1of1ForFork4_thidvar3=v_thread1Thread1of1ForFork4_thidvar3_4, thread1Thread1of1ForFork4_thidvar4=v_thread1Thread1of1ForFork4_thidvar4_4, ULTIMATE.start_main_#t~mem48#1=|v_ULTIMATE.start_main_#t~mem48#1_6|, thread1Thread1of1ForFork4_thidvar5=v_thread1Thread1of1ForFork4_thidvar5_4, thread1Thread1of1ForFork4_thidvar0=v_thread1Thread1of1ForFork4_thidvar0_4, thread1Thread1of1ForFork4_thidvar1=v_thread1Thread1of1ForFork4_thidvar1_4} AuxVars[] AssignedVars[][8044], [406#true, thread1Thread1of1ForFork4NotInUse, 2678#true, thread2Thread1of1ForFork2NotInUse, thread6Thread1of1ForFork3NotInUse, 10266#(or (= (+ ~s12~0 ~s22~0) (+ ~s11~0 ~s21~0)) (not (= ~n~0 (+ ~i2~0 1))) (not (= (+ ~i1~0 1) ~n~0))), thread4Thread1of1ForFork0InUse, 6932#(not (= ~n~0 0)), 4991#true, 435#true, 1915#true, 4210#true, 7#L132true, 377#true, thread5Thread1of1ForFork1NotInUse, 68#L162-2true, 330#true, 9061#(and (or (not (= ~n~0 1)) (not (= ~s12~0 0)) (< |ULTIMATE.start_create_fresh_int_array_#res#1.base| (+ |#StackHeapBarrier| 1))) (or (< ~x~0.base (+ |#StackHeapBarrier| 1)) (not (= ~n~0 1)) (not (= ~s12~0 0)))), 333#true, thread3Thread1of1ForFork5NotInUse]) [2023-11-29 21:48:31,876 INFO L294 olderBase$Statistics]: this new event has 237 ancestors and is cut-off event [2023-11-29 21:48:31,876 INFO L297 olderBase$Statistics]: existing Event has 237 ancestors and is cut-off event [2023-11-29 21:48:31,876 INFO L297 olderBase$Statistics]: existing Event has 237 ancestors and is cut-off event [2023-11-29 21:48:31,876 INFO L297 olderBase$Statistics]: existing Event has 237 ancestors and is cut-off event [2023-11-29 21:48:34,510 INFO L124 PetriNetUnfolderBase]: 187648/338410 cut-off events. [2023-11-29 21:48:34,510 INFO L125 PetriNetUnfolderBase]: For 3427354/3483028 co-relation queries the response was YES. [2023-11-29 21:48:37,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2378957 conditions, 338410 events. 187648/338410 cut-off events. For 3427354/3483028 co-relation queries the response was YES. Maximal size of possible extension queue 7478. Compared 3809617 event pairs, 7100 based on Foata normal form. 2888/312675 useless extension candidates. Maximal degree in co-relation 1350856. Up to 148492 conditions per place. [2023-11-29 21:48:40,906 INFO L140 encePairwiseOnDemand]: 277/335 looper letters, 2965 selfloop transitions, 934 changer transitions 7377/11545 dead transitions. [2023-11-29 21:48:40,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 782 places, 11545 transitions, 235886 flow [2023-11-29 21:48:40,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2023-11-29 21:48:40,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2023-11-29 21:48:40,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 40789 transitions. [2023-11-29 21:48:40,940 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5509421219693388 [2023-11-29 21:48:40,941 INFO L72 ComplementDD]: Start complementDD. Operand 221 states and 40789 transitions. [2023-11-29 21:48:40,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 221 states and 40789 transitions. [2023-11-29 21:48:40,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 21:48:40,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 221 states and 40789 transitions. [2023-11-29 21:48:41,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 222 states, 221 states have (on average 184.5656108597285) internal successors, (40789), 221 states have internal predecessors, (40789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:48:41,120 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 222 states, 222 states have (on average 335.0) internal successors, (74370), 222 states have internal predecessors, (74370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:48:41,131 INFO L81 ComplementDD]: Finished complementDD. Result has 222 states, 222 states have (on average 335.0) internal successors, (74370), 222 states have internal predecessors, (74370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:48:41,133 INFO L307 CegarLoopForPetriNet]: 274 programPoint places, 508 predicate places. [2023-11-29 21:48:41,133 INFO L500 AbstractCegarLoop]: Abstraction has has 782 places, 11545 transitions, 235886 flow [2023-11-29 21:48:41,134 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 177.5185185185185) internal successors, (9586), 54 states have internal predecessors, (9586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:48:41,134 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 21:48:41,134 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-29 21:48:41,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-29 21:48:41,340 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-29 21:48:41,340 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 8 more)] === [2023-11-29 21:48:41,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 21:48:41,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1135566306, now seen corresponding path program 2 times [2023-11-29 21:48:41,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 21:48:41,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344164066] [2023-11-29 21:48:41,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 21:48:41,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 21:48:41,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 21:48:43,211 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 21:48:43,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 21:48:43,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344164066] [2023-11-29 21:48:43,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344164066] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 21:48:43,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080734320] [2023-11-29 21:48:43,211 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 21:48:43,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 21:48:43,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 21:48:43,232 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 21:48:43,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 21:48:43,535 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 21:48:43,535 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 21:48:43,539 INFO L262 TraceCheckSpWp]: Trace formula consists of 664 conjuncts, 52 conjunts are in the unsatisfiable core [2023-11-29 21:48:43,542 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 21:48:44,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 21:48:45,043 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 21:48:45,043 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 21:48:45,183 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 21:48:45,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 18 [2023-11-29 21:48:45,407 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-29 21:48:45,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080734320] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 21:48:45,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 21:48:45,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21, 13] total 41 [2023-11-29 21:48:45,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157784314] [2023-11-29 21:48:45,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 21:48:45,408 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-11-29 21:48:45,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 21:48:45,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-11-29 21:48:45,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1471, Unknown=0, NotChecked=0, Total=1640 [2023-11-29 21:48:45,413 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 335 [2023-11-29 21:48:45,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 782 places, 11545 transitions, 235886 flow. Second operand has 41 states, 41 states have (on average 194.78048780487805) internal successors, (7986), 41 states have internal predecessors, (7986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 21:48:45,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 21:48:45,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 335 [2023-11-29 21:48:45,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2023-11-29 21:54:13,806 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-29 21:54:13,806 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-29 21:54:14,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 [2023-11-29 21:54:14,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-29 21:54:16,170 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (10 of 11 remaining) [2023-11-29 21:54:16,170 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 21:54:16,170 WARN L624 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-11-29 21:54:16,171 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 11 remaining) [2023-11-29 21:54:16,172 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 11 remaining) [2023-11-29 21:54:16,172 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 11 remaining) [2023-11-29 21:54:16,172 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 11 remaining) [2023-11-29 21:54:16,172 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 11 remaining) [2023-11-29 21:54:16,172 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 11 remaining) [2023-11-29 21:54:16,172 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Thread1of1ForFork4Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 11 remaining) [2023-11-29 21:54:16,172 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Thread1of1ForFork4Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 11 remaining) [2023-11-29 21:54:16,172 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Thread1of1ForFork0Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 11 remaining) [2023-11-29 21:54:16,172 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread4Thread1of1ForFork0Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 11 remaining) [2023-11-29 21:54:16,172 INFO L457 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1] [2023-11-29 21:54:16,174 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 21:54:16,174 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 21:54:16,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 09:54:16 BasicIcfg [2023-11-29 21:54:16,177 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 21:54:16,177 INFO L158 Benchmark]: Toolchain (without parser) took 643834.14ms. Allocated memory was 446.7MB in the beginning and 15.4GB in the end (delta: 14.9GB). Free memory was 402.5MB in the beginning and 6.0GB in the end (delta: -5.6GB). Peak memory consumption was 9.8GB. Max. memory is 16.0GB. [2023-11-29 21:54:16,177 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 308.3MB. Free memory is still 257.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-29 21:54:16,177 INFO L158 Benchmark]: CACSL2BoogieTranslator took 179.57ms. Allocated memory is still 446.7MB. Free memory was 402.1MB in the beginning and 389.1MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-11-29 21:54:16,177 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.55ms. Allocated memory is still 446.7MB. Free memory was 389.1MB in the beginning and 385.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-11-29 21:54:16,177 INFO L158 Benchmark]: Boogie Preprocessor took 63.11ms. Allocated memory is still 446.7MB. Free memory was 385.7MB in the beginning and 383.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-29 21:54:16,178 INFO L158 Benchmark]: RCFGBuilder took 928.92ms. Allocated memory is still 446.7MB. Free memory was 383.2MB in the beginning and 374.3MB in the end (delta: 8.9MB). Peak memory consumption was 44.2MB. Max. memory is 16.0GB. [2023-11-29 21:54:16,178 INFO L158 Benchmark]: TraceAbstraction took 642616.87ms. Allocated memory was 446.7MB in the beginning and 15.4GB in the end (delta: 14.9GB). Free memory was 374.3MB in the beginning and 6.0GB in the end (delta: -5.6GB). Peak memory consumption was 9.8GB. Max. memory is 16.0GB. [2023-11-29 21:54:16,178 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 308.3MB. Free memory is still 257.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 179.57ms. Allocated memory is still 446.7MB. Free memory was 402.1MB in the beginning and 389.1MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 40.55ms. Allocated memory is still 446.7MB. Free memory was 389.1MB in the beginning and 385.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 63.11ms. Allocated memory is still 446.7MB. Free memory was 385.7MB in the beginning and 383.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 928.92ms. Allocated memory is still 446.7MB. Free memory was 383.2MB in the beginning and 374.3MB in the end (delta: 8.9MB). Peak memory consumption was 44.2MB. Max. memory is 16.0GB. * TraceAbstraction took 642616.87ms. Allocated memory was 446.7MB in the beginning and 15.4GB in the end (delta: 14.9GB). Free memory was 374.3MB in the beginning and 6.0GB in the end (delta: -5.6GB). Peak memory consumption was 9.8GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 166]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 81]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 80]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 160]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 161]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 126]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 127]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 80]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 81]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 126]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 127]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 13 procedures, 393 locations, 11 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 642.4s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 614.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 23 mSolverCounterUnknown, 11657 SdHoareTripleChecker+Valid, 17.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11657 mSDsluCounter, 17930 SdHoareTripleChecker+Invalid, 14.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16941 mSDsCounter, 397 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 41022 IncrementalHoareTripleChecker+Invalid, 41442 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 397 mSolverCounterUnsat, 989 mSDtfsCounter, 41022 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4404 GetRequests, 3601 SyntacticMatches, 0 SemanticMatches, 803 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46039 ImplicationChecksByTransitivity, 21.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=235886occurred in iteration=12, InterpolantAutomatonStates: 524, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 21.9s InterpolantComputationTime, 5406 NumberOfCodeBlocks, 5398 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 6877 ConstructedInterpolants, 5 QuantifiedInterpolants, 47506 SizeOfPredicates, 180 NumberOfNonLiveVariables, 5824 ConjunctsInSsa, 264 ConjunctsInUnsatCore, 28 InterpolantComputations, 9 PerfectInterpolantSequences, 104/236 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown