/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.fix-rcfgbuilder-lbe-0ccecc1-m [2023-11-10 12:36:18,234 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-10 12:36:18,312 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-10 12:36:18,344 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-10 12:36:18,345 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-10 12:36:18,345 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-10 12:36:18,346 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-10 12:36:18,346 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-10 12:36:18,347 INFO L153 SettingsManager]: * Use SBE=true [2023-11-10 12:36:18,350 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-10 12:36:18,351 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-10 12:36:18,351 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-10 12:36:18,351 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-10 12:36:18,353 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-10 12:36:18,353 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-10 12:36:18,353 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-10 12:36:18,353 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-10 12:36:18,353 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-10 12:36:18,354 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-10 12:36:18,354 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-10 12:36:18,354 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-10 12:36:18,355 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-10 12:36:18,355 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-10 12:36:18,355 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-10 12:36:18,355 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-10 12:36:18,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-10 12:36:18,357 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-10 12:36:18,357 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-10 12:36:18,357 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-10 12:36:18,357 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-10 12:36:18,358 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-10 12:36:18,358 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-10 12:36:18,358 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-10 12:36:18,358 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 [2023-11-10 12:36:18,604 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-10 12:36:18,628 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-10 12:36:18,630 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-10 12:36:18,631 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-10 12:36:18,631 INFO L274 PluginConnector]: CDTParser initialized [2023-11-10 12:36:18,632 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c [2023-11-10 12:36:19,863 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-10 12:36:20,079 INFO L384 CDTParser]: Found 1 translation units. [2023-11-10 12:36:20,079 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-sum-array-hom.wvr.c [2023-11-10 12:36:20,087 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ef6ffb2b/20844090290a4b45907534e7f8d0a367/FLAG0f9e0efed [2023-11-10 12:36:20,103 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ef6ffb2b/20844090290a4b45907534e7f8d0a367 [2023-11-10 12:36:20,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-10 12:36:20,109 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-10 12:36:20,112 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-10 12:36:20,112 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-10 12:36:20,116 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-10 12:36:20,117 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:36:20" (1/1) ... [2023-11-10 12:36:20,118 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f0142a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:36:20, skipping insertion in model container [2023-11-10 12:36:20,119 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 12:36:20" (1/1) ... [2023-11-10 12:36:20,143 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-10 12:36:20,318 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/popl20-more-sum-array-hom.wvr.c[2396,2409] [2023-11-10 12:36:20,332 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-10 12:36:20,342 INFO L202 MainTranslator]: Completed pre-run [2023-11-10 12:36:20,377 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/popl20-more-sum-array-hom.wvr.c[2396,2409] [2023-11-10 12:36:20,380 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-10 12:36:20,393 INFO L206 MainTranslator]: Completed translation [2023-11-10 12:36:20,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:36:20 WrapperNode [2023-11-10 12:36:20,393 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-10 12:36:20,394 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-10 12:36:20,394 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-10 12:36:20,395 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-10 12:36:20,400 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:36:20" (1/1) ... [2023-11-10 12:36:20,415 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:36:20" (1/1) ... [2023-11-10 12:36:20,447 INFO L138 Inliner]: procedures = 25, calls = 34, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 105 [2023-11-10 12:36:20,447 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-10 12:36:20,448 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-10 12:36:20,448 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-10 12:36:20,448 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-10 12:36:20,456 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:36:20" (1/1) ... [2023-11-10 12:36:20,457 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:36:20" (1/1) ... [2023-11-10 12:36:20,463 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:36:20" (1/1) ... [2023-11-10 12:36:20,463 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:36:20" (1/1) ... [2023-11-10 12:36:20,472 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:36:20" (1/1) ... [2023-11-10 12:36:20,477 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:36:20" (1/1) ... [2023-11-10 12:36:20,478 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:36:20" (1/1) ... [2023-11-10 12:36:20,479 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:36:20" (1/1) ... [2023-11-10 12:36:20,481 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-10 12:36:20,486 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-10 12:36:20,486 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-10 12:36:20,486 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-10 12:36:20,487 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:36:20" (1/1) ... [2023-11-10 12:36:20,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-10 12:36:20,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:36:20,514 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-10 12:36:20,518 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-10 12:36:20,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-10 12:36:20,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-10 12:36:20,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-10 12:36:20,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-10 12:36:20,544 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-10 12:36:20,544 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-10 12:36:20,544 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-10 12:36:20,544 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-10 12:36:20,544 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-10 12:36:20,545 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-10 12:36:20,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-10 12:36:20,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-10 12:36:20,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-10 12:36:20,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-10 12:36:20,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-10 12:36:20,546 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-10 12:36:20,641 INFO L236 CfgBuilder]: Building ICFG [2023-11-10 12:36:20,643 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-10 12:36:20,933 INFO L277 CfgBuilder]: Performing block encoding [2023-11-10 12:36:20,948 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-10 12:36:20,948 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-10 12:36:20,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:36:20 BoogieIcfgContainer [2023-11-10 12:36:20,952 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-10 12:36:20,953 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-10 12:36:20,953 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-10 12:36:20,955 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-10 12:36:20,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 12:36:20" (1/3) ... [2023-11-10 12:36:20,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@761cbad9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:36:20, skipping insertion in model container [2023-11-10 12:36:20,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 12:36:20" (2/3) ... [2023-11-10 12:36:20,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@761cbad9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 12:36:20, skipping insertion in model container [2023-11-10 12:36:20,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 12:36:20" (3/3) ... [2023-11-10 12:36:20,958 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-sum-array-hom.wvr.c [2023-11-10 12:36:20,973 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-10 12:36:20,973 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-10 12:36:20,973 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-10 12:36:21,053 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-10 12:36:21,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 163 transitions, 347 flow [2023-11-10 12:36:21,190 INFO L124 PetriNetUnfolderBase]: 12/160 cut-off events. [2023-11-10 12:36:21,190 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-10 12:36:21,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 160 events. 12/160 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 113 event pairs, 0 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 119. Up to 2 conditions per place. [2023-11-10 12:36:21,199 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 163 transitions, 347 flow [2023-11-10 12:36:21,204 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 149 transitions, 316 flow [2023-11-10 12:36:21,220 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-10 12:36:21,227 INFO L357 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=false, 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;@8e984a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-10 12:36:21,227 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-10 12:36:21,267 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-10 12:36:21,267 INFO L124 PetriNetUnfolderBase]: 12/148 cut-off events. [2023-11-10 12:36:21,267 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-10 12:36:21,268 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:36:21,268 INFO L208 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] [2023-11-10 12:36:21,269 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-10 12:36:21,273 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:36:21,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1859928083, now seen corresponding path program 1 times [2023-11-10 12:36:21,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:36:21,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299167841] [2023-11-10 12:36:21,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:36:21,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:36:21,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:36:22,390 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-10 12:36:22,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:36:22,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299167841] [2023-11-10 12:36:22,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299167841] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 12:36:22,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 12:36:22,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-10 12:36:22,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423960914] [2023-11-10 12:36:22,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 12:36:22,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-10 12:36:22,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:36:22,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-10 12:36:22,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-10 12:36:22,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 163 [2023-11-10 12:36:22,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 149 transitions, 316 flow. Second operand has 7 states, 7 states have (on average 118.71428571428571) internal successors, (831), 7 states have internal predecessors, (831), 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-10 12:36:22,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:36:22,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 163 [2023-11-10 12:36:22,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:36:22,740 INFO L124 PetriNetUnfolderBase]: 53/406 cut-off events. [2023-11-10 12:36:22,740 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2023-11-10 12:36:22,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 577 conditions, 406 events. 53/406 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1554 event pairs, 9 based on Foata normal form. 60/435 useless extension candidates. Maximal degree in co-relation 212. Up to 51 conditions per place. [2023-11-10 12:36:22,750 INFO L140 encePairwiseOnDemand]: 142/163 looper letters, 59 selfloop transitions, 9 changer transitions 11/180 dead transitions. [2023-11-10 12:36:22,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 180 transitions, 572 flow [2023-11-10 12:36:22,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-10 12:36:22,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-10 12:36:22,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1354 transitions. [2023-11-10 12:36:22,769 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7551589514779699 [2023-11-10 12:36:22,769 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1354 transitions. [2023-11-10 12:36:22,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1354 transitions. [2023-11-10 12:36:22,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:36:22,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1354 transitions. [2023-11-10 12:36:22,781 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 123.0909090909091) internal successors, (1354), 11 states have internal predecessors, (1354), 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-10 12:36:22,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 163.0) internal successors, (1956), 12 states have internal predecessors, (1956), 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-10 12:36:22,790 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 163.0) internal successors, (1956), 12 states have internal predecessors, (1956), 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-10 12:36:22,792 INFO L175 Difference]: Start difference. First operand has 147 places, 149 transitions, 316 flow. Second operand 11 states and 1354 transitions. [2023-11-10 12:36:22,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 180 transitions, 572 flow [2023-11-10 12:36:22,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 180 transitions, 536 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-10 12:36:22,801 INFO L231 Difference]: Finished difference. Result has 155 places, 143 transitions, 333 flow [2023-11-10 12:36:22,803 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=333, PETRI_PLACES=155, PETRI_TRANSITIONS=143} [2023-11-10 12:36:22,806 INFO L281 CegarLoopForPetriNet]: 147 programPoint places, 8 predicate places. [2023-11-10 12:36:22,806 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 143 transitions, 333 flow [2023-11-10 12:36:22,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 118.71428571428571) internal successors, (831), 7 states have internal predecessors, (831), 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-10 12:36:22,807 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:36:22,807 INFO L208 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] [2023-11-10 12:36:22,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-10 12:36:22,808 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-10 12:36:22,808 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:36:22,808 INFO L85 PathProgramCache]: Analyzing trace with hash 458794696, now seen corresponding path program 1 times [2023-11-10 12:36:22,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:36:22,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096985263] [2023-11-10 12:36:22,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:36:22,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:36:22,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:36:22,980 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:36:22,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:36:22,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096985263] [2023-11-10 12:36:22,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096985263] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 12:36:22,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 12:36:22,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-10 12:36:22,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932030949] [2023-11-10 12:36:22,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 12:36:22,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-10 12:36:22,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:36:22,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-10 12:36:22,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-10 12:36:22,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 163 [2023-11-10 12:36:22,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 143 transitions, 333 flow. Second operand has 7 states, 7 states have (on average 125.0) internal successors, (875), 7 states have internal predecessors, (875), 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-10 12:36:22,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:36:22,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 163 [2023-11-10 12:36:22,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:36:23,250 INFO L124 PetriNetUnfolderBase]: 225/917 cut-off events. [2023-11-10 12:36:23,250 INFO L125 PetriNetUnfolderBase]: For 74/81 co-relation queries the response was YES. [2023-11-10 12:36:23,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1487 conditions, 917 events. 225/917 cut-off events. For 74/81 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5451 event pairs, 120 based on Foata normal form. 0/769 useless extension candidates. Maximal degree in co-relation 1455. Up to 282 conditions per place. [2023-11-10 12:36:23,261 INFO L140 encePairwiseOnDemand]: 150/163 looper letters, 43 selfloop transitions, 14 changer transitions 0/167 dead transitions. [2023-11-10 12:36:23,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 167 transitions, 503 flow [2023-11-10 12:36:23,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-10 12:36:23,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-10 12:36:23,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1268 transitions. [2023-11-10 12:36:23,266 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7779141104294478 [2023-11-10 12:36:23,266 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1268 transitions. [2023-11-10 12:36:23,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1268 transitions. [2023-11-10 12:36:23,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:36:23,267 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1268 transitions. [2023-11-10 12:36:23,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 126.8) internal successors, (1268), 10 states have internal predecessors, (1268), 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-10 12:36:23,273 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 163.0) internal successors, (1793), 11 states have internal predecessors, (1793), 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-10 12:36:23,274 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 163.0) internal successors, (1793), 11 states have internal predecessors, (1793), 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-10 12:36:23,274 INFO L175 Difference]: Start difference. First operand has 155 places, 143 transitions, 333 flow. Second operand 10 states and 1268 transitions. [2023-11-10 12:36:23,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 167 transitions, 503 flow [2023-11-10 12:36:23,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 167 transitions, 499 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-10 12:36:23,283 INFO L231 Difference]: Finished difference. Result has 156 places, 150 transitions, 395 flow [2023-11-10 12:36:23,283 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=395, PETRI_PLACES=156, PETRI_TRANSITIONS=150} [2023-11-10 12:36:23,284 INFO L281 CegarLoopForPetriNet]: 147 programPoint places, 9 predicate places. [2023-11-10 12:36:23,284 INFO L495 AbstractCegarLoop]: Abstraction has has 156 places, 150 transitions, 395 flow [2023-11-10 12:36:23,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 125.0) internal successors, (875), 7 states have internal predecessors, (875), 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-10 12:36:23,285 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:36:23,285 INFO L208 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] [2023-11-10 12:36:23,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-10 12:36:23,286 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-10 12:36:23,287 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:36:23,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1462566017, now seen corresponding path program 1 times [2023-11-10 12:36:23,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:36:23,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907890878] [2023-11-10 12:36:23,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:36:23,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:36:23,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:36:23,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:36:23,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:36:23,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907890878] [2023-11-10 12:36:23,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907890878] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 12:36:23,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 12:36:23,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-10 12:36:23,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146315387] [2023-11-10 12:36:23,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 12:36:23,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-10 12:36:23,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:36:23,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-10 12:36:23,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-10 12:36:23,688 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 163 [2023-11-10 12:36:23,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 150 transitions, 395 flow. Second operand has 10 states, 10 states have (on average 96.3) internal successors, (963), 10 states have internal predecessors, (963), 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-10 12:36:23,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:36:23,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 163 [2023-11-10 12:36:23,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:36:24,369 INFO L124 PetriNetUnfolderBase]: 1018/2804 cut-off events. [2023-11-10 12:36:24,370 INFO L125 PetriNetUnfolderBase]: For 372/401 co-relation queries the response was YES. [2023-11-10 12:36:24,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4867 conditions, 2804 events. 1018/2804 cut-off events. For 372/401 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 22898 event pairs, 712 based on Foata normal form. 28/2455 useless extension candidates. Maximal degree in co-relation 4024. Up to 1262 conditions per place. [2023-11-10 12:36:24,395 INFO L140 encePairwiseOnDemand]: 147/163 looper letters, 81 selfloop transitions, 17 changer transitions 0/184 dead transitions. [2023-11-10 12:36:24,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 184 transitions, 669 flow [2023-11-10 12:36:24,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-10 12:36:24,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-10 12:36:24,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1282 transitions. [2023-11-10 12:36:24,400 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6050023596035866 [2023-11-10 12:36:24,400 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1282 transitions. [2023-11-10 12:36:24,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1282 transitions. [2023-11-10 12:36:24,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:36:24,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1282 transitions. [2023-11-10 12:36:24,404 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 98.61538461538461) internal successors, (1282), 13 states have internal predecessors, (1282), 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-10 12:36:24,410 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 163.0) internal successors, (2282), 14 states have internal predecessors, (2282), 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-10 12:36:24,411 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 163.0) internal successors, (2282), 14 states have internal predecessors, (2282), 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-10 12:36:24,411 INFO L175 Difference]: Start difference. First operand has 156 places, 150 transitions, 395 flow. Second operand 13 states and 1282 transitions. [2023-11-10 12:36:24,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 184 transitions, 669 flow [2023-11-10 12:36:24,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 184 transitions, 665 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-10 12:36:24,420 INFO L231 Difference]: Finished difference. Result has 172 places, 155 transitions, 460 flow [2023-11-10 12:36:24,421 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=460, PETRI_PLACES=172, PETRI_TRANSITIONS=155} [2023-11-10 12:36:24,422 INFO L281 CegarLoopForPetriNet]: 147 programPoint places, 25 predicate places. [2023-11-10 12:36:24,422 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 155 transitions, 460 flow [2023-11-10 12:36:24,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 96.3) internal successors, (963), 10 states have internal predecessors, (963), 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-10 12:36:24,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:36:24,423 INFO L208 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] [2023-11-10 12:36:24,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-10 12:36:24,423 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-10 12:36:24,424 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:36:24,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1983580268, now seen corresponding path program 1 times [2023-11-10 12:36:24,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:36:24,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747170233] [2023-11-10 12:36:24,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:36:24,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:36:24,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:36:24,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:36:24,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:36:24,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747170233] [2023-11-10 12:36:24,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747170233] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 12:36:24,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 12:36:24,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-10 12:36:24,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947456331] [2023-11-10 12:36:24,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 12:36:24,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-10 12:36:24,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:36:24,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-10 12:36:24,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-10 12:36:24,808 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 163 [2023-11-10 12:36:24,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 155 transitions, 460 flow. Second operand has 10 states, 10 states have (on average 97.2) internal successors, (972), 10 states have internal predecessors, (972), 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-10 12:36:24,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:36:24,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 163 [2023-11-10 12:36:24,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:36:25,341 INFO L124 PetriNetUnfolderBase]: 742/1799 cut-off events. [2023-11-10 12:36:25,342 INFO L125 PetriNetUnfolderBase]: For 480/503 co-relation queries the response was YES. [2023-11-10 12:36:25,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3536 conditions, 1799 events. 742/1799 cut-off events. For 480/503 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 12325 event pairs, 432 based on Foata normal form. 23/1619 useless extension candidates. Maximal degree in co-relation 3144. Up to 906 conditions per place. [2023-11-10 12:36:25,359 INFO L140 encePairwiseOnDemand]: 146/163 looper letters, 58 selfloop transitions, 10 changer transitions 29/182 dead transitions. [2023-11-10 12:36:25,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 182 transitions, 714 flow [2023-11-10 12:36:25,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-10 12:36:25,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-10 12:36:25,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1382 transitions. [2023-11-10 12:36:25,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6056091148115688 [2023-11-10 12:36:25,363 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1382 transitions. [2023-11-10 12:36:25,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1382 transitions. [2023-11-10 12:36:25,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:36:25,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1382 transitions. [2023-11-10 12:36:25,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 98.71428571428571) internal successors, (1382), 14 states have internal predecessors, (1382), 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-10 12:36:25,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 163.0) internal successors, (2445), 15 states have internal predecessors, (2445), 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-10 12:36:25,371 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 163.0) internal successors, (2445), 15 states have internal predecessors, (2445), 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-10 12:36:25,372 INFO L175 Difference]: Start difference. First operand has 172 places, 155 transitions, 460 flow. Second operand 14 states and 1382 transitions. [2023-11-10 12:36:25,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 182 transitions, 714 flow [2023-11-10 12:36:25,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 182 transitions, 693 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-11-10 12:36:25,379 INFO L231 Difference]: Finished difference. Result has 180 places, 144 transitions, 399 flow [2023-11-10 12:36:25,380 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=399, PETRI_PLACES=180, PETRI_TRANSITIONS=144} [2023-11-10 12:36:25,381 INFO L281 CegarLoopForPetriNet]: 147 programPoint places, 33 predicate places. [2023-11-10 12:36:25,382 INFO L495 AbstractCegarLoop]: Abstraction has has 180 places, 144 transitions, 399 flow [2023-11-10 12:36:25,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 97.2) internal successors, (972), 10 states have internal predecessors, (972), 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-10 12:36:25,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:36:25,382 INFO L208 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] [2023-11-10 12:36:25,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-10 12:36:25,383 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-10 12:36:25,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:36:25,383 INFO L85 PathProgramCache]: Analyzing trace with hash -630975787, now seen corresponding path program 1 times [2023-11-10 12:36:25,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:36:25,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237044048] [2023-11-10 12:36:25,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:36:25,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:36:25,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:36:25,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:36:25,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:36:25,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237044048] [2023-11-10 12:36:25,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237044048] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:36:25,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331198146] [2023-11-10 12:36:25,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:36:25,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:36:25,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:36:25,581 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-10 12:36:25,597 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-10 12:36:25,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:36:25,686 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-10 12:36:25,692 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:36:25,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:36:25,897 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:36:26,080 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:36:26,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331198146] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-10 12:36:26,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-10 12:36:26,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2023-11-10 12:36:26,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817751070] [2023-11-10 12:36:26,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 12:36:26,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-10 12:36:26,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:36:26,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-10 12:36:26,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2023-11-10 12:36:26,084 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 163 [2023-11-10 12:36:26,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 144 transitions, 399 flow. Second operand has 9 states, 9 states have (on average 115.77777777777777) internal successors, (1042), 9 states have internal predecessors, (1042), 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-10 12:36:26,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:36:26,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 163 [2023-11-10 12:36:26,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:36:26,719 INFO L124 PetriNetUnfolderBase]: 1904/4155 cut-off events. [2023-11-10 12:36:26,720 INFO L125 PetriNetUnfolderBase]: For 1348/1349 co-relation queries the response was YES. [2023-11-10 12:36:26,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8749 conditions, 4155 events. 1904/4155 cut-off events. For 1348/1349 co-relation queries the response was YES. Maximal size of possible extension queue 323. Compared 34261 event pairs, 618 based on Foata normal form. 16/4079 useless extension candidates. Maximal degree in co-relation 8630. Up to 885 conditions per place. [2023-11-10 12:36:26,765 INFO L140 encePairwiseOnDemand]: 151/163 looper letters, 92 selfloop transitions, 22 changer transitions 0/215 dead transitions. [2023-11-10 12:36:26,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 215 transitions, 839 flow [2023-11-10 12:36:26,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-10 12:36:26,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-10 12:36:26,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1571 transitions. [2023-11-10 12:36:26,769 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7413874469089193 [2023-11-10 12:36:26,769 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1571 transitions. [2023-11-10 12:36:26,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1571 transitions. [2023-11-10 12:36:26,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:36:26,770 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1571 transitions. [2023-11-10 12:36:26,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 120.84615384615384) internal successors, (1571), 13 states have internal predecessors, (1571), 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-10 12:36:26,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 163.0) internal successors, (2282), 14 states have internal predecessors, (2282), 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-10 12:36:26,777 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 163.0) internal successors, (2282), 14 states have internal predecessors, (2282), 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-10 12:36:26,777 INFO L175 Difference]: Start difference. First operand has 180 places, 144 transitions, 399 flow. Second operand 13 states and 1571 transitions. [2023-11-10 12:36:26,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 215 transitions, 839 flow [2023-11-10 12:36:26,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 215 transitions, 723 flow, removed 34 selfloop flow, removed 20 redundant places. [2023-11-10 12:36:26,792 INFO L231 Difference]: Finished difference. Result has 164 places, 162 transitions, 475 flow [2023-11-10 12:36:26,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=475, PETRI_PLACES=164, PETRI_TRANSITIONS=162} [2023-11-10 12:36:26,793 INFO L281 CegarLoopForPetriNet]: 147 programPoint places, 17 predicate places. [2023-11-10 12:36:26,793 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 162 transitions, 475 flow [2023-11-10 12:36:26,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 115.77777777777777) internal successors, (1042), 9 states have internal predecessors, (1042), 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-10 12:36:26,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:36:26,794 INFO L208 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] [2023-11-10 12:36:26,803 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-10 12:36:27,000 WARN L477 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-10 12:36:27,001 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-10 12:36:27,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:36:27,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1303530599, now seen corresponding path program 2 times [2023-11-10 12:36:27,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:36:27,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081140865] [2023-11-10 12:36:27,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:36:27,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:36:27,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:36:27,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:36:27,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:36:27,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081140865] [2023-11-10 12:36:27,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081140865] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:36:27,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487935717] [2023-11-10 12:36:27,174 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-10 12:36:27,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:36:27,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:36:27,175 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-10 12:36:27,201 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-10 12:36:27,284 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-10 12:36:27,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 12:36:27,286 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-10 12:36:27,291 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:36:27,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:36:27,446 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:36:27,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:36:27,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487935717] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-10 12:36:27,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-10 12:36:27,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 20 [2023-11-10 12:36:27,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498336505] [2023-11-10 12:36:27,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 12:36:27,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-10 12:36:27,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:36:27,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-10 12:36:27,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2023-11-10 12:36:27,635 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 163 [2023-11-10 12:36:27,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 162 transitions, 475 flow. Second operand has 9 states, 9 states have (on average 115.77777777777777) internal successors, (1042), 9 states have internal predecessors, (1042), 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-10 12:36:27,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:36:27,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 163 [2023-11-10 12:36:27,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:36:28,327 INFO L124 PetriNetUnfolderBase]: 2265/4763 cut-off events. [2023-11-10 12:36:28,327 INFO L125 PetriNetUnfolderBase]: For 2458/2469 co-relation queries the response was YES. [2023-11-10 12:36:28,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11013 conditions, 4763 events. 2265/4763 cut-off events. For 2458/2469 co-relation queries the response was YES. Maximal size of possible extension queue 384. Compared 40059 event pairs, 591 based on Foata normal form. 24/4300 useless extension candidates. Maximal degree in co-relation 10918. Up to 1124 conditions per place. [2023-11-10 12:36:28,375 INFO L140 encePairwiseOnDemand]: 150/163 looper letters, 92 selfloop transitions, 31 changer transitions 0/224 dead transitions. [2023-11-10 12:36:28,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 224 transitions, 944 flow [2023-11-10 12:36:28,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-10 12:36:28,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-10 12:36:28,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1339 transitions. [2023-11-10 12:36:28,380 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7467930842163971 [2023-11-10 12:36:28,380 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1339 transitions. [2023-11-10 12:36:28,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1339 transitions. [2023-11-10 12:36:28,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:36:28,381 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1339 transitions. [2023-11-10 12:36:28,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 121.72727272727273) internal successors, (1339), 11 states have internal predecessors, (1339), 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-10 12:36:28,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 163.0) internal successors, (1956), 12 states have internal predecessors, (1956), 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-10 12:36:28,387 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 163.0) internal successors, (1956), 12 states have internal predecessors, (1956), 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-10 12:36:28,387 INFO L175 Difference]: Start difference. First operand has 164 places, 162 transitions, 475 flow. Second operand 11 states and 1339 transitions. [2023-11-10 12:36:28,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 224 transitions, 944 flow [2023-11-10 12:36:28,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 224 transitions, 939 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-10 12:36:28,410 INFO L231 Difference]: Finished difference. Result has 176 places, 179 transitions, 690 flow [2023-11-10 12:36:28,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=690, PETRI_PLACES=176, PETRI_TRANSITIONS=179} [2023-11-10 12:36:28,413 INFO L281 CegarLoopForPetriNet]: 147 programPoint places, 29 predicate places. [2023-11-10 12:36:28,414 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 179 transitions, 690 flow [2023-11-10 12:36:28,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 115.77777777777777) internal successors, (1042), 9 states have internal predecessors, (1042), 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-10 12:36:28,414 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:36:28,414 INFO L208 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] [2023-11-10 12:36:28,423 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-10 12:36:28,620 WARN L477 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-10 12:36:28,621 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-10 12:36:28,621 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:36:28,621 INFO L85 PathProgramCache]: Analyzing trace with hash -227071655, now seen corresponding path program 3 times [2023-11-10 12:36:28,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:36:28,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013903095] [2023-11-10 12:36:28,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:36:28,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:36:28,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:36:28,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:36:28,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:36:28,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013903095] [2023-11-10 12:36:28,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013903095] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:36:28,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083492465] [2023-11-10 12:36:28,806 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-10 12:36:28,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:36:28,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:36:28,807 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-10 12:36:28,810 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-10 12:36:28,914 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-10 12:36:28,914 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 12:36:28,916 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-10 12:36:28,924 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:36:29,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:36:29,075 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:36:29,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:36:29,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083492465] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-10 12:36:29,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-10 12:36:29,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 19 [2023-11-10 12:36:29,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563878835] [2023-11-10 12:36:29,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 12:36:29,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-10 12:36:29,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:36:29,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-10 12:36:29,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2023-11-10 12:36:29,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 163 [2023-11-10 12:36:29,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 179 transitions, 690 flow. Second operand has 9 states, 9 states have (on average 115.77777777777777) internal successors, (1042), 9 states have internal predecessors, (1042), 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-10 12:36:29,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:36:29,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 163 [2023-11-10 12:36:29,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:36:30,274 INFO L124 PetriNetUnfolderBase]: 3100/6245 cut-off events. [2023-11-10 12:36:30,274 INFO L125 PetriNetUnfolderBase]: For 8875/8956 co-relation queries the response was YES. [2023-11-10 12:36:30,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17460 conditions, 6245 events. 3100/6245 cut-off events. For 8875/8956 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 53595 event pairs, 657 based on Foata normal form. 32/5660 useless extension candidates. Maximal degree in co-relation 17358. Up to 1788 conditions per place. [2023-11-10 12:36:30,348 INFO L140 encePairwiseOnDemand]: 149/163 looper letters, 91 selfloop transitions, 52 changer transitions 0/244 dead transitions. [2023-11-10 12:36:30,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 244 transitions, 1337 flow [2023-11-10 12:36:30,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-10 12:36:30,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-10 12:36:30,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1213 transitions. [2023-11-10 12:36:30,352 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7441717791411043 [2023-11-10 12:36:30,352 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1213 transitions. [2023-11-10 12:36:30,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1213 transitions. [2023-11-10 12:36:30,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:36:30,353 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1213 transitions. [2023-11-10 12:36:30,356 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 121.3) internal successors, (1213), 10 states have internal predecessors, (1213), 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-10 12:36:30,359 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 163.0) internal successors, (1793), 11 states have internal predecessors, (1793), 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-10 12:36:30,360 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 163.0) internal successors, (1793), 11 states have internal predecessors, (1793), 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-10 12:36:30,360 INFO L175 Difference]: Start difference. First operand has 176 places, 179 transitions, 690 flow. Second operand 10 states and 1213 transitions. [2023-11-10 12:36:30,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 244 transitions, 1337 flow [2023-11-10 12:36:30,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 244 transitions, 1302 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-11-10 12:36:30,432 INFO L231 Difference]: Finished difference. Result has 186 places, 207 transitions, 1080 flow [2023-11-10 12:36:30,433 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=671, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1080, PETRI_PLACES=186, PETRI_TRANSITIONS=207} [2023-11-10 12:36:30,433 INFO L281 CegarLoopForPetriNet]: 147 programPoint places, 39 predicate places. [2023-11-10 12:36:30,433 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 207 transitions, 1080 flow [2023-11-10 12:36:30,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 115.77777777777777) internal successors, (1042), 9 states have internal predecessors, (1042), 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-10 12:36:30,434 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:36:30,435 INFO L208 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] [2023-11-10 12:36:30,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-10 12:36:30,641 WARN L477 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-10 12:36:30,641 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-10 12:36:30,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:36:30,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1368514269, now seen corresponding path program 4 times [2023-11-10 12:36:30,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:36:30,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395518701] [2023-11-10 12:36:30,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:36:30,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:36:30,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:36:30,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:36:30,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:36:30,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395518701] [2023-11-10 12:36:30,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395518701] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:36:30,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344269580] [2023-11-10 12:36:30,807 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-10 12:36:30,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:36:30,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:36:30,809 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-10 12:36:30,812 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-10 12:36:30,901 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-10 12:36:30,901 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 12:36:30,903 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-10 12:36:30,909 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:36:31,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:36:31,070 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:36:31,270 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:36:31,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344269580] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-10 12:36:31,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-10 12:36:31,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2023-11-10 12:36:31,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978201114] [2023-11-10 12:36:31,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 12:36:31,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-10 12:36:31,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:36:31,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-10 12:36:31,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2023-11-10 12:36:31,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 163 [2023-11-10 12:36:31,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 207 transitions, 1080 flow. Second operand has 9 states, 9 states have (on average 115.77777777777777) internal successors, (1042), 9 states have internal predecessors, (1042), 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-10 12:36:31,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:36:31,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 163 [2023-11-10 12:36:31,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:36:32,274 INFO L124 PetriNetUnfolderBase]: 3196/6838 cut-off events. [2023-11-10 12:36:32,274 INFO L125 PetriNetUnfolderBase]: For 17167/17330 co-relation queries the response was YES. [2023-11-10 12:36:32,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21537 conditions, 6838 events. 3196/6838 cut-off events. For 17167/17330 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 61257 event pairs, 698 based on Foata normal form. 48/6225 useless extension candidates. Maximal degree in co-relation 21429. Up to 1276 conditions per place. [2023-11-10 12:36:32,341 INFO L140 encePairwiseOnDemand]: 151/163 looper letters, 103 selfloop transitions, 62 changer transitions 0/266 dead transitions. [2023-11-10 12:36:32,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 266 transitions, 1804 flow [2023-11-10 12:36:32,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-10 12:36:32,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-10 12:36:32,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1323 transitions. [2023-11-10 12:36:32,345 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7378694924707194 [2023-11-10 12:36:32,345 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1323 transitions. [2023-11-10 12:36:32,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1323 transitions. [2023-11-10 12:36:32,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:36:32,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1323 transitions. [2023-11-10 12:36:32,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 120.27272727272727) internal successors, (1323), 11 states have internal predecessors, (1323), 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-10 12:36:32,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 163.0) internal successors, (1956), 12 states have internal predecessors, (1956), 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-10 12:36:32,352 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 163.0) internal successors, (1956), 12 states have internal predecessors, (1956), 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-10 12:36:32,353 INFO L175 Difference]: Start difference. First operand has 186 places, 207 transitions, 1080 flow. Second operand 11 states and 1323 transitions. [2023-11-10 12:36:32,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 266 transitions, 1804 flow [2023-11-10 12:36:32,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 266 transitions, 1779 flow, removed 9 selfloop flow, removed 4 redundant places. [2023-11-10 12:36:32,425 INFO L231 Difference]: Finished difference. Result has 196 places, 228 transitions, 1497 flow [2023-11-10 12:36:32,426 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=1057, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1497, PETRI_PLACES=196, PETRI_TRANSITIONS=228} [2023-11-10 12:36:32,426 INFO L281 CegarLoopForPetriNet]: 147 programPoint places, 49 predicate places. [2023-11-10 12:36:32,426 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 228 transitions, 1497 flow [2023-11-10 12:36:32,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 115.77777777777777) internal successors, (1042), 9 states have internal predecessors, (1042), 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-10 12:36:32,427 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:36:32,427 INFO L208 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] [2023-11-10 12:36:32,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-10 12:36:32,635 WARN L477 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-10 12:36:32,636 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-10 12:36:32,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:36:32,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1518315907, now seen corresponding path program 5 times [2023-11-10 12:36:32,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:36:32,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543493039] [2023-11-10 12:36:32,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:36:32,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:36:32,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:36:32,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:36:32,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:36:32,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543493039] [2023-11-10 12:36:32,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543493039] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:36:32,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676664103] [2023-11-10 12:36:32,811 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-10 12:36:32,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:36:32,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:36:32,813 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-10 12:36:32,837 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-10 12:36:32,915 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-10 12:36:32,915 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 12:36:32,917 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-10 12:36:32,921 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:36:33,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:36:33,018 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:36:33,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:36:33,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676664103] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-10 12:36:33,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-10 12:36:33,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 16 [2023-11-10 12:36:33,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428451808] [2023-11-10 12:36:33,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-10 12:36:33,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-10 12:36:33,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:36:33,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-10 12:36:33,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2023-11-10 12:36:33,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 163 [2023-11-10 12:36:33,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 228 transitions, 1497 flow. Second operand has 16 states, 16 states have (on average 111.3125) internal successors, (1781), 16 states have internal predecessors, (1781), 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-10 12:36:33,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:36:33,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 163 [2023-11-10 12:36:33,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:36:35,879 INFO L124 PetriNetUnfolderBase]: 8245/16189 cut-off events. [2023-11-10 12:36:35,879 INFO L125 PetriNetUnfolderBase]: For 62656/63073 co-relation queries the response was YES. [2023-11-10 12:36:35,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55884 conditions, 16189 events. 8245/16189 cut-off events. For 62656/63073 co-relation queries the response was YES. Maximal size of possible extension queue 831. Compared 145217 event pairs, 1201 based on Foata normal form. 122/15496 useless extension candidates. Maximal degree in co-relation 55771. Up to 1878 conditions per place. [2023-11-10 12:36:36,046 INFO L140 encePairwiseOnDemand]: 141/163 looper letters, 265 selfloop transitions, 237 changer transitions 0/598 dead transitions. [2023-11-10 12:36:36,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 598 transitions, 4996 flow [2023-11-10 12:36:36,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-10 12:36:36,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-11-10 12:36:36,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 3570 transitions. [2023-11-10 12:36:36,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7300613496932515 [2023-11-10 12:36:36,055 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 3570 transitions. [2023-11-10 12:36:36,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 3570 transitions. [2023-11-10 12:36:36,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:36:36,057 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 3570 transitions. [2023-11-10 12:36:36,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 119.0) internal successors, (3570), 30 states have internal predecessors, (3570), 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-10 12:36:36,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 163.0) internal successors, (5053), 31 states have internal predecessors, (5053), 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-10 12:36:36,087 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 163.0) internal successors, (5053), 31 states have internal predecessors, (5053), 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-10 12:36:36,087 INFO L175 Difference]: Start difference. First operand has 196 places, 228 transitions, 1497 flow. Second operand 30 states and 3570 transitions. [2023-11-10 12:36:36,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 598 transitions, 4996 flow [2023-11-10 12:36:36,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 598 transitions, 4873 flow, removed 58 selfloop flow, removed 4 redundant places. [2023-11-10 12:36:36,640 INFO L231 Difference]: Finished difference. Result has 243 places, 391 transitions, 4046 flow [2023-11-10 12:36:36,640 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=1452, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=4046, PETRI_PLACES=243, PETRI_TRANSITIONS=391} [2023-11-10 12:36:36,641 INFO L281 CegarLoopForPetriNet]: 147 programPoint places, 96 predicate places. [2023-11-10 12:36:36,641 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 391 transitions, 4046 flow [2023-11-10 12:36:36,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 111.3125) internal successors, (1781), 16 states have internal predecessors, (1781), 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-10 12:36:36,642 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:36:36,643 INFO L208 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] [2023-11-10 12:36:36,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-10 12:36:36,849 WARN L477 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-10 12:36:36,849 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-10 12:36:36,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:36:36,850 INFO L85 PathProgramCache]: Analyzing trace with hash -224893010, now seen corresponding path program 1 times [2023-11-10 12:36:36,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:36:36,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922059073] [2023-11-10 12:36:36,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:36:36,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:36:36,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:36:36,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:36:36,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:36:36,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922059073] [2023-11-10 12:36:36,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922059073] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:36:36,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520483537] [2023-11-10 12:36:36,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:36:36,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:36:36,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:36:36,997 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-10 12:36:37,001 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-10 12:36:37,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:36:37,111 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-10 12:36:37,113 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:36:37,287 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:36:37,288 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:36:37,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:36:37,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [520483537] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-10 12:36:37,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-10 12:36:37,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2023-11-10 12:36:37,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942524976] [2023-11-10 12:36:37,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 12:36:37,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-10 12:36:37,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:36:37,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-10 12:36:37,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2023-11-10 12:36:37,420 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 163 [2023-11-10 12:36:37,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 391 transitions, 4046 flow. Second operand has 7 states, 7 states have (on average 125.0) internal successors, (875), 7 states have internal predecessors, (875), 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-10 12:36:37,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:36:37,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 163 [2023-11-10 12:36:37,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:36:38,315 INFO L124 PetriNetUnfolderBase]: 1665/4589 cut-off events. [2023-11-10 12:36:38,316 INFO L125 PetriNetUnfolderBase]: For 49134/51125 co-relation queries the response was YES. [2023-11-10 12:36:38,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19997 conditions, 4589 events. 1665/4589 cut-off events. For 49134/51125 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 40603 event pairs, 282 based on Foata normal form. 339/4585 useless extension candidates. Maximal degree in co-relation 19863. Up to 848 conditions per place. [2023-11-10 12:36:38,377 INFO L140 encePairwiseOnDemand]: 155/163 looper letters, 145 selfloop transitions, 28 changer transitions 0/441 dead transitions. [2023-11-10 12:36:38,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 441 transitions, 5126 flow [2023-11-10 12:36:38,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-10 12:36:38,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-10 12:36:38,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 887 transitions. [2023-11-10 12:36:38,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7773882559158632 [2023-11-10 12:36:38,379 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 887 transitions. [2023-11-10 12:36:38,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 887 transitions. [2023-11-10 12:36:38,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:36:38,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 887 transitions. [2023-11-10 12:36:38,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.71428571428571) internal successors, (887), 7 states have internal predecessors, (887), 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-10 12:36:38,384 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 163.0) internal successors, (1304), 8 states have internal predecessors, (1304), 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-10 12:36:38,385 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 163.0) internal successors, (1304), 8 states have internal predecessors, (1304), 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-10 12:36:38,385 INFO L175 Difference]: Start difference. First operand has 243 places, 391 transitions, 4046 flow. Second operand 7 states and 887 transitions. [2023-11-10 12:36:38,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 441 transitions, 5126 flow [2023-11-10 12:36:38,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 441 transitions, 4933 flow, removed 19 selfloop flow, removed 12 redundant places. [2023-11-10 12:36:38,645 INFO L231 Difference]: Finished difference. Result has 238 places, 391 transitions, 3949 flow [2023-11-10 12:36:38,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=3864, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3949, PETRI_PLACES=238, PETRI_TRANSITIONS=391} [2023-11-10 12:36:38,647 INFO L281 CegarLoopForPetriNet]: 147 programPoint places, 91 predicate places. [2023-11-10 12:36:38,647 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 391 transitions, 3949 flow [2023-11-10 12:36:38,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 125.0) internal successors, (875), 7 states have internal predecessors, (875), 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-10 12:36:38,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:36:38,648 INFO L208 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] [2023-11-10 12:36:38,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-10 12:36:38,853 WARN L477 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-10 12:36:38,854 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-10 12:36:38,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:36:38,855 INFO L85 PathProgramCache]: Analyzing trace with hash 376690283, now seen corresponding path program 6 times [2023-11-10 12:36:38,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:36:38,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438346844] [2023-11-10 12:36:38,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:36:38,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:36:38,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:36:39,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:36:39,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:36:39,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438346844] [2023-11-10 12:36:39,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438346844] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:36:39,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082043979] [2023-11-10 12:36:39,010 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-10 12:36:39,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:36:39,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:36:39,013 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-10 12:36:39,016 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-10 12:36:39,112 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-11-10 12:36:39,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-10 12:36:39,114 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-10 12:36:39,117 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:36:39,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:36:39,276 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:36:39,500 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-10 12:36:39,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2082043979] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-10 12:36:39,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-10 12:36:39,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 20 [2023-11-10 12:36:39,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245974183] [2023-11-10 12:36:39,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 12:36:39,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-10 12:36:39,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 12:36:39,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-10 12:36:39,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2023-11-10 12:36:39,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 163 [2023-11-10 12:36:39,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 391 transitions, 3949 flow. Second operand has 9 states, 9 states have (on average 115.77777777777777) internal successors, (1042), 9 states have internal predecessors, (1042), 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-10 12:36:39,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 12:36:39,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 163 [2023-11-10 12:36:39,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 12:36:40,982 INFO L124 PetriNetUnfolderBase]: 3764/8084 cut-off events. [2023-11-10 12:36:40,982 INFO L125 PetriNetUnfolderBase]: For 48345/48865 co-relation queries the response was YES. [2023-11-10 12:36:41,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33437 conditions, 8084 events. 3764/8084 cut-off events. For 48345/48865 co-relation queries the response was YES. Maximal size of possible extension queue 423. Compared 69981 event pairs, 595 based on Foata normal form. 109/7969 useless extension candidates. Maximal degree in co-relation 33305. Up to 1644 conditions per place. [2023-11-10 12:36:41,086 INFO L140 encePairwiseOnDemand]: 149/163 looper letters, 133 selfloop transitions, 176 changer transitions 0/441 dead transitions. [2023-11-10 12:36:41,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 441 transitions, 4876 flow [2023-11-10 12:36:41,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-10 12:36:41,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-10 12:36:41,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1212 transitions. [2023-11-10 12:36:41,088 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.743558282208589 [2023-11-10 12:36:41,088 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1212 transitions. [2023-11-10 12:36:41,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1212 transitions. [2023-11-10 12:36:41,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 12:36:41,089 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1212 transitions. [2023-11-10 12:36:41,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 121.2) internal successors, (1212), 10 states have internal predecessors, (1212), 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-10 12:36:41,092 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 163.0) internal successors, (1793), 11 states have internal predecessors, (1793), 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-10 12:36:41,092 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 163.0) internal successors, (1793), 11 states have internal predecessors, (1793), 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-10 12:36:41,093 INFO L175 Difference]: Start difference. First operand has 238 places, 391 transitions, 3949 flow. Second operand 10 states and 1212 transitions. [2023-11-10 12:36:41,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 441 transitions, 4876 flow [2023-11-10 12:36:41,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 441 transitions, 4841 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-10 12:36:41,358 INFO L231 Difference]: Finished difference. Result has 246 places, 401 transitions, 4685 flow [2023-11-10 12:36:41,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=3912, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=390, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=165, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4685, PETRI_PLACES=246, PETRI_TRANSITIONS=401} [2023-11-10 12:36:41,359 INFO L281 CegarLoopForPetriNet]: 147 programPoint places, 99 predicate places. [2023-11-10 12:36:41,359 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 401 transitions, 4685 flow [2023-11-10 12:36:41,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 115.77777777777777) internal successors, (1042), 9 states have internal predecessors, (1042), 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-10 12:36:41,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 12:36:41,360 INFO L208 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] [2023-11-10 12:36:41,364 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-10 12:36:41,561 WARN L477 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-10 12:36:41,561 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-11-10 12:36:41,561 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 12:36:41,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1408331695, now seen corresponding path program 1 times [2023-11-10 12:36:41,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 12:36:41,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12586461] [2023-11-10 12:36:41,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:36:41,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 12:36:41,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:36:42,898 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-10 12:36:42,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 12:36:42,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12586461] [2023-11-10 12:36:42,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12586461] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-10 12:36:42,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7796038] [2023-11-10 12:36:42,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 12:36:42,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-10 12:36:42,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 12:36:42,900 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-10 12:36:42,903 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-10 12:36:43,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 12:36:43,004 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 55 conjunts are in the unsatisfiable core [2023-11-10 12:36:43,009 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-10 12:36:43,057 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-10 12:36:43,108 INFO L322 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-10 12:36:43,108 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-11-10 12:36:43,159 INFO L322 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-11-10 12:36:43,159 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 22 [2023-11-10 12:36:43,469 INFO L322 Elim1Store]: treesize reduction 36, result has 26.5 percent of original size [2023-11-10 12:36:43,470 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 21 treesize of output 25 [2023-11-10 12:36:43,667 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-10 12:36:44,023 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-10 12:36:44,158 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-10 12:36:44,410 INFO L351 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-10 12:36:44,446 INFO L351 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-10 12:36:44,567 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-10 12:36:44,568 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-10 12:36:44,906 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_319 (Array Int Int))) (= (mod (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_319) c_~A~0.base) c_~A~0.offset) c_~sum3~0 c_~sum2~0) 4294967296) (mod (+ |c_thread1Thread1of1ForFork1_#t~mem2| c_~sum1~0) 4294967296))) is different from false [2023-11-10 12:36:44,914 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_319 (Array Int Int))) (= (mod (+ (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4))) c_~sum1~0) 4294967296) (mod (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_319) c_~A~0.base) c_~A~0.offset) c_~sum3~0 c_~sum2~0) 4294967296))) is different from false [2023-11-10 12:36:44,940 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_319 (Array Int Int)) (v_ArrVal_318 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_318))) (= (mod (+ (select (select .cse0 c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork1_~i~0 4))) c_~sum1~0) 4294967296) (mod (+ c_~sum3~0 c_~sum2~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_319) c_~A~0.base) c_~A~0.offset)) 4294967296)))) is different from false [2023-11-10 12:36:44,971 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_319 (Array Int Int)) (v_ArrVal_318 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_318))) (= (mod (+ c_~sum3~0 c_~sum2~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_319) c_~A~0.base) c_~A~0.offset)) 4294967296) (mod (+ c_~sum1~0 (select (select .cse0 c_~A~0.base) c_~A~0.offset)) 4294967296)))) is different from false [2023-11-10 12:36:44,987 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_317 (Array Int Int)) (v_ArrVal_319 (Array Int Int)) (v_ArrVal_318 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_317) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_318))) (= (mod (+ c_~sum3~0 c_~sum2~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_319) c_~A~0.base) c_~A~0.offset)) 4294967296) (mod (+ c_~sum1~0 (select (select .cse0 c_~A~0.base) c_~A~0.offset)) 4294967296)))) is different from false [2023-11-10 12:36:45,280 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_317 (Array Int Int)) (v_ArrVal_319 (Array Int Int)) (v_ArrVal_318 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_317) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_318))) (= (mod (+ c_~sum3~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_319) |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) c_~sum2~0) 4294967296) (mod (+ (select (select .cse0 |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_uint_array_~arr~0#1.offset|) c_~sum1~0) 4294967296)))) is different from false [2023-11-10 12:36:45,325 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-10 12:36:45,326 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 48 [2023-11-10 12:36:45,334 INFO L351 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 1702 treesize of output 1606 [2023-11-10 12:36:45,349 INFO L351 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 192 treesize of output 184 [2023-11-10 12:36:45,354 INFO L351 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 184 treesize of output 172 [2023-11-10 12:36:45,363 INFO L351 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 88 treesize of output 82 [2023-11-10 12:36:47,291 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-10 12:36:47,296 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-10 12:36:47,496 WARN L477 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-10 12:36:47,497 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: critical constraint is false at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:354) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:343) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:441) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:252) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:324) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:731) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:255) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:338) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:341) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-10 12:36:47,501 INFO L158 Benchmark]: Toolchain (without parser) took 27391.82ms. Allocated memory was 298.8MB in the beginning and 3.4GB in the end (delta: 3.1GB). Free memory was 241.1MB in the beginning and 2.2GB in the end (delta: -1.9GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2023-11-10 12:36:47,501 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 187.7MB. Free memory is still 139.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-10 12:36:47,501 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.52ms. Allocated memory is still 298.8MB. Free memory was 240.8MB in the beginning and 229.2MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-11-10 12:36:47,501 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.18ms. Allocated memory is still 298.8MB. Free memory was 229.2MB in the beginning and 227.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-10 12:36:47,502 INFO L158 Benchmark]: Boogie Preprocessor took 37.24ms. Allocated memory is still 298.8MB. Free memory was 227.5MB in the beginning and 225.8MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-11-10 12:36:47,502 INFO L158 Benchmark]: RCFGBuilder took 465.80ms. Allocated memory is still 298.8MB. Free memory was 225.8MB in the beginning and 209.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-11-10 12:36:47,502 INFO L158 Benchmark]: TraceAbstraction took 26546.91ms. Allocated memory was 298.8MB in the beginning and 3.4GB in the end (delta: 3.1GB). Free memory was 208.3MB in the beginning and 2.2GB in the end (delta: -2.0GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. [2023-11-10 12:36:47,503 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.17ms. Allocated memory is still 187.7MB. Free memory is still 139.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 281.52ms. Allocated memory is still 298.8MB. Free memory was 240.8MB in the beginning and 229.2MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.18ms. Allocated memory is still 298.8MB. Free memory was 229.2MB in the beginning and 227.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.24ms. Allocated memory is still 298.8MB. Free memory was 227.5MB in the beginning and 225.8MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 465.80ms. Allocated memory is still 298.8MB. Free memory was 225.8MB in the beginning and 209.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 26546.91ms. Allocated memory was 298.8MB in the beginning and 3.4GB in the end (delta: 3.1GB). Free memory was 208.3MB in the beginning and 2.2GB in the end (delta: -2.0GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: critical constraint is false de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: critical constraint is false: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:354) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-10 12:36:47,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...