/usr/bin/java -Xmx16000000000 -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-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/weaver/mult-comm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 06:41:03,141 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 06:41:03,215 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-VariableLbe.epf [2023-08-27 06:41:03,220 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 06:41:03,220 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 06:41:03,263 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 06:41:03,263 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 06:41:03,264 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 06:41:03,265 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 06:41:03,268 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 06:41:03,268 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 06:41:03,269 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 06:41:03,269 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 06:41:03,270 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 06:41:03,270 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 06:41:03,271 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 06:41:03,271 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 06:41:03,271 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 06:41:03,271 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 06:41:03,271 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 06:41:03,272 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 06:41:03,272 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 06:41:03,273 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 06:41:03,273 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 06:41:03,273 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 06:41:03,274 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 06:41:03,274 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 06:41:03,274 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 06:41:03,274 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 06:41:03,274 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 06:41:03,275 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 06:41:03,276 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 06:41:03,276 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 06:41:03,276 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 06:41:03,276 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 06:41:03,276 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-27 06:41:03,632 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 06:41:03,651 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 06:41:03,653 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 06:41:03,654 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 06:41:03,656 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 06:41:03,657 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/mult-comm.wvr.c [2023-08-27 06:41:04,929 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 06:41:05,159 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 06:41:05,159 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/mult-comm.wvr.c [2023-08-27 06:41:05,165 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bde847ef/1f9edd37fa624f3d9c1341193386ee10/FLAGcc43054d4 [2023-08-27 06:41:05,177 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2bde847ef/1f9edd37fa624f3d9c1341193386ee10 [2023-08-27 06:41:05,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 06:41:05,180 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 06:41:05,181 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 06:41:05,182 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 06:41:05,184 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 06:41:05,185 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 06:41:05" (1/1) ... [2023-08-27 06:41:05,186 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10fd4d2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:41:05, skipping insertion in model container [2023-08-27 06:41:05,186 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 06:41:05" (1/1) ... [2023-08-27 06:41:05,203 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 06:41:05,342 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 06:41:05,349 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 06:41:05,365 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 06:41:05,378 INFO L206 MainTranslator]: Completed translation [2023-08-27 06:41:05,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:41:05 WrapperNode [2023-08-27 06:41:05,378 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 06:41:05,379 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 06:41:05,379 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 06:41:05,380 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 06:41:05,385 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:41:05" (1/1) ... [2023-08-27 06:41:05,390 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:41:05" (1/1) ... [2023-08-27 06:41:05,406 INFO L138 Inliner]: procedures = 21, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 56 [2023-08-27 06:41:05,406 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 06:41:05,407 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 06:41:05,407 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 06:41:05,407 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 06:41:05,415 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:41:05" (1/1) ... [2023-08-27 06:41:05,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:41:05" (1/1) ... [2023-08-27 06:41:05,417 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:41:05" (1/1) ... [2023-08-27 06:41:05,417 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:41:05" (1/1) ... [2023-08-27 06:41:05,421 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:41:05" (1/1) ... [2023-08-27 06:41:05,424 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:41:05" (1/1) ... [2023-08-27 06:41:05,425 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:41:05" (1/1) ... [2023-08-27 06:41:05,426 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:41:05" (1/1) ... [2023-08-27 06:41:05,428 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 06:41:05,428 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 06:41:05,429 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 06:41:05,429 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 06:41:05,429 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:41:05" (1/1) ... [2023-08-27 06:41:05,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 06:41:05,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 06:41:05,454 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-08-27 06:41:05,478 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-08-27 06:41:05,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 06:41:05,489 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-27 06:41:05,489 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-27 06:41:05,489 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-27 06:41:05,489 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-27 06:41:05,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 06:41:05,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 06:41:05,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 06:41:05,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 06:41:05,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 06:41:05,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-27 06:41:05,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 06:41:05,492 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-27 06:41:05,608 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 06:41:05,609 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 06:41:05,757 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 06:41:05,763 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 06:41:05,763 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-27 06:41:05,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:41:05 BoogieIcfgContainer [2023-08-27 06:41:05,765 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 06:41:05,767 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 06:41:05,767 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 06:41:05,770 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 06:41:05,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 06:41:05" (1/3) ... [2023-08-27 06:41:05,771 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c67627a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 06:41:05, skipping insertion in model container [2023-08-27 06:41:05,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 06:41:05" (2/3) ... [2023-08-27 06:41:05,771 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c67627a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 06:41:05, skipping insertion in model container [2023-08-27 06:41:05,771 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 06:41:05" (3/3) ... [2023-08-27 06:41:05,773 INFO L112 eAbstractionObserver]: Analyzing ICFG mult-comm.wvr.c [2023-08-27 06:41:05,788 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 06:41:05,788 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-27 06:41:05,788 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 06:41:05,842 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-27 06:41:05,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 80 transitions, 176 flow [2023-08-27 06:41:05,922 INFO L124 PetriNetUnfolderBase]: 5/78 cut-off events. [2023-08-27 06:41:05,922 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-27 06:41:05,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87 conditions, 78 events. 5/78 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 52 event pairs, 0 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2023-08-27 06:41:05,927 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 80 transitions, 176 flow [2023-08-27 06:41:05,931 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 69 transitions, 150 flow [2023-08-27 06:41:05,934 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 06:41:05,943 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 69 transitions, 150 flow [2023-08-27 06:41:05,945 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 69 transitions, 150 flow [2023-08-27 06:41:05,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 69 transitions, 150 flow [2023-08-27 06:41:05,977 INFO L124 PetriNetUnfolderBase]: 5/69 cut-off events. [2023-08-27 06:41:05,977 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-27 06:41:05,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 69 events. 5/69 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/64 useless extension candidates. Maximal degree in co-relation 43. Up to 2 conditions per place. [2023-08-27 06:41:05,979 INFO L119 LiptonReduction]: Number of co-enabled transitions 572 [2023-08-27 06:41:07,852 INFO L134 LiptonReduction]: Checked pairs total: 527 [2023-08-27 06:41:07,852 INFO L136 LiptonReduction]: Total number of compositions: 61 [2023-08-27 06:41:07,870 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 06:41:07,876 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=LoopsAndPotentialCycles, 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;@3919d61b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 06:41:07,876 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-27 06:41:07,881 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 06:41:07,881 INFO L124 PetriNetUnfolderBase]: 2/14 cut-off events. [2023-08-27 06:41:07,881 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-27 06:41:07,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 06:41:07,882 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 06:41:07,882 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-27 06:41:07,886 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 06:41:07,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1660908965, now seen corresponding path program 1 times [2023-08-27 06:41:07,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 06:41:07,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489868324] [2023-08-27 06:41:07,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 06:41:07,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 06:41:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 06:41:08,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:41:08,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 06:41:08,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489868324] [2023-08-27 06:41:08,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489868324] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 06:41:08,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 06:41:08,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 06:41:08,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40876472] [2023-08-27 06:41:08,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 06:41:08,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 06:41:08,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 06:41:08,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 06:41:08,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 06:41:08,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 141 [2023-08-27 06:41:08,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 15 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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-08-27 06:41:08,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 06:41:08,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 141 [2023-08-27 06:41:08,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 06:41:08,484 INFO L124 PetriNetUnfolderBase]: 65/114 cut-off events. [2023-08-27 06:41:08,484 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-08-27 06:41:08,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246 conditions, 114 events. 65/114 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 316 event pairs, 9 based on Foata normal form. 1/77 useless extension candidates. Maximal degree in co-relation 179. Up to 85 conditions per place. [2023-08-27 06:41:08,488 INFO L140 encePairwiseOnDemand]: 137/141 looper letters, 19 selfloop transitions, 3 changer transitions 1/25 dead transitions. [2023-08-27 06:41:08,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 25 transitions, 117 flow [2023-08-27 06:41:08,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 06:41:08,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 06:41:08,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2023-08-27 06:41:08,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5319148936170213 [2023-08-27 06:41:08,504 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 225 transitions. [2023-08-27 06:41:08,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 225 transitions. [2023-08-27 06:41:08,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 06:41:08,508 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 225 transitions. [2023-08-27 06:41:08,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 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-08-27 06:41:08,518 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 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-08-27 06:41:08,518 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 141.0) internal successors, (564), 4 states have internal predecessors, (564), 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-08-27 06:41:08,520 INFO L175 Difference]: Start difference. First operand has 20 places, 15 transitions, 42 flow. Second operand 3 states and 225 transitions. [2023-08-27 06:41:08,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 25 transitions, 117 flow [2023-08-27 06:41:08,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 25 transitions, 103 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-27 06:41:08,536 INFO L231 Difference]: Finished difference. Result has 19 places, 17 transitions, 53 flow [2023-08-27 06:41:08,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=53, PETRI_PLACES=19, PETRI_TRANSITIONS=17} [2023-08-27 06:41:08,542 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, -1 predicate places. [2023-08-27 06:41:08,542 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 17 transitions, 53 flow [2023-08-27 06:41:08,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 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-08-27 06:41:08,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 06:41:08,543 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 06:41:08,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 06:41:08,544 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-27 06:41:08,546 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 06:41:08,546 INFO L85 PathProgramCache]: Analyzing trace with hash 2040868693, now seen corresponding path program 1 times [2023-08-27 06:41:08,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 06:41:08,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710753938] [2023-08-27 06:41:08,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 06:41:08,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 06:41:08,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 06:41:08,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:41:08,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 06:41:08,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710753938] [2023-08-27 06:41:08,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710753938] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 06:41:08,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121421864] [2023-08-27 06:41:08,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 06:41:08,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 06:41:08,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 06:41:08,997 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-08-27 06:41:09,025 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-08-27 06:41:09,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 06:41:09,076 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-27 06:41:09,080 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 06:41:09,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:41:09,237 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 06:41:09,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:41:09,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121421864] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 06:41:09,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 06:41:09,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 7 [2023-08-27 06:41:09,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074447446] [2023-08-27 06:41:09,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 06:41:09,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-27 06:41:09,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 06:41:09,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-27 06:41:09,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-08-27 06:41:09,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 141 [2023-08-27 06:41:09,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 17 transitions, 53 flow. Second operand has 9 states, 9 states have (on average 62.0) internal successors, (558), 9 states have internal predecessors, (558), 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-08-27 06:41:09,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 06:41:09,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 141 [2023-08-27 06:41:09,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 06:41:09,850 INFO L124 PetriNetUnfolderBase]: 75/137 cut-off events. [2023-08-27 06:41:09,850 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-08-27 06:41:09,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 339 conditions, 137 events. 75/137 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 432 event pairs, 1 based on Foata normal form. 1/138 useless extension candidates. Maximal degree in co-relation 84. Up to 79 conditions per place. [2023-08-27 06:41:09,852 INFO L140 encePairwiseOnDemand]: 135/141 looper letters, 21 selfloop transitions, 5 changer transitions 15/42 dead transitions. [2023-08-27 06:41:09,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 42 transitions, 200 flow [2023-08-27 06:41:09,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 06:41:09,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 06:41:09,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 396 transitions. [2023-08-27 06:41:09,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46808510638297873 [2023-08-27 06:41:09,858 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 396 transitions. [2023-08-27 06:41:09,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 396 transitions. [2023-08-27 06:41:09,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 06:41:09,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 396 transitions. [2023-08-27 06:41:09,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 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-08-27 06:41:09,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 141.0) internal successors, (987), 7 states have internal predecessors, (987), 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-08-27 06:41:09,865 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 141.0) internal successors, (987), 7 states have internal predecessors, (987), 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-08-27 06:41:09,866 INFO L175 Difference]: Start difference. First operand has 19 places, 17 transitions, 53 flow. Second operand 6 states and 396 transitions. [2023-08-27 06:41:09,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 42 transitions, 200 flow [2023-08-27 06:41:09,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 42 transitions, 195 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 06:41:09,870 INFO L231 Difference]: Finished difference. Result has 26 places, 19 transitions, 78 flow [2023-08-27 06:41:09,871 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=78, PETRI_PLACES=26, PETRI_TRANSITIONS=19} [2023-08-27 06:41:09,875 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 6 predicate places. [2023-08-27 06:41:09,876 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 19 transitions, 78 flow [2023-08-27 06:41:09,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 62.0) internal successors, (558), 9 states have internal predecessors, (558), 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-08-27 06:41:09,876 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 06:41:09,876 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 06:41:09,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-27 06:41:10,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 06:41:10,083 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-27 06:41:10,083 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 06:41:10,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1844407065, now seen corresponding path program 1 times [2023-08-27 06:41:10,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 06:41:10,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102657641] [2023-08-27 06:41:10,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 06:41:10,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 06:41:10,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 06:41:10,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:41:10,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 06:41:10,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102657641] [2023-08-27 06:41:10,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102657641] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 06:41:10,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064380932] [2023-08-27 06:41:10,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 06:41:10,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 06:41:10,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 06:41:10,285 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-08-27 06:41:10,313 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-08-27 06:41:10,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 06:41:10,359 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-27 06:41:10,360 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 06:41:10,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:41:10,445 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 06:41:10,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:41:10,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064380932] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 06:41:10,641 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 06:41:10,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 8 [2023-08-27 06:41:10,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277101644] [2023-08-27 06:41:10,641 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 06:41:10,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-27 06:41:10,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 06:41:10,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-27 06:41:10,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-08-27 06:41:10,643 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 141 [2023-08-27 06:41:10,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 78 flow. Second operand has 10 states, 10 states have (on average 61.8) internal successors, (618), 10 states have internal predecessors, (618), 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-08-27 06:41:10,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 06:41:10,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 141 [2023-08-27 06:41:10,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 06:41:10,769 INFO L124 PetriNetUnfolderBase]: 48/93 cut-off events. [2023-08-27 06:41:10,769 INFO L125 PetriNetUnfolderBase]: For 41/48 co-relation queries the response was YES. [2023-08-27 06:41:10,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 93 events. 48/93 cut-off events. For 41/48 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 204 event pairs, 8 based on Foata normal form. 8/101 useless extension candidates. Maximal degree in co-relation 255. Up to 69 conditions per place. [2023-08-27 06:41:10,771 INFO L140 encePairwiseOnDemand]: 135/141 looper letters, 17 selfloop transitions, 6 changer transitions 9/34 dead transitions. [2023-08-27 06:41:10,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 34 transitions, 189 flow [2023-08-27 06:41:10,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 06:41:10,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 06:41:10,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 386 transitions. [2023-08-27 06:41:10,772 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4562647754137116 [2023-08-27 06:41:10,773 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 386 transitions. [2023-08-27 06:41:10,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 386 transitions. [2023-08-27 06:41:10,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 06:41:10,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 386 transitions. [2023-08-27 06:41:10,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 64.33333333333333) internal successors, (386), 6 states have internal predecessors, (386), 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-08-27 06:41:10,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 141.0) internal successors, (987), 7 states have internal predecessors, (987), 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-08-27 06:41:10,776 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 141.0) internal successors, (987), 7 states have internal predecessors, (987), 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-08-27 06:41:10,776 INFO L175 Difference]: Start difference. First operand has 26 places, 19 transitions, 78 flow. Second operand 6 states and 386 transitions. [2023-08-27 06:41:10,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 34 transitions, 189 flow [2023-08-27 06:41:10,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 34 transitions, 167 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-27 06:41:10,778 INFO L231 Difference]: Finished difference. Result has 29 places, 21 transitions, 94 flow [2023-08-27 06:41:10,778 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=94, PETRI_PLACES=29, PETRI_TRANSITIONS=21} [2023-08-27 06:41:10,779 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2023-08-27 06:41:10,779 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 21 transitions, 94 flow [2023-08-27 06:41:10,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 61.8) internal successors, (618), 10 states have internal predecessors, (618), 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-08-27 06:41:10,780 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 06:41:10,780 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 06:41:10,793 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-08-27 06:41:10,985 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,SelfDestructingSolverStorable2 [2023-08-27 06:41:10,986 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-27 06:41:10,986 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 06:41:10,987 INFO L85 PathProgramCache]: Analyzing trace with hash 156600209, now seen corresponding path program 2 times [2023-08-27 06:41:10,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 06:41:10,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128727673] [2023-08-27 06:41:10,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 06:41:10,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 06:41:11,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 06:41:11,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:41:11,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 06:41:11,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128727673] [2023-08-27 06:41:11,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128727673] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 06:41:11,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [492797114] [2023-08-27 06:41:11,238 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 06:41:11,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 06:41:11,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 06:41:11,240 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-08-27 06:41:11,263 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-08-27 06:41:11,306 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 06:41:11,306 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 06:41:11,307 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-27 06:41:11,309 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 06:41:11,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:41:11,435 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 06:41:11,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:41:11,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [492797114] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 06:41:11,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 06:41:11,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 12 [2023-08-27 06:41:11,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376484010] [2023-08-27 06:41:11,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 06:41:11,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-27 06:41:11,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 06:41:11,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-27 06:41:11,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2023-08-27 06:41:11,623 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 141 [2023-08-27 06:41:11,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 21 transitions, 94 flow. Second operand has 14 states, 14 states have (on average 53.42857142857143) internal successors, (748), 14 states have internal predecessors, (748), 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-08-27 06:41:11,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 06:41:11,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 141 [2023-08-27 06:41:11,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 06:41:11,886 INFO L124 PetriNetUnfolderBase]: 113/211 cut-off events. [2023-08-27 06:41:11,886 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2023-08-27 06:41:11,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 616 conditions, 211 events. 113/211 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 678 event pairs, 9 based on Foata normal form. 3/214 useless extension candidates. Maximal degree in co-relation 601. Up to 92 conditions per place. [2023-08-27 06:41:11,889 INFO L140 encePairwiseOnDemand]: 134/141 looper letters, 41 selfloop transitions, 19 changer transitions 12/72 dead transitions. [2023-08-27 06:41:11,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 72 transitions, 397 flow [2023-08-27 06:41:11,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-27 06:41:11,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-27 06:41:11,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 635 transitions. [2023-08-27 06:41:11,891 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4094132817537073 [2023-08-27 06:41:11,891 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 635 transitions. [2023-08-27 06:41:11,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 635 transitions. [2023-08-27 06:41:11,892 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 06:41:11,892 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 635 transitions. [2023-08-27 06:41:11,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 57.72727272727273) internal successors, (635), 11 states have internal predecessors, (635), 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-08-27 06:41:11,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 141.0) internal successors, (1692), 12 states have internal predecessors, (1692), 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-08-27 06:41:11,896 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 141.0) internal successors, (1692), 12 states have internal predecessors, (1692), 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-08-27 06:41:11,896 INFO L175 Difference]: Start difference. First operand has 29 places, 21 transitions, 94 flow. Second operand 11 states and 635 transitions. [2023-08-27 06:41:11,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 72 transitions, 397 flow [2023-08-27 06:41:11,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 72 transitions, 384 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-27 06:41:11,899 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 198 flow [2023-08-27 06:41:11,899 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=198, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2023-08-27 06:41:11,900 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 20 predicate places. [2023-08-27 06:41:11,900 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 198 flow [2023-08-27 06:41:11,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 53.42857142857143) internal successors, (748), 14 states have internal predecessors, (748), 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-08-27 06:41:11,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 06:41:11,901 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 06:41:11,911 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-08-27 06:41:12,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 06:41:12,109 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-27 06:41:12,110 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 06:41:12,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1415825343, now seen corresponding path program 3 times [2023-08-27 06:41:12,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 06:41:12,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548849461] [2023-08-27 06:41:12,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 06:41:12,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 06:41:12,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 06:41:12,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:41:12,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 06:41:12,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548849461] [2023-08-27 06:41:12,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548849461] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 06:41:12,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1984792370] [2023-08-27 06:41:12,363 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-27 06:41:12,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 06:41:12,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 06:41:12,401 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-08-27 06:41:12,404 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-08-27 06:41:12,463 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-27 06:41:12,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 06:41:12,464 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-27 06:41:12,465 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 06:41:12,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:41:12,586 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 06:41:12,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:41:12,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1984792370] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 06:41:12,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 06:41:12,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 11 [2023-08-27 06:41:12,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154923837] [2023-08-27 06:41:12,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 06:41:12,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-27 06:41:12,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 06:41:12,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-27 06:41:12,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2023-08-27 06:41:12,786 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 141 [2023-08-27 06:41:12,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 198 flow. Second operand has 13 states, 13 states have (on average 53.46153846153846) internal successors, (695), 13 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 06:41:12,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 06:41:12,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 141 [2023-08-27 06:41:12,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 06:41:12,940 INFO L124 PetriNetUnfolderBase]: 132/244 cut-off events. [2023-08-27 06:41:12,940 INFO L125 PetriNetUnfolderBase]: For 358/358 co-relation queries the response was YES. [2023-08-27 06:41:12,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 882 conditions, 244 events. 132/244 cut-off events. For 358/358 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 818 event pairs, 23 based on Foata normal form. 2/242 useless extension candidates. Maximal degree in co-relation 828. Up to 180 conditions per place. [2023-08-27 06:41:12,943 INFO L140 encePairwiseOnDemand]: 134/141 looper letters, 41 selfloop transitions, 17 changer transitions 8/66 dead transitions. [2023-08-27 06:41:12,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 66 transitions, 459 flow [2023-08-27 06:41:12,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 06:41:12,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 06:41:12,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 515 transitions. [2023-08-27 06:41:12,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40583136327817176 [2023-08-27 06:41:12,945 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 515 transitions. [2023-08-27 06:41:12,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 515 transitions. [2023-08-27 06:41:12,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 06:41:12,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 515 transitions. [2023-08-27 06:41:12,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 57.22222222222222) internal successors, (515), 9 states have internal predecessors, (515), 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-08-27 06:41:12,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 141.0) internal successors, (1410), 10 states have internal predecessors, (1410), 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-08-27 06:41:12,949 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 141.0) internal successors, (1410), 10 states have internal predecessors, (1410), 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-08-27 06:41:12,949 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 198 flow. Second operand 9 states and 515 transitions. [2023-08-27 06:41:12,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 66 transitions, 459 flow [2023-08-27 06:41:12,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 66 transitions, 393 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-08-27 06:41:12,953 INFO L231 Difference]: Finished difference. Result has 47 places, 43 transitions, 261 flow [2023-08-27 06:41:12,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=261, PETRI_PLACES=47, PETRI_TRANSITIONS=43} [2023-08-27 06:41:12,954 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 27 predicate places. [2023-08-27 06:41:12,954 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 43 transitions, 261 flow [2023-08-27 06:41:12,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 53.46153846153846) internal successors, (695), 13 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 06:41:12,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 06:41:12,955 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 06:41:12,964 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-08-27 06:41:13,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 06:41:13,162 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-27 06:41:13,162 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 06:41:13,163 INFO L85 PathProgramCache]: Analyzing trace with hash 645928271, now seen corresponding path program 2 times [2023-08-27 06:41:13,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 06:41:13,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10256800] [2023-08-27 06:41:13,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 06:41:13,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 06:41:13,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 06:41:13,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:41:13,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 06:41:13,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10256800] [2023-08-27 06:41:13,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10256800] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 06:41:13,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274828928] [2023-08-27 06:41:13,403 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 06:41:13,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 06:41:13,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 06:41:13,404 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-08-27 06:41:13,409 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-08-27 06:41:13,460 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 06:41:13,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 06:41:13,461 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-27 06:41:13,462 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 06:41:13,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:41:13,556 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 06:41:13,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:41:13,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274828928] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 06:41:13,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 06:41:13,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 8 [2023-08-27 06:41:13,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604182254] [2023-08-27 06:41:13,761 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 06:41:13,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-27 06:41:13,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 06:41:13,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-27 06:41:13,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-08-27 06:41:13,763 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 141 [2023-08-27 06:41:13,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 43 transitions, 261 flow. Second operand has 10 states, 10 states have (on average 61.8) internal successors, (618), 10 states have internal predecessors, (618), 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-08-27 06:41:13,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 06:41:13,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 141 [2023-08-27 06:41:13,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 06:41:13,890 INFO L124 PetriNetUnfolderBase]: 150/279 cut-off events. [2023-08-27 06:41:13,891 INFO L125 PetriNetUnfolderBase]: For 584/594 co-relation queries the response was YES. [2023-08-27 06:41:13,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1015 conditions, 279 events. 150/279 cut-off events. For 584/594 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1050 event pairs, 22 based on Foata normal form. 8/275 useless extension candidates. Maximal degree in co-relation 961. Up to 214 conditions per place. [2023-08-27 06:41:13,893 INFO L140 encePairwiseOnDemand]: 135/141 looper letters, 47 selfloop transitions, 17 changer transitions 4/71 dead transitions. [2023-08-27 06:41:13,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 71 transitions, 519 flow [2023-08-27 06:41:13,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 06:41:13,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 06:41:13,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 520 transitions. [2023-08-27 06:41:13,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46099290780141844 [2023-08-27 06:41:13,895 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 520 transitions. [2023-08-27 06:41:13,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 520 transitions. [2023-08-27 06:41:13,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 06:41:13,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 520 transitions. [2023-08-27 06:41:13,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 65.0) internal successors, (520), 8 states have internal predecessors, (520), 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-08-27 06:41:13,898 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 141.0) internal successors, (1269), 9 states have internal predecessors, (1269), 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-08-27 06:41:13,899 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 141.0) internal successors, (1269), 9 states have internal predecessors, (1269), 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-08-27 06:41:13,899 INFO L175 Difference]: Start difference. First operand has 47 places, 43 transitions, 261 flow. Second operand 8 states and 520 transitions. [2023-08-27 06:41:13,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 71 transitions, 519 flow [2023-08-27 06:41:13,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 71 transitions, 472 flow, removed 16 selfloop flow, removed 3 redundant places. [2023-08-27 06:41:13,902 INFO L231 Difference]: Finished difference. Result has 53 places, 51 transitions, 314 flow [2023-08-27 06:41:13,902 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=314, PETRI_PLACES=53, PETRI_TRANSITIONS=51} [2023-08-27 06:41:13,903 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 33 predicate places. [2023-08-27 06:41:13,903 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 51 transitions, 314 flow [2023-08-27 06:41:13,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 61.8) internal successors, (618), 10 states have internal predecessors, (618), 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-08-27 06:41:13,904 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 06:41:13,904 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 06:41:13,915 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-08-27 06:41:14,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 06:41:14,115 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-27 06:41:14,116 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 06:41:14,116 INFO L85 PathProgramCache]: Analyzing trace with hash -543772353, now seen corresponding path program 3 times [2023-08-27 06:41:14,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 06:41:14,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900577504] [2023-08-27 06:41:14,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 06:41:14,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 06:41:14,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 06:41:14,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:41:14,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 06:41:14,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900577504] [2023-08-27 06:41:14,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900577504] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 06:41:14,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424430776] [2023-08-27 06:41:14,404 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-27 06:41:14,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 06:41:14,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 06:41:14,406 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-08-27 06:41:14,430 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-08-27 06:41:14,470 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-27 06:41:14,471 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 06:41:14,472 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-27 06:41:14,473 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 06:41:14,574 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:41:14,574 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 06:41:14,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 06:41:14,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424430776] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-27 06:41:14,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-27 06:41:14,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 9 [2023-08-27 06:41:14,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946054600] [2023-08-27 06:41:14,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 06:41:14,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 06:41:14,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 06:41:14,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 06:41:14,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-08-27 06:41:14,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 141 [2023-08-27 06:41:14,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 51 transitions, 314 flow. Second operand has 5 states, 5 states have (on average 61.6) internal successors, (308), 5 states have internal predecessors, (308), 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-08-27 06:41:14,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 06:41:14,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 141 [2023-08-27 06:41:14,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 06:41:14,878 INFO L124 PetriNetUnfolderBase]: 166/307 cut-off events. [2023-08-27 06:41:14,878 INFO L125 PetriNetUnfolderBase]: For 576/586 co-relation queries the response was YES. [2023-08-27 06:41:14,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1138 conditions, 307 events. 166/307 cut-off events. For 576/586 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1197 event pairs, 38 based on Foata normal form. 7/302 useless extension candidates. Maximal degree in co-relation 1078. Up to 263 conditions per place. [2023-08-27 06:41:14,880 INFO L140 encePairwiseOnDemand]: 135/141 looper letters, 47 selfloop transitions, 12 changer transitions 2/64 dead transitions. [2023-08-27 06:41:14,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 64 transitions, 499 flow [2023-08-27 06:41:14,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 06:41:14,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 06:41:14,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 325 transitions. [2023-08-27 06:41:14,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46099290780141844 [2023-08-27 06:41:14,882 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 325 transitions. [2023-08-27 06:41:14,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 325 transitions. [2023-08-27 06:41:14,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 06:41:14,883 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 325 transitions. [2023-08-27 06:41:14,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 65.0) internal successors, (325), 5 states have internal predecessors, (325), 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-08-27 06:41:14,885 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 141.0) internal successors, (846), 6 states have internal predecessors, (846), 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-08-27 06:41:14,885 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 141.0) internal successors, (846), 6 states have internal predecessors, (846), 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-08-27 06:41:14,885 INFO L175 Difference]: Start difference. First operand has 53 places, 51 transitions, 314 flow. Second operand 5 states and 325 transitions. [2023-08-27 06:41:14,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 64 transitions, 499 flow [2023-08-27 06:41:14,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 64 transitions, 449 flow, removed 16 selfloop flow, removed 3 redundant places. [2023-08-27 06:41:14,889 INFO L231 Difference]: Finished difference. Result has 56 places, 55 transitions, 339 flow [2023-08-27 06:41:14,889 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=339, PETRI_PLACES=56, PETRI_TRANSITIONS=55} [2023-08-27 06:41:14,889 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 36 predicate places. [2023-08-27 06:41:14,890 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 55 transitions, 339 flow [2023-08-27 06:41:14,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 61.6) internal successors, (308), 5 states have internal predecessors, (308), 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-08-27 06:41:14,890 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 06:41:14,890 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 06:41:14,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-08-27 06:41:15,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 06:41:15,096 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-27 06:41:15,096 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 06:41:15,096 INFO L85 PathProgramCache]: Analyzing trace with hash -2074315301, now seen corresponding path program 1 times [2023-08-27 06:41:15,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 06:41:15,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781913625] [2023-08-27 06:41:15,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 06:41:15,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 06:41:15,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 06:41:15,539 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:41:15,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 06:41:15,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781913625] [2023-08-27 06:41:15,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781913625] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 06:41:15,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454444875] [2023-08-27 06:41:15,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 06:41:15,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 06:41:15,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 06:41:15,541 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-08-27 06:41:15,564 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-08-27 06:41:15,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 06:41:15,615 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-27 06:41:15,616 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 06:41:15,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:41:15,819 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 06:41:17,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:41:17,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454444875] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 06:41:17,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 06:41:17,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 17 [2023-08-27 06:41:17,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861777067] [2023-08-27 06:41:17,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 06:41:17,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-27 06:41:17,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 06:41:17,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-27 06:41:17,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2023-08-27 06:41:17,387 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 141 [2023-08-27 06:41:17,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 55 transitions, 339 flow. Second operand has 19 states, 19 states have (on average 52.8421052631579) internal successors, (1004), 19 states have internal predecessors, (1004), 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-08-27 06:41:17,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 06:41:17,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 141 [2023-08-27 06:41:17,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 06:41:19,543 INFO L124 PetriNetUnfolderBase]: 300/602 cut-off events. [2023-08-27 06:41:19,543 INFO L125 PetriNetUnfolderBase]: For 1238/1238 co-relation queries the response was YES. [2023-08-27 06:41:19,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2241 conditions, 602 events. 300/602 cut-off events. For 1238/1238 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3050 event pairs, 25 based on Foata normal form. 3/601 useless extension candidates. Maximal degree in co-relation 2118. Up to 195 conditions per place. [2023-08-27 06:41:19,548 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 97 selfloop transitions, 72 changer transitions 31/200 dead transitions. [2023-08-27 06:41:19,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 200 transitions, 1457 flow [2023-08-27 06:41:19,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-08-27 06:41:19,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-08-27 06:41:19,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 1703 transitions. [2023-08-27 06:41:19,554 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4026004728132388 [2023-08-27 06:41:19,554 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 1703 transitions. [2023-08-27 06:41:19,554 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 1703 transitions. [2023-08-27 06:41:19,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 06:41:19,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 1703 transitions. [2023-08-27 06:41:19,558 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 56.766666666666666) internal successors, (1703), 30 states have internal predecessors, (1703), 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-08-27 06:41:19,563 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 141.0) internal successors, (4371), 31 states have internal predecessors, (4371), 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-08-27 06:41:19,564 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 141.0) internal successors, (4371), 31 states have internal predecessors, (4371), 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-08-27 06:41:19,564 INFO L175 Difference]: Start difference. First operand has 56 places, 55 transitions, 339 flow. Second operand 30 states and 1703 transitions. [2023-08-27 06:41:19,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 200 transitions, 1457 flow [2023-08-27 06:41:19,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 200 transitions, 1434 flow, removed 9 selfloop flow, removed 2 redundant places. [2023-08-27 06:41:19,575 INFO L231 Difference]: Finished difference. Result has 87 places, 102 transitions, 845 flow [2023-08-27 06:41:19,576 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=845, PETRI_PLACES=87, PETRI_TRANSITIONS=102} [2023-08-27 06:41:19,576 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 67 predicate places. [2023-08-27 06:41:19,576 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 102 transitions, 845 flow [2023-08-27 06:41:19,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 52.8421052631579) internal successors, (1004), 19 states have internal predecessors, (1004), 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-08-27 06:41:19,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 06:41:19,577 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 06:41:19,585 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-08-27 06:41:19,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 06:41:19,783 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-27 06:41:19,783 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 06:41:19,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1469132737, now seen corresponding path program 2 times [2023-08-27 06:41:19,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 06:41:19,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686156016] [2023-08-27 06:41:19,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 06:41:19,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 06:41:19,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 06:41:20,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:41:20,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 06:41:20,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686156016] [2023-08-27 06:41:20,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686156016] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 06:41:20,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [11944770] [2023-08-27 06:41:20,148 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 06:41:20,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 06:41:20,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 06:41:20,153 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-08-27 06:41:20,156 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-08-27 06:41:20,215 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 06:41:20,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 06:41:20,217 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-27 06:41:20,218 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 06:41:20,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:41:20,395 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 06:41:21,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:41:21,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [11944770] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 06:41:21,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 06:41:21,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2023-08-27 06:41:21,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595463120] [2023-08-27 06:41:21,713 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 06:41:21,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-27 06:41:21,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 06:41:21,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-27 06:41:21,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2023-08-27 06:41:21,715 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 141 [2023-08-27 06:41:21,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 102 transitions, 845 flow. Second operand has 18 states, 18 states have (on average 52.94444444444444) internal successors, (953), 18 states have internal predecessors, (953), 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-08-27 06:41:21,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 06:41:21,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 141 [2023-08-27 06:41:21,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 06:41:23,391 INFO L124 PetriNetUnfolderBase]: 310/614 cut-off events. [2023-08-27 06:41:23,391 INFO L125 PetriNetUnfolderBase]: For 1817/1817 co-relation queries the response was YES. [2023-08-27 06:41:23,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2719 conditions, 614 events. 310/614 cut-off events. For 1817/1817 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3069 event pairs, 19 based on Foata normal form. 4/614 useless extension candidates. Maximal degree in co-relation 2593. Up to 342 conditions per place. [2023-08-27 06:41:23,396 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 112 selfloop transitions, 55 changer transitions 23/190 dead transitions. [2023-08-27 06:41:23,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 190 transitions, 1625 flow [2023-08-27 06:41:23,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-08-27 06:41:23,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-08-27 06:41:23,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1303 transitions. [2023-08-27 06:41:23,400 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4017884674683935 [2023-08-27 06:41:23,400 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 1303 transitions. [2023-08-27 06:41:23,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 1303 transitions. [2023-08-27 06:41:23,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 06:41:23,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1303 transitions. [2023-08-27 06:41:23,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 56.65217391304348) internal successors, (1303), 23 states have internal predecessors, (1303), 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-08-27 06:41:23,407 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 141.0) internal successors, (3384), 24 states have internal predecessors, (3384), 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-08-27 06:41:23,408 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 141.0) internal successors, (3384), 24 states have internal predecessors, (3384), 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-08-27 06:41:23,408 INFO L175 Difference]: Start difference. First operand has 87 places, 102 transitions, 845 flow. Second operand 23 states and 1303 transitions. [2023-08-27 06:41:23,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 190 transitions, 1625 flow [2023-08-27 06:41:23,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 190 transitions, 1262 flow, removed 160 selfloop flow, removed 13 redundant places. [2023-08-27 06:41:23,423 INFO L231 Difference]: Finished difference. Result has 101 places, 113 transitions, 790 flow [2023-08-27 06:41:23,423 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=790, PETRI_PLACES=101, PETRI_TRANSITIONS=113} [2023-08-27 06:41:23,424 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 81 predicate places. [2023-08-27 06:41:23,424 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 113 transitions, 790 flow [2023-08-27 06:41:23,424 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 52.94444444444444) internal successors, (953), 18 states have internal predecessors, (953), 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-08-27 06:41:23,424 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 06:41:23,424 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 06:41:23,436 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-08-27 06:41:23,635 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,SelfDestructingSolverStorable8 [2023-08-27 06:41:23,635 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-27 06:41:23,636 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 06:41:23,636 INFO L85 PathProgramCache]: Analyzing trace with hash 604008821, now seen corresponding path program 3 times [2023-08-27 06:41:23,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 06:41:23,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140095466] [2023-08-27 06:41:23,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 06:41:23,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 06:41:23,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 06:41:24,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:41:24,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 06:41:24,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140095466] [2023-08-27 06:41:24,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140095466] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 06:41:24,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160414949] [2023-08-27 06:41:24,081 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-27 06:41:24,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 06:41:24,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 06:41:24,082 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 06:41:24,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-27 06:41:24,146 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-27 06:41:24,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 06:41:24,147 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-27 06:41:24,148 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 06:41:24,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:41:24,332 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 06:41:26,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:41:26,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160414949] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 06:41:26,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 06:41:26,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 17 [2023-08-27 06:41:26,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262189677] [2023-08-27 06:41:26,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 06:41:26,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-27 06:41:26,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 06:41:26,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-27 06:41:26,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2023-08-27 06:41:26,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 141 [2023-08-27 06:41:26,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 113 transitions, 790 flow. Second operand has 19 states, 19 states have (on average 52.8421052631579) internal successors, (1004), 19 states have internal predecessors, (1004), 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-08-27 06:41:26,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 06:41:26,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 141 [2023-08-27 06:41:26,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 06:41:28,400 INFO L124 PetriNetUnfolderBase]: 294/579 cut-off events. [2023-08-27 06:41:28,401 INFO L125 PetriNetUnfolderBase]: For 1071/1071 co-relation queries the response was YES. [2023-08-27 06:41:28,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2341 conditions, 579 events. 294/579 cut-off events. For 1071/1071 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 2842 event pairs, 19 based on Foata normal form. 3/560 useless extension candidates. Maximal degree in co-relation 2257. Up to 235 conditions per place. [2023-08-27 06:41:28,405 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 85 selfloop transitions, 82 changer transitions 17/184 dead transitions. [2023-08-27 06:41:28,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 184 transitions, 1405 flow [2023-08-27 06:41:28,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-08-27 06:41:28,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-08-27 06:41:28,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1414 transitions. [2023-08-27 06:41:28,409 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40113475177304964 [2023-08-27 06:41:28,409 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 1414 transitions. [2023-08-27 06:41:28,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 1414 transitions. [2023-08-27 06:41:28,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 06:41:28,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 1414 transitions. [2023-08-27 06:41:28,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 56.56) internal successors, (1414), 25 states have internal predecessors, (1414), 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-08-27 06:41:28,416 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 141.0) internal successors, (3666), 26 states have internal predecessors, (3666), 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-08-27 06:41:28,417 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 141.0) internal successors, (3666), 26 states have internal predecessors, (3666), 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-08-27 06:41:28,417 INFO L175 Difference]: Start difference. First operand has 101 places, 113 transitions, 790 flow. Second operand 25 states and 1414 transitions. [2023-08-27 06:41:28,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 184 transitions, 1405 flow [2023-08-27 06:41:28,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 184 transitions, 1285 flow, removed 34 selfloop flow, removed 13 redundant places. [2023-08-27 06:41:28,431 INFO L231 Difference]: Finished difference. Result has 114 places, 117 transitions, 922 flow [2023-08-27 06:41:28,432 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=922, PETRI_PLACES=114, PETRI_TRANSITIONS=117} [2023-08-27 06:41:28,432 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 94 predicate places. [2023-08-27 06:41:28,432 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 117 transitions, 922 flow [2023-08-27 06:41:28,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 52.8421052631579) internal successors, (1004), 19 states have internal predecessors, (1004), 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-08-27 06:41:28,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 06:41:28,433 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 06:41:28,438 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-08-27 06:41:28,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-08-27 06:41:28,639 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-27 06:41:28,639 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 06:41:28,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1043136037, now seen corresponding path program 4 times [2023-08-27 06:41:28,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 06:41:28,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922154659] [2023-08-27 06:41:28,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 06:41:28,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 06:41:28,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 06:41:29,261 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:41:29,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 06:41:29,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922154659] [2023-08-27 06:41:29,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922154659] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 06:41:29,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985879949] [2023-08-27 06:41:29,262 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-27 06:41:29,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 06:41:29,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 06:41:29,263 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 06:41:29,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-27 06:41:29,368 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-27 06:41:29,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 06:41:29,370 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 29 conjunts are in the unsatisfiable core [2023-08-27 06:41:29,371 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 06:41:29,839 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:41:29,839 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 06:41:31,570 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:41:31,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985879949] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 06:41:31,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 06:41:31,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 20 [2023-08-27 06:41:31,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087665870] [2023-08-27 06:41:31,570 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 06:41:31,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-27 06:41:31,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 06:41:31,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-27 06:41:31,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2023-08-27 06:41:31,572 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 141 [2023-08-27 06:41:31,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 117 transitions, 922 flow. Second operand has 22 states, 22 states have (on average 48.0) internal successors, (1056), 22 states have internal predecessors, (1056), 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-08-27 06:41:31,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 06:41:31,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 141 [2023-08-27 06:41:31,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 06:41:34,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 06:41:40,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 06:41:44,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 06:41:47,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 06:41:48,714 INFO L124 PetriNetUnfolderBase]: 415/788 cut-off events. [2023-08-27 06:41:48,714 INFO L125 PetriNetUnfolderBase]: For 2048/2048 co-relation queries the response was YES. [2023-08-27 06:41:48,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3529 conditions, 788 events. 415/788 cut-off events. For 2048/2048 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 4024 event pairs, 21 based on Foata normal form. 4/774 useless extension candidates. Maximal degree in co-relation 3430. Up to 361 conditions per place. [2023-08-27 06:41:48,719 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 131 selfloop transitions, 88 changer transitions 26/245 dead transitions. [2023-08-27 06:41:48,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 245 transitions, 2094 flow [2023-08-27 06:41:48,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-08-27 06:41:48,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2023-08-27 06:41:48,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 1647 transitions. [2023-08-27 06:41:48,723 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3650265957446808 [2023-08-27 06:41:48,724 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 1647 transitions. [2023-08-27 06:41:48,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 1647 transitions. [2023-08-27 06:41:48,724 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 06:41:48,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 1647 transitions. [2023-08-27 06:41:48,727 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 51.46875) internal successors, (1647), 32 states have internal predecessors, (1647), 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-08-27 06:41:48,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 141.0) internal successors, (4653), 33 states have internal predecessors, (4653), 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-08-27 06:41:48,732 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 141.0) internal successors, (4653), 33 states have internal predecessors, (4653), 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-08-27 06:41:48,732 INFO L175 Difference]: Start difference. First operand has 114 places, 117 transitions, 922 flow. Second operand 32 states and 1647 transitions. [2023-08-27 06:41:48,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 245 transitions, 2094 flow [2023-08-27 06:41:48,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 245 transitions, 1888 flow, removed 38 selfloop flow, removed 20 redundant places. [2023-08-27 06:41:48,748 INFO L231 Difference]: Finished difference. Result has 129 places, 150 transitions, 1297 flow [2023-08-27 06:41:48,749 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=743, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=1297, PETRI_PLACES=129, PETRI_TRANSITIONS=150} [2023-08-27 06:41:48,749 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 109 predicate places. [2023-08-27 06:41:48,749 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 150 transitions, 1297 flow [2023-08-27 06:41:48,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 48.0) internal successors, (1056), 22 states have internal predecessors, (1056), 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-08-27 06:41:48,750 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 06:41:48,750 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 06:41:48,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-27 06:41:48,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-08-27 06:41:48,955 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-27 06:41:48,956 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 06:41:48,956 INFO L85 PathProgramCache]: Analyzing trace with hash 794664601, now seen corresponding path program 5 times [2023-08-27 06:41:48,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 06:41:48,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362241780] [2023-08-27 06:41:48,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 06:41:48,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 06:41:48,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 06:41:49,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:41:49,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 06:41:49,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362241780] [2023-08-27 06:41:49,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362241780] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 06:41:49,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519595470] [2023-08-27 06:41:49,350 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-27 06:41:49,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 06:41:49,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 06:41:49,353 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 06:41:49,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-27 06:41:49,419 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 06:41:49,419 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 06:41:49,420 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-27 06:41:49,421 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 06:41:49,607 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:41:49,607 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 06:41:53,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:41:53,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1519595470] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 06:41:53,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 06:41:53,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2023-08-27 06:41:53,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91438589] [2023-08-27 06:41:53,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 06:41:53,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-27 06:41:53,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 06:41:53,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-27 06:41:53,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2023-08-27 06:41:53,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 141 [2023-08-27 06:41:53,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 150 transitions, 1297 flow. Second operand has 18 states, 18 states have (on average 53.0) internal successors, (954), 18 states have internal predecessors, (954), 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-08-27 06:41:53,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 06:41:53,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 141 [2023-08-27 06:41:53,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 06:41:54,877 INFO L124 PetriNetUnfolderBase]: 452/858 cut-off events. [2023-08-27 06:41:54,877 INFO L125 PetriNetUnfolderBase]: For 2890/2890 co-relation queries the response was YES. [2023-08-27 06:41:54,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4160 conditions, 858 events. 452/858 cut-off events. For 2890/2890 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 4450 event pairs, 63 based on Foata normal form. 2/840 useless extension candidates. Maximal degree in co-relation 4118. Up to 723 conditions per place. [2023-08-27 06:41:54,883 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 165 selfloop transitions, 37 changer transitions 16/218 dead transitions. [2023-08-27 06:41:54,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 218 transitions, 2149 flow [2023-08-27 06:41:54,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-27 06:41:54,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-27 06:41:54,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 908 transitions. [2023-08-27 06:41:54,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4024822695035461 [2023-08-27 06:41:54,887 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 908 transitions. [2023-08-27 06:41:54,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 908 transitions. [2023-08-27 06:41:54,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 06:41:54,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 908 transitions. [2023-08-27 06:41:54,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 56.75) internal successors, (908), 16 states have internal predecessors, (908), 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-08-27 06:41:54,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 141.0) internal successors, (2397), 17 states have internal predecessors, (2397), 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-08-27 06:41:54,891 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 141.0) internal successors, (2397), 17 states have internal predecessors, (2397), 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-08-27 06:41:54,892 INFO L175 Difference]: Start difference. First operand has 129 places, 150 transitions, 1297 flow. Second operand 16 states and 908 transitions. [2023-08-27 06:41:54,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 218 transitions, 2149 flow [2023-08-27 06:41:54,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 218 transitions, 1883 flow, removed 107 selfloop flow, removed 12 redundant places. [2023-08-27 06:41:54,914 INFO L231 Difference]: Finished difference. Result has 138 places, 172 transitions, 1440 flow [2023-08-27 06:41:54,914 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=1056, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1440, PETRI_PLACES=138, PETRI_TRANSITIONS=172} [2023-08-27 06:41:54,915 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 118 predicate places. [2023-08-27 06:41:54,915 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 172 transitions, 1440 flow [2023-08-27 06:41:54,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 53.0) internal successors, (954), 18 states have internal predecessors, (954), 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-08-27 06:41:54,915 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 06:41:54,916 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 06:41:54,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-27 06:41:55,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-08-27 06:41:55,125 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-27 06:41:55,125 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 06:41:55,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1080507479, now seen corresponding path program 6 times [2023-08-27 06:41:55,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 06:41:55,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139612322] [2023-08-27 06:41:55,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 06:41:55,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 06:41:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 06:41:55,543 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:41:55,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 06:41:55,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139612322] [2023-08-27 06:41:55,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139612322] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 06:41:55,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438367359] [2023-08-27 06:41:55,544 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-27 06:41:55,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 06:41:55,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 06:41:55,545 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 06:41:55,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-27 06:41:55,612 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-08-27 06:41:55,612 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 06:41:55,613 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-27 06:41:55,614 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 06:41:55,783 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:41:55,783 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 06:41:58,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:41:58,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438367359] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 06:41:58,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 06:41:58,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2023-08-27 06:41:58,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184912422] [2023-08-27 06:41:58,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 06:41:58,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-27 06:41:58,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 06:41:58,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-27 06:41:58,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2023-08-27 06:41:58,883 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 141 [2023-08-27 06:41:58,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 172 transitions, 1440 flow. Second operand has 18 states, 18 states have (on average 52.888888888888886) internal successors, (952), 18 states have internal predecessors, (952), 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-08-27 06:41:58,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 06:41:58,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 141 [2023-08-27 06:41:58,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 06:42:00,864 INFO L124 PetriNetUnfolderBase]: 502/964 cut-off events. [2023-08-27 06:42:00,864 INFO L125 PetriNetUnfolderBase]: For 3667/3667 co-relation queries the response was YES. [2023-08-27 06:42:00,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4725 conditions, 964 events. 502/964 cut-off events. For 3667/3667 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 5276 event pairs, 62 based on Foata normal form. 2/940 useless extension candidates. Maximal degree in co-relation 4638. Up to 785 conditions per place. [2023-08-27 06:42:00,870 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 190 selfloop transitions, 56 changer transitions 10/256 dead transitions. [2023-08-27 06:42:00,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 256 transitions, 2543 flow [2023-08-27 06:42:00,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-08-27 06:42:00,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-08-27 06:42:00,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1289 transitions. [2023-08-27 06:42:00,873 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39747147702744373 [2023-08-27 06:42:00,873 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 1289 transitions. [2023-08-27 06:42:00,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 1289 transitions. [2023-08-27 06:42:00,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 06:42:00,874 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1289 transitions. [2023-08-27 06:42:00,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 56.04347826086956) internal successors, (1289), 23 states have internal predecessors, (1289), 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-08-27 06:42:00,879 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 141.0) internal successors, (3384), 24 states have internal predecessors, (3384), 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-08-27 06:42:00,880 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 141.0) internal successors, (3384), 24 states have internal predecessors, (3384), 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-08-27 06:42:00,880 INFO L175 Difference]: Start difference. First operand has 138 places, 172 transitions, 1440 flow. Second operand 23 states and 1289 transitions. [2023-08-27 06:42:00,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 256 transitions, 2543 flow [2023-08-27 06:42:00,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 256 transitions, 2442 flow, removed 45 selfloop flow, removed 3 redundant places. [2023-08-27 06:42:00,906 INFO L231 Difference]: Finished difference. Result has 164 places, 199 transitions, 1881 flow [2023-08-27 06:42:00,907 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=1351, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1881, PETRI_PLACES=164, PETRI_TRANSITIONS=199} [2023-08-27 06:42:00,907 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 144 predicate places. [2023-08-27 06:42:00,907 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 199 transitions, 1881 flow [2023-08-27 06:42:00,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 52.888888888888886) internal successors, (952), 18 states have internal predecessors, (952), 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-08-27 06:42:00,908 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 06:42:00,908 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 06:42:00,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-27 06:42:01,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-08-27 06:42:01,113 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-27 06:42:01,114 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 06:42:01,114 INFO L85 PathProgramCache]: Analyzing trace with hash 638430873, now seen corresponding path program 7 times [2023-08-27 06:42:01,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 06:42:01,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375615482] [2023-08-27 06:42:01,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 06:42:01,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 06:42:01,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 06:42:01,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:42:01,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 06:42:01,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375615482] [2023-08-27 06:42:01,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375615482] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 06:42:01,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108865853] [2023-08-27 06:42:01,429 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-27 06:42:01,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 06:42:01,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 06:42:01,430 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 06:42:01,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-27 06:42:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 06:42:01,494 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-27 06:42:01,495 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 06:42:01,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:42:01,653 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 06:42:04,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:42:04,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108865853] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 06:42:04,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 06:42:04,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2023-08-27 06:42:04,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188316129] [2023-08-27 06:42:04,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 06:42:04,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-27 06:42:04,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 06:42:04,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-27 06:42:04,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2023-08-27 06:42:04,764 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 141 [2023-08-27 06:42:04,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 199 transitions, 1881 flow. Second operand has 18 states, 18 states have (on average 52.888888888888886) internal successors, (952), 18 states have internal predecessors, (952), 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-08-27 06:42:04,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 06:42:04,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 141 [2023-08-27 06:42:04,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 06:42:05,719 INFO L124 PetriNetUnfolderBase]: 505/971 cut-off events. [2023-08-27 06:42:05,720 INFO L125 PetriNetUnfolderBase]: For 4433/4433 co-relation queries the response was YES. [2023-08-27 06:42:05,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5026 conditions, 971 events. 505/971 cut-off events. For 4433/4433 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 5292 event pairs, 68 based on Foata normal form. 4/951 useless extension candidates. Maximal degree in co-relation 4931. Up to 861 conditions per place. [2023-08-27 06:42:05,726 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 186 selfloop transitions, 43 changer transitions 8/237 dead transitions. [2023-08-27 06:42:05,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 237 transitions, 2548 flow [2023-08-27 06:42:05,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-08-27 06:42:05,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-08-27 06:42:05,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1000 transitions. [2023-08-27 06:42:05,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39401103230890466 [2023-08-27 06:42:05,728 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1000 transitions. [2023-08-27 06:42:05,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1000 transitions. [2023-08-27 06:42:05,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 06:42:05,728 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1000 transitions. [2023-08-27 06:42:05,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 55.55555555555556) internal successors, (1000), 18 states have internal predecessors, (1000), 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-08-27 06:42:05,733 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 141.0) internal successors, (2679), 19 states have internal predecessors, (2679), 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-08-27 06:42:05,733 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 141.0) internal successors, (2679), 19 states have internal predecessors, (2679), 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-08-27 06:42:05,733 INFO L175 Difference]: Start difference. First operand has 164 places, 199 transitions, 1881 flow. Second operand 18 states and 1000 transitions. [2023-08-27 06:42:05,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 237 transitions, 2548 flow [2023-08-27 06:42:05,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 237 transitions, 2287 flow, removed 102 selfloop flow, removed 12 redundant places. [2023-08-27 06:42:05,765 INFO L231 Difference]: Finished difference. Result has 174 places, 204 transitions, 1819 flow [2023-08-27 06:42:05,766 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=1624, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1819, PETRI_PLACES=174, PETRI_TRANSITIONS=204} [2023-08-27 06:42:05,766 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 154 predicate places. [2023-08-27 06:42:05,766 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 204 transitions, 1819 flow [2023-08-27 06:42:05,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 52.888888888888886) internal successors, (952), 18 states have internal predecessors, (952), 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-08-27 06:42:05,767 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 06:42:05,767 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 06:42:05,776 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-27 06:42:05,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-08-27 06:42:05,970 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-27 06:42:05,970 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 06:42:05,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1503846509, now seen corresponding path program 8 times [2023-08-27 06:42:05,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 06:42:05,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966013817] [2023-08-27 06:42:05,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 06:42:05,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 06:42:05,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 06:42:06,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:42:06,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 06:42:06,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966013817] [2023-08-27 06:42:06,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966013817] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 06:42:06,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864208588] [2023-08-27 06:42:06,316 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 06:42:06,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 06:42:06,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 06:42:06,317 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 06:42:06,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-27 06:42:06,370 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 06:42:06,370 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 06:42:06,371 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-27 06:42:06,371 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 06:42:06,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:42:06,503 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 06:42:09,191 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:42:09,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864208588] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 06:42:09,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 06:42:09,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2023-08-27 06:42:09,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87949008] [2023-08-27 06:42:09,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 06:42:09,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-27 06:42:09,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 06:42:09,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-27 06:42:09,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2023-08-27 06:42:09,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 141 [2023-08-27 06:42:09,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 204 transitions, 1819 flow. Second operand has 18 states, 18 states have (on average 52.888888888888886) internal successors, (952), 18 states have internal predecessors, (952), 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-08-27 06:42:09,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 06:42:09,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 141 [2023-08-27 06:42:09,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 06:42:10,382 INFO L124 PetriNetUnfolderBase]: 535/1017 cut-off events. [2023-08-27 06:42:10,382 INFO L125 PetriNetUnfolderBase]: For 5408/5408 co-relation queries the response was YES. [2023-08-27 06:42:10,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5344 conditions, 1017 events. 535/1017 cut-off events. For 5408/5408 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 5584 event pairs, 67 based on Foata normal form. 2/991 useless extension candidates. Maximal degree in co-relation 5245. Up to 830 conditions per place. [2023-08-27 06:42:10,391 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 180 selfloop transitions, 62 changer transitions 10/252 dead transitions. [2023-08-27 06:42:10,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 252 transitions, 2688 flow [2023-08-27 06:42:10,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-08-27 06:42:10,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-08-27 06:42:10,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1005 transitions. [2023-08-27 06:42:10,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3959810874704492 [2023-08-27 06:42:10,392 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1005 transitions. [2023-08-27 06:42:10,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1005 transitions. [2023-08-27 06:42:10,393 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 06:42:10,393 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1005 transitions. [2023-08-27 06:42:10,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 55.833333333333336) internal successors, (1005), 18 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 06:42:10,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 141.0) internal successors, (2679), 19 states have internal predecessors, (2679), 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-08-27 06:42:10,398 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 141.0) internal successors, (2679), 19 states have internal predecessors, (2679), 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-08-27 06:42:10,398 INFO L175 Difference]: Start difference. First operand has 174 places, 204 transitions, 1819 flow. Second operand 18 states and 1005 transitions. [2023-08-27 06:42:10,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 252 transitions, 2688 flow [2023-08-27 06:42:10,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 252 transitions, 2594 flow, removed 25 selfloop flow, removed 11 redundant places. [2023-08-27 06:42:10,441 INFO L231 Difference]: Finished difference. Result has 184 places, 214 transitions, 2086 flow [2023-08-27 06:42:10,442 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=1729, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2086, PETRI_PLACES=184, PETRI_TRANSITIONS=214} [2023-08-27 06:42:10,442 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 164 predicate places. [2023-08-27 06:42:10,442 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 214 transitions, 2086 flow [2023-08-27 06:42:10,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 52.888888888888886) internal successors, (952), 18 states have internal predecessors, (952), 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-08-27 06:42:10,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 06:42:10,443 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 06:42:10,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-08-27 06:42:10,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 06:42:10,651 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-27 06:42:10,651 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 06:42:10,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1093769279, now seen corresponding path program 9 times [2023-08-27 06:42:10,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 06:42:10,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726476500] [2023-08-27 06:42:10,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 06:42:10,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 06:42:10,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 06:42:11,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:42:11,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 06:42:11,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726476500] [2023-08-27 06:42:11,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726476500] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 06:42:11,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296336368] [2023-08-27 06:42:11,042 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-27 06:42:11,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 06:42:11,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 06:42:11,043 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 06:42:11,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-08-27 06:42:11,103 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-27 06:42:11,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 06:42:11,104 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-27 06:42:11,105 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 06:42:11,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:42:11,259 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 06:42:14,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:42:14,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296336368] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 06:42:14,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 06:42:14,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2023-08-27 06:42:14,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365039894] [2023-08-27 06:42:14,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 06:42:14,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-27 06:42:14,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 06:42:14,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-27 06:42:14,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2023-08-27 06:42:14,567 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 141 [2023-08-27 06:42:14,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 214 transitions, 2086 flow. Second operand has 18 states, 18 states have (on average 53.0) internal successors, (954), 18 states have internal predecessors, (954), 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-08-27 06:42:14,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 06:42:14,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 141 [2023-08-27 06:42:14,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 06:42:16,443 INFO L124 PetriNetUnfolderBase]: 533/1003 cut-off events. [2023-08-27 06:42:16,443 INFO L125 PetriNetUnfolderBase]: For 6373/6373 co-relation queries the response was YES. [2023-08-27 06:42:16,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5499 conditions, 1003 events. 533/1003 cut-off events. For 6373/6373 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 5431 event pairs, 66 based on Foata normal form. 2/981 useless extension candidates. Maximal degree in co-relation 5396. Up to 857 conditions per place. [2023-08-27 06:42:16,452 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 187 selfloop transitions, 58 changer transitions 10/255 dead transitions. [2023-08-27 06:42:16,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 255 transitions, 2754 flow [2023-08-27 06:42:16,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-27 06:42:16,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-27 06:42:16,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1167 transitions. [2023-08-27 06:42:16,455 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3941236068895643 [2023-08-27 06:42:16,455 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1167 transitions. [2023-08-27 06:42:16,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1167 transitions. [2023-08-27 06:42:16,455 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 06:42:16,455 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1167 transitions. [2023-08-27 06:42:16,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 55.57142857142857) internal successors, (1167), 21 states have internal predecessors, (1167), 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-08-27 06:42:16,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 141.0) internal successors, (3102), 22 states have internal predecessors, (3102), 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-08-27 06:42:16,460 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 141.0) internal successors, (3102), 22 states have internal predecessors, (3102), 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-08-27 06:42:16,460 INFO L175 Difference]: Start difference. First operand has 184 places, 214 transitions, 2086 flow. Second operand 21 states and 1167 transitions. [2023-08-27 06:42:16,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 255 transitions, 2754 flow [2023-08-27 06:42:16,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 255 transitions, 2593 flow, removed 54 selfloop flow, removed 11 redundant places. [2023-08-27 06:42:16,496 INFO L231 Difference]: Finished difference. Result has 195 places, 216 transitions, 2132 flow [2023-08-27 06:42:16,496 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=1929, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=2132, PETRI_PLACES=195, PETRI_TRANSITIONS=216} [2023-08-27 06:42:16,496 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 175 predicate places. [2023-08-27 06:42:16,496 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 216 transitions, 2132 flow [2023-08-27 06:42:16,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 53.0) internal successors, (954), 18 states have internal predecessors, (954), 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-08-27 06:42:16,497 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 06:42:16,497 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 06:42:16,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-08-27 06:42:16,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-27 06:42:16,698 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-27 06:42:16,698 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 06:42:16,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1490584709, now seen corresponding path program 10 times [2023-08-27 06:42:16,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 06:42:16,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651328546] [2023-08-27 06:42:16,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 06:42:16,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 06:42:16,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 06:42:17,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:42:17,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 06:42:17,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651328546] [2023-08-27 06:42:17,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651328546] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 06:42:17,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668283791] [2023-08-27 06:42:17,049 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-27 06:42:17,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 06:42:17,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 06:42:17,051 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 06:42:17,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-08-27 06:42:17,114 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-27 06:42:17,115 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 06:42:17,115 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-27 06:42:17,116 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 06:42:17,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:42:17,266 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 06:42:19,777 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:42:19,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668283791] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 06:42:19,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 06:42:19,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2023-08-27 06:42:19,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788532118] [2023-08-27 06:42:19,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 06:42:19,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-27 06:42:19,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 06:42:19,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-27 06:42:19,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2023-08-27 06:42:19,779 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 141 [2023-08-27 06:42:19,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 216 transitions, 2132 flow. Second operand has 18 states, 18 states have (on average 53.0) internal successors, (954), 18 states have internal predecessors, (954), 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-08-27 06:42:19,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 06:42:19,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 141 [2023-08-27 06:42:19,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 06:42:22,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 06:42:22,462 INFO L124 PetriNetUnfolderBase]: 532/1006 cut-off events. [2023-08-27 06:42:22,462 INFO L125 PetriNetUnfolderBase]: For 5979/5979 co-relation queries the response was YES. [2023-08-27 06:42:22,466 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5522 conditions, 1006 events. 532/1006 cut-off events. For 5979/5979 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 5467 event pairs, 65 based on Foata normal form. 2/986 useless extension candidates. Maximal degree in co-relation 5416. Up to 816 conditions per place. [2023-08-27 06:42:22,470 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 186 selfloop transitions, 63 changer transitions 10/259 dead transitions. [2023-08-27 06:42:22,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 259 transitions, 2857 flow [2023-08-27 06:42:22,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-08-27 06:42:22,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-08-27 06:42:22,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1013 transitions. [2023-08-27 06:42:22,473 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39913317572892043 [2023-08-27 06:42:22,473 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1013 transitions. [2023-08-27 06:42:22,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1013 transitions. [2023-08-27 06:42:22,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 06:42:22,473 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1013 transitions. [2023-08-27 06:42:22,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 56.27777777777778) internal successors, (1013), 18 states have internal predecessors, (1013), 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-08-27 06:42:22,477 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 141.0) internal successors, (2679), 19 states have internal predecessors, (2679), 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-08-27 06:42:22,477 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 141.0) internal successors, (2679), 19 states have internal predecessors, (2679), 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-08-27 06:42:22,477 INFO L175 Difference]: Start difference. First operand has 195 places, 216 transitions, 2132 flow. Second operand 18 states and 1013 transitions. [2023-08-27 06:42:22,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 259 transitions, 2857 flow [2023-08-27 06:42:22,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 259 transitions, 2706 flow, removed 27 selfloop flow, removed 19 redundant places. [2023-08-27 06:42:22,516 INFO L231 Difference]: Finished difference. Result has 194 places, 219 transitions, 2207 flow [2023-08-27 06:42:22,517 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=1985, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2207, PETRI_PLACES=194, PETRI_TRANSITIONS=219} [2023-08-27 06:42:22,517 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 174 predicate places. [2023-08-27 06:42:22,517 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 219 transitions, 2207 flow [2023-08-27 06:42:22,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 53.0) internal successors, (954), 18 states have internal predecessors, (954), 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-08-27 06:42:22,517 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 06:42:22,518 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 06:42:22,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-08-27 06:42:22,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-27 06:42:22,723 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-27 06:42:22,723 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 06:42:22,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1368069815, now seen corresponding path program 11 times [2023-08-27 06:42:22,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 06:42:22,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384723595] [2023-08-27 06:42:22,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 06:42:22,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 06:42:22,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 06:42:23,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:42:23,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 06:42:23,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384723595] [2023-08-27 06:42:23,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384723595] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 06:42:23,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980700316] [2023-08-27 06:42:23,043 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-27 06:42:23,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 06:42:23,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 06:42:23,045 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 06:42:23,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-08-27 06:42:23,117 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 06:42:23,118 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 06:42:23,119 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-27 06:42:23,120 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 06:42:23,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:42:23,296 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 06:42:26,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:42:26,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980700316] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 06:42:26,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 06:42:26,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2023-08-27 06:42:26,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300088083] [2023-08-27 06:42:26,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 06:42:26,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-27 06:42:26,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 06:42:26,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-27 06:42:26,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2023-08-27 06:42:26,651 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 141 [2023-08-27 06:42:26,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 219 transitions, 2207 flow. Second operand has 18 states, 18 states have (on average 52.94444444444444) internal successors, (953), 18 states have internal predecessors, (953), 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-08-27 06:42:26,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 06:42:26,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 141 [2023-08-27 06:42:26,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 06:42:27,842 INFO L124 PetriNetUnfolderBase]: 551/1041 cut-off events. [2023-08-27 06:42:27,843 INFO L125 PetriNetUnfolderBase]: For 6314/6314 co-relation queries the response was YES. [2023-08-27 06:42:27,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5867 conditions, 1041 events. 551/1041 cut-off events. For 6314/6314 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 5686 event pairs, 60 based on Foata normal form. 2/1021 useless extension candidates. Maximal degree in co-relation 5801. Up to 894 conditions per place. [2023-08-27 06:42:27,851 INFO L140 encePairwiseOnDemand]: 132/141 looper letters, 220 selfloop transitions, 46 changer transitions 16/282 dead transitions. [2023-08-27 06:42:27,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 282 transitions, 3222 flow [2023-08-27 06:42:27,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-08-27 06:42:27,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-08-27 06:42:27,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1020 transitions. [2023-08-27 06:42:27,854 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40189125295508277 [2023-08-27 06:42:27,854 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1020 transitions. [2023-08-27 06:42:27,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1020 transitions. [2023-08-27 06:42:27,854 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 06:42:27,854 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1020 transitions. [2023-08-27 06:42:27,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 56.666666666666664) internal successors, (1020), 18 states have internal predecessors, (1020), 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-08-27 06:42:27,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 141.0) internal successors, (2679), 19 states have internal predecessors, (2679), 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-08-27 06:42:27,858 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 141.0) internal successors, (2679), 19 states have internal predecessors, (2679), 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-08-27 06:42:27,858 INFO L175 Difference]: Start difference. First operand has 194 places, 219 transitions, 2207 flow. Second operand 18 states and 1020 transitions. [2023-08-27 06:42:27,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 282 transitions, 3222 flow [2023-08-27 06:42:27,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 282 transitions, 3031 flow, removed 60 selfloop flow, removed 14 redundant places. [2023-08-27 06:42:27,896 INFO L231 Difference]: Finished difference. Result has 203 places, 233 transitions, 2401 flow [2023-08-27 06:42:27,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=2021, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2401, PETRI_PLACES=203, PETRI_TRANSITIONS=233} [2023-08-27 06:42:27,897 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 183 predicate places. [2023-08-27 06:42:27,897 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 233 transitions, 2401 flow [2023-08-27 06:42:27,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 52.94444444444444) internal successors, (953), 18 states have internal predecessors, (953), 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-08-27 06:42:27,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 06:42:27,897 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 06:42:27,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-08-27 06:42:28,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-27 06:42:28,098 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-27 06:42:28,098 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 06:42:28,098 INFO L85 PathProgramCache]: Analyzing trace with hash 2044327863, now seen corresponding path program 12 times [2023-08-27 06:42:28,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 06:42:28,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332053056] [2023-08-27 06:42:28,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 06:42:28,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 06:42:28,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 06:42:28,473 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:42:28,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 06:42:28,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332053056] [2023-08-27 06:42:28,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332053056] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 06:42:28,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [677901729] [2023-08-27 06:42:28,474 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-27 06:42:28,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 06:42:28,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 06:42:28,475 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 06:42:28,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-08-27 06:42:28,529 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-08-27 06:42:28,529 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 06:42:28,530 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-27 06:42:28,531 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 06:42:28,689 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:42:28,690 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 06:42:31,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:42:31,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [677901729] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 06:42:31,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 06:42:31,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2023-08-27 06:42:31,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293661089] [2023-08-27 06:42:31,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 06:42:31,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-27 06:42:31,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 06:42:31,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-27 06:42:31,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2023-08-27 06:42:31,875 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 141 [2023-08-27 06:42:31,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 233 transitions, 2401 flow. Second operand has 18 states, 18 states have (on average 52.888888888888886) internal successors, (952), 18 states have internal predecessors, (952), 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-08-27 06:42:31,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 06:42:31,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 141 [2023-08-27 06:42:31,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 06:42:33,463 INFO L124 PetriNetUnfolderBase]: 571/1087 cut-off events. [2023-08-27 06:42:33,463 INFO L125 PetriNetUnfolderBase]: For 8238/8238 co-relation queries the response was YES. [2023-08-27 06:42:33,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6443 conditions, 1087 events. 571/1087 cut-off events. For 8238/8238 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 6069 event pairs, 64 based on Foata normal form. 2/1067 useless extension candidates. Maximal degree in co-relation 6331. Up to 903 conditions per place. [2023-08-27 06:42:33,473 INFO L140 encePairwiseOnDemand]: 132/141 looper letters, 214 selfloop transitions, 60 changer transitions 13/287 dead transitions. [2023-08-27 06:42:33,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 287 transitions, 3453 flow [2023-08-27 06:42:33,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-08-27 06:42:33,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-08-27 06:42:33,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1223 transitions. [2023-08-27 06:42:33,475 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39426176660219214 [2023-08-27 06:42:33,475 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 1223 transitions. [2023-08-27 06:42:33,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 1223 transitions. [2023-08-27 06:42:33,475 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 06:42:33,475 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1223 transitions. [2023-08-27 06:42:33,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 55.59090909090909) internal successors, (1223), 22 states have internal predecessors, (1223), 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-08-27 06:42:33,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 141.0) internal successors, (3243), 23 states have internal predecessors, (3243), 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-08-27 06:42:33,480 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 141.0) internal successors, (3243), 23 states have internal predecessors, (3243), 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-08-27 06:42:33,480 INFO L175 Difference]: Start difference. First operand has 203 places, 233 transitions, 2401 flow. Second operand 22 states and 1223 transitions. [2023-08-27 06:42:33,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 287 transitions, 3453 flow [2023-08-27 06:42:33,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 287 transitions, 3248 flow, removed 76 selfloop flow, removed 12 redundant places. [2023-08-27 06:42:33,514 INFO L231 Difference]: Finished difference. Result has 217 places, 243 transitions, 2604 flow [2023-08-27 06:42:33,515 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=2210, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2604, PETRI_PLACES=217, PETRI_TRANSITIONS=243} [2023-08-27 06:42:33,515 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 197 predicate places. [2023-08-27 06:42:33,515 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 243 transitions, 2604 flow [2023-08-27 06:42:33,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 52.888888888888886) internal successors, (952), 18 states have internal predecessors, (952), 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-08-27 06:42:33,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 06:42:33,515 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 06:42:33,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-08-27 06:42:33,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 06:42:33,716 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-27 06:42:33,716 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 06:42:33,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1988258853, now seen corresponding path program 4 times [2023-08-27 06:42:33,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 06:42:33,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363622175] [2023-08-27 06:42:33,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 06:42:33,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 06:42:33,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 06:42:33,876 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:42:33,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 06:42:33,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363622175] [2023-08-27 06:42:33,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363622175] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 06:42:33,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1019686089] [2023-08-27 06:42:33,877 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-27 06:42:33,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 06:42:33,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 06:42:33,881 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 06:42:33,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-08-27 06:42:34,011 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-27 06:42:34,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 06:42:34,013 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 24 conjunts are in the unsatisfiable core [2023-08-27 06:42:34,013 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 06:42:34,185 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:42:34,185 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 06:42:36,616 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:42:36,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1019686089] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 06:42:36,617 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 06:42:36,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 6] total 16 [2023-08-27 06:42:36,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105874114] [2023-08-27 06:42:36,617 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 06:42:36,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-27 06:42:36,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 06:42:36,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-27 06:42:36,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=226, Unknown=1, NotChecked=0, Total=306 [2023-08-27 06:42:36,618 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 141 [2023-08-27 06:42:36,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 243 transitions, 2604 flow. Second operand has 18 states, 18 states have (on average 53.166666666666664) internal successors, (957), 18 states have internal predecessors, (957), 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-08-27 06:42:36,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 06:42:36,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 141 [2023-08-27 06:42:36,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 06:42:37,308 INFO L124 PetriNetUnfolderBase]: 569/1071 cut-off events. [2023-08-27 06:42:37,308 INFO L125 PetriNetUnfolderBase]: For 8248/8248 co-relation queries the response was YES. [2023-08-27 06:42:37,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6378 conditions, 1071 events. 569/1071 cut-off events. For 8248/8248 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 5867 event pairs, 72 based on Foata normal form. 2/1053 useless extension candidates. Maximal degree in co-relation 6265. Up to 976 conditions per place. [2023-08-27 06:42:37,317 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 222 selfloop transitions, 41 changer transitions 6/269 dead transitions. [2023-08-27 06:42:37,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 269 transitions, 3228 flow [2023-08-27 06:42:37,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-27 06:42:37,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-27 06:42:37,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 836 transitions. [2023-08-27 06:42:37,320 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39527186761229316 [2023-08-27 06:42:37,320 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 836 transitions. [2023-08-27 06:42:37,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 836 transitions. [2023-08-27 06:42:37,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 06:42:37,320 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 836 transitions. [2023-08-27 06:42:37,321 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 55.733333333333334) internal successors, (836), 15 states have internal predecessors, (836), 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-08-27 06:42:37,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 141.0) internal successors, (2256), 16 states have internal predecessors, (2256), 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-08-27 06:42:37,324 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 141.0) internal successors, (2256), 16 states have internal predecessors, (2256), 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-08-27 06:42:37,324 INFO L175 Difference]: Start difference. First operand has 217 places, 243 transitions, 2604 flow. Second operand 15 states and 836 transitions. [2023-08-27 06:42:37,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 269 transitions, 3228 flow [2023-08-27 06:42:37,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 269 transitions, 2976 flow, removed 86 selfloop flow, removed 21 redundant places. [2023-08-27 06:42:37,376 INFO L231 Difference]: Finished difference. Result has 212 places, 244 transitions, 2470 flow [2023-08-27 06:42:37,376 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=2352, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2470, PETRI_PLACES=212, PETRI_TRANSITIONS=244} [2023-08-27 06:42:37,377 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 192 predicate places. [2023-08-27 06:42:37,377 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 244 transitions, 2470 flow [2023-08-27 06:42:37,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 53.166666666666664) internal successors, (957), 18 states have internal predecessors, (957), 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-08-27 06:42:37,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 06:42:37,377 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 06:42:37,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-08-27 06:42:37,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 06:42:37,582 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-27 06:42:37,583 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 06:42:37,583 INFO L85 PathProgramCache]: Analyzing trace with hash -540026125, now seen corresponding path program 13 times [2023-08-27 06:42:37,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 06:42:37,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404045300] [2023-08-27 06:42:37,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 06:42:37,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 06:42:37,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 06:42:38,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:42:38,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 06:42:38,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404045300] [2023-08-27 06:42:38,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404045300] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 06:42:38,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [447972009] [2023-08-27 06:42:38,063 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-27 06:42:38,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 06:42:38,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 06:42:38,065 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 06:42:38,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-08-27 06:42:38,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 06:42:38,144 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-27 06:42:38,145 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 06:42:38,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:42:38,347 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 06:42:40,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:42:40,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [447972009] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 06:42:40,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 06:42:40,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2023-08-27 06:42:40,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91049058] [2023-08-27 06:42:40,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 06:42:40,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-27 06:42:40,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 06:42:40,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-27 06:42:40,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2023-08-27 06:42:40,832 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 141 [2023-08-27 06:42:40,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 244 transitions, 2470 flow. Second operand has 18 states, 18 states have (on average 52.888888888888886) internal successors, (952), 18 states have internal predecessors, (952), 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-08-27 06:42:40,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 06:42:40,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 141 [2023-08-27 06:42:40,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 06:42:42,616 INFO L124 PetriNetUnfolderBase]: 609/1151 cut-off events. [2023-08-27 06:42:42,616 INFO L125 PetriNetUnfolderBase]: For 10553/10553 co-relation queries the response was YES. [2023-08-27 06:42:42,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7083 conditions, 1151 events. 609/1151 cut-off events. For 10553/10553 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 6441 event pairs, 70 based on Foata normal form. 2/1131 useless extension candidates. Maximal degree in co-relation 6972. Up to 974 conditions per place. [2023-08-27 06:42:42,624 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 234 selfloop transitions, 63 changer transitions 8/305 dead transitions. [2023-08-27 06:42:42,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 305 transitions, 3805 flow [2023-08-27 06:42:42,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-27 06:42:42,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-27 06:42:42,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1068 transitions. [2023-08-27 06:42:42,627 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3986562150055991 [2023-08-27 06:42:42,627 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1068 transitions. [2023-08-27 06:42:42,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1068 transitions. [2023-08-27 06:42:42,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 06:42:42,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1068 transitions. [2023-08-27 06:42:42,629 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 56.21052631578947) internal successors, (1068), 19 states have internal predecessors, (1068), 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-08-27 06:42:42,631 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 141.0) internal successors, (2820), 20 states have internal predecessors, (2820), 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-08-27 06:42:42,632 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 141.0) internal successors, (2820), 20 states have internal predecessors, (2820), 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-08-27 06:42:42,632 INFO L175 Difference]: Start difference. First operand has 212 places, 244 transitions, 2470 flow. Second operand 19 states and 1068 transitions. [2023-08-27 06:42:42,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 305 transitions, 3805 flow [2023-08-27 06:42:42,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 305 transitions, 3701 flow, removed 12 selfloop flow, removed 14 redundant places. [2023-08-27 06:42:42,685 INFO L231 Difference]: Finished difference. Result has 223 places, 260 transitions, 2988 flow [2023-08-27 06:42:42,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=2378, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=2988, PETRI_PLACES=223, PETRI_TRANSITIONS=260} [2023-08-27 06:42:42,685 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 203 predicate places. [2023-08-27 06:42:42,686 INFO L495 AbstractCegarLoop]: Abstraction has has 223 places, 260 transitions, 2988 flow [2023-08-27 06:42:42,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 52.888888888888886) internal successors, (952), 18 states have internal predecessors, (952), 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-08-27 06:42:42,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 06:42:42,686 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 06:42:42,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-08-27 06:42:42,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-08-27 06:42:42,889 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-27 06:42:42,889 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 06:42:42,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1178912227, now seen corresponding path program 14 times [2023-08-27 06:42:42,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 06:42:42,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730325638] [2023-08-27 06:42:42,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 06:42:42,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 06:42:42,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 06:42:43,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:42:43,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 06:42:43,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730325638] [2023-08-27 06:42:43,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730325638] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 06:42:43,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858669428] [2023-08-27 06:42:43,302 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 06:42:43,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 06:42:43,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 06:42:43,303 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 06:42:43,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-08-27 06:42:43,374 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 06:42:43,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 06:42:43,375 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-27 06:42:43,376 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 06:42:43,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:42:43,571 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 06:42:47,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:42:47,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858669428] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 06:42:47,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 06:42:47,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 17 [2023-08-27 06:42:47,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615130708] [2023-08-27 06:42:47,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 06:42:47,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-27 06:42:47,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 06:42:47,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-27 06:42:47,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2023-08-27 06:42:47,536 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 141 [2023-08-27 06:42:47,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 260 transitions, 2988 flow. Second operand has 19 states, 19 states have (on average 48.05263157894737) internal successors, (913), 19 states have internal predecessors, (913), 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-08-27 06:42:47,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 06:42:47,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 141 [2023-08-27 06:42:47,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 06:42:48,491 INFO L124 PetriNetUnfolderBase]: 611/1164 cut-off events. [2023-08-27 06:42:48,491 INFO L125 PetriNetUnfolderBase]: For 12841/12841 co-relation queries the response was YES. [2023-08-27 06:42:48,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7458 conditions, 1164 events. 611/1164 cut-off events. For 12841/12841 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 6566 event pairs, 80 based on Foata normal form. 3/1145 useless extension candidates. Maximal degree in co-relation 7342. Up to 1059 conditions per place. [2023-08-27 06:42:48,499 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 239 selfloop transitions, 45 changer transitions 7/291 dead transitions. [2023-08-27 06:42:48,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 291 transitions, 3807 flow [2023-08-27 06:42:48,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-27 06:42:48,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-27 06:42:48,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 809 transitions. [2023-08-27 06:42:48,500 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35859929078014185 [2023-08-27 06:42:48,500 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 809 transitions. [2023-08-27 06:42:48,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 809 transitions. [2023-08-27 06:42:48,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 06:42:48,500 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 809 transitions. [2023-08-27 06:42:48,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 50.5625) internal successors, (809), 16 states have internal predecessors, (809), 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-08-27 06:42:48,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 141.0) internal successors, (2397), 17 states have internal predecessors, (2397), 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-08-27 06:42:48,503 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 141.0) internal successors, (2397), 17 states have internal predecessors, (2397), 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-08-27 06:42:48,503 INFO L175 Difference]: Start difference. First operand has 223 places, 260 transitions, 2988 flow. Second operand 16 states and 809 transitions. [2023-08-27 06:42:48,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 291 transitions, 3807 flow [2023-08-27 06:42:48,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 291 transitions, 3436 flow, removed 163 selfloop flow, removed 10 redundant places. [2023-08-27 06:42:48,578 INFO L231 Difference]: Finished difference. Result has 231 places, 263 transitions, 2816 flow [2023-08-27 06:42:48,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=2621, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=2816, PETRI_PLACES=231, PETRI_TRANSITIONS=263} [2023-08-27 06:42:48,579 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 211 predicate places. [2023-08-27 06:42:48,579 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 263 transitions, 2816 flow [2023-08-27 06:42:48,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 48.05263157894737) internal successors, (913), 19 states have internal predecessors, (913), 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-08-27 06:42:48,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 06:42:48,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 06:42:48,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-08-27 06:42:48,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-08-27 06:42:48,788 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-27 06:42:48,788 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 06:42:48,788 INFO L85 PathProgramCache]: Analyzing trace with hash 2031066063, now seen corresponding path program 15 times [2023-08-27 06:42:48,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 06:42:48,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272509650] [2023-08-27 06:42:48,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 06:42:48,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 06:42:48,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 06:42:49,190 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:42:49,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 06:42:49,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272509650] [2023-08-27 06:42:49,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272509650] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 06:42:49,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951793545] [2023-08-27 06:42:49,191 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-27 06:42:49,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 06:42:49,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 06:42:49,193 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 06:42:49,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-08-27 06:42:49,265 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-27 06:42:49,265 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 06:42:49,266 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-27 06:42:49,267 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 06:42:49,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:42:49,453 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 06:42:53,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:42:53,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951793545] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 06:42:53,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 06:42:53,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2023-08-27 06:42:53,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124423735] [2023-08-27 06:42:53,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 06:42:53,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-27 06:42:53,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 06:42:53,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-27 06:42:53,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2023-08-27 06:42:53,682 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 141 [2023-08-27 06:42:53,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 263 transitions, 2816 flow. Second operand has 18 states, 18 states have (on average 53.0) internal successors, (954), 18 states have internal predecessors, (954), 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-08-27 06:42:53,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 06:42:53,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 141 [2023-08-27 06:42:53,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 06:42:56,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 06:42:57,426 INFO L124 PetriNetUnfolderBase]: 641/1213 cut-off events. [2023-08-27 06:42:57,426 INFO L125 PetriNetUnfolderBase]: For 13832/13832 co-relation queries the response was YES. [2023-08-27 06:42:57,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7594 conditions, 1213 events. 641/1213 cut-off events. For 13832/13832 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 6856 event pairs, 72 based on Foata normal form. 2/1189 useless extension candidates. Maximal degree in co-relation 7475. Up to 1026 conditions per place. [2023-08-27 06:42:57,436 INFO L140 encePairwiseOnDemand]: 132/141 looper letters, 248 selfloop transitions, 64 changer transitions 11/323 dead transitions. [2023-08-27 06:42:57,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 323 transitions, 3895 flow [2023-08-27 06:42:57,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-08-27 06:42:57,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-08-27 06:42:57,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1337 transitions. [2023-08-27 06:42:57,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3950945626477541 [2023-08-27 06:42:57,452 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 1337 transitions. [2023-08-27 06:42:57,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 1337 transitions. [2023-08-27 06:42:57,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 06:42:57,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 1337 transitions. [2023-08-27 06:42:57,458 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 55.708333333333336) internal successors, (1337), 24 states have internal predecessors, (1337), 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-08-27 06:42:57,461 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 141.0) internal successors, (3525), 25 states have internal predecessors, (3525), 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-08-27 06:42:57,461 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 141.0) internal successors, (3525), 25 states have internal predecessors, (3525), 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-08-27 06:42:57,461 INFO L175 Difference]: Start difference. First operand has 231 places, 263 transitions, 2816 flow. Second operand 24 states and 1337 transitions. [2023-08-27 06:42:57,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 323 transitions, 3895 flow [2023-08-27 06:42:57,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 323 transitions, 3765 flow, removed 34 selfloop flow, removed 12 redundant places. [2023-08-27 06:42:57,550 INFO L231 Difference]: Finished difference. Result has 247 places, 273 transitions, 3128 flow [2023-08-27 06:42:57,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=2686, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=3128, PETRI_PLACES=247, PETRI_TRANSITIONS=273} [2023-08-27 06:42:57,551 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 227 predicate places. [2023-08-27 06:42:57,551 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 273 transitions, 3128 flow [2023-08-27 06:42:57,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 53.0) internal successors, (954), 18 states have internal predecessors, (954), 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-08-27 06:42:57,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 06:42:57,552 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 06:42:57,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-08-27 06:42:57,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 06:42:57,757 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-27 06:42:57,757 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 06:42:57,757 INFO L85 PathProgramCache]: Analyzing trace with hash -553287925, now seen corresponding path program 16 times [2023-08-27 06:42:57,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 06:42:57,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167671498] [2023-08-27 06:42:57,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 06:42:57,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 06:42:57,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 06:42:58,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:42:58,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 06:42:58,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167671498] [2023-08-27 06:42:58,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167671498] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 06:42:58,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838183264] [2023-08-27 06:42:58,134 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-27 06:42:58,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 06:42:58,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 06:42:58,134 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 06:42:58,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-08-27 06:42:58,202 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-27 06:42:58,202 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 06:42:58,203 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-27 06:42:58,204 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 06:42:58,371 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:42:58,372 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 06:43:00,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:43:00,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838183264] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 06:43:00,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 06:43:00,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2023-08-27 06:43:00,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836779930] [2023-08-27 06:43:00,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 06:43:00,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-27 06:43:00,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 06:43:00,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-27 06:43:00,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2023-08-27 06:43:00,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 141 [2023-08-27 06:43:00,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 273 transitions, 3128 flow. Second operand has 18 states, 18 states have (on average 53.0) internal successors, (954), 18 states have internal predecessors, (954), 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-08-27 06:43:00,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 06:43:00,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 141 [2023-08-27 06:43:00,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 06:43:01,938 INFO L124 PetriNetUnfolderBase]: 627/1187 cut-off events. [2023-08-27 06:43:01,938 INFO L125 PetriNetUnfolderBase]: For 14060/14060 co-relation queries the response was YES. [2023-08-27 06:43:01,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7615 conditions, 1187 events. 627/1187 cut-off events. For 14060/14060 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 6694 event pairs, 76 based on Foata normal form. 2/1165 useless extension candidates. Maximal degree in co-relation 7526. Up to 1024 conditions per place. [2023-08-27 06:43:01,948 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 234 selfloop transitions, 65 changer transitions 10/309 dead transitions. [2023-08-27 06:43:01,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 309 transitions, 3929 flow [2023-08-27 06:43:01,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-08-27 06:43:01,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-08-27 06:43:01,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1003 transitions. [2023-08-27 06:43:01,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3951930654058314 [2023-08-27 06:43:01,950 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1003 transitions. [2023-08-27 06:43:01,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1003 transitions. [2023-08-27 06:43:01,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 06:43:01,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1003 transitions. [2023-08-27 06:43:01,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 55.72222222222222) internal successors, (1003), 18 states have internal predecessors, (1003), 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-08-27 06:43:01,953 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 141.0) internal successors, (2679), 19 states have internal predecessors, (2679), 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-08-27 06:43:01,954 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 141.0) internal successors, (2679), 19 states have internal predecessors, (2679), 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-08-27 06:43:01,954 INFO L175 Difference]: Start difference. First operand has 247 places, 273 transitions, 3128 flow. Second operand 18 states and 1003 transitions. [2023-08-27 06:43:01,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 309 transitions, 3929 flow [2023-08-27 06:43:02,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 309 transitions, 3669 flow, removed 94 selfloop flow, removed 21 redundant places. [2023-08-27 06:43:02,046 INFO L231 Difference]: Finished difference. Result has 246 places, 275 transitions, 3114 flow [2023-08-27 06:43:02,046 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=2870, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=3114, PETRI_PLACES=246, PETRI_TRANSITIONS=275} [2023-08-27 06:43:02,046 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 226 predicate places. [2023-08-27 06:43:02,047 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 275 transitions, 3114 flow [2023-08-27 06:43:02,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 53.0) internal successors, (954), 18 states have internal predecessors, (954), 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-08-27 06:43:02,047 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 06:43:02,047 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 06:43:02,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-08-27 06:43:02,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 06:43:02,252 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-27 06:43:02,253 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 06:43:02,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1426341431, now seen corresponding path program 4 times [2023-08-27 06:43:02,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 06:43:02,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576116553] [2023-08-27 06:43:02,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 06:43:02,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 06:43:02,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 06:43:02,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:43:02,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 06:43:02,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576116553] [2023-08-27 06:43:02,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576116553] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 06:43:02,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473387745] [2023-08-27 06:43:02,532 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-27 06:43:02,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 06:43:02,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 06:43:02,537 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 06:43:02,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-08-27 06:43:02,615 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-27 06:43:02,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 06:43:02,617 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-27 06:43:02,617 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 06:43:02,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:43:02,742 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 06:43:02,891 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:43:02,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473387745] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 06:43:02,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 06:43:02,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 11 [2023-08-27 06:43:02,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443433826] [2023-08-27 06:43:02,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 06:43:02,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-27 06:43:02,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 06:43:02,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-27 06:43:02,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2023-08-27 06:43:02,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 141 [2023-08-27 06:43:02,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 275 transitions, 3114 flow. Second operand has 13 states, 13 states have (on average 61.69230769230769) internal successors, (802), 13 states have internal predecessors, (802), 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-08-27 06:43:02,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 06:43:02,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 141 [2023-08-27 06:43:02,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 06:43:03,685 INFO L124 PetriNetUnfolderBase]: 661/1255 cut-off events. [2023-08-27 06:43:03,686 INFO L125 PetriNetUnfolderBase]: For 17856/17863 co-relation queries the response was YES. [2023-08-27 06:43:03,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8452 conditions, 1255 events. 661/1255 cut-off events. For 17856/17863 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 7285 event pairs, 58 based on Foata normal form. 6/1234 useless extension candidates. Maximal degree in co-relation 8327. Up to 1009 conditions per place. [2023-08-27 06:43:03,699 INFO L140 encePairwiseOnDemand]: 135/141 looper letters, 259 selfloop transitions, 47 changer transitions 6/322 dead transitions. [2023-08-27 06:43:03,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 322 transitions, 4353 flow [2023-08-27 06:43:03,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-27 06:43:03,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-27 06:43:03,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 839 transitions. [2023-08-27 06:43:03,701 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45771958537915985 [2023-08-27 06:43:03,701 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 839 transitions. [2023-08-27 06:43:03,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 839 transitions. [2023-08-27 06:43:03,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 06:43:03,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 839 transitions. [2023-08-27 06:43:03,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 64.53846153846153) internal successors, (839), 13 states have internal predecessors, (839), 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-08-27 06:43:03,704 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 141.0) internal successors, (1974), 14 states have internal predecessors, (1974), 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-08-27 06:43:03,704 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 141.0) internal successors, (1974), 14 states have internal predecessors, (1974), 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-08-27 06:43:03,704 INFO L175 Difference]: Start difference. First operand has 246 places, 275 transitions, 3114 flow. Second operand 13 states and 839 transitions. [2023-08-27 06:43:03,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 322 transitions, 4353 flow [2023-08-27 06:43:03,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 322 transitions, 4170 flow, removed 43 selfloop flow, removed 14 redundant places. [2023-08-27 06:43:03,816 INFO L231 Difference]: Finished difference. Result has 244 places, 289 transitions, 3386 flow [2023-08-27 06:43:03,817 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=2943, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3386, PETRI_PLACES=244, PETRI_TRANSITIONS=289} [2023-08-27 06:43:03,817 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 224 predicate places. [2023-08-27 06:43:03,817 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 289 transitions, 3386 flow [2023-08-27 06:43:03,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 61.69230769230769) internal successors, (802), 13 states have internal predecessors, (802), 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-08-27 06:43:03,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 06:43:03,818 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 06:43:03,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-08-27 06:43:04,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-08-27 06:43:04,028 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-27 06:43:04,028 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 06:43:04,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1967502711, now seen corresponding path program 17 times [2023-08-27 06:43:04,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 06:43:04,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391897211] [2023-08-27 06:43:04,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 06:43:04,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 06:43:04,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 06:43:04,381 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:43:04,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 06:43:04,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391897211] [2023-08-27 06:43:04,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391897211] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 06:43:04,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002851232] [2023-08-27 06:43:04,382 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-27 06:43:04,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 06:43:04,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 06:43:04,383 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 06:43:04,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-08-27 06:43:04,459 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 06:43:04,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 06:43:04,461 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-27 06:43:04,462 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 06:43:04,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:43:04,697 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 06:43:06,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:43:06,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002851232] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 06:43:06,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 06:43:06,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 17 [2023-08-27 06:43:06,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632539220] [2023-08-27 06:43:06,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 06:43:06,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-27 06:43:06,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 06:43:06,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-27 06:43:06,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2023-08-27 06:43:06,098 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 141 [2023-08-27 06:43:06,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 289 transitions, 3386 flow. Second operand has 19 states, 19 states have (on average 52.8421052631579) internal successors, (1004), 19 states have internal predecessors, (1004), 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-08-27 06:43:06,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 06:43:06,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 141 [2023-08-27 06:43:06,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 06:43:07,721 INFO L124 PetriNetUnfolderBase]: 730/1396 cut-off events. [2023-08-27 06:43:07,721 INFO L125 PetriNetUnfolderBase]: For 19772/19772 co-relation queries the response was YES. [2023-08-27 06:43:07,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9493 conditions, 1396 events. 730/1396 cut-off events. For 19772/19772 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 8298 event pairs, 80 based on Foata normal form. 3/1379 useless extension candidates. Maximal degree in co-relation 9367. Up to 1143 conditions per place. [2023-08-27 06:43:07,732 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 273 selfloop transitions, 74 changer transitions 32/379 dead transitions. [2023-08-27 06:43:07,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 379 transitions, 5150 flow [2023-08-27 06:43:07,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-08-27 06:43:07,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-08-27 06:43:07,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1347 transitions. [2023-08-27 06:43:07,735 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3980496453900709 [2023-08-27 06:43:07,736 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 1347 transitions. [2023-08-27 06:43:07,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 1347 transitions. [2023-08-27 06:43:07,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 06:43:07,736 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 1347 transitions. [2023-08-27 06:43:07,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 56.125) internal successors, (1347), 24 states have internal predecessors, (1347), 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-08-27 06:43:07,740 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 141.0) internal successors, (3525), 25 states have internal predecessors, (3525), 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-08-27 06:43:07,740 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 141.0) internal successors, (3525), 25 states have internal predecessors, (3525), 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-08-27 06:43:07,740 INFO L175 Difference]: Start difference. First operand has 244 places, 289 transitions, 3386 flow. Second operand 24 states and 1347 transitions. [2023-08-27 06:43:07,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 379 transitions, 5150 flow [2023-08-27 06:43:07,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 379 transitions, 4897 flow, removed 115 selfloop flow, removed 4 redundant places. [2023-08-27 06:43:07,839 INFO L231 Difference]: Finished difference. Result has 273 places, 311 transitions, 3881 flow [2023-08-27 06:43:07,839 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=3213, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=3881, PETRI_PLACES=273, PETRI_TRANSITIONS=311} [2023-08-27 06:43:07,839 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 253 predicate places. [2023-08-27 06:43:07,839 INFO L495 AbstractCegarLoop]: Abstraction has has 273 places, 311 transitions, 3881 flow [2023-08-27 06:43:07,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 52.8421052631579) internal successors, (1004), 19 states have internal predecessors, (1004), 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-08-27 06:43:07,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 06:43:07,840 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 06:43:07,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2023-08-27 06:43:08,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-08-27 06:43:08,040 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-27 06:43:08,041 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 06:43:08,041 INFO L85 PathProgramCache]: Analyzing trace with hash -361178151, now seen corresponding path program 18 times [2023-08-27 06:43:08,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 06:43:08,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884926579] [2023-08-27 06:43:08,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 06:43:08,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 06:43:08,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 06:43:08,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:43:08,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 06:43:08,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884926579] [2023-08-27 06:43:08,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884926579] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 06:43:08,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274783376] [2023-08-27 06:43:08,402 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-27 06:43:08,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 06:43:08,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 06:43:08,403 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 06:43:08,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-08-27 06:43:08,474 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-08-27 06:43:08,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 06:43:08,475 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-27 06:43:08,476 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 06:43:08,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:43:08,684 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 06:43:10,079 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:43:10,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274783376] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 06:43:10,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 06:43:10,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 17 [2023-08-27 06:43:10,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215068607] [2023-08-27 06:43:10,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 06:43:10,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-27 06:43:10,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 06:43:10,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-27 06:43:10,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2023-08-27 06:43:10,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 141 [2023-08-27 06:43:10,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 311 transitions, 3881 flow. Second operand has 19 states, 19 states have (on average 52.89473684210526) internal successors, (1005), 19 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 06:43:10,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 06:43:10,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 141 [2023-08-27 06:43:10,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 06:43:12,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 06:43:13,310 INFO L124 PetriNetUnfolderBase]: 763/1453 cut-off events. [2023-08-27 06:43:13,310 INFO L125 PetriNetUnfolderBase]: For 26112/26112 co-relation queries the response was YES. [2023-08-27 06:43:13,317 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10568 conditions, 1453 events. 763/1453 cut-off events. For 26112/26112 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 8704 event pairs, 78 based on Foata normal form. 3/1436 useless extension candidates. Maximal degree in co-relation 10432. Up to 1151 conditions per place. [2023-08-27 06:43:13,322 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 273 selfloop transitions, 102 changer transitions 16/391 dead transitions. [2023-08-27 06:43:13,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 391 transitions, 5716 flow [2023-08-27 06:43:13,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-08-27 06:43:13,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-08-27 06:43:13,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1405 transitions. [2023-08-27 06:43:13,324 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39858156028368796 [2023-08-27 06:43:13,325 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 1405 transitions. [2023-08-27 06:43:13,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 1405 transitions. [2023-08-27 06:43:13,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 06:43:13,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 1405 transitions. [2023-08-27 06:43:13,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 56.2) internal successors, (1405), 25 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 06:43:13,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 141.0) internal successors, (3666), 26 states have internal predecessors, (3666), 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-08-27 06:43:13,329 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 141.0) internal successors, (3666), 26 states have internal predecessors, (3666), 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-08-27 06:43:13,330 INFO L175 Difference]: Start difference. First operand has 273 places, 311 transitions, 3881 flow. Second operand 25 states and 1405 transitions. [2023-08-27 06:43:13,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 391 transitions, 5716 flow [2023-08-27 06:43:13,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 391 transitions, 5261 flow, removed 210 selfloop flow, removed 8 redundant places. [2023-08-27 06:43:13,451 INFO L231 Difference]: Finished difference. Result has 292 places, 332 transitions, 4435 flow [2023-08-27 06:43:13,451 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=3484, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=4435, PETRI_PLACES=292, PETRI_TRANSITIONS=332} [2023-08-27 06:43:13,452 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 272 predicate places. [2023-08-27 06:43:13,452 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 332 transitions, 4435 flow [2023-08-27 06:43:13,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 52.89473684210526) internal successors, (1005), 19 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 06:43:13,452 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 06:43:13,452 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 06:43:13,457 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2023-08-27 06:43:13,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-08-27 06:43:13,653 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-27 06:43:13,653 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 06:43:13,653 INFO L85 PathProgramCache]: Analyzing trace with hash 599655405, now seen corresponding path program 19 times [2023-08-27 06:43:13,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 06:43:13,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763041099] [2023-08-27 06:43:13,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 06:43:13,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 06:43:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 06:43:14,591 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:43:14,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 06:43:14,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763041099] [2023-08-27 06:43:14,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763041099] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 06:43:14,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186648413] [2023-08-27 06:43:14,591 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-27 06:43:14,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 06:43:14,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 06:43:14,592 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 06:43:14,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-08-27 06:43:14,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 06:43:14,691 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 29 conjunts are in the unsatisfiable core [2023-08-27 06:43:14,692 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 06:43:14,973 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:43:14,973 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 06:43:18,136 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (div (+ (mod c_~x_2~0 4294967296) (- 4294967294)) 4294967296)) (.cse3 (* (div c_~x_2~0 4294967296) 4294967296)) (.cse0 (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296)) (.cse4 (mod c_thread2Thread1of1ForFork1_~i~1 4294967296))) (and (forall ((v_z_346 Int)) (or (< .cse0 v_z_346) (let ((.cse1 (* 2 v_z_346))) (< (+ c_~x_1~0 .cse1 (* .cse2 4294967296) .cse3 4294967293) (+ c_~x_2~0 (* (div (+ c_~x_1~0 .cse1) 4294967296) 4294967296)))) (<= v_z_346 .cse4))) (or (forall ((v_z_346 Int)) (or (< .cse0 v_z_346) (let ((.cse5 (* 2 v_z_346))) (< (+ c_~x_2~0 (* (div (+ c_~x_1~0 .cse5) 4294967296) 4294967296) 1) (+ c_~x_1~0 .cse5 .cse3))) (<= v_z_346 .cse4))) (< 0 (+ .cse2 1))) (forall ((v_z_346 Int)) (or (< .cse0 v_z_346) (let ((.cse6 (* 2 v_z_346))) (< (+ c_~x_1~0 .cse6 .cse3) (+ c_~x_2~0 (* (div (+ c_~x_1~0 .cse6) 4294967296) 4294967296) 3))) (<= v_z_346 .cse4))) (forall ((v_z_346 Int)) (or (let ((.cse7 (* 2 v_z_346))) (< (+ c_~x_2~0 (* (div (+ c_~x_1~0 .cse7) 4294967296) 4294967296)) (+ c_~x_1~0 4294967295 .cse7 .cse3))) (< .cse0 v_z_346) (<= v_z_346 .cse4))))) is different from false [2023-08-27 06:43:18,279 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-27 06:43:18,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186648413] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 06:43:18,280 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 06:43:18,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 21 [2023-08-27 06:43:18,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726986109] [2023-08-27 06:43:18,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 06:43:18,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-27 06:43:18,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 06:43:18,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-27 06:43:18,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=366, Unknown=1, NotChecked=40, Total=506 [2023-08-27 06:43:18,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 141 [2023-08-27 06:43:18,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 332 transitions, 4435 flow. Second operand has 23 states, 23 states have (on average 47.869565217391305) internal successors, (1101), 23 states have internal predecessors, (1101), 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-08-27 06:43:18,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 06:43:18,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 141 [2023-08-27 06:43:18,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 06:43:26,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 06:43:28,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 06:43:30,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 06:43:32,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 06:43:34,396 INFO L124 PetriNetUnfolderBase]: 839/1614 cut-off events. [2023-08-27 06:43:34,397 INFO L125 PetriNetUnfolderBase]: For 39891/39891 co-relation queries the response was YES. [2023-08-27 06:43:34,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12914 conditions, 1614 events. 839/1614 cut-off events. For 39891/39891 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 9951 event pairs, 80 based on Foata normal form. 5/1599 useless extension candidates. Maximal degree in co-relation 12774. Up to 1178 conditions per place. [2023-08-27 06:43:34,412 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 290 selfloop transitions, 138 changer transitions 18/446 dead transitions. [2023-08-27 06:43:34,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 446 transitions, 7383 flow [2023-08-27 06:43:34,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-08-27 06:43:34,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2023-08-27 06:43:34,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 1686 transitions. [2023-08-27 06:43:34,415 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3623468729851709 [2023-08-27 06:43:34,416 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 1686 transitions. [2023-08-27 06:43:34,416 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 1686 transitions. [2023-08-27 06:43:34,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 06:43:34,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 1686 transitions. [2023-08-27 06:43:34,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 51.09090909090909) internal successors, (1686), 33 states have internal predecessors, (1686), 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-08-27 06:43:34,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 141.0) internal successors, (4794), 34 states have internal predecessors, (4794), 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-08-27 06:43:34,422 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 141.0) internal successors, (4794), 34 states have internal predecessors, (4794), 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-08-27 06:43:34,422 INFO L175 Difference]: Start difference. First operand has 292 places, 332 transitions, 4435 flow. Second operand 33 states and 1686 transitions. [2023-08-27 06:43:34,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 446 transitions, 7383 flow [2023-08-27 06:43:34,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 446 transitions, 6234 flow, removed 540 selfloop flow, removed 10 redundant places. [2023-08-27 06:43:34,684 INFO L231 Difference]: Finished difference. Result has 319 places, 367 transitions, 5224 flow [2023-08-27 06:43:34,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=3875, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=5224, PETRI_PLACES=319, PETRI_TRANSITIONS=367} [2023-08-27 06:43:34,685 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 299 predicate places. [2023-08-27 06:43:34,685 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 367 transitions, 5224 flow [2023-08-27 06:43:34,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 47.869565217391305) internal successors, (1101), 23 states have internal predecessors, (1101), 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-08-27 06:43:34,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 06:43:34,686 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 06:43:34,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2023-08-27 06:43:34,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-08-27 06:43:34,889 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-27 06:43:34,889 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 06:43:34,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1943883729, now seen corresponding path program 5 times [2023-08-27 06:43:34,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 06:43:34,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871411800] [2023-08-27 06:43:34,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 06:43:34,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 06:43:34,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 06:43:35,114 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:43:35,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 06:43:35,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871411800] [2023-08-27 06:43:35,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871411800] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 06:43:35,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450124080] [2023-08-27 06:43:35,115 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-27 06:43:35,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 06:43:35,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 06:43:35,117 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 06:43:35,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-08-27 06:43:35,231 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-08-27 06:43:35,231 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 06:43:35,232 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-27 06:43:35,233 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 06:43:35,367 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:43:35,367 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 06:43:35,533 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-27 06:43:35,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450124080] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 06:43:35,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 06:43:35,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 4] total 12 [2023-08-27 06:43:35,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26930371] [2023-08-27 06:43:35,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 06:43:35,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-27 06:43:35,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 06:43:35,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-27 06:43:35,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-08-27 06:43:35,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 141 [2023-08-27 06:43:35,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 367 transitions, 5224 flow. Second operand has 14 states, 14 states have (on average 61.642857142857146) internal successors, (863), 14 states have internal predecessors, (863), 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-08-27 06:43:35,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 06:43:35,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 141 [2023-08-27 06:43:35,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 06:43:36,370 INFO L124 PetriNetUnfolderBase]: 832/1611 cut-off events. [2023-08-27 06:43:36,370 INFO L125 PetriNetUnfolderBase]: For 32269/32279 co-relation queries the response was YES. [2023-08-27 06:43:36,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12135 conditions, 1611 events. 832/1611 cut-off events. For 32269/32279 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 10018 event pairs, 60 based on Foata normal form. 5/1590 useless extension candidates. Maximal degree in co-relation 11986. Up to 1296 conditions per place. [2023-08-27 06:43:36,385 INFO L140 encePairwiseOnDemand]: 135/141 looper letters, 315 selfloop transitions, 78 changer transitions 28/428 dead transitions. [2023-08-27 06:43:36,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 428 transitions, 6653 flow [2023-08-27 06:43:36,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-27 06:43:36,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-27 06:43:36,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1098 transitions. [2023-08-27 06:43:36,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45807259073842305 [2023-08-27 06:43:36,396 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1098 transitions. [2023-08-27 06:43:36,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1098 transitions. [2023-08-27 06:43:36,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 06:43:36,396 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1098 transitions. [2023-08-27 06:43:36,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 64.58823529411765) internal successors, (1098), 17 states have internal predecessors, (1098), 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-08-27 06:43:36,399 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 141.0) internal successors, (2538), 18 states have internal predecessors, (2538), 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-08-27 06:43:36,399 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 141.0) internal successors, (2538), 18 states have internal predecessors, (2538), 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-08-27 06:43:36,399 INFO L175 Difference]: Start difference. First operand has 319 places, 367 transitions, 5224 flow. Second operand 17 states and 1098 transitions. [2023-08-27 06:43:36,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 428 transitions, 6653 flow [2023-08-27 06:43:36,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 428 transitions, 5730 flow, removed 380 selfloop flow, removed 21 redundant places. [2023-08-27 06:43:36,669 INFO L231 Difference]: Finished difference. Result has 316 places, 368 transitions, 4543 flow [2023-08-27 06:43:36,669 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=4303, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=367, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=289, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=4543, PETRI_PLACES=316, PETRI_TRANSITIONS=368} [2023-08-27 06:43:36,669 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 296 predicate places. [2023-08-27 06:43:36,670 INFO L495 AbstractCegarLoop]: Abstraction has has 316 places, 368 transitions, 4543 flow [2023-08-27 06:43:36,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 61.642857142857146) internal successors, (863), 14 states have internal predecessors, (863), 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-08-27 06:43:36,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 06:43:36,670 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 06:43:36,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2023-08-27 06:43:36,873 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-08-27 06:43:36,873 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-27 06:43:36,873 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 06:43:36,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1152488695, now seen corresponding path program 6 times [2023-08-27 06:43:36,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 06:43:36,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396570996] [2023-08-27 06:43:36,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 06:43:36,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 06:43:36,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 06:43:37,116 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:43:37,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 06:43:37,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396570996] [2023-08-27 06:43:37,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396570996] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 06:43:37,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102885526] [2023-08-27 06:43:37,116 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-27 06:43:37,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 06:43:37,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 06:43:37,117 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 06:43:37,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-08-27 06:43:37,220 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-08-27 06:43:37,221 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 06:43:37,221 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 28 conjunts are in the unsatisfiable core [2023-08-27 06:43:37,222 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 06:43:37,463 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:43:37,463 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 06:44:02,608 WARN L234 SmtUtils]: Spent 6.09s on a formula simplification. DAG size of input: 35 DAG size of output: 31 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 06:44:22,290 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_z_354 Int) (v_y_354 Int)) (let ((.cse0 (+ (* v_y_354 4294967296) (* 2863311531 v_z_354)))) (or (< 0 .cse0) (< v_z_354 0) (= (mod c_~x_2~0 4294967296) (+ (mod c_~x_1~0 4294967296) v_z_354)) (< .cse0 0) (<= 4294967296 v_z_354)))) is different from false [2023-08-27 06:44:26,360 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:44:26,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102885526] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 06:44:26,361 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 06:44:26,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 22 [2023-08-27 06:44:26,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826088713] [2023-08-27 06:44:26,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 06:44:26,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-27 06:44:26,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 06:44:26,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-27 06:44:26,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=378, Unknown=12, NotChecked=42, Total=552 [2023-08-27 06:44:26,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 141 [2023-08-27 06:44:26,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 368 transitions, 4543 flow. Second operand has 24 states, 24 states have (on average 52.833333333333336) internal successors, (1268), 24 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-08-27 06:44:26,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 06:44:26,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 141 [2023-08-27 06:44:26,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 06:44:28,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:44:30,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:44:32,413 WARN L839 $PredicateComparison]: unable to prove that (and (= c_~x_2~0 0) (forall ((v_z_354 Int) (v_y_354 Int)) (let ((.cse0 (+ (* v_y_354 4294967296) (* 2863311531 v_z_354)))) (or (< 0 .cse0) (< v_z_354 0) (= (mod c_~x_2~0 4294967296) (+ (mod c_~x_1~0 4294967296) v_z_354)) (< .cse0 0) (<= 4294967296 v_z_354)))) (<= 0 c_~x_1~0) (<= c_~x_1~0 0)) is different from false [2023-08-27 06:44:34,432 WARN L839 $PredicateComparison]: unable to prove that (and (= c_~x_2~0 0) (= c_thread1Thread1of1ForFork0_~i~0 0) (<= 0 c_~x_1~0) (or (< (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296) (+ (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) 1)) (forall ((v_z_354 Int) (v_y_354 Int)) (let ((.cse0 (+ (* v_y_354 4294967296) (* 2863311531 v_z_354)))) (or (< 0 .cse0) (< v_z_354 0) (= (mod c_~x_2~0 4294967296) (+ (mod c_~x_1~0 4294967296) v_z_354)) (< .cse0 0) (<= 4294967296 v_z_354))))) (<= c_~x_1~0 0)) is different from false [2023-08-27 06:44:36,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:44:38,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:44:40,586 WARN L839 $PredicateComparison]: unable to prove that (and (or (< (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296) (+ (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) 1)) (forall ((v_z_354 Int) (v_y_354 Int)) (let ((.cse0 (mod c_~x_2~0 4294967296)) (.cse1 (+ (mod c_~x_1~0 4294967296) v_z_354)) (.cse2 (+ (* v_y_354 4294967296) (* 2863311531 v_z_354)))) (or (= (+ .cse0 4294967296) .cse1) (< 0 .cse2) (< v_z_354 0) (= .cse0 .cse1) (< .cse2 0) (<= 4294967296 v_z_354))))) (= c_~x_2~0 0) (= c_thread1Thread1of1ForFork0_~i~0 0) (<= 0 c_~x_1~0) (<= c_~x_1~0 0)) is different from false [2023-08-27 06:44:42,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:44:44,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:44:50,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:44:56,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:44:58,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:45:00,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:45:14,489 WARN L234 SmtUtils]: Spent 12.13s on a formula simplification. DAG size of input: 48 DAG size of output: 9 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 06:45:38,762 WARN L234 SmtUtils]: Spent 20.23s on a formula simplification. DAG size of input: 46 DAG size of output: 35 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 06:45:40,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:45:42,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:45:50,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:45:52,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:45:55,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:45:57,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:46:03,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:46:05,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:46:11,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:46:13,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:46:15,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:46:17,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:46:19,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:46:21,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:46:23,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:46:25,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:46:27,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:46:29,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:46:31,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:46:37,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:46:39,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:47:02,209 WARN L234 SmtUtils]: Spent 10.12s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 06:47:04,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:47:06,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:47:08,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:47:10,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:47:13,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:47:15,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:47:17,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:47:19,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:47:21,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:47:23,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:47:25,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:47:27,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:47:29,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:47:31,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:47:33,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:47:35,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:47:37,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:47:53,827 WARN L234 SmtUtils]: Spent 10.12s on a formula simplification that was a NOOP. DAG size: 63 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 06:47:56,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:47:58,078 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:48:07,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:48:09,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:48:17,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:48:19,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:48:21,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:48:23,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:48:25,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:48:31,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:48:33,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:48:36,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:48:38,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:48:39,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:48:58,157 WARN L234 SmtUtils]: Spent 10.12s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 06:49:00,174 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:49:02,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:49:04,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:49:06,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:49:08,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:49:10,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:49:12,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:49:14,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:49:16,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:49:18,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:49:20,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:49:22,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:49:24,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:49:26,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:49:28,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:49:30,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:49:32,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:49:34,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:49:34,696 INFO L124 PetriNetUnfolderBase]: 1084/2063 cut-off events. [2023-08-27 06:49:34,696 INFO L125 PetriNetUnfolderBase]: For 38522/38522 co-relation queries the response was YES. [2023-08-27 06:49:34,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15395 conditions, 2063 events. 1084/2063 cut-off events. For 38522/38522 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 13326 event pairs, 29 based on Foata normal form. 6/2038 useless extension candidates. Maximal degree in co-relation 15246. Up to 926 conditions per place. [2023-08-27 06:49:34,715 INFO L140 encePairwiseOnDemand]: 130/141 looper letters, 277 selfloop transitions, 316 changer transitions 18/611 dead transitions. [2023-08-27 06:49:34,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 611 transitions, 8973 flow [2023-08-27 06:49:34,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-08-27 06:49:34,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2023-08-27 06:49:34,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 2118 transitions. [2023-08-27 06:49:34,719 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39529675251959684 [2023-08-27 06:49:34,719 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 2118 transitions. [2023-08-27 06:49:34,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 2118 transitions. [2023-08-27 06:49:34,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 06:49:34,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 2118 transitions. [2023-08-27 06:49:34,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 55.73684210526316) internal successors, (2118), 38 states have internal predecessors, (2118), 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-08-27 06:49:34,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 141.0) internal successors, (5499), 39 states have internal predecessors, (5499), 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-08-27 06:49:34,726 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 141.0) internal successors, (5499), 39 states have internal predecessors, (5499), 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-08-27 06:49:34,726 INFO L175 Difference]: Start difference. First operand has 316 places, 368 transitions, 4543 flow. Second operand 38 states and 2118 transitions. [2023-08-27 06:49:34,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 611 transitions, 8973 flow [2023-08-27 06:49:34,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 611 transitions, 8664 flow, removed 26 selfloop flow, removed 15 redundant places. [2023-08-27 06:49:34,971 INFO L231 Difference]: Finished difference. Result has 360 places, 532 transitions, 8298 flow [2023-08-27 06:49:34,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=4379, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=170, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=8298, PETRI_PLACES=360, PETRI_TRANSITIONS=532} [2023-08-27 06:49:34,971 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 340 predicate places. [2023-08-27 06:49:34,971 INFO L495 AbstractCegarLoop]: Abstraction has has 360 places, 532 transitions, 8298 flow [2023-08-27 06:49:34,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 52.833333333333336) internal successors, (1268), 24 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-08-27 06:49:34,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 06:49:34,972 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 06:49:34,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2023-08-27 06:49:35,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 06:49:35,172 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-27 06:49:35,173 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 06:49:35,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1738214759, now seen corresponding path program 20 times [2023-08-27 06:49:35,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 06:49:35,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351671247] [2023-08-27 06:49:35,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 06:49:35,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 06:49:35,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 06:49:35,870 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:49:35,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 06:49:35,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351671247] [2023-08-27 06:49:35,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351671247] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 06:49:35,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1974504249] [2023-08-27 06:49:35,871 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 06:49:35,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 06:49:35,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 06:49:35,873 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 06:49:35,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2023-08-27 06:49:35,958 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 06:49:35,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 06:49:35,959 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 29 conjunts are in the unsatisfiable core [2023-08-27 06:49:35,960 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 06:49:36,334 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:49:36,334 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 06:49:39,557 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~x_1~0 4294967296))) (let ((.cse2 (* (div (+ .cse0 (- 4294967294)) 4294967296) 4294967296)) (.cse1 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse3 (* 4294967296 (div c_~x_1~0 4294967296))) (.cse5 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296))) (and (or (< .cse0 1) (forall ((v_z_363 Int)) (or (<= v_z_363 .cse1) (let ((.cse4 (* 2 v_z_363))) (< (+ .cse2 c_~x_2~0 .cse3 .cse4 4294967293) (+ c_~x_1~0 (* 4294967296 (div (+ c_~x_2~0 .cse4) 4294967296))))) (< .cse5 v_z_363)))) (forall ((v_z_363 Int)) (or (<= v_z_363 .cse1) (let ((.cse6 (* 2 v_z_363))) (< (+ c_~x_2~0 .cse3 .cse6) (+ c_~x_1~0 3 (* 4294967296 (div (+ c_~x_2~0 .cse6) 4294967296))))) (< .cse5 v_z_363))) (forall ((v_z_363 Int)) (or (let ((.cse7 (* 2 v_z_363))) (< (+ c_~x_1~0 (* 4294967296 (div (+ c_~x_2~0 .cse7) 4294967296))) (+ .cse2 c_~x_2~0 4294967295 .cse3 .cse7))) (<= v_z_363 .cse1) (< .cse5 v_z_363))) (forall ((v_z_363 Int)) (or (<= v_z_363 .cse1) (let ((.cse8 (* 2 v_z_363))) (< (+ c_~x_1~0 (* 4294967296 (div (+ c_~x_2~0 .cse8) 4294967296))) (+ c_~x_2~0 4294967295 .cse3 .cse8))) (< .cse5 v_z_363)))))) is different from false [2023-08-27 06:49:39,697 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-27 06:49:39,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1974504249] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 06:49:39,698 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 06:49:39,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 20 [2023-08-27 06:49:39,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74986439] [2023-08-27 06:49:39,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 06:49:39,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-27 06:49:39,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 06:49:39,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-27 06:49:39,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=340, Unknown=1, NotChecked=38, Total=462 [2023-08-27 06:49:39,699 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 141 [2023-08-27 06:49:39,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 532 transitions, 8298 flow. Second operand has 22 states, 22 states have (on average 52.86363636363637) internal successors, (1163), 22 states have internal predecessors, (1163), 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-08-27 06:49:39,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 06:49:39,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 141 [2023-08-27 06:49:39,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 06:49:45,696 INFO L124 PetriNetUnfolderBase]: 1095/2084 cut-off events. [2023-08-27 06:49:45,697 INFO L125 PetriNetUnfolderBase]: For 54585/54585 co-relation queries the response was YES. [2023-08-27 06:49:45,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19097 conditions, 2084 events. 1095/2084 cut-off events. For 54585/54585 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 13481 event pairs, 63 based on Foata normal form. 5/2087 useless extension candidates. Maximal degree in co-relation 18840. Up to 1582 conditions per place. [2023-08-27 06:49:45,718 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 401 selfloop transitions, 192 changer transitions 15/608 dead transitions. [2023-08-27 06:49:45,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 608 transitions, 10231 flow [2023-08-27 06:49:45,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-08-27 06:49:45,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-08-27 06:49:45,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 1685 transitions. [2023-08-27 06:49:45,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3983451536643026 [2023-08-27 06:49:45,720 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 1685 transitions. [2023-08-27 06:49:45,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 1685 transitions. [2023-08-27 06:49:45,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 06:49:45,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 1685 transitions. [2023-08-27 06:49:45,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 56.166666666666664) internal successors, (1685), 30 states have internal predecessors, (1685), 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-08-27 06:49:45,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 141.0) internal successors, (4371), 31 states have internal predecessors, (4371), 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-08-27 06:49:45,725 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 141.0) internal successors, (4371), 31 states have internal predecessors, (4371), 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-08-27 06:49:45,725 INFO L175 Difference]: Start difference. First operand has 360 places, 532 transitions, 8298 flow. Second operand 30 states and 1685 transitions. [2023-08-27 06:49:45,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 608 transitions, 10231 flow [2023-08-27 06:49:46,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 608 transitions, 9505 flow, removed 341 selfloop flow, removed 8 redundant places. [2023-08-27 06:49:46,154 INFO L231 Difference]: Finished difference. Result has 381 places, 535 transitions, 8146 flow [2023-08-27 06:49:46,154 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=7635, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=531, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=188, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=8146, PETRI_PLACES=381, PETRI_TRANSITIONS=535} [2023-08-27 06:49:46,154 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 361 predicate places. [2023-08-27 06:49:46,154 INFO L495 AbstractCegarLoop]: Abstraction has has 381 places, 535 transitions, 8146 flow [2023-08-27 06:49:46,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 52.86363636363637) internal successors, (1163), 22 states have internal predecessors, (1163), 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-08-27 06:49:46,155 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 06:49:46,155 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 06:49:46,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2023-08-27 06:49:46,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2023-08-27 06:49:46,357 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-27 06:49:46,357 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 06:49:46,357 INFO L85 PathProgramCache]: Analyzing trace with hash -275755235, now seen corresponding path program 7 times [2023-08-27 06:49:46,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 06:49:46,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237180251] [2023-08-27 06:49:46,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 06:49:46,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 06:49:46,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 06:49:46,587 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:49:46,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 06:49:46,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237180251] [2023-08-27 06:49:46,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237180251] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 06:49:46,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1300188750] [2023-08-27 06:49:46,587 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-27 06:49:46,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 06:49:46,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 06:49:46,588 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 06:49:46,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-08-27 06:49:46,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 06:49:46,677 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-27 06:49:46,678 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 06:49:46,794 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:49:46,794 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 06:50:06,442 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_~x_2~0 4294967296)) (.cse3 (mod c_~x_1~0 4294967296))) (and (forall ((v_y_370 Int) (v_z_370 Int)) (let ((.cse1 (+ (* 2863311531 v_z_370) (* v_y_370 4294967296))) (.cse0 (+ .cse3 v_z_370))) (or (<= 4294967296 .cse0) (< 0 .cse1) (< v_z_370 0) (< .cse1 0) (= .cse2 .cse0)))) (forall ((v_y_370 Int) (v_z_370 Int)) (let ((.cse4 (+ (* 2863311531 v_z_370) (* v_y_370 4294967296)))) (or (<= 4294967296 v_z_370) (< 0 .cse4) (< v_z_370 0) (< .cse4 0) (= .cse2 (+ .cse3 v_z_370))))))) is different from false [2023-08-27 06:50:16,758 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-08-27 06:50:16,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1300188750] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 06:50:16,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 06:50:16,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2023-08-27 06:50:16,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093738866] [2023-08-27 06:50:16,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 06:50:16,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-27 06:50:16,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 06:50:16,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-27 06:50:16,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=203, Unknown=1, NotChecked=30, Total=306 [2023-08-27 06:50:16,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 141 [2023-08-27 06:50:16,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 535 transitions, 8146 flow. Second operand has 18 states, 18 states have (on average 56.388888888888886) internal successors, (1015), 18 states have internal predecessors, (1015), 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-08-27 06:50:16,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 06:50:16,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 141 [2023-08-27 06:50:16,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 06:50:18,798 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_~x_2~0 4294967296)) (.cse3 (mod c_~x_1~0 4294967296))) (and (forall ((v_y_370 Int) (v_z_370 Int)) (let ((.cse1 (+ (* 2863311531 v_z_370) (* v_y_370 4294967296))) (.cse0 (+ .cse3 v_z_370))) (or (<= 4294967296 .cse0) (< 0 .cse1) (< v_z_370 0) (< .cse1 0) (= .cse2 .cse0)))) (= c_~x_2~0 0) (= |c_ULTIMATE.start_main_~#t1~0#1.offset| 0) (<= 0 c_~x_1~0) (forall ((v_y_370 Int) (v_z_370 Int)) (let ((.cse4 (+ (* 2863311531 v_z_370) (* v_y_370 4294967296)))) (or (<= 4294967296 v_z_370) (< 0 .cse4) (< v_z_370 0) (< .cse4 0) (= .cse2 (+ .cse3 v_z_370))))) (<= c_~x_1~0 0))) is different from false [2023-08-27 06:50:20,143 INFO L124 PetriNetUnfolderBase]: 1208/2346 cut-off events. [2023-08-27 06:50:20,143 INFO L125 PetriNetUnfolderBase]: For 54888/54900 co-relation queries the response was YES. [2023-08-27 06:50:20,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20773 conditions, 2346 events. 1208/2346 cut-off events. For 54888/54900 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 15891 event pairs, 97 based on Foata normal form. 23/2367 useless extension candidates. Maximal degree in co-relation 20521. Up to 1732 conditions per place. [2023-08-27 06:50:20,164 INFO L140 encePairwiseOnDemand]: 134/141 looper letters, 458 selfloop transitions, 117 changer transitions 110/694 dead transitions. [2023-08-27 06:50:20,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 395 places, 694 transitions, 12033 flow [2023-08-27 06:50:20,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-27 06:50:20,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-27 06:50:20,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1005 transitions. [2023-08-27 06:50:20,166 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4192740926157697 [2023-08-27 06:50:20,166 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1005 transitions. [2023-08-27 06:50:20,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1005 transitions. [2023-08-27 06:50:20,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 06:50:20,167 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1005 transitions. [2023-08-27 06:50:20,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 59.11764705882353) internal successors, (1005), 17 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 06:50:20,169 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 141.0) internal successors, (2538), 18 states have internal predecessors, (2538), 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-08-27 06:50:20,169 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 141.0) internal successors, (2538), 18 states have internal predecessors, (2538), 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-08-27 06:50:20,169 INFO L175 Difference]: Start difference. First operand has 381 places, 535 transitions, 8146 flow. Second operand 17 states and 1005 transitions. [2023-08-27 06:50:20,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 395 places, 694 transitions, 12033 flow [2023-08-27 06:50:20,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 694 transitions, 11479 flow, removed 72 selfloop flow, removed 26 redundant places. [2023-08-27 06:50:20,465 INFO L231 Difference]: Finished difference. Result has 378 places, 537 transitions, 8333 flow [2023-08-27 06:50:20,465 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=7702, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=535, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=8333, PETRI_PLACES=378, PETRI_TRANSITIONS=537} [2023-08-27 06:50:20,465 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 358 predicate places. [2023-08-27 06:50:20,465 INFO L495 AbstractCegarLoop]: Abstraction has has 378 places, 537 transitions, 8333 flow [2023-08-27 06:50:20,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 56.388888888888886) internal successors, (1015), 18 states have internal predecessors, (1015), 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-08-27 06:50:20,466 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 06:50:20,466 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 06:50:20,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2023-08-27 06:50:20,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 06:50:20,671 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-27 06:50:20,671 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 06:50:20,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1085101861, now seen corresponding path program 21 times [2023-08-27 06:50:20,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 06:50:20,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474683032] [2023-08-27 06:50:20,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 06:50:20,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 06:50:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 06:50:21,342 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:50:21,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 06:50:21,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474683032] [2023-08-27 06:50:21,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474683032] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 06:50:21,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474404938] [2023-08-27 06:50:21,343 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-27 06:50:21,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 06:50:21,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 06:50:21,344 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 06:50:21,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2023-08-27 06:50:21,439 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-27 06:50:21,439 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 06:50:21,440 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 29 conjunts are in the unsatisfiable core [2023-08-27 06:50:21,441 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 06:50:27,284 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:50:27,284 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 06:50:29,703 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:50:29,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474404938] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 06:50:29,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 06:50:29,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 18 [2023-08-27 06:50:29,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815993912] [2023-08-27 06:50:29,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 06:50:29,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-27 06:50:29,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 06:50:29,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-27 06:50:29,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2023-08-27 06:50:29,705 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 141 [2023-08-27 06:50:29,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 537 transitions, 8333 flow. Second operand has 20 states, 20 states have (on average 52.8) internal successors, (1056), 20 states have internal predecessors, (1056), 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-08-27 06:50:29,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 06:50:29,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 141 [2023-08-27 06:50:29,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 06:50:32,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 06:50:35,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 06:50:37,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 06:50:40,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 06:50:43,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 06:50:45,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:50:47,263 INFO L124 PetriNetUnfolderBase]: 1104/2092 cut-off events. [2023-08-27 06:50:47,263 INFO L125 PetriNetUnfolderBase]: For 45740/45740 co-relation queries the response was YES. [2023-08-27 06:50:47,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18714 conditions, 2092 events. 1104/2092 cut-off events. For 45740/45740 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 13406 event pairs, 116 based on Foata normal form. 2/2092 useless extension candidates. Maximal degree in co-relation 18573. Up to 1831 conditions per place. [2023-08-27 06:50:47,282 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 395 selfloop transitions, 180 changer transitions 7/582 dead transitions. [2023-08-27 06:50:47,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 582 transitions, 10065 flow [2023-08-27 06:50:47,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-08-27 06:50:47,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-08-27 06:50:47,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1392 transitions. [2023-08-27 06:50:47,284 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3948936170212766 [2023-08-27 06:50:47,284 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 1392 transitions. [2023-08-27 06:50:47,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 1392 transitions. [2023-08-27 06:50:47,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 06:50:47,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 1392 transitions. [2023-08-27 06:50:47,286 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 55.68) internal successors, (1392), 25 states have internal predecessors, (1392), 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-08-27 06:50:47,288 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 141.0) internal successors, (3666), 26 states have internal predecessors, (3666), 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-08-27 06:50:47,289 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 141.0) internal successors, (3666), 26 states have internal predecessors, (3666), 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-08-27 06:50:47,289 INFO L175 Difference]: Start difference. First operand has 378 places, 537 transitions, 8333 flow. Second operand 25 states and 1392 transitions. [2023-08-27 06:50:47,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 582 transitions, 10065 flow [2023-08-27 06:50:47,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 375 places, 582 transitions, 9917 flow, removed 54 selfloop flow, removed 14 redundant places. [2023-08-27 06:50:47,567 INFO L231 Difference]: Finished difference. Result has 381 places, 544 transitions, 8809 flow [2023-08-27 06:50:47,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=8229, PETRI_DIFFERENCE_MINUEND_PLACES=351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=174, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=8809, PETRI_PLACES=381, PETRI_TRANSITIONS=544} [2023-08-27 06:50:47,567 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 361 predicate places. [2023-08-27 06:50:47,567 INFO L495 AbstractCegarLoop]: Abstraction has has 381 places, 544 transitions, 8809 flow [2023-08-27 06:50:47,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 52.8) internal successors, (1056), 20 states have internal predecessors, (1056), 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-08-27 06:50:47,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 06:50:47,568 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 06:50:47,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2023-08-27 06:50:47,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 06:50:47,768 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-27 06:50:47,768 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 06:50:47,768 INFO L85 PathProgramCache]: Analyzing trace with hash -880192755, now seen corresponding path program 5 times [2023-08-27 06:50:47,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 06:50:47,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247591271] [2023-08-27 06:50:47,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 06:50:47,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 06:50:47,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 06:50:48,025 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:50:48,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 06:50:48,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247591271] [2023-08-27 06:50:48,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247591271] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 06:50:48,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070513470] [2023-08-27 06:50:48,026 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-27 06:50:48,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 06:50:48,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 06:50:48,026 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 06:50:48,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2023-08-27 06:50:48,126 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-08-27 06:50:48,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 06:50:48,127 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 28 conjunts are in the unsatisfiable core [2023-08-27 06:50:48,128 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 06:50:52,129 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:50:52,130 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 06:51:05,992 WARN L234 SmtUtils]: Spent 6.12s on a formula simplification. DAG size of input: 40 DAG size of output: 33 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 06:51:08,075 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_z_396 Int) (v_y_396 Int)) (let ((.cse1 (mod c_~x_1~0 4294967296)) (.cse0 (+ (mod c_~x_2~0 4294967296) v_z_396)) (.cse2 (+ (* 2863311531 v_z_396) (* v_y_396 4294967296)))) (or (= .cse0 .cse1) (< .cse2 0) (= (+ .cse1 4294967296) .cse0) (< (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) .cse2) (<= 4294967296 v_z_396) (< v_z_396 0)))) is different from false [2023-08-27 06:51:20,215 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_z_396 Int) (v_y_396 Int)) (let ((.cse1 (mod c_~x_1~0 4294967296)) (.cse0 (+ (mod c_~x_2~0 4294967296) v_z_396)) (.cse2 (+ (* 2863311531 v_z_396) (* v_y_396 4294967296)))) (or (= .cse0 .cse1) (< .cse2 0) (= (+ .cse1 4294967296) .cse0) (<= 4294967296 v_z_396) (< v_z_396 0) (< 0 .cse2)))) is different from false [2023-08-27 06:51:22,276 WARN L861 $PredicateComparison]: unable to prove that (forall ((v_z_396 Int) (v_y_396 Int)) (let ((.cse1 (mod c_~x_1~0 4294967296)) (.cse0 (+ (mod c_~x_2~0 4294967296) v_z_396)) (.cse2 (+ (* 2863311531 v_z_396) (* v_y_396 4294967296)))) (or (= .cse0 .cse1) (< .cse2 0) (= (+ .cse1 4294967296) .cse0) (<= 4294967296 v_z_396) (< v_z_396 0) (< 0 .cse2)))) is different from true [2023-08-27 06:51:46,282 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_z_396 Int) (v_y_396 Int)) (let ((.cse0 (+ (* 2863311531 v_z_396) (* v_y_396 4294967296)))) (or (= (+ (mod c_~x_2~0 4294967296) v_z_396) (mod c_~x_1~0 4294967296)) (< .cse0 0) (<= 4294967296 v_z_396) (< v_z_396 0) (< 0 .cse0)))) is different from false [2023-08-27 06:51:46,303 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:51:46,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070513470] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 06:51:46,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 06:51:46,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 21 [2023-08-27 06:51:46,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197364371] [2023-08-27 06:51:46,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 06:51:46,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-27 06:51:46,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 06:51:46,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-27 06:51:46,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=295, Unknown=7, NotChecked=114, Total=506 [2023-08-27 06:51:46,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 141 [2023-08-27 06:51:46,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 544 transitions, 8809 flow. Second operand has 23 states, 23 states have (on average 52.869565217391305) internal successors, (1216), 23 states have internal predecessors, (1216), 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-08-27 06:51:46,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 06:51:46,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 141 [2023-08-27 06:51:46,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 06:51:48,352 WARN L839 $PredicateComparison]: unable to prove that (and (= c_~x_2~0 0) (<= 0 c_~x_1~0) (forall ((v_z_396 Int) (v_y_396 Int)) (let ((.cse0 (+ (* 2863311531 v_z_396) (* v_y_396 4294967296)))) (or (= (+ (mod c_~x_2~0 4294967296) v_z_396) (mod c_~x_1~0 4294967296)) (< .cse0 0) (<= 4294967296 v_z_396) (< v_z_396 0) (< 0 .cse0)))) (<= c_~x_1~0 0)) is different from false [2023-08-27 06:51:50,373 WARN L839 $PredicateComparison]: unable to prove that (and (= c_~x_2~0 0) (<= 0 c_~x_1~0) (forall ((v_z_396 Int) (v_y_396 Int)) (let ((.cse1 (mod c_~x_1~0 4294967296)) (.cse0 (+ (mod c_~x_2~0 4294967296) v_z_396)) (.cse2 (+ (* 2863311531 v_z_396) (* v_y_396 4294967296)))) (or (= .cse0 .cse1) (< .cse2 0) (= (+ .cse1 4294967296) .cse0) (<= 4294967296 v_z_396) (< v_z_396 0) (< 0 .cse2)))) (<= c_~x_1~0 0)) is different from false [2023-08-27 06:51:52,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:51:54,423 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_z_396 Int) (v_y_396 Int)) (let ((.cse1 (mod c_~x_1~0 4294967296)) (.cse0 (+ (mod c_~x_2~0 4294967296) v_z_396)) (.cse2 (+ (* 2863311531 v_z_396) (* v_y_396 4294967296)))) (or (= .cse0 .cse1) (< .cse2 0) (= (+ .cse1 4294967296) .cse0) (< (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) .cse2) (<= 4294967296 v_z_396) (< v_z_396 0)))) (= c_~x_2~0 0) (= c_thread1Thread1of1ForFork0_~i~0 0) (<= 0 c_~x_1~0) (<= c_~x_1~0 0)) is different from false [2023-08-27 06:51:56,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:51:58,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:52:00,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:52:02,556 WARN L839 $PredicateComparison]: unable to prove that (and (= c_~x_2~0 0) (or (forall ((v_z_396 Int) (v_y_396 Int)) (let ((.cse1 (mod c_~x_1~0 4294967296)) (.cse0 (+ (mod c_~x_2~0 4294967296) v_z_396)) (.cse2 (+ (* 2863311531 v_z_396) (* v_y_396 4294967296)))) (or (= .cse0 .cse1) (< .cse2 0) (= (+ .cse1 4294967296) .cse0) (< (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) .cse2) (<= 4294967296 v_z_396) (< v_z_396 0)))) (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296) (+ (mod c_thread2Thread1of1ForFork1_~i~1 4294967296) 1))) (= c_thread1Thread1of1ForFork0_~i~0 0) (<= 0 c_~x_1~0) (= c_thread2Thread1of1ForFork1_~i~1 0) (<= c_~x_1~0 0)) is different from false [2023-08-27 06:52:05,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:52:06,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:52:08,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:52:14,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:52:18,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:52:21,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:52:21,357 INFO L124 PetriNetUnfolderBase]: 1170/2209 cut-off events. [2023-08-27 06:52:21,358 INFO L125 PetriNetUnfolderBase]: For 44208/44208 co-relation queries the response was YES. [2023-08-27 06:52:21,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20111 conditions, 2209 events. 1170/2209 cut-off events. For 44208/44208 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 14217 event pairs, 361 based on Foata normal form. 2/2209 useless extension candidates. Maximal degree in co-relation 19866. Up to 2092 conditions per place. [2023-08-27 06:52:21,376 INFO L140 encePairwiseOnDemand]: 130/141 looper letters, 556 selfloop transitions, 55 changer transitions 10/621 dead transitions. [2023-08-27 06:52:21,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 621 transitions, 11259 flow [2023-08-27 06:52:21,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-27 06:52:21,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-27 06:52:21,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1112 transitions. [2023-08-27 06:52:21,378 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3943262411347518 [2023-08-27 06:52:21,378 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1112 transitions. [2023-08-27 06:52:21,378 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1112 transitions. [2023-08-27 06:52:21,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 06:52:21,378 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1112 transitions. [2023-08-27 06:52:21,379 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 55.6) internal successors, (1112), 20 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 06:52:21,381 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 141.0) internal successors, (2961), 21 states have internal predecessors, (2961), 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-08-27 06:52:21,381 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 141.0) internal successors, (2961), 21 states have internal predecessors, (2961), 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-08-27 06:52:21,381 INFO L175 Difference]: Start difference. First operand has 381 places, 544 transitions, 8809 flow. Second operand 20 states and 1112 transitions. [2023-08-27 06:52:21,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 621 transitions, 11259 flow [2023-08-27 06:52:21,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 621 transitions, 10819 flow, removed 51 selfloop flow, removed 22 redundant places. [2023-08-27 06:52:21,641 INFO L231 Difference]: Finished difference. Result has 392 places, 581 transitions, 9490 flow [2023-08-27 06:52:21,642 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=8431, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=493, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=9490, PETRI_PLACES=392, PETRI_TRANSITIONS=581} [2023-08-27 06:52:21,642 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 372 predicate places. [2023-08-27 06:52:21,642 INFO L495 AbstractCegarLoop]: Abstraction has has 392 places, 581 transitions, 9490 flow [2023-08-27 06:52:21,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 52.869565217391305) internal successors, (1216), 23 states have internal predecessors, (1216), 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-08-27 06:52:21,643 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 06:52:21,643 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 06:52:21,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2023-08-27 06:52:21,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2023-08-27 06:52:21,848 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-27 06:52:21,849 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 06:52:21,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1829314337, now seen corresponding path program 22 times [2023-08-27 06:52:21,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 06:52:21,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423085867] [2023-08-27 06:52:21,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 06:52:21,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 06:52:21,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 06:52:22,331 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:52:22,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 06:52:22,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423085867] [2023-08-27 06:52:22,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423085867] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 06:52:22,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322252152] [2023-08-27 06:52:22,331 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-27 06:52:22,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 06:52:22,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 06:52:22,332 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 06:52:22,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2023-08-27 06:52:22,426 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-27 06:52:22,426 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 06:52:22,427 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 29 conjunts are in the unsatisfiable core [2023-08-27 06:52:22,428 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 06:52:22,771 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:52:22,772 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 06:52:27,283 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296)) (.cse0 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse6 (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296)) (.cse1 (mod c_~x_1~0 4294967296)) (.cse3 (* 4294967296 (div c_~x_1~0 4294967296))) (.cse5 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296))) (and (or (forall ((v_z_411 Int)) (or (< .cse0 v_z_411) (let ((.cse2 (* 2 v_z_411))) (< (+ c_~x_2~0 (* 4294967296 (div (+ (- 1) .cse1) 4294967296)) 4294967294 .cse2 .cse3) (+ (* (div (+ c_~x_2~0 .cse2) 4294967296) 4294967296) .cse4 c_~x_1~0))) (<= v_z_411 .cse5))) (< (div (+ .cse1 .cse6) 4294967296) 1)) (forall ((v_z_411 Int)) (or (let ((.cse7 (* 2 v_z_411))) (< (+ c_~x_2~0 .cse7 .cse3) (+ (* (div (+ c_~x_2~0 .cse7) 4294967296) 4294967296) .cse4 c_~x_1~0 2))) (< .cse0 v_z_411) (<= v_z_411 .cse5))) (forall ((v_z_411 Int)) (or (< .cse0 v_z_411) (let ((.cse8 (* 2 v_z_411))) (< (+ (* (div (+ c_~x_2~0 .cse8) 4294967296) 4294967296) c_~x_1~0 .cse6) (+ (* (div (+ .cse4 (- 4294967295)) 4294967296) 4294967296) c_~x_2~0 8589934593 .cse8 .cse3))) (<= v_z_411 .cse5))) (or (< 4294967294 (+ .cse1 .cse4)) (forall ((v_z_411 Int)) (or (< .cse0 v_z_411) (< (+ (* (div (+ c_~x_2~0 (* 2 v_z_411)) 4294967296) 4294967296) (* (div (+ (- 1) (* (- 2) v_z_411) (* (- 1) c_~x_2~0) c_~x_1~0 .cse6) 4294967296) 4294967296) 4294967295) (+ .cse1 .cse3)) (<= v_z_411 .cse5)))))) is different from false [2023-08-27 06:52:29,624 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~x_1~0 4294967296)) (.cse2 (* 4294967296 (div c_~x_1~0 4294967296))) (.cse0 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse3 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296))) (and (or (forall ((v_z_411 Int)) (or (< .cse0 v_z_411) (< (+ (* (div (+ (* (- 2) v_z_411) (* (- 1) c_~x_2~0) c_~x_1~0 1) 4294967296) 4294967296) (* (div (+ c_~x_2~0 (* 2 v_z_411)) 4294967296) 4294967296) 4294967295) (+ .cse1 .cse2)) (<= v_z_411 .cse3))) (< 4294967293 .cse1)) (forall ((v_z_411 Int)) (or (< .cse0 v_z_411) (let ((.cse4 (* 2 v_z_411))) (< (+ (* (div (+ c_~x_2~0 .cse4) 4294967296) 4294967296) c_~x_1~0) (+ c_~x_2~0 4294967295 .cse4 .cse2))) (<= v_z_411 .cse3))) (forall ((v_z_411 Int)) (or (< .cse0 v_z_411) (let ((.cse5 (* 2 v_z_411))) (< (+ c_~x_2~0 .cse5 .cse2) (+ (* (div (+ c_~x_2~0 .cse5) 4294967296) 4294967296) c_~x_1~0 3))) (<= v_z_411 .cse3))) (or (< (div (+ .cse1 2) 4294967296) 1) (forall ((v_z_411 Int)) (or (let ((.cse6 (* 2 v_z_411))) (< (+ c_~x_2~0 (* 4294967296 (div (+ (- 1) .cse1) 4294967296)) .cse6 .cse2 4294967293) (+ (* (div (+ c_~x_2~0 .cse6) 4294967296) 4294967296) c_~x_1~0))) (< .cse0 v_z_411) (<= v_z_411 .cse3)))))) is different from false [2023-08-27 06:52:30,147 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-08-27 06:52:30,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322252152] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 06:52:30,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 06:52:30,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 21 [2023-08-27 06:52:30,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82299247] [2023-08-27 06:52:30,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 06:52:30,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-27 06:52:30,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 06:52:30,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-27 06:52:30,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=336, Unknown=2, NotChecked=78, Total=506 [2023-08-27 06:52:30,149 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 141 [2023-08-27 06:52:30,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 581 transitions, 9490 flow. Second operand has 23 states, 23 states have (on average 47.95652173913044) internal successors, (1103), 23 states have internal predecessors, (1103), 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-08-27 06:52:30,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 06:52:30,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 141 [2023-08-27 06:52:30,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 06:52:35,075 INFO L124 PetriNetUnfolderBase]: 1199/2264 cut-off events. [2023-08-27 06:52:35,075 INFO L125 PetriNetUnfolderBase]: For 49171/49171 co-relation queries the response was YES. [2023-08-27 06:52:35,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20861 conditions, 2264 events. 1199/2264 cut-off events. For 49171/49171 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 14719 event pairs, 211 based on Foata normal form. 2/2264 useless extension candidates. Maximal degree in co-relation 20603. Up to 1977 conditions per place. [2023-08-27 06:52:35,101 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 488 selfloop transitions, 137 changer transitions 11/636 dead transitions. [2023-08-27 06:52:35,101 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 410 places, 636 transitions, 11441 flow [2023-08-27 06:52:35,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-27 06:52:35,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-27 06:52:35,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1022 transitions. [2023-08-27 06:52:35,103 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3624113475177305 [2023-08-27 06:52:35,103 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1022 transitions. [2023-08-27 06:52:35,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1022 transitions. [2023-08-27 06:52:35,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 06:52:35,103 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1022 transitions. [2023-08-27 06:52:35,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 51.1) internal successors, (1022), 20 states have internal predecessors, (1022), 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-08-27 06:52:35,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 141.0) internal successors, (2961), 21 states have internal predecessors, (2961), 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-08-27 06:52:35,106 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 141.0) internal successors, (2961), 21 states have internal predecessors, (2961), 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-08-27 06:52:35,106 INFO L175 Difference]: Start difference. First operand has 392 places, 581 transitions, 9490 flow. Second operand 20 states and 1022 transitions. [2023-08-27 06:52:35,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 410 places, 636 transitions, 11441 flow [2023-08-27 06:52:35,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 636 transitions, 11362 flow, removed 37 selfloop flow, removed 2 redundant places. [2023-08-27 06:52:35,474 INFO L231 Difference]: Finished difference. Result has 416 places, 591 transitions, 10023 flow [2023-08-27 06:52:35,475 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=9411, PETRI_DIFFERENCE_MINUEND_PLACES=389, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=10023, PETRI_PLACES=416, PETRI_TRANSITIONS=591} [2023-08-27 06:52:35,475 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 396 predicate places. [2023-08-27 06:52:35,475 INFO L495 AbstractCegarLoop]: Abstraction has has 416 places, 591 transitions, 10023 flow [2023-08-27 06:52:35,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 47.95652173913044) internal successors, (1103), 23 states have internal predecessors, (1103), 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-08-27 06:52:35,476 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 06:52:35,476 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 06:52:35,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2023-08-27 06:52:35,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2023-08-27 06:52:35,681 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-27 06:52:35,681 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 06:52:35,682 INFO L85 PathProgramCache]: Analyzing trace with hash -640568379, now seen corresponding path program 8 times [2023-08-27 06:52:35,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 06:52:35,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990954597] [2023-08-27 06:52:35,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 06:52:35,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 06:52:35,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 06:52:35,900 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:52:35,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 06:52:35,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990954597] [2023-08-27 06:52:35,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990954597] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 06:52:35,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [63677145] [2023-08-27 06:52:35,901 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 06:52:35,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 06:52:35,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 06:52:35,902 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 06:52:35,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2023-08-27 06:52:35,980 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 06:52:35,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 06:52:35,981 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-27 06:52:35,981 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 06:52:36,141 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:52:36,141 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 06:52:38,367 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (mod c_~x_2~0 4294967296))) (let ((.cse0 (+ .cse6 4294967296)) (.cse2 (mod c_thread2Thread1of1ForFork1_~i~1 4294967296)) (.cse4 (mod c_~x_1~0 4294967296))) (and (forall ((v_y_416 Int) (v_z_416 Int)) (let ((.cse3 (+ (* v_y_416 4294967296) (* 2863311531 v_z_416))) (.cse1 (+ .cse4 v_z_416))) (or (<= 4294967296 v_z_416) (= .cse0 .cse1) (< .cse2 .cse3) (< .cse3 0) (< .cse1 4294967296)))) (forall ((v_y_416 Int) (v_z_416 Int)) (let ((.cse5 (+ (* v_y_416 4294967296) (* 2863311531 v_z_416))) (.cse7 (+ .cse4 v_z_416))) (or (< v_z_416 0) (< .cse2 .cse5) (< .cse5 0) (= .cse6 .cse7) (<= 4294967296 .cse7)))) (forall ((v_y_416 Int) (v_z_416 Int)) (let ((.cse9 (+ (* v_y_416 4294967296) (* 2863311531 v_z_416))) (.cse8 (+ .cse4 v_z_416))) (or (< v_z_416 0) (<= 4294967296 v_z_416) (= .cse0 .cse8) (< .cse2 .cse9) (< .cse9 0) (= .cse6 .cse8))))))) is different from false [2023-08-27 06:52:46,598 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~x_2~0 4294967296)) (.cse3 (mod c_~x_1~0 4294967296))) (and (forall ((v_y_416 Int) (v_z_416 Int)) (let ((.cse0 (+ (* v_y_416 4294967296) (* 2863311531 v_z_416))) (.cse2 (+ .cse3 v_z_416))) (or (< v_z_416 0) (< 0 .cse0) (< .cse0 0) (= .cse1 .cse2) (<= 4294967296 .cse2)))) (forall ((v_y_416 Int) (v_z_416 Int)) (let ((.cse4 (+ (* v_y_416 4294967296) (* 2863311531 v_z_416))) (.cse5 (+ .cse3 v_z_416))) (or (< v_z_416 0) (<= 4294967296 v_z_416) (< 0 .cse4) (= (+ .cse1 4294967296) .cse5) (< .cse4 0) (= .cse1 .cse5)))))) is different from false [2023-08-27 06:52:53,091 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~x_2~0 4294967296)) (.cse3 (mod c_~x_1~0 4294967296))) (and (forall ((v_y_416 Int) (v_z_416 Int)) (let ((.cse0 (+ (* v_y_416 4294967296) (* 2863311531 v_z_416))) (.cse2 (+ .cse3 v_z_416))) (or (< v_z_416 0) (< 0 .cse0) (< .cse0 0) (= .cse1 .cse2) (<= 4294967296 .cse2)))) (forall ((v_y_416 Int) (v_z_416 Int)) (let ((.cse4 (+ (* v_y_416 4294967296) (* 2863311531 v_z_416)))) (or (< v_z_416 0) (<= 4294967296 v_z_416) (< 0 .cse4) (< .cse4 0) (= .cse1 (+ .cse3 v_z_416))))))) is different from false [2023-08-27 06:52:57,202 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-08-27 06:52:57,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [63677145] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 06:52:57,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 06:52:57,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 15 [2023-08-27 06:52:57,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916550048] [2023-08-27 06:52:57,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 06:52:57,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-27 06:52:57,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 06:52:57,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-27 06:52:57,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=129, Unknown=3, NotChecked=78, Total=272 [2023-08-27 06:52:57,204 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 141 [2023-08-27 06:52:57,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 591 transitions, 10023 flow. Second operand has 17 states, 17 states have (on average 61.1764705882353) internal successors, (1040), 17 states have internal predecessors, (1040), 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-08-27 06:52:57,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 06:52:57,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 141 [2023-08-27 06:52:57,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 06:52:59,228 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~x_2~0 4294967296)) (.cse3 (mod c_~x_1~0 4294967296))) (and (forall ((v_y_416 Int) (v_z_416 Int)) (let ((.cse0 (+ (* v_y_416 4294967296) (* 2863311531 v_z_416))) (.cse2 (+ .cse3 v_z_416))) (or (< v_z_416 0) (< 0 .cse0) (< .cse0 0) (= .cse1 .cse2) (<= 4294967296 .cse2)))) (forall ((v_y_416 Int) (v_z_416 Int)) (let ((.cse4 (+ (* v_y_416 4294967296) (* 2863311531 v_z_416)))) (or (< v_z_416 0) (<= 4294967296 v_z_416) (< 0 .cse4) (< .cse4 0) (= .cse1 (+ .cse3 v_z_416))))) (= c_~x_2~0 0) (<= 0 c_~x_1~0) (<= c_~x_1~0 0))) is different from false [2023-08-27 06:53:01,254 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~x_2~0 4294967296)) (.cse3 (mod c_~x_1~0 4294967296))) (and (forall ((v_y_416 Int) (v_z_416 Int)) (let ((.cse0 (+ (* v_y_416 4294967296) (* 2863311531 v_z_416))) (.cse2 (+ .cse3 v_z_416))) (or (< v_z_416 0) (< 0 .cse0) (< .cse0 0) (= .cse1 .cse2) (<= 4294967296 .cse2)))) (= c_~x_2~0 0) (<= 0 c_~x_1~0) (<= c_~x_1~0 0) (forall ((v_y_416 Int) (v_z_416 Int)) (let ((.cse4 (+ (* v_y_416 4294967296) (* 2863311531 v_z_416))) (.cse5 (+ .cse3 v_z_416))) (or (< v_z_416 0) (<= 4294967296 v_z_416) (< 0 .cse4) (= (+ .cse1 4294967296) .cse5) (< .cse4 0) (= .cse1 .cse5)))))) is different from false [2023-08-27 06:53:03,272 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (mod c_~x_2~0 4294967296))) (let ((.cse0 (+ .cse6 4294967296)) (.cse2 (mod c_thread2Thread1of1ForFork1_~i~1 4294967296)) (.cse4 (mod c_~x_1~0 4294967296))) (and (forall ((v_y_416 Int) (v_z_416 Int)) (let ((.cse3 (+ (* v_y_416 4294967296) (* 2863311531 v_z_416))) (.cse1 (+ .cse4 v_z_416))) (or (<= 4294967296 v_z_416) (= .cse0 .cse1) (< .cse2 .cse3) (< .cse3 0) (< .cse1 4294967296)))) (forall ((v_y_416 Int) (v_z_416 Int)) (let ((.cse5 (+ (* v_y_416 4294967296) (* 2863311531 v_z_416))) (.cse7 (+ .cse4 v_z_416))) (or (< v_z_416 0) (< .cse2 .cse5) (< .cse5 0) (= .cse6 .cse7) (<= 4294967296 .cse7)))) (= c_~x_2~0 0) (forall ((v_y_416 Int) (v_z_416 Int)) (let ((.cse9 (+ (* v_y_416 4294967296) (* 2863311531 v_z_416))) (.cse8 (+ .cse4 v_z_416))) (or (< v_z_416 0) (<= 4294967296 v_z_416) (= .cse0 .cse8) (< .cse2 .cse9) (< .cse9 0) (= .cse6 .cse8)))) (<= 0 c_~x_1~0) (= c_thread2Thread1of1ForFork1_~i~1 0) (<= c_~x_1~0 0)))) is different from false [2023-08-27 06:53:04,418 INFO L124 PetriNetUnfolderBase]: 1273/2465 cut-off events. [2023-08-27 06:53:04,419 INFO L125 PetriNetUnfolderBase]: For 62215/62227 co-relation queries the response was YES. [2023-08-27 06:53:04,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23607 conditions, 2465 events. 1273/2465 cut-off events. For 62215/62227 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 16710 event pairs, 274 based on Foata normal form. 16/2475 useless extension candidates. Maximal degree in co-relation 23339. Up to 2124 conditions per place. [2023-08-27 06:53:04,441 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 609 selfloop transitions, 85 changer transitions 10/714 dead transitions. [2023-08-27 06:53:04,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 714 transitions, 13876 flow [2023-08-27 06:53:04,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-27 06:53:04,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-27 06:53:04,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 776 transitions. [2023-08-27 06:53:04,443 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.458628841607565 [2023-08-27 06:53:04,443 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 776 transitions. [2023-08-27 06:53:04,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 776 transitions. [2023-08-27 06:53:04,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 06:53:04,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 776 transitions. [2023-08-27 06:53:04,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 64.66666666666667) internal successors, (776), 12 states have internal predecessors, (776), 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-08-27 06:53:04,446 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 141.0) internal successors, (1833), 13 states have internal predecessors, (1833), 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-08-27 06:53:04,446 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 141.0) internal successors, (1833), 13 states have internal predecessors, (1833), 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-08-27 06:53:04,446 INFO L175 Difference]: Start difference. First operand has 416 places, 591 transitions, 10023 flow. Second operand 12 states and 776 transitions. [2023-08-27 06:53:04,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 714 transitions, 13876 flow [2023-08-27 06:53:04,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 714 transitions, 13549 flow, removed 74 selfloop flow, removed 12 redundant places. [2023-08-27 06:53:04,853 INFO L231 Difference]: Finished difference. Result has 422 places, 656 transitions, 11797 flow [2023-08-27 06:53:04,853 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=9733, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=506, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=11797, PETRI_PLACES=422, PETRI_TRANSITIONS=656} [2023-08-27 06:53:04,853 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 402 predicate places. [2023-08-27 06:53:04,854 INFO L495 AbstractCegarLoop]: Abstraction has has 422 places, 656 transitions, 11797 flow [2023-08-27 06:53:04,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 61.1764705882353) internal successors, (1040), 17 states have internal predecessors, (1040), 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-08-27 06:53:04,854 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 06:53:04,854 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 06:53:04,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2023-08-27 06:53:05,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2023-08-27 06:53:05,059 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-27 06:53:05,059 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 06:53:05,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1572800837, now seen corresponding path program 9 times [2023-08-27 06:53:05,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 06:53:05,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841119037] [2023-08-27 06:53:05,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 06:53:05,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 06:53:05,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 06:53:05,307 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:53:05,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 06:53:05,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841119037] [2023-08-27 06:53:05,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841119037] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 06:53:05,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699191640] [2023-08-27 06:53:05,307 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-27 06:53:05,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 06:53:05,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 06:53:05,308 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 06:53:05,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2023-08-27 06:53:05,390 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-27 06:53:05,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 06:53:05,391 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 28 conjunts are in the unsatisfiable core [2023-08-27 06:53:05,391 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 06:53:05,663 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:53:05,663 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 06:53:18,300 WARN L234 SmtUtils]: Spent 6.10s on a formula simplification. DAG size of input: 40 DAG size of output: 33 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 06:53:39,403 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_z_422 Int) (v_y_422 Int)) (let ((.cse0 (+ (* 2863311531 v_z_422) (* v_y_422 4294967296)))) (or (<= 4294967296 v_z_422) (< .cse0 0) (< v_z_422 0) (< 0 .cse0) (= (+ (mod c_~x_1~0 4294967296) v_z_422) (mod c_~x_2~0 4294967296))))) is different from false [2023-08-27 06:53:43,487 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 06:53:43,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699191640] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 06:53:43,487 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 06:53:43,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 21 [2023-08-27 06:53:43,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188665388] [2023-08-27 06:53:43,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 06:53:43,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-27 06:53:43,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 06:53:43,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-27 06:53:43,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=336, Unknown=11, NotChecked=40, Total=506 [2023-08-27 06:53:43,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 141 [2023-08-27 06:53:43,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 422 places, 656 transitions, 11797 flow. Second operand has 23 states, 23 states have (on average 52.91304347826087) internal successors, (1217), 23 states have internal predecessors, (1217), 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-08-27 06:53:43,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 06:53:43,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 141 [2023-08-27 06:53:43,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 06:53:45,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:53:47,534 WARN L839 $PredicateComparison]: unable to prove that (and (= c_~x_2~0 0) (forall ((v_z_422 Int) (v_y_422 Int)) (let ((.cse0 (+ (* 2863311531 v_z_422) (* v_y_422 4294967296)))) (or (<= 4294967296 v_z_422) (< .cse0 0) (< v_z_422 0) (< 0 .cse0) (= (+ (mod c_~x_1~0 4294967296) v_z_422) (mod c_~x_2~0 4294967296))))) (<= 0 c_~x_1~0) (<= c_~x_1~0 0)) is different from false [2023-08-27 06:53:49,552 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_z_422 Int) (v_y_422 Int)) (let ((.cse0 (+ (* 2863311531 v_z_422) (* v_y_422 4294967296))) (.cse1 (+ (mod c_~x_1~0 4294967296) v_z_422)) (.cse2 (mod c_~x_2~0 4294967296))) (or (<= 4294967296 v_z_422) (< .cse0 0) (< v_z_422 0) (< 0 .cse0) (= .cse1 .cse2) (= .cse1 (+ .cse2 4294967296))))) (< (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296) (+ (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) 1))) (= c_~x_2~0 0) (= c_thread1Thread1of1ForFork0_~i~0 0) (<= 0 c_~x_1~0) (<= c_~x_1~0 0)) is different from false [2023-08-27 06:53:51,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:53:53,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:53:55,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:53:57,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:53:59,775 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_z_422 Int) (v_y_422 Int)) (let ((.cse0 (+ (* 2863311531 v_z_422) (* v_y_422 4294967296))) (.cse1 (+ (mod c_~x_1~0 4294967296) v_z_422)) (.cse2 (mod c_~x_2~0 4294967296))) (or (< (mod c_thread2Thread1of1ForFork1_~i~1 4294967296) .cse0) (<= 4294967296 v_z_422) (< .cse0 0) (< v_z_422 0) (= .cse1 .cse2) (= .cse1 (+ .cse2 4294967296))))) (< (mod (+ 3 c_thread1Thread1of1ForFork0_~i~0) 4294967296) (+ (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) 1))) (= c_~x_2~0 0) (= c_thread1Thread1of1ForFork0_~i~0 0) (<= 0 c_~x_1~0) (= c_thread2Thread1of1ForFork1_~i~1 0) (<= c_~x_1~0 0)) is different from false [2023-08-27 06:54:01,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:54:03,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:54:05,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:54:07,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:54:10,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:54:14,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:54:16,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:54:32,884 WARN L234 SmtUtils]: Spent 10.12s on a formula simplification that was a NOOP. DAG size: 59 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 06:54:35,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:54:37,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:54:39,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:54:41,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:54:43,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:54:45,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:54:47,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:54:49,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:54:51,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:54:53,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:54:55,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:54:57,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:54:59,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:55:01,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:55:03,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:55:05,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:55:07,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:55:09,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:55:11,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:55:13,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2023-08-27 06:55:15,649 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-27 06:55:15,649 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-27 06:55:15,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 06:55:15,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-27 06:55:15,692 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (2 of 3 remaining) [2023-08-27 06:55:15,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2023-08-27 06:55:15,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 06:55:15,893 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (23states, 51/141 universal loopers) in iteration 37,while PetriNetUnfolder was constructing finite prefix that currently has 4644 conditions, 406 events (205/405 cut-off events. For 6268/6268 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 2771 event pairs, 40 based on Foata normal form. 0/607 useless extension candidates. Maximal degree in co-relation 4497. Up to 314 conditions per place.). [2023-08-27 06:55:15,894 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-27 06:55:15,895 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-27 06:55:15,895 INFO L445 BasicCegarLoop]: Path program histogram: [22, 9, 5, 1] [2023-08-27 06:55:15,897 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 06:55:15,897 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 06:55:15,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 06:55:15 BasicIcfg [2023-08-27 06:55:15,899 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 06:55:15,900 INFO L158 Benchmark]: Toolchain (without parser) took 850719.58ms. Allocated memory was 377.5MB in the beginning and 601.9MB in the end (delta: 224.4MB). Free memory was 354.3MB in the beginning and 263.7MB in the end (delta: 90.6MB). Peak memory consumption was 317.7MB. Max. memory is 16.0GB. [2023-08-27 06:55:15,902 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 377.5MB. Free memory was 355.1MB in the beginning and 355.1MB in the end (delta: 86.2kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 06:55:15,902 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.29ms. Allocated memory is still 377.5MB. Free memory was 354.3MB in the beginning and 343.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-08-27 06:55:15,902 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.97ms. Allocated memory is still 377.5MB. Free memory was 343.8MB in the beginning and 342.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 06:55:15,903 INFO L158 Benchmark]: Boogie Preprocessor took 20.91ms. Allocated memory is still 377.5MB. Free memory was 342.3MB in the beginning and 341.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 06:55:15,903 INFO L158 Benchmark]: RCFGBuilder took 336.98ms. Allocated memory is still 377.5MB. Free memory was 341.1MB in the beginning and 328.6MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-08-27 06:55:15,903 INFO L158 Benchmark]: TraceAbstraction took 850132.28ms. Allocated memory was 377.5MB in the beginning and 601.9MB in the end (delta: 224.4MB). Free memory was 327.6MB in the beginning and 263.7MB in the end (delta: 64.0MB). Peak memory consumption was 290.5MB. Max. memory is 16.0GB. [2023-08-27 06:55:15,904 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.13ms. Allocated memory is still 377.5MB. Free memory was 355.1MB in the beginning and 355.1MB in the end (delta: 86.2kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 197.29ms. Allocated memory is still 377.5MB. Free memory was 354.3MB in the beginning and 343.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 26.97ms. Allocated memory is still 377.5MB. Free memory was 343.8MB in the beginning and 342.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 20.91ms. Allocated memory is still 377.5MB. Free memory was 342.3MB in the beginning and 341.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 336.98ms. Allocated memory is still 377.5MB. Free memory was 341.1MB in the beginning and 328.6MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * TraceAbstraction took 850132.28ms. Allocated memory was 377.5MB in the beginning and 601.9MB in the end (delta: 224.4MB). Free memory was 327.6MB in the beginning and 263.7MB in the end (delta: 64.0MB). Peak memory consumption was 290.5MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.9s, 71 PlacesBefore, 20 PlacesAfterwards, 69 TransitionsBefore, 15 TransitionsAfterwards, 572 CoEnabledTransitionPairs, 6 FixpointIterations, 32 TrivialSequentialCompositions, 19 ConcurrentSequentialCompositions, 3 TrivialYvCompositions, 4 ConcurrentYvCompositions, 3 ChoiceCompositions, 61 TotalNumberOfCompositions, 527 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 527, independent: 527, independent conditional: 0, independent unconditional: 527, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 299, independent: 299, independent conditional: 0, independent unconditional: 299, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 527, independent: 228, independent conditional: 0, independent unconditional: 228, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 299, unknown conditional: 0, unknown unconditional: 299] , Statistics on independence cache: Total cache size (in pairs): 19, Positive cache size: 19, Positive conditional cache size: 0, Positive unconditional cache size: 19, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (23states, 51/141 universal loopers) in iteration 37,while PetriNetUnfolder was constructing finite prefix that currently has 4644 conditions, 406 events (205/405 cut-off events. For 6268/6268 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 2771 event pairs, 40 based on Foata normal form. 0/607 useless extension candidates. Maximal degree in co-relation 4497. Up to 314 conditions per place.). - TimeoutResultAtElement [Line: 64]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (23states, 51/141 universal loopers) in iteration 37,while PetriNetUnfolder was constructing finite prefix that currently has 4644 conditions, 406 events (205/405 cut-off events. For 6268/6268 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 2771 event pairs, 40 based on Foata normal form. 0/607 useless extension candidates. Maximal degree in co-relation 4497. Up to 314 conditions per place.). - TimeoutResultAtElement [Line: 65]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (23states, 51/141 universal loopers) in iteration 37,while PetriNetUnfolder was constructing finite prefix that currently has 4644 conditions, 406 events (205/405 cut-off events. For 6268/6268 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 2771 event pairs, 40 based on Foata normal form. 0/607 useless extension candidates. Maximal degree in co-relation 4497. Up to 314 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 98 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 850.0s, OverallIterations: 37, TraceHistogramMax: 3, PathProgramHistogramMax: 22, EmptinessCheckTime: 0.0s, AutomataDifference: 547.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.0s, HoareTripleCheckerStatistics: 131 mSolverCounterUnknown, 1852 SdHoareTripleChecker+Valid, 315.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1852 mSDsluCounter, 515 SdHoareTripleChecker+Invalid, 312.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2279 IncrementalHoareTripleChecker+Unchecked, 395 mSDsCounter, 610 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14858 IncrementalHoareTripleChecker+Invalid, 17878 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 610 mSolverCounterUnsat, 120 mSDtfsCounter, 14858 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1544 GetRequests, 594 SyntacticMatches, 104 SemanticMatches, 846 ConstructedPredicates, 27 IntricatePredicates, 1 DeprecatedPredicates, 6623 ImplicationChecksByTransitivity, 363.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11797occurred in iteration=36, InterpolantAutomatonStates: 678, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 289.7s InterpolantComputationTime, 1103 NumberOfCodeBlocks, 1103 NumberOfCodeBlocksAsserted, 111 NumberOfCheckSat, 1539 ConstructedInterpolants, 48 QuantifiedInterpolants, 46575 SizeOfPredicates, 133 NumberOfNonLiveVariables, 4201 ConjunctsInSsa, 846 ConjunctsInUnsatCore, 109 InterpolantComputations, 2 PerfectInterpolantSequences, 4/306 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown