/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 -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 00:02:49,628 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 00:02:49,671 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 00:02:49,675 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 00:02:49,675 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 00:02:49,690 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 00:02:49,690 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 00:02:49,691 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 00:02:49,691 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 00:02:49,691 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 00:02:49,691 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 00:02:49,692 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 00:02:49,692 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 00:02:49,692 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 00:02:49,692 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 00:02:49,693 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 00:02:49,693 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 00:02:49,693 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 00:02:49,693 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 00:02:49,694 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 00:02:49,694 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 00:02:49,694 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 00:02:49,694 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 00:02:49,695 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 00:02:49,695 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 00:02:49,695 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 00:02:49,695 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 00:02:49,696 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 00:02:49,696 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 00:02:49,696 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 00:02:49,696 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 00:02:49,696 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 00:02:49,697 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 00:02:49,697 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 00:02:49,697 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 00:02:49,697 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.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 00:02:49,914 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 00:02:49,934 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 00:02:49,936 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 00:02:49,937 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 00:02:49,938 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 00:02:49,939 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 00:02:51,017 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 00:02:51,227 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 00:02:51,228 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/mult-comm.wvr.c [2023-08-27 00:02:51,233 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de07b9cd5/f81aea31498948b2aa702a7fce1d5d77/FLAG2bdd570be [2023-08-27 00:02:51,244 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de07b9cd5/f81aea31498948b2aa702a7fce1d5d77 [2023-08-27 00:02:51,249 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 00:02:51,250 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 00:02:51,252 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 00:02:51,252 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 00:02:51,254 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 00:02:51,255 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 12:02:51" (1/1) ... [2023-08-27 00:02:51,256 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6818cf3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:02:51, skipping insertion in model container [2023-08-27 00:02:51,256 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 12:02:51" (1/1) ... [2023-08-27 00:02:51,272 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 00:02:51,406 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 00:02:51,414 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 00:02:51,438 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 00:02:51,449 INFO L206 MainTranslator]: Completed translation [2023-08-27 00:02:51,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:02:51 WrapperNode [2023-08-27 00:02:51,451 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 00:02:51,452 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 00:02:51,452 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 00:02:51,452 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 00:02:51,457 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:02:51" (1/1) ... [2023-08-27 00:02:51,463 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:02:51" (1/1) ... [2023-08-27 00:02:51,478 INFO L138 Inliner]: procedures = 21, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 56 [2023-08-27 00:02:51,479 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 00:02:51,480 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 00:02:51,480 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 00:02:51,480 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 00:02:51,486 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:02:51" (1/1) ... [2023-08-27 00:02:51,486 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:02:51" (1/1) ... [2023-08-27 00:02:51,494 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:02:51" (1/1) ... [2023-08-27 00:02:51,494 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:02:51" (1/1) ... [2023-08-27 00:02:51,504 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:02:51" (1/1) ... [2023-08-27 00:02:51,507 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:02:51" (1/1) ... [2023-08-27 00:02:51,507 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:02:51" (1/1) ... [2023-08-27 00:02:51,508 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:02:51" (1/1) ... [2023-08-27 00:02:51,509 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 00:02:51,510 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 00:02:51,510 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 00:02:51,510 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 00:02:51,510 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:02:51" (1/1) ... [2023-08-27 00:02:51,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 00:02:51,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:02:51,550 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 00:02:51,568 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 00:02:51,583 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 00:02:51,583 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-27 00:02:51,583 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-27 00:02:51,583 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-27 00:02:51,583 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-27 00:02:51,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 00:02:51,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 00:02:51,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 00:02:51,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 00:02:51,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 00:02:51,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-27 00:02:51,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 00:02:51,585 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 00:02:51,672 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 00:02:51,673 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 00:02:51,862 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 00:02:51,867 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 00:02:51,867 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-27 00:02:51,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 12:02:51 BoogieIcfgContainer [2023-08-27 00:02:51,869 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 00:02:51,870 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 00:02:51,871 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 00:02:51,873 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 00:02:51,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 12:02:51" (1/3) ... [2023-08-27 00:02:51,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75c6edd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 12:02:51, skipping insertion in model container [2023-08-27 00:02:51,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 12:02:51" (2/3) ... [2023-08-27 00:02:51,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75c6edd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 12:02:51, skipping insertion in model container [2023-08-27 00:02:51,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 12:02:51" (3/3) ... [2023-08-27 00:02:51,875 INFO L112 eAbstractionObserver]: Analyzing ICFG mult-comm.wvr.c [2023-08-27 00:02:51,891 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 00:02:51,891 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-27 00:02:51,892 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 00:02:51,954 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-27 00:02:51,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 82 places, 80 transitions, 176 flow [2023-08-27 00:02:52,038 INFO L124 PetriNetUnfolderBase]: 5/78 cut-off events. [2023-08-27 00:02:52,039 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-27 00:02:52,045 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 00:02:52,045 INFO L82 GeneralOperation]: Start removeDead. Operand has 82 places, 80 transitions, 176 flow [2023-08-27 00:02:52,050 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 69 transitions, 150 flow [2023-08-27 00:02:52,054 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 00:02:52,065 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 71 places, 69 transitions, 150 flow [2023-08-27 00:02:52,068 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 71 places, 69 transitions, 150 flow [2023-08-27 00:02:52,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 69 transitions, 150 flow [2023-08-27 00:02:52,097 INFO L124 PetriNetUnfolderBase]: 5/69 cut-off events. [2023-08-27 00:02:52,097 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-27 00:02:52,098 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 00:02:52,099 INFO L119 LiptonReduction]: Number of co-enabled transitions 572 [2023-08-27 00:02:53,533 INFO L134 LiptonReduction]: Checked pairs total: 527 [2023-08-27 00:02:53,533 INFO L136 LiptonReduction]: Total number of compositions: 61 [2023-08-27 00:02:53,543 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 00:02:53,548 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;@61e135d3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 00:02:53,548 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-27 00:02:53,552 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 00:02:53,552 INFO L124 PetriNetUnfolderBase]: 2/14 cut-off events. [2023-08-27 00:02:53,552 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-27 00:02:53,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:02:53,552 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:02:53,553 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 00:02:53,556 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:02:53,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1660908965, now seen corresponding path program 1 times [2023-08-27 00:02:53,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:02:53,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328979662] [2023-08-27 00:02:53,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:02:53,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:02:53,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:02:54,066 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 00:02:54,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:02:54,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328979662] [2023-08-27 00:02:54,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328979662] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 00:02:54,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 00:02:54,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 00:02:54,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64166660] [2023-08-27 00:02:54,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 00:02:54,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 00:02:54,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:02:54,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 00:02:54,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 00:02:54,100 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 141 [2023-08-27 00:02:54,101 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 00:02:54,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:02:54,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 141 [2023-08-27 00:02:54,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:02:54,165 INFO L124 PetriNetUnfolderBase]: 65/114 cut-off events. [2023-08-27 00:02:54,165 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-08-27 00:02:54,166 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 00:02:54,167 INFO L140 encePairwiseOnDemand]: 137/141 looper letters, 19 selfloop transitions, 3 changer transitions 1/25 dead transitions. [2023-08-27 00:02:54,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 22 places, 25 transitions, 117 flow [2023-08-27 00:02:54,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 00:02:54,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 00:02:54,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2023-08-27 00:02:54,176 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5319148936170213 [2023-08-27 00:02:54,177 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 225 transitions. [2023-08-27 00:02:54,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 225 transitions. [2023-08-27 00:02:54,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:02:54,180 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 225 transitions. [2023-08-27 00:02:54,181 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 00:02:54,184 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 00:02:54,185 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 00:02:54,186 INFO L175 Difference]: Start difference. First operand has 20 places, 15 transitions, 42 flow. Second operand 3 states and 225 transitions. [2023-08-27 00:02:54,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 22 places, 25 transitions, 117 flow [2023-08-27 00:02:54,188 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 00:02:54,189 INFO L231 Difference]: Finished difference. Result has 19 places, 17 transitions, 53 flow [2023-08-27 00:02:54,191 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 00:02:54,193 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, -1 predicate places. [2023-08-27 00:02:54,193 INFO L495 AbstractCegarLoop]: Abstraction has has 19 places, 17 transitions, 53 flow [2023-08-27 00:02:54,193 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 00:02:54,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:02:54,193 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:02:54,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 00:02:54,194 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 00:02:54,194 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:02:54,194 INFO L85 PathProgramCache]: Analyzing trace with hash 2040868693, now seen corresponding path program 1 times [2023-08-27 00:02:54,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:02:54,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592040952] [2023-08-27 00:02:54,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:02:54,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:02:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:02:54,495 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 00:02:54,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:02:54,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592040952] [2023-08-27 00:02:54,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592040952] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:02:54,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1660602713] [2023-08-27 00:02:54,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:02:54,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:02:54,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:02:54,499 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 00:02:54,554 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 00:02:54,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:02:54,594 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-27 00:02:54,597 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:02:54,718 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 00:02:54,718 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:02:54,975 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 00:02:54,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1660602713] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:02:54,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:02:54,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 7 [2023-08-27 00:02:54,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211302249] [2023-08-27 00:02:54,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:02:54,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-27 00:02:54,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:02:54,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-27 00:02:54,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-08-27 00:02:54,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 141 [2023-08-27 00:02:54,979 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 00:02:54,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:02:54,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 141 [2023-08-27 00:02:54,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:02:55,120 INFO L124 PetriNetUnfolderBase]: 75/137 cut-off events. [2023-08-27 00:02:55,121 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-08-27 00:02:55,121 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 00:02:55,122 INFO L140 encePairwiseOnDemand]: 135/141 looper letters, 21 selfloop transitions, 5 changer transitions 15/42 dead transitions. [2023-08-27 00:02:55,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 42 transitions, 200 flow [2023-08-27 00:02:55,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 00:02:55,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 00:02:55,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 396 transitions. [2023-08-27 00:02:55,124 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46808510638297873 [2023-08-27 00:02:55,124 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 396 transitions. [2023-08-27 00:02:55,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 396 transitions. [2023-08-27 00:02:55,125 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:02:55,125 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 396 transitions. [2023-08-27 00:02:55,126 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 00:02:55,128 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 00:02:55,128 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 00:02:55,128 INFO L175 Difference]: Start difference. First operand has 19 places, 17 transitions, 53 flow. Second operand 6 states and 396 transitions. [2023-08-27 00:02:55,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 42 transitions, 200 flow [2023-08-27 00:02:55,129 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 00:02:55,130 INFO L231 Difference]: Finished difference. Result has 26 places, 19 transitions, 78 flow [2023-08-27 00:02:55,130 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 00:02:55,130 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 6 predicate places. [2023-08-27 00:02:55,130 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 19 transitions, 78 flow [2023-08-27 00:02:55,131 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 00:02:55,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:02:55,131 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:02:55,137 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 00:02:55,337 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 00:02:55,337 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 00:02:55,338 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:02:55,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1844407065, now seen corresponding path program 1 times [2023-08-27 00:02:55,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:02:55,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395349431] [2023-08-27 00:02:55,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:02:55,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:02:55,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:02:55,531 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 00:02:55,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:02:55,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395349431] [2023-08-27 00:02:55,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395349431] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:02:55,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545933959] [2023-08-27 00:02:55,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:02:55,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:02:55,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:02:55,546 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 00:02:55,580 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 00:02:55,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:02:55,604 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-27 00:02:55,606 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:02:55,684 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 00:02:55,684 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:02:55,826 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 00:02:55,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545933959] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:02:55,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:02:55,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 8 [2023-08-27 00:02:55,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433925256] [2023-08-27 00:02:55,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:02:55,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-27 00:02:55,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:02:55,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-27 00:02:55,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-08-27 00:02:55,829 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 141 [2023-08-27 00:02:55,830 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 00:02:55,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:02:55,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 141 [2023-08-27 00:02:55,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:02:55,930 INFO L124 PetriNetUnfolderBase]: 48/93 cut-off events. [2023-08-27 00:02:55,931 INFO L125 PetriNetUnfolderBase]: For 41/48 co-relation queries the response was YES. [2023-08-27 00:02:55,931 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 00:02:55,932 INFO L140 encePairwiseOnDemand]: 135/141 looper letters, 17 selfloop transitions, 6 changer transitions 9/34 dead transitions. [2023-08-27 00:02:55,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 34 transitions, 189 flow [2023-08-27 00:02:55,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 00:02:55,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 00:02:55,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 386 transitions. [2023-08-27 00:02:55,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4562647754137116 [2023-08-27 00:02:55,933 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 386 transitions. [2023-08-27 00:02:55,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 386 transitions. [2023-08-27 00:02:55,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:02:55,934 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 386 transitions. [2023-08-27 00:02:55,935 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 00:02:55,936 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 00:02:55,937 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 00:02:55,937 INFO L175 Difference]: Start difference. First operand has 26 places, 19 transitions, 78 flow. Second operand 6 states and 386 transitions. [2023-08-27 00:02:55,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 34 transitions, 189 flow [2023-08-27 00:02:55,937 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 00:02:55,938 INFO L231 Difference]: Finished difference. Result has 29 places, 21 transitions, 94 flow [2023-08-27 00:02:55,938 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 00:02:55,938 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 9 predicate places. [2023-08-27 00:02:55,939 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 21 transitions, 94 flow [2023-08-27 00:02:55,939 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 00:02:55,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:02:55,939 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:02:55,945 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 00:02:56,144 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 00:02:56,145 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 00:02:56,146 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:02:56,146 INFO L85 PathProgramCache]: Analyzing trace with hash 156600209, now seen corresponding path program 2 times [2023-08-27 00:02:56,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:02:56,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644733288] [2023-08-27 00:02:56,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:02:56,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:02:56,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:02:56,336 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 00:02:56,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:02:56,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644733288] [2023-08-27 00:02:56,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644733288] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:02:56,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641103141] [2023-08-27 00:02:56,337 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 00:02:56,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:02:56,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:02:56,339 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 00:02:56,366 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 00:02:56,395 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 00:02:56,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 00:02:56,397 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-27 00:02:56,399 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:02:56,503 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 00:02:56,503 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:02:56,696 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 00:02:56,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641103141] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:02:56,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:02:56,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 12 [2023-08-27 00:02:56,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012891569] [2023-08-27 00:02:56,696 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:02:56,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-27 00:02:56,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:02:56,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-27 00:02:56,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2023-08-27 00:02:56,699 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 141 [2023-08-27 00:02:56,701 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 00:02:56,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:02:56,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 141 [2023-08-27 00:02:56,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:02:56,936 INFO L124 PetriNetUnfolderBase]: 113/211 cut-off events. [2023-08-27 00:02:56,937 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2023-08-27 00:02:56,938 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 00:02:56,939 INFO L140 encePairwiseOnDemand]: 134/141 looper letters, 41 selfloop transitions, 19 changer transitions 12/72 dead transitions. [2023-08-27 00:02:56,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 72 transitions, 397 flow [2023-08-27 00:02:56,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-27 00:02:56,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-27 00:02:56,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 635 transitions. [2023-08-27 00:02:56,946 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4094132817537073 [2023-08-27 00:02:56,946 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 635 transitions. [2023-08-27 00:02:56,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 635 transitions. [2023-08-27 00:02:56,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:02:56,947 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 635 transitions. [2023-08-27 00:02:56,948 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 00:02:56,951 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 00:02:56,951 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 00:02:56,951 INFO L175 Difference]: Start difference. First operand has 29 places, 21 transitions, 94 flow. Second operand 11 states and 635 transitions. [2023-08-27 00:02:56,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 72 transitions, 397 flow [2023-08-27 00:02:56,957 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 00:02:56,958 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 198 flow [2023-08-27 00:02:56,958 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 00:02:56,959 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 20 predicate places. [2023-08-27 00:02:56,960 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 198 flow [2023-08-27 00:02:56,960 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 00:02:56,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:02:56,960 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:02:56,977 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 00:02:57,166 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 00:02:57,169 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 00:02:57,169 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:02:57,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1415825343, now seen corresponding path program 3 times [2023-08-27 00:02:57,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:02:57,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693151731] [2023-08-27 00:02:57,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:02:57,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:02:57,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:02:57,384 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 00:02:57,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:02:57,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693151731] [2023-08-27 00:02:57,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693151731] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:02:57,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311360902] [2023-08-27 00:02:57,388 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-27 00:02:57,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:02:57,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:02:57,393 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 00:02:57,394 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 00:02:57,440 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-27 00:02:57,441 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 00:02:57,442 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-27 00:02:57,443 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:02:57,548 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 00:02:57,548 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:02:57,696 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 00:02:57,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311360902] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:02:57,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:02:57,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 4] total 11 [2023-08-27 00:02:57,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554521443] [2023-08-27 00:02:57,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:02:57,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-27 00:02:57,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:02:57,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-27 00:02:57,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2023-08-27 00:02:57,700 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 141 [2023-08-27 00:02:57,700 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 00:02:57,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:02:57,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 141 [2023-08-27 00:02:57,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:02:57,839 INFO L124 PetriNetUnfolderBase]: 132/244 cut-off events. [2023-08-27 00:02:57,839 INFO L125 PetriNetUnfolderBase]: For 358/358 co-relation queries the response was YES. [2023-08-27 00:02:57,841 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 00:02:57,844 INFO L140 encePairwiseOnDemand]: 134/141 looper letters, 41 selfloop transitions, 17 changer transitions 8/66 dead transitions. [2023-08-27 00:02:57,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 66 transitions, 459 flow [2023-08-27 00:02:57,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 00:02:57,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 00:02:57,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 515 transitions. [2023-08-27 00:02:57,849 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40583136327817176 [2023-08-27 00:02:57,849 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 515 transitions. [2023-08-27 00:02:57,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 515 transitions. [2023-08-27 00:02:57,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:02:57,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 515 transitions. [2023-08-27 00:02:57,860 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 00:02:57,861 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 00:02:57,862 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 00:02:57,862 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 198 flow. Second operand 9 states and 515 transitions. [2023-08-27 00:02:57,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 66 transitions, 459 flow [2023-08-27 00:02:57,864 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 00:02:57,865 INFO L231 Difference]: Finished difference. Result has 47 places, 43 transitions, 261 flow [2023-08-27 00:02:57,865 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 00:02:57,865 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 27 predicate places. [2023-08-27 00:02:57,866 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 43 transitions, 261 flow [2023-08-27 00:02:57,866 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 00:02:57,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:02:57,866 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:02:57,871 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 00:02:58,071 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 00:02:58,071 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 00:02:58,072 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:02:58,072 INFO L85 PathProgramCache]: Analyzing trace with hash 645928271, now seen corresponding path program 2 times [2023-08-27 00:02:58,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:02:58,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591657899] [2023-08-27 00:02:58,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:02:58,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:02:58,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:02:58,333 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 00:02:58,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:02:58,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591657899] [2023-08-27 00:02:58,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591657899] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:02:58,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682726571] [2023-08-27 00:02:58,333 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 00:02:58,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:02:58,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:02:58,334 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 00:02:58,342 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 00:02:58,387 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 00:02:58,387 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 00:02:58,388 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-27 00:02:58,389 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:02:58,463 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 00:02:58,463 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:02:58,622 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 00:02:58,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682726571] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:02:58,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:02:58,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 8 [2023-08-27 00:02:58,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828825369] [2023-08-27 00:02:58,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:02:58,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-27 00:02:58,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:02:58,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-27 00:02:58,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-08-27 00:02:58,625 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 141 [2023-08-27 00:02:58,625 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 00:02:58,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:02:58,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 141 [2023-08-27 00:02:58,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:02:58,717 INFO L124 PetriNetUnfolderBase]: 150/279 cut-off events. [2023-08-27 00:02:58,717 INFO L125 PetriNetUnfolderBase]: For 584/594 co-relation queries the response was YES. [2023-08-27 00:02:58,718 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 00:02:58,719 INFO L140 encePairwiseOnDemand]: 135/141 looper letters, 47 selfloop transitions, 17 changer transitions 4/71 dead transitions. [2023-08-27 00:02:58,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 71 transitions, 519 flow [2023-08-27 00:02:58,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 00:02:58,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 00:02:58,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 520 transitions. [2023-08-27 00:02:58,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46099290780141844 [2023-08-27 00:02:58,721 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 520 transitions. [2023-08-27 00:02:58,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 520 transitions. [2023-08-27 00:02:58,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:02:58,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 520 transitions. [2023-08-27 00:02:58,723 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 00:02:58,724 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 00:02:58,724 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 00:02:58,724 INFO L175 Difference]: Start difference. First operand has 47 places, 43 transitions, 261 flow. Second operand 8 states and 520 transitions. [2023-08-27 00:02:58,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 71 transitions, 519 flow [2023-08-27 00:02:58,726 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 00:02:58,727 INFO L231 Difference]: Finished difference. Result has 53 places, 51 transitions, 314 flow [2023-08-27 00:02:58,727 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 00:02:58,727 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 33 predicate places. [2023-08-27 00:02:58,728 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 51 transitions, 314 flow [2023-08-27 00:02:58,728 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 00:02:58,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:02:58,728 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:02:58,742 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 00:02:58,939 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 00:02:58,940 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 00:02:58,940 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:02:58,940 INFO L85 PathProgramCache]: Analyzing trace with hash -543772353, now seen corresponding path program 3 times [2023-08-27 00:02:58,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:02:58,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405140989] [2023-08-27 00:02:58,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:02:58,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:02:58,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:02:59,176 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 00:02:59,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:02:59,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405140989] [2023-08-27 00:02:59,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405140989] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:02:59,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734640770] [2023-08-27 00:02:59,176 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-27 00:02:59,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:02:59,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:02:59,179 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 00:02:59,217 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 00:02:59,241 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-27 00:02:59,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 00:02:59,242 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-27 00:02:59,244 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:02:59,323 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 00:02:59,323 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:02:59,495 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 00:02:59,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734640770] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-27 00:02:59,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-27 00:02:59,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 9 [2023-08-27 00:02:59,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936410867] [2023-08-27 00:02:59,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 00:02:59,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 00:02:59,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:02:59,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 00:02:59,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-08-27 00:02:59,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 141 [2023-08-27 00:02:59,500 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 00:02:59,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:02:59,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 141 [2023-08-27 00:02:59,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:02:59,553 INFO L124 PetriNetUnfolderBase]: 166/307 cut-off events. [2023-08-27 00:02:59,553 INFO L125 PetriNetUnfolderBase]: For 576/586 co-relation queries the response was YES. [2023-08-27 00:02:59,554 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 00:02:59,556 INFO L140 encePairwiseOnDemand]: 135/141 looper letters, 47 selfloop transitions, 12 changer transitions 2/64 dead transitions. [2023-08-27 00:02:59,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 64 transitions, 499 flow [2023-08-27 00:02:59,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 00:02:59,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 00:02:59,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 325 transitions. [2023-08-27 00:02:59,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46099290780141844 [2023-08-27 00:02:59,557 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 325 transitions. [2023-08-27 00:02:59,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 325 transitions. [2023-08-27 00:02:59,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:02:59,557 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 325 transitions. [2023-08-27 00:02:59,558 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 00:02:59,559 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 00:02:59,559 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 00:02:59,559 INFO L175 Difference]: Start difference. First operand has 53 places, 51 transitions, 314 flow. Second operand 5 states and 325 transitions. [2023-08-27 00:02:59,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 64 transitions, 499 flow [2023-08-27 00:02:59,561 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 00:02:59,562 INFO L231 Difference]: Finished difference. Result has 56 places, 55 transitions, 339 flow [2023-08-27 00:02:59,562 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 00:02:59,563 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 36 predicate places. [2023-08-27 00:02:59,563 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 55 transitions, 339 flow [2023-08-27 00:02:59,563 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 00:02:59,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:02:59,563 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:02:59,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-27 00:02:59,768 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 00:02:59,769 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 00:02:59,769 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:02:59,769 INFO L85 PathProgramCache]: Analyzing trace with hash -2074315301, now seen corresponding path program 1 times [2023-08-27 00:02:59,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:02:59,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295794381] [2023-08-27 00:02:59,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:02:59,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:02:59,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:03:00,088 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 00:03:00,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:03:00,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295794381] [2023-08-27 00:03:00,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295794381] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:03:00,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666962757] [2023-08-27 00:03:00,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:03:00,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:03:00,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:03:00,096 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 00:03:00,098 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 00:03:00,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:03:00,187 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-27 00:03:00,188 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:03:00,361 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 00:03:00,361 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:03:01,606 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 00:03:01,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666962757] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:03:01,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:03:01,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 17 [2023-08-27 00:03:01,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444022835] [2023-08-27 00:03:01,607 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:03:01,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-27 00:03:01,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:03:01,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-27 00:03:01,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2023-08-27 00:03:01,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 141 [2023-08-27 00:03:01,609 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 00:03:01,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:03:01,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 141 [2023-08-27 00:03:01,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:03:03,463 INFO L124 PetriNetUnfolderBase]: 300/602 cut-off events. [2023-08-27 00:03:03,463 INFO L125 PetriNetUnfolderBase]: For 1238/1238 co-relation queries the response was YES. [2023-08-27 00:03:03,465 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 00:03:03,467 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 97 selfloop transitions, 72 changer transitions 31/200 dead transitions. [2023-08-27 00:03:03,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 200 transitions, 1457 flow [2023-08-27 00:03:03,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-08-27 00:03:03,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-08-27 00:03:03,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 1703 transitions. [2023-08-27 00:03:03,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4026004728132388 [2023-08-27 00:03:03,478 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 1703 transitions. [2023-08-27 00:03:03,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 1703 transitions. [2023-08-27 00:03:03,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:03:03,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 1703 transitions. [2023-08-27 00:03:03,482 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 00:03:03,486 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 00:03:03,486 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 00:03:03,486 INFO L175 Difference]: Start difference. First operand has 56 places, 55 transitions, 339 flow. Second operand 30 states and 1703 transitions. [2023-08-27 00:03:03,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 200 transitions, 1457 flow [2023-08-27 00:03:03,491 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 00:03:03,493 INFO L231 Difference]: Finished difference. Result has 87 places, 102 transitions, 845 flow [2023-08-27 00:03:03,494 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 00:03:03,494 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 67 predicate places. [2023-08-27 00:03:03,494 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 102 transitions, 845 flow [2023-08-27 00:03:03,495 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 00:03:03,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:03:03,495 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:03:03,502 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 00:03:03,699 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 00:03:03,700 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 00:03:03,700 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:03:03,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1469132737, now seen corresponding path program 2 times [2023-08-27 00:03:03,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:03:03,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035787143] [2023-08-27 00:03:03,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:03:03,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:03:03,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:03:03,995 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 00:03:03,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:03:03,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035787143] [2023-08-27 00:03:03,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035787143] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:03:03,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365961861] [2023-08-27 00:03:03,995 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 00:03:03,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:03:03,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:03:04,005 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 00:03:04,008 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 00:03:04,056 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 00:03:04,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 00:03:04,057 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-27 00:03:04,058 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:03:04,199 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 00:03:04,199 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:03:05,308 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 00:03:05,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365961861] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:03:05,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:03:05,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2023-08-27 00:03:05,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265560342] [2023-08-27 00:03:05,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:03:05,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-27 00:03:05,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:03:05,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-27 00:03:05,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2023-08-27 00:03:05,312 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 141 [2023-08-27 00:03:05,312 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 00:03:05,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:03:05,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 141 [2023-08-27 00:03:05,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:03:06,757 INFO L124 PetriNetUnfolderBase]: 310/614 cut-off events. [2023-08-27 00:03:06,757 INFO L125 PetriNetUnfolderBase]: For 1817/1817 co-relation queries the response was YES. [2023-08-27 00:03:06,758 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 00:03:06,761 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 112 selfloop transitions, 55 changer transitions 23/190 dead transitions. [2023-08-27 00:03:06,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 190 transitions, 1625 flow [2023-08-27 00:03:06,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-08-27 00:03:06,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-08-27 00:03:06,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1303 transitions. [2023-08-27 00:03:06,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4017884674683935 [2023-08-27 00:03:06,767 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 1303 transitions. [2023-08-27 00:03:06,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 1303 transitions. [2023-08-27 00:03:06,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:03:06,768 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1303 transitions. [2023-08-27 00:03:06,770 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 00:03:06,773 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 00:03:06,773 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 00:03:06,773 INFO L175 Difference]: Start difference. First operand has 87 places, 102 transitions, 845 flow. Second operand 23 states and 1303 transitions. [2023-08-27 00:03:06,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 190 transitions, 1625 flow [2023-08-27 00:03:06,783 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 00:03:06,785 INFO L231 Difference]: Finished difference. Result has 101 places, 113 transitions, 790 flow [2023-08-27 00:03:06,785 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 00:03:06,785 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 81 predicate places. [2023-08-27 00:03:06,786 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 113 transitions, 790 flow [2023-08-27 00:03:06,786 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 00:03:06,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:03:06,786 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:03:06,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-08-27 00:03:06,991 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 00:03:06,991 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 00:03:06,992 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:03:06,992 INFO L85 PathProgramCache]: Analyzing trace with hash 604008821, now seen corresponding path program 3 times [2023-08-27 00:03:06,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:03:06,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890824941] [2023-08-27 00:03:06,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:03:06,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:03:07,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:03:07,395 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 00:03:07,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:03:07,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890824941] [2023-08-27 00:03:07,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890824941] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:03:07,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602746113] [2023-08-27 00:03:07,396 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-27 00:03:07,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:03:07,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:03:07,397 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 00:03:07,435 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 00:03:07,466 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-27 00:03:07,466 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 00:03:07,467 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-27 00:03:07,468 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:03:07,669 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 00:03:07,669 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:03:09,717 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 00:03:09,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602746113] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:03:09,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:03:09,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 17 [2023-08-27 00:03:09,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839662936] [2023-08-27 00:03:09,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:03:09,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-27 00:03:09,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:03:09,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-27 00:03:09,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2023-08-27 00:03:09,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 141 [2023-08-27 00:03:09,720 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 00:03:09,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:03:09,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 141 [2023-08-27 00:03:09,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:03:11,586 INFO L124 PetriNetUnfolderBase]: 294/579 cut-off events. [2023-08-27 00:03:11,586 INFO L125 PetriNetUnfolderBase]: For 1071/1071 co-relation queries the response was YES. [2023-08-27 00:03:11,587 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 00:03:11,590 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 85 selfloop transitions, 82 changer transitions 17/184 dead transitions. [2023-08-27 00:03:11,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 184 transitions, 1405 flow [2023-08-27 00:03:11,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-08-27 00:03:11,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-08-27 00:03:11,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1414 transitions. [2023-08-27 00:03:11,592 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40113475177304964 [2023-08-27 00:03:11,592 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 1414 transitions. [2023-08-27 00:03:11,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 1414 transitions. [2023-08-27 00:03:11,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:03:11,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 1414 transitions. [2023-08-27 00:03:11,595 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 00:03:11,598 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 00:03:11,598 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 00:03:11,598 INFO L175 Difference]: Start difference. First operand has 101 places, 113 transitions, 790 flow. Second operand 25 states and 1414 transitions. [2023-08-27 00:03:11,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 184 transitions, 1405 flow [2023-08-27 00:03:11,603 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 00:03:11,605 INFO L231 Difference]: Finished difference. Result has 114 places, 117 transitions, 922 flow [2023-08-27 00:03:11,605 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 00:03:11,606 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 94 predicate places. [2023-08-27 00:03:11,606 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 117 transitions, 922 flow [2023-08-27 00:03:11,606 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 00:03:11,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:03:11,606 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:03:11,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-27 00:03:11,810 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 00:03:11,810 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 00:03:11,811 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:03:11,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1043136037, now seen corresponding path program 4 times [2023-08-27 00:03:11,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:03:11,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885178143] [2023-08-27 00:03:11,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:03:11,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:03:11,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:03:12,372 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 00:03:12,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:03:12,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885178143] [2023-08-27 00:03:12,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885178143] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:03:12,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415571097] [2023-08-27 00:03:12,373 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-27 00:03:12,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:03:12,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:03:12,388 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 00:03:12,391 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 00:03:12,470 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-27 00:03:12,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 00:03:12,471 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 29 conjunts are in the unsatisfiable core [2023-08-27 00:03:12,472 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:03:12,868 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 00:03:12,868 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:03:14,243 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 00:03:14,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415571097] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:03:14,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:03:14,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 20 [2023-08-27 00:03:14,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829511405] [2023-08-27 00:03:14,243 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:03:14,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-27 00:03:14,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:03:14,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-27 00:03:14,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=373, Unknown=0, NotChecked=0, Total=462 [2023-08-27 00:03:14,245 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 141 [2023-08-27 00:03:14,246 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 00:03:14,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:03:14,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 141 [2023-08-27 00:03:14,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:03:17,238 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 00:03:20,286 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 00:03:23,382 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 00:03:27,316 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 00:03:29,957 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 00:03:32,023 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 00:03:34,158 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 00:03:36,239 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 00:03:36,728 INFO L124 PetriNetUnfolderBase]: 405/772 cut-off events. [2023-08-27 00:03:36,729 INFO L125 PetriNetUnfolderBase]: For 2036/2036 co-relation queries the response was YES. [2023-08-27 00:03:36,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3455 conditions, 772 events. 405/772 cut-off events. For 2036/2036 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 3935 event pairs, 21 based on Foata normal form. 4/758 useless extension candidates. Maximal degree in co-relation 3356. Up to 357 conditions per place. [2023-08-27 00:03:36,734 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 127 selfloop transitions, 83 changer transitions 26/236 dead transitions. [2023-08-27 00:03:36,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 236 transitions, 2020 flow [2023-08-27 00:03:36,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-08-27 00:03:36,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-08-27 00:03:36,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 1546 transitions. [2023-08-27 00:03:36,736 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3654846335697399 [2023-08-27 00:03:36,736 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 1546 transitions. [2023-08-27 00:03:36,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 1546 transitions. [2023-08-27 00:03:36,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:03:36,736 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 1546 transitions. [2023-08-27 00:03:36,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 51.53333333333333) internal successors, (1546), 30 states have internal predecessors, (1546), 0 states have call successors, (0), 0 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 00:03:36,741 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 00:03:36,742 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 00:03:36,742 INFO L175 Difference]: Start difference. First operand has 114 places, 117 transitions, 922 flow. Second operand 30 states and 1546 transitions. [2023-08-27 00:03:36,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 236 transitions, 2020 flow [2023-08-27 00:03:36,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 236 transitions, 1821 flow, removed 36 selfloop flow, removed 20 redundant places. [2023-08-27 00:03:36,760 INFO L231 Difference]: Finished difference. Result has 125 places, 145 transitions, 1231 flow [2023-08-27 00:03:36,760 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=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1231, PETRI_PLACES=125, PETRI_TRANSITIONS=145} [2023-08-27 00:03:36,761 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 105 predicate places. [2023-08-27 00:03:36,761 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 145 transitions, 1231 flow [2023-08-27 00:03:36,761 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 00:03:36,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:03:36,761 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:03:36,767 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 00:03:36,966 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 00:03:36,967 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 00:03:36,967 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:03:36,967 INFO L85 PathProgramCache]: Analyzing trace with hash 794664601, now seen corresponding path program 5 times [2023-08-27 00:03:36,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:03:36,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436940071] [2023-08-27 00:03:36,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:03:36,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:03:36,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:03:37,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 00:03:37,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:03:37,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436940071] [2023-08-27 00:03:37,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436940071] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:03:37,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354140211] [2023-08-27 00:03:37,302 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-27 00:03:37,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:03:37,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:03:37,317 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 00:03:37,318 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 00:03:37,370 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 00:03:37,370 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 00:03:37,371 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-27 00:03:37,372 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:03:37,517 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 00:03:37,518 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:03:40,788 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 00:03:40,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354140211] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:03:40,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:03:40,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2023-08-27 00:03:40,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723511175] [2023-08-27 00:03:40,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:03:40,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-27 00:03:40,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:03:40,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-27 00:03:40,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=235, Unknown=0, NotChecked=0, Total=306 [2023-08-27 00:03:40,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 141 [2023-08-27 00:03:40,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 145 transitions, 1231 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 00:03:40,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:03:40,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 141 [2023-08-27 00:03:40,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:03:41,786 INFO L124 PetriNetUnfolderBase]: 442/842 cut-off events. [2023-08-27 00:03:41,786 INFO L125 PetriNetUnfolderBase]: For 2832/2832 co-relation queries the response was YES. [2023-08-27 00:03:41,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4060 conditions, 842 events. 442/842 cut-off events. For 2832/2832 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 4347 event pairs, 63 based on Foata normal form. 2/824 useless extension candidates. Maximal degree in co-relation 4020. Up to 707 conditions per place. [2023-08-27 00:03:41,792 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 160 selfloop transitions, 37 changer transitions 16/213 dead transitions. [2023-08-27 00:03:41,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 213 transitions, 2073 flow [2023-08-27 00:03:41,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-27 00:03:41,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-27 00:03:41,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 908 transitions. [2023-08-27 00:03:41,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4024822695035461 [2023-08-27 00:03:41,794 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 908 transitions. [2023-08-27 00:03:41,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 908 transitions. [2023-08-27 00:03:41,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:03:41,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 908 transitions. [2023-08-27 00:03:41,796 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 00:03:41,797 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 00:03:41,798 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 00:03:41,798 INFO L175 Difference]: Start difference. First operand has 125 places, 145 transitions, 1231 flow. Second operand 16 states and 908 transitions. [2023-08-27 00:03:41,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 213 transitions, 2073 flow [2023-08-27 00:03:41,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 213 transitions, 1829 flow, removed 96 selfloop flow, removed 12 redundant places. [2023-08-27 00:03:41,813 INFO L231 Difference]: Finished difference. Result has 134 places, 167 transitions, 1396 flow [2023-08-27 00:03:41,813 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=1012, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1396, PETRI_PLACES=134, PETRI_TRANSITIONS=167} [2023-08-27 00:03:41,813 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 114 predicate places. [2023-08-27 00:03:41,813 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 167 transitions, 1396 flow [2023-08-27 00:03:41,814 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 00:03:41,814 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:03:41,814 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:03:41,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-08-27 00:03:42,018 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 00:03:42,018 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 00:03:42,019 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:03:42,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1080507479, now seen corresponding path program 6 times [2023-08-27 00:03:42,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:03:42,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223812211] [2023-08-27 00:03:42,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:03:42,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:03:42,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:03:42,358 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 00:03:42,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:03:42,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223812211] [2023-08-27 00:03:42,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223812211] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:03:42,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608556350] [2023-08-27 00:03:42,359 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-27 00:03:42,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:03:42,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:03:42,361 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 00:03:42,363 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 00:03:42,412 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-08-27 00:03:42,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 00:03:42,414 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-27 00:03:42,414 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:03:42,549 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 00:03:42,549 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:03:45,031 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 00:03:45,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608556350] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:03:45,031 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:03:45,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2023-08-27 00:03:45,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845228172] [2023-08-27 00:03:45,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:03:45,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-27 00:03:45,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:03:45,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-27 00:03:45,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2023-08-27 00:03:45,033 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 141 [2023-08-27 00:03:45,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 167 transitions, 1396 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 00:03:45,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:03:45,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 141 [2023-08-27 00:03:45,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:03:46,518 INFO L124 PetriNetUnfolderBase]: 492/948 cut-off events. [2023-08-27 00:03:46,518 INFO L125 PetriNetUnfolderBase]: For 3764/3764 co-relation queries the response was YES. [2023-08-27 00:03:46,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4649 conditions, 948 events. 492/948 cut-off events. For 3764/3764 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 5176 event pairs, 60 based on Foata normal form. 2/926 useless extension candidates. Maximal degree in co-relation 4522. Up to 769 conditions per place. [2023-08-27 00:03:46,524 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 185 selfloop transitions, 56 changer transitions 10/251 dead transitions. [2023-08-27 00:03:46,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 251 transitions, 2489 flow [2023-08-27 00:03:46,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-08-27 00:03:46,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-08-27 00:03:46,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1289 transitions. [2023-08-27 00:03:46,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39747147702744373 [2023-08-27 00:03:46,526 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 1289 transitions. [2023-08-27 00:03:46,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 1289 transitions. [2023-08-27 00:03:46,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:03:46,526 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1289 transitions. [2023-08-27 00:03:46,528 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 00:03:46,531 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 00:03:46,531 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 00:03:46,531 INFO L175 Difference]: Start difference. First operand has 134 places, 167 transitions, 1396 flow. Second operand 23 states and 1289 transitions. [2023-08-27 00:03:46,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 251 transitions, 2489 flow [2023-08-27 00:03:46,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 251 transitions, 2388 flow, removed 45 selfloop flow, removed 3 redundant places. [2023-08-27 00:03:46,550 INFO L231 Difference]: Finished difference. Result has 160 places, 194 transitions, 1837 flow [2023-08-27 00:03:46,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=1307, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=1837, PETRI_PLACES=160, PETRI_TRANSITIONS=194} [2023-08-27 00:03:46,551 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 140 predicate places. [2023-08-27 00:03:46,551 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 194 transitions, 1837 flow [2023-08-27 00:03:46,551 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 00:03:46,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:03:46,551 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:03:46,565 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 00:03:46,756 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 00:03:46,756 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 00:03:46,756 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:03:46,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1447777499, now seen corresponding path program 4 times [2023-08-27 00:03:46,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:03:46,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616525239] [2023-08-27 00:03:46,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:03:46,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:03:46,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:03:46,906 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 00:03:46,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:03:46,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616525239] [2023-08-27 00:03:46,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616525239] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:03:46,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697324950] [2023-08-27 00:03:46,906 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-27 00:03:46,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:03:46,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:03:46,909 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 00:03:46,917 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 00:03:47,007 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-27 00:03:47,007 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 00:03:47,008 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-27 00:03:47,009 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:03:47,085 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 00:03:47,086 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:03:49,374 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 00:03:49,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697324950] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:03:49,374 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:03:49,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 11 [2023-08-27 00:03:49,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014097392] [2023-08-27 00:03:49,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:03:49,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-27 00:03:49,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:03:49,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-27 00:03:49,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=110, Unknown=1, NotChecked=0, Total=156 [2023-08-27 00:03:49,375 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 141 [2023-08-27 00:03:49,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 194 transitions, 1837 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 00:03:49,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:03:49,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 141 [2023-08-27 00:03:49,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:03:49,728 INFO L124 PetriNetUnfolderBase]: 487/939 cut-off events. [2023-08-27 00:03:49,728 INFO L125 PetriNetUnfolderBase]: For 4417/4427 co-relation queries the response was YES. [2023-08-27 00:03:49,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4830 conditions, 939 events. 487/939 cut-off events. For 4417/4427 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 5153 event pairs, 56 based on Foata normal form. 5/917 useless extension candidates. Maximal degree in co-relation 4713. Up to 804 conditions per place. [2023-08-27 00:03:49,735 INFO L140 encePairwiseOnDemand]: 135/141 looper letters, 175 selfloop transitions, 26 changer transitions 34/238 dead transitions. [2023-08-27 00:03:49,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 238 transitions, 2535 flow [2023-08-27 00:03:49,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-27 00:03:49,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-27 00:03:49,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 718 transitions. [2023-08-27 00:03:49,736 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4629271437782076 [2023-08-27 00:03:49,737 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 718 transitions. [2023-08-27 00:03:49,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 718 transitions. [2023-08-27 00:03:49,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:03:49,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 718 transitions. [2023-08-27 00:03:49,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 65.27272727272727) internal successors, (718), 11 states have internal predecessors, (718), 0 states have call successors, (0), 0 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 00:03:49,739 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 00:03:49,739 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 00:03:49,739 INFO L175 Difference]: Start difference. First operand has 160 places, 194 transitions, 1837 flow. Second operand 11 states and 718 transitions. [2023-08-27 00:03:49,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 238 transitions, 2535 flow [2023-08-27 00:03:49,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 238 transitions, 2278 flow, removed 100 selfloop flow, removed 12 redundant places. [2023-08-27 00:03:49,763 INFO L231 Difference]: Finished difference. Result has 160 places, 190 transitions, 1596 flow [2023-08-27 00:03:49,764 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=1580, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1596, PETRI_PLACES=160, PETRI_TRANSITIONS=190} [2023-08-27 00:03:49,765 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 140 predicate places. [2023-08-27 00:03:49,765 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 190 transitions, 1596 flow [2023-08-27 00:03:49,774 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 00:03:49,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:03:49,774 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:03:49,783 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 00:03:49,978 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 00:03:49,979 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 00:03:49,979 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:03:49,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1093769279, now seen corresponding path program 7 times [2023-08-27 00:03:49,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:03:49,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631684774] [2023-08-27 00:03:49,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:03:49,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:03:49,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:03:50,312 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 00:03:50,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:03:50,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631684774] [2023-08-27 00:03:50,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631684774] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:03:50,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833166286] [2023-08-27 00:03:50,313 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-27 00:03:50,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:03:50,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:03:50,325 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 00:03:50,373 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 00:03:50,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:03:50,433 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-27 00:03:50,434 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:03:50,584 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 00:03:50,584 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:03:56,592 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 00:03:56,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833166286] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:03:56,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:03:56,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2023-08-27 00:03:56,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110542421] [2023-08-27 00:03:56,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:03:56,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-27 00:03:56,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:03:56,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-27 00:03:56,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2023-08-27 00:03:56,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 141 [2023-08-27 00:03:56,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 190 transitions, 1596 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 00:03:56,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:03:56,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 141 [2023-08-27 00:03:56,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:03:58,224 INFO L124 PetriNetUnfolderBase]: 473/889 cut-off events. [2023-08-27 00:03:58,224 INFO L125 PetriNetUnfolderBase]: For 3535/3535 co-relation queries the response was YES. [2023-08-27 00:03:58,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4377 conditions, 889 events. 473/889 cut-off events. For 3535/3535 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 4636 event pairs, 56 based on Foata normal form. 2/865 useless extension candidates. Maximal degree in co-relation 4331. Up to 751 conditions per place. [2023-08-27 00:03:58,231 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 168 selfloop transitions, 53 changer transitions 10/231 dead transitions. [2023-08-27 00:03:58,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 231 transitions, 2215 flow [2023-08-27 00:03:58,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-27 00:03:58,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-27 00:03:58,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1113 transitions. [2023-08-27 00:03:58,233 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3946808510638298 [2023-08-27 00:03:58,233 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1113 transitions. [2023-08-27 00:03:58,233 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1113 transitions. [2023-08-27 00:03:58,233 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:03:58,233 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1113 transitions. [2023-08-27 00:03:58,235 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 55.65) internal successors, (1113), 20 states have internal predecessors, (1113), 0 states have call successors, (0), 0 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 00:03:58,237 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 00:03:58,237 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 00:03:58,237 INFO L175 Difference]: Start difference. First operand has 160 places, 190 transitions, 1596 flow. Second operand 20 states and 1113 transitions. [2023-08-27 00:03:58,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 231 transitions, 2215 flow [2023-08-27 00:03:58,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 231 transitions, 2133 flow, removed 12 selfloop flow, removed 11 redundant places. [2023-08-27 00:03:58,256 INFO L231 Difference]: Finished difference. Result has 167 places, 192 transitions, 1699 flow [2023-08-27 00:03:58,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=1520, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=1699, PETRI_PLACES=167, PETRI_TRANSITIONS=192} [2023-08-27 00:03:58,257 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 147 predicate places. [2023-08-27 00:03:58,257 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 192 transitions, 1699 flow [2023-08-27 00:03:58,257 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 00:03:58,257 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:03:58,257 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:03:58,277 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 00:03:58,462 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 00:03:58,462 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 00:03:58,463 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:03:58,463 INFO L85 PathProgramCache]: Analyzing trace with hash 638430873, now seen corresponding path program 8 times [2023-08-27 00:03:58,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:03:58,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955615347] [2023-08-27 00:03:58,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:03:58,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:03:58,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:03:58,736 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 00:03:58,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:03:58,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955615347] [2023-08-27 00:03:58,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955615347] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:03:58,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49601173] [2023-08-27 00:03:58,737 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 00:03:58,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:03:58,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:03:58,738 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 00:03:58,740 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 00:03:58,793 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 00:03:58,794 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 00:03:58,795 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-27 00:03:58,795 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:03:58,950 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 00:03:58,950 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:04:01,650 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 00:04:01,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49601173] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:04:01,650 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:04:01,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2023-08-27 00:04:01,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21284710] [2023-08-27 00:04:01,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:04:01,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-27 00:04:01,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:04:01,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-27 00:04:01,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2023-08-27 00:04:01,667 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 141 [2023-08-27 00:04:01,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 192 transitions, 1699 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 00:04:01,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:04:01,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 141 [2023-08-27 00:04:01,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:04:02,716 INFO L124 PetriNetUnfolderBase]: 476/907 cut-off events. [2023-08-27 00:04:02,716 INFO L125 PetriNetUnfolderBase]: For 3847/3847 co-relation queries the response was YES. [2023-08-27 00:04:02,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4585 conditions, 907 events. 476/907 cut-off events. For 3847/3847 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 4824 event pairs, 62 based on Foata normal form. 3/888 useless extension candidates. Maximal degree in co-relation 4540. Up to 809 conditions per place. [2023-08-27 00:04:02,723 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 182 selfloop transitions, 40 changer transitions 8/230 dead transitions. [2023-08-27 00:04:02,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 230 transitions, 2376 flow [2023-08-27 00:04:02,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-08-27 00:04:02,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-08-27 00:04:02,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1000 transitions. [2023-08-27 00:04:02,738 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39401103230890466 [2023-08-27 00:04:02,738 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1000 transitions. [2023-08-27 00:04:02,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1000 transitions. [2023-08-27 00:04:02,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:04:02,738 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1000 transitions. [2023-08-27 00:04:02,740 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 00:04:02,741 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 00:04:02,742 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 00:04:02,742 INFO L175 Difference]: Start difference. First operand has 167 places, 192 transitions, 1699 flow. Second operand 18 states and 1000 transitions. [2023-08-27 00:04:02,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 230 transitions, 2376 flow [2023-08-27 00:04:02,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 230 transitions, 2208 flow, removed 40 selfloop flow, removed 17 redundant places. [2023-08-27 00:04:02,762 INFO L231 Difference]: Finished difference. Result has 171 places, 197 transitions, 1748 flow [2023-08-27 00:04:02,762 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=1569, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=1748, PETRI_PLACES=171, PETRI_TRANSITIONS=197} [2023-08-27 00:04:02,762 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 151 predicate places. [2023-08-27 00:04:02,762 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 197 transitions, 1748 flow [2023-08-27 00:04:02,763 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 00:04:02,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:04:02,763 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:04:02,781 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 00:04:02,967 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 00:04:02,968 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 00:04:02,968 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:04:02,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1490584709, now seen corresponding path program 9 times [2023-08-27 00:04:02,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:04:02,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582036357] [2023-08-27 00:04:02,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:04:02,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:04:02,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:04:03,302 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 00:04:03,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:04:03,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582036357] [2023-08-27 00:04:03,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582036357] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:04:03,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088290015] [2023-08-27 00:04:03,303 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-27 00:04:03,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:04:03,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:04:03,304 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 00:04:03,306 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 00:04:03,356 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-27 00:04:03,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 00:04:03,357 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-27 00:04:03,358 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:04:03,535 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 00:04:03,535 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:04:06,843 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 00:04:06,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088290015] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:04:06,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:04:06,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2023-08-27 00:04:06,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516866096] [2023-08-27 00:04:06,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:04:06,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-27 00:04:06,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:04:06,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-27 00:04:06,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2023-08-27 00:04:06,845 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 141 [2023-08-27 00:04:06,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 197 transitions, 1748 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 00:04:06,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:04:06,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 141 [2023-08-27 00:04:06,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:04:09,524 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 00:04:10,153 INFO L124 PetriNetUnfolderBase]: 512/980 cut-off events. [2023-08-27 00:04:10,154 INFO L125 PetriNetUnfolderBase]: For 5052/5052 co-relation queries the response was YES. [2023-08-27 00:04:10,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5120 conditions, 980 events. 512/980 cut-off events. For 5052/5052 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 5336 event pairs, 61 based on Foata normal form. 2/960 useless extension candidates. Maximal degree in co-relation 5071. Up to 779 conditions per place. [2023-08-27 00:04:10,160 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 185 selfloop transitions, 61 changer transitions 10/256 dead transitions. [2023-08-27 00:04:10,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 256 transitions, 2709 flow [2023-08-27 00:04:10,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-08-27 00:04:10,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-08-27 00:04:10,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1018 transitions. [2023-08-27 00:04:10,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40110323089046496 [2023-08-27 00:04:10,162 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1018 transitions. [2023-08-27 00:04:10,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1018 transitions. [2023-08-27 00:04:10,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:04:10,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1018 transitions. [2023-08-27 00:04:10,164 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 56.55555555555556) internal successors, (1018), 18 states have internal predecessors, (1018), 0 states have call successors, (0), 0 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 00:04:10,165 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 00:04:10,166 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 00:04:10,166 INFO L175 Difference]: Start difference. First operand has 171 places, 197 transitions, 1748 flow. Second operand 18 states and 1018 transitions. [2023-08-27 00:04:10,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 256 transitions, 2709 flow [2023-08-27 00:04:10,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 256 transitions, 2613 flow, removed 25 selfloop flow, removed 12 redundant places. [2023-08-27 00:04:10,191 INFO L231 Difference]: Finished difference. Result has 181 places, 208 transitions, 2077 flow [2023-08-27 00:04:10,191 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=1658, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2077, PETRI_PLACES=181, PETRI_TRANSITIONS=208} [2023-08-27 00:04:10,192 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 161 predicate places. [2023-08-27 00:04:10,192 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 208 transitions, 2077 flow [2023-08-27 00:04:10,192 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 00:04:10,192 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:04:10,192 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:04:10,209 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 00:04:10,397 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 00:04:10,397 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 00:04:10,397 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:04:10,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1503846509, now seen corresponding path program 10 times [2023-08-27 00:04:10,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:04:10,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063270014] [2023-08-27 00:04:10,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:04:10,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:04:10,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:04:10,720 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 00:04:10,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:04:10,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063270014] [2023-08-27 00:04:10,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063270014] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:04:10,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1026493439] [2023-08-27 00:04:10,720 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-27 00:04:10,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:04:10,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:04:10,730 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 00:04:10,731 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 00:04:10,780 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-27 00:04:10,780 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 00:04:10,781 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-27 00:04:10,784 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:04:10,948 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 00:04:10,949 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:04:13,974 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 00:04:13,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1026493439] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:04:13,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:04:13,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2023-08-27 00:04:13,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629876051] [2023-08-27 00:04:13,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:04:13,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-27 00:04:13,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:04:13,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-27 00:04:13,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2023-08-27 00:04:13,975 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 141 [2023-08-27 00:04:13,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 208 transitions, 2077 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 00:04:13,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:04:13,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 141 [2023-08-27 00:04:13,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:04:15,130 INFO L124 PetriNetUnfolderBase]: 527/1008 cut-off events. [2023-08-27 00:04:15,131 INFO L125 PetriNetUnfolderBase]: For 7074/7074 co-relation queries the response was YES. [2023-08-27 00:04:15,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5747 conditions, 1008 events. 527/1008 cut-off events. For 7074/7074 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 5499 event pairs, 59 based on Foata normal form. 3/993 useless extension candidates. Maximal degree in co-relation 5693. Up to 791 conditions per place. [2023-08-27 00:04:15,139 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 176 selfloop transitions, 68 changer transitions 11/255 dead transitions. [2023-08-27 00:04:15,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 255 transitions, 3006 flow [2023-08-27 00:04:15,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-27 00:04:15,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-27 00:04:15,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 951 transitions. [2023-08-27 00:04:15,143 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3967459324155194 [2023-08-27 00:04:15,143 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 951 transitions. [2023-08-27 00:04:15,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 951 transitions. [2023-08-27 00:04:15,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:04:15,144 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 951 transitions. [2023-08-27 00:04:15,145 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 55.94117647058823) internal successors, (951), 17 states have internal predecessors, (951), 0 states have call successors, (0), 0 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 00:04:15,152 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 00:04:15,152 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 00:04:15,152 INFO L175 Difference]: Start difference. First operand has 181 places, 208 transitions, 2077 flow. Second operand 17 states and 951 transitions. [2023-08-27 00:04:15,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 255 transitions, 3006 flow [2023-08-27 00:04:15,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 255 transitions, 2661 flow, removed 136 selfloop flow, removed 12 redundant places. [2023-08-27 00:04:15,197 INFO L231 Difference]: Finished difference. Result has 188 places, 217 transitions, 2176 flow [2023-08-27 00:04:15,197 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=1808, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2176, PETRI_PLACES=188, PETRI_TRANSITIONS=217} [2023-08-27 00:04:15,198 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 168 predicate places. [2023-08-27 00:04:15,198 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 217 transitions, 2176 flow [2023-08-27 00:04:15,198 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 00:04:15,198 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:04:15,198 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:04:15,205 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 00:04:15,402 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 00:04:15,403 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 00:04:15,403 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:04:15,403 INFO L85 PathProgramCache]: Analyzing trace with hash -295815165, now seen corresponding path program 11 times [2023-08-27 00:04:15,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:04:15,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086998251] [2023-08-27 00:04:15,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:04:15,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:04:15,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:04:15,731 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 00:04:15,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:04:15,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086998251] [2023-08-27 00:04:15,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086998251] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:04:15,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548883728] [2023-08-27 00:04:15,732 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-27 00:04:15,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:04:15,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:04:15,741 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 00:04:15,748 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 00:04:15,820 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 00:04:15,820 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 00:04:15,821 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-27 00:04:15,822 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:04:15,987 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 00:04:15,988 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:04:19,826 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 00:04:19,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548883728] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:04:19,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:04:19,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2023-08-27 00:04:19,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568950141] [2023-08-27 00:04:19,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:04:19,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-27 00:04:19,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:04:19,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-27 00:04:19,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2023-08-27 00:04:19,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 141 [2023-08-27 00:04:19,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 217 transitions, 2176 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 00:04:19,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:04:19,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 141 [2023-08-27 00:04:19,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:04:20,876 INFO L124 PetriNetUnfolderBase]: 553/1045 cut-off events. [2023-08-27 00:04:20,877 INFO L125 PetriNetUnfolderBase]: For 8706/8706 co-relation queries the response was YES. [2023-08-27 00:04:20,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6118 conditions, 1045 events. 553/1045 cut-off events. For 8706/8706 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 5693 event pairs, 66 based on Foata normal form. 2/1027 useless extension candidates. Maximal degree in co-relation 6062. Up to 924 conditions per place. [2023-08-27 00:04:20,885 INFO L140 encePairwiseOnDemand]: 132/141 looper letters, 218 selfloop transitions, 41 changer transitions 11/270 dead transitions. [2023-08-27 00:04:20,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 270 transitions, 3117 flow [2023-08-27 00:04:20,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-27 00:04:20,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-27 00:04:20,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 956 transitions. [2023-08-27 00:04:20,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39883187317480184 [2023-08-27 00:04:20,886 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 956 transitions. [2023-08-27 00:04:20,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 956 transitions. [2023-08-27 00:04:20,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:04:20,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 956 transitions. [2023-08-27 00:04:20,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 56.23529411764706) internal successors, (956), 17 states have internal predecessors, (956), 0 states have call successors, (0), 0 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 00:04:20,889 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 00:04:20,890 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 00:04:20,890 INFO L175 Difference]: Start difference. First operand has 188 places, 217 transitions, 2176 flow. Second operand 17 states and 956 transitions. [2023-08-27 00:04:20,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 270 transitions, 3117 flow [2023-08-27 00:04:20,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 270 transitions, 2960 flow, removed 54 selfloop flow, removed 11 redundant places. [2023-08-27 00:04:20,931 INFO L231 Difference]: Finished difference. Result has 196 places, 230 transitions, 2395 flow [2023-08-27 00:04:20,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=2046, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2395, PETRI_PLACES=196, PETRI_TRANSITIONS=230} [2023-08-27 00:04:20,932 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 176 predicate places. [2023-08-27 00:04:20,932 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 230 transitions, 2395 flow [2023-08-27 00:04:20,932 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 00:04:20,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:04:20,932 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:04:20,939 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 00:04:21,136 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 00:04:21,137 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 00:04:21,137 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:04:21,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1426341431, now seen corresponding path program 4 times [2023-08-27 00:04:21,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:04:21,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584330731] [2023-08-27 00:04:21,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:04:21,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:04:21,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:04:21,406 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 00:04:21,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:04:21,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584330731] [2023-08-27 00:04:21,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584330731] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:04:21,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833847678] [2023-08-27 00:04:21,406 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-27 00:04:21,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:04:21,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:04:21,409 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 00:04:21,428 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 00:04:21,489 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-27 00:04:21,489 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 00:04:21,489 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-27 00:04:21,490 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:04:21,665 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 00:04:21,665 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:04:21,977 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 00:04:21,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833847678] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:04:21,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:04:21,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 6] total 17 [2023-08-27 00:04:21,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265988102] [2023-08-27 00:04:21,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:04:21,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-27 00:04:21,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:04:21,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-27 00:04:21,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2023-08-27 00:04:21,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 141 [2023-08-27 00:04:21,979 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 230 transitions, 2395 flow. Second operand has 19 states, 19 states have (on average 53.10526315789474) internal successors, (1009), 19 states have internal predecessors, (1009), 0 states have call successors, (0), 0 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 00:04:21,979 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:04:21,979 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 141 [2023-08-27 00:04:21,979 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:04:23,119 INFO L124 PetriNetUnfolderBase]: 724/1342 cut-off events. [2023-08-27 00:04:23,119 INFO L125 PetriNetUnfolderBase]: For 13917/13917 co-relation queries the response was YES. [2023-08-27 00:04:23,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8384 conditions, 1342 events. 724/1342 cut-off events. For 13917/13917 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 7611 event pairs, 22 based on Foata normal form. 3/1327 useless extension candidates. Maximal degree in co-relation 8323. Up to 734 conditions per place. [2023-08-27 00:04:23,129 INFO L140 encePairwiseOnDemand]: 132/141 looper letters, 194 selfloop transitions, 153 changer transitions 19/366 dead transitions. [2023-08-27 00:04:23,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 366 transitions, 4548 flow [2023-08-27 00:04:23,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-08-27 00:04:23,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2023-08-27 00:04:23,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 1528 transitions. [2023-08-27 00:04:23,131 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4013659049120042 [2023-08-27 00:04:23,131 INFO L72 ComplementDD]: Start complementDD. Operand 27 states and 1528 transitions. [2023-08-27 00:04:23,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 1528 transitions. [2023-08-27 00:04:23,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:04:23,132 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 27 states and 1528 transitions. [2023-08-27 00:04:23,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 28 states, 27 states have (on average 56.592592592592595) internal successors, (1528), 27 states have internal predecessors, (1528), 0 states have call successors, (0), 0 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 00:04:23,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 28 states, 28 states have (on average 141.0) internal successors, (3948), 28 states have internal predecessors, (3948), 0 states have call successors, (0), 0 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 00:04:23,136 INFO L81 ComplementDD]: Finished complementDD. Result has 28 states, 28 states have (on average 141.0) internal successors, (3948), 28 states have internal predecessors, (3948), 0 states have call successors, (0), 0 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 00:04:23,136 INFO L175 Difference]: Start difference. First operand has 196 places, 230 transitions, 2395 flow. Second operand 27 states and 1528 transitions. [2023-08-27 00:04:23,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 366 transitions, 4548 flow [2023-08-27 00:04:23,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 366 transitions, 4356 flow, removed 72 selfloop flow, removed 12 redundant places. [2023-08-27 00:04:23,187 INFO L231 Difference]: Finished difference. Result has 220 places, 287 transitions, 3740 flow [2023-08-27 00:04:23,187 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=2211, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=3740, PETRI_PLACES=220, PETRI_TRANSITIONS=287} [2023-08-27 00:04:23,187 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 200 predicate places. [2023-08-27 00:04:23,187 INFO L495 AbstractCegarLoop]: Abstraction has has 220 places, 287 transitions, 3740 flow [2023-08-27 00:04:23,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 53.10526315789474) internal successors, (1009), 19 states have internal predecessors, (1009), 0 states have call successors, (0), 0 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 00:04:23,188 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:04:23,188 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:04:23,192 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 00:04:23,388 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 00:04:23,389 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 00:04:23,389 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:04:23,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1967502711, now seen corresponding path program 12 times [2023-08-27 00:04:23,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:04:23,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987912001] [2023-08-27 00:04:23,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:04:23,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:04:23,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:04:23,732 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 00:04:23,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:04:23,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987912001] [2023-08-27 00:04:23,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987912001] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:04:23,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088922463] [2023-08-27 00:04:23,732 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-27 00:04:23,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:04:23,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:04:23,745 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 00:04:23,747 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 00:04:23,797 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-08-27 00:04:23,797 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 00:04:23,798 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-27 00:04:23,798 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:04:23,943 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 00:04:23,944 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:04:25,457 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 00:04:25,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088922463] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:04:25,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:04:25,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 17 [2023-08-27 00:04:25,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102347819] [2023-08-27 00:04:25,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:04:25,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-27 00:04:25,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:04:25,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-27 00:04:25,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2023-08-27 00:04:25,459 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 141 [2023-08-27 00:04:25,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 287 transitions, 3740 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 00:04:25,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:04:25,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 141 [2023-08-27 00:04:25,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:04:26,979 INFO L124 PetriNetUnfolderBase]: 735/1383 cut-off events. [2023-08-27 00:04:26,979 INFO L125 PetriNetUnfolderBase]: For 16736/16736 co-relation queries the response was YES. [2023-08-27 00:04:26,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9430 conditions, 1383 events. 735/1383 cut-off events. For 16736/16736 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 8039 event pairs, 76 based on Foata normal form. 3/1386 useless extension candidates. Maximal degree in co-relation 9364. Up to 1166 conditions per place. [2023-08-27 00:04:26,990 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 264 selfloop transitions, 73 changer transitions 21/358 dead transitions. [2023-08-27 00:04:26,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 358 transitions, 5052 flow [2023-08-27 00:04:26,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-08-27 00:04:26,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-08-27 00:04:26,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1394 transitions. [2023-08-27 00:04:26,996 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3954609929078014 [2023-08-27 00:04:26,996 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 1394 transitions. [2023-08-27 00:04:26,996 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 1394 transitions. [2023-08-27 00:04:26,996 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:04:26,996 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 1394 transitions. [2023-08-27 00:04:26,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 55.76) internal successors, (1394), 25 states have internal predecessors, (1394), 0 states have call successors, (0), 0 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 00:04:27,000 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 00:04:27,001 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 00:04:27,001 INFO L175 Difference]: Start difference. First operand has 220 places, 287 transitions, 3740 flow. Second operand 25 states and 1394 transitions. [2023-08-27 00:04:27,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 358 transitions, 5052 flow [2023-08-27 00:04:27,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 358 transitions, 4426 flow, removed 295 selfloop flow, removed 10 redundant places. [2023-08-27 00:04:27,128 INFO L231 Difference]: Finished difference. Result has 241 places, 299 transitions, 3616 flow [2023-08-27 00:04:27,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=3177, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=3616, PETRI_PLACES=241, PETRI_TRANSITIONS=299} [2023-08-27 00:04:27,129 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 221 predicate places. [2023-08-27 00:04:27,129 INFO L495 AbstractCegarLoop]: Abstraction has has 241 places, 299 transitions, 3616 flow [2023-08-27 00:04:27,129 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 00:04:27,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:04:27,129 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:04:27,135 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 00:04:27,333 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 00:04:27,333 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 00:04:27,334 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:04:27,334 INFO L85 PathProgramCache]: Analyzing trace with hash -361178151, now seen corresponding path program 13 times [2023-08-27 00:04:27,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:04:27,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704105608] [2023-08-27 00:04:27,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:04:27,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:04:27,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:04:28,560 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 00:04:28,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:04:28,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704105608] [2023-08-27 00:04:28,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704105608] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:04:28,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293390006] [2023-08-27 00:04:28,560 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-27 00:04:28,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:04:28,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:04:28,561 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 00:04:28,563 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 00:04:28,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:04:28,614 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-27 00:04:28,615 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:04:28,831 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 00:04:28,831 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:04:31,350 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 00:04:31,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293390006] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:04:31,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:04:31,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 18 [2023-08-27 00:04:31,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850190948] [2023-08-27 00:04:31,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:04:31,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-27 00:04:31,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:04:31,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-27 00:04:31,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2023-08-27 00:04:31,352 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 141 [2023-08-27 00:04:31,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 299 transitions, 3616 flow. Second operand has 20 states, 20 states have (on average 48.05) internal successors, (961), 20 states have internal predecessors, (961), 0 states have call successors, (0), 0 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 00:04:31,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:04:31,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 141 [2023-08-27 00:04:31,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:04:34,352 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 00:04:35,316 INFO L124 PetriNetUnfolderBase]: 790/1496 cut-off events. [2023-08-27 00:04:35,316 INFO L125 PetriNetUnfolderBase]: For 20090/20090 co-relation queries the response was YES. [2023-08-27 00:04:35,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9868 conditions, 1496 events. 790/1496 cut-off events. For 20090/20090 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 8935 event pairs, 78 based on Foata normal form. 4/1500 useless extension candidates. Maximal degree in co-relation 9795. Up to 1172 conditions per place. [2023-08-27 00:04:35,327 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 261 selfloop transitions, 103 changer transitions 20/384 dead transitions. [2023-08-27 00:04:35,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 384 transitions, 5230 flow [2023-08-27 00:04:35,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-08-27 00:04:35,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-08-27 00:04:35,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1228 transitions. [2023-08-27 00:04:35,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3628841607565012 [2023-08-27 00:04:35,329 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 1228 transitions. [2023-08-27 00:04:35,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 1228 transitions. [2023-08-27 00:04:35,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:04:35,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 1228 transitions. [2023-08-27 00:04:35,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 51.166666666666664) internal successors, (1228), 24 states have internal predecessors, (1228), 0 states have call successors, (0), 0 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 00:04:35,333 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 00:04:35,333 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 00:04:35,333 INFO L175 Difference]: Start difference. First operand has 241 places, 299 transitions, 3616 flow. Second operand 24 states and 1228 transitions. [2023-08-27 00:04:35,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 384 transitions, 5230 flow [2023-08-27 00:04:35,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 384 transitions, 4992 flow, removed 89 selfloop flow, removed 15 redundant places. [2023-08-27 00:04:35,419 INFO L231 Difference]: Finished difference. Result has 255 places, 324 transitions, 4245 flow [2023-08-27 00:04:35,419 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=3422, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=4245, PETRI_PLACES=255, PETRI_TRANSITIONS=324} [2023-08-27 00:04:35,420 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 235 predicate places. [2023-08-27 00:04:35,420 INFO L495 AbstractCegarLoop]: Abstraction has has 255 places, 324 transitions, 4245 flow [2023-08-27 00:04:35,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 48.05) internal successors, (961), 20 states have internal predecessors, (961), 0 states have call successors, (0), 0 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 00:04:35,420 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:04:35,420 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:04:35,424 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 00:04:35,624 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 00:04:35,625 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 00:04:35,625 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:04:35,625 INFO L85 PathProgramCache]: Analyzing trace with hash 599655405, now seen corresponding path program 14 times [2023-08-27 00:04:35,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:04:35,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486934940] [2023-08-27 00:04:35,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:04:35,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:04:35,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:04:36,345 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 00:04:36,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:04:36,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486934940] [2023-08-27 00:04:36,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486934940] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:04:36,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080495741] [2023-08-27 00:04:36,346 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 00:04:36,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:04:36,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:04:36,347 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 00:04:36,349 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 00:04:36,451 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 00:04:36,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 00:04:36,453 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 29 conjunts are in the unsatisfiable core [2023-08-27 00:04:36,454 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:04:36,743 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 00:04:36,743 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:04:41,456 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_thread2Thread1of1ForFork1_~i~1 4294967296)) (.cse4 (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296)) (.cse3 (* (div c_~x_2~0 4294967296) 4294967296)) (.cse2 (div (+ (mod c_~x_2~0 4294967296) (- 4294967294)) 4294967296))) (and (forall ((v_z_270 Int)) (or (<= v_z_270 .cse0) (let ((.cse1 (* 2 v_z_270))) (< (+ c_~x_2~0 (* 4294967296 (div (+ c_~x_1~0 .cse1) 4294967296))) (+ c_~x_1~0 4294967295 (* .cse2 4294967296) .cse1 .cse3))) (< .cse4 v_z_270))) (forall ((v_z_270 Int)) (or (<= v_z_270 .cse0) (let ((.cse5 (* 2 v_z_270))) (< (+ c_~x_1~0 .cse5 .cse3) (+ c_~x_2~0 3 (* 4294967296 (div (+ c_~x_1~0 .cse5) 4294967296))))) (< .cse4 v_z_270))) (forall ((v_z_270 Int)) (or (<= v_z_270 .cse0) (< .cse4 v_z_270) (let ((.cse6 (* 2 v_z_270))) (< (+ c_~x_2~0 (* 4294967296 (div (+ c_~x_1~0 .cse6) 4294967296))) (+ c_~x_1~0 4294967295 .cse6 .cse3))))) (or (forall ((v_z_270 Int)) (or (<= v_z_270 .cse0) (< .cse4 v_z_270) (let ((.cse7 (* 2 v_z_270))) (< (+ c_~x_1~0 .cse7 .cse3 4294967293) (+ c_~x_2~0 (* 4294967296 (div (+ c_~x_1~0 .cse7) 4294967296))))))) (< .cse2 0)))) is different from false [2023-08-27 00:04:41,586 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 00:04:41,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080495741] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:04:41,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:04:41,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 20 [2023-08-27 00:04:41,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345435732] [2023-08-27 00:04:41,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:04:41,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-27 00:04:41,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:04:41,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-27 00:04:41,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=330, Unknown=2, NotChecked=38, Total=462 [2023-08-27 00:04:41,588 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 141 [2023-08-27 00:04:41,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 324 transitions, 4245 flow. Second operand has 22 states, 22 states have (on average 52.72727272727273) internal successors, (1160), 22 states have internal predecessors, (1160), 0 states have call successors, (0), 0 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 00:04:41,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:04:41,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 141 [2023-08-27 00:04:41,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:04:45,880 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 00:04:50,767 INFO L124 PetriNetUnfolderBase]: 864/1642 cut-off events. [2023-08-27 00:04:50,767 INFO L125 PetriNetUnfolderBase]: For 28806/28806 co-relation queries the response was YES. [2023-08-27 00:04:50,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12106 conditions, 1642 events. 864/1642 cut-off events. For 28806/28806 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 9985 event pairs, 80 based on Foata normal form. 4/1646 useless extension candidates. Maximal degree in co-relation 12027. Up to 1203 conditions per place. [2023-08-27 00:04:50,781 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 279 selfloop transitions, 142 changer transitions 17/438 dead transitions. [2023-08-27 00:04:50,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 438 transitions, 6819 flow [2023-08-27 00:04:50,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-08-27 00:04:50,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2023-08-27 00:04:50,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 1849 transitions. [2023-08-27 00:04:50,784 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.397378035675908 [2023-08-27 00:04:50,784 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 1849 transitions. [2023-08-27 00:04:50,784 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 1849 transitions. [2023-08-27 00:04:50,785 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:04:50,785 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 1849 transitions. [2023-08-27 00:04:50,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 56.03030303030303) internal successors, (1849), 33 states have internal predecessors, (1849), 0 states have call successors, (0), 0 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 00:04:50,789 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 00:04:50,790 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 00:04:50,790 INFO L175 Difference]: Start difference. First operand has 255 places, 324 transitions, 4245 flow. Second operand 33 states and 1849 transitions. [2023-08-27 00:04:50,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 438 transitions, 6819 flow [2023-08-27 00:04:50,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 438 transitions, 6018 flow, removed 364 selfloop flow, removed 14 redundant places. [2023-08-27 00:04:50,928 INFO L231 Difference]: Finished difference. Result has 275 places, 362 transitions, 5135 flow [2023-08-27 00:04:50,928 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=3795, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=5135, PETRI_PLACES=275, PETRI_TRANSITIONS=362} [2023-08-27 00:04:50,928 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 255 predicate places. [2023-08-27 00:04:50,928 INFO L495 AbstractCegarLoop]: Abstraction has has 275 places, 362 transitions, 5135 flow [2023-08-27 00:04:50,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 52.72727272727273) internal successors, (1160), 22 states have internal predecessors, (1160), 0 states have call successors, (0), 0 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 00:04:50,929 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:04:50,929 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:04:50,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2023-08-27 00:04:51,133 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 00:04:51,133 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 00:04:51,134 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:04:51,134 INFO L85 PathProgramCache]: Analyzing trace with hash -552538345, now seen corresponding path program 15 times [2023-08-27 00:04:51,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:04:51,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734100840] [2023-08-27 00:04:51,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:04:51,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:04:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:04:51,415 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 00:04:51,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:04:51,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734100840] [2023-08-27 00:04:51,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734100840] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:04:51,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478480068] [2023-08-27 00:04:51,416 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-27 00:04:51,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:04:51,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:04:51,417 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 00:04:51,419 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 00:04:51,480 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-27 00:04:51,480 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 00:04:51,481 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-27 00:04:51,482 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:04:51,651 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 00:04:51,651 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:04:54,576 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 00:04:54,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478480068] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:04:54,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:04:54,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2023-08-27 00:04:54,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737464527] [2023-08-27 00:04:54,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:04:54,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-27 00:04:54,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:04:54,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-27 00:04:54,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2023-08-27 00:04:54,580 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 141 [2023-08-27 00:04:54,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 362 transitions, 5135 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 00:04:54,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:04:54,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 141 [2023-08-27 00:04:54,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:04:55,950 INFO L124 PetriNetUnfolderBase]: 910/1716 cut-off events. [2023-08-27 00:04:55,950 INFO L125 PetriNetUnfolderBase]: For 26990/26990 co-relation queries the response was YES. [2023-08-27 00:04:55,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12741 conditions, 1716 events. 910/1716 cut-off events. For 26990/26990 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 10472 event pairs, 96 based on Foata normal form. 2/1718 useless extension candidates. Maximal degree in co-relation 12661. Up to 1547 conditions per place. [2023-08-27 00:04:55,965 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 346 selfloop transitions, 58 changer transitions 11/415 dead transitions. [2023-08-27 00:04:55,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 415 transitions, 6788 flow [2023-08-27 00:04:55,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-27 00:04:55,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-27 00:04:55,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 949 transitions. [2023-08-27 00:04:55,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39591155611180645 [2023-08-27 00:04:55,976 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 949 transitions. [2023-08-27 00:04:55,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 949 transitions. [2023-08-27 00:04:55,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:04:55,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 949 transitions. [2023-08-27 00:04:55,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 55.8235294117647) internal successors, (949), 17 states have internal predecessors, (949), 0 states have call successors, (0), 0 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 00:04:55,979 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 00:04:55,979 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 00:04:55,979 INFO L175 Difference]: Start difference. First operand has 275 places, 362 transitions, 5135 flow. Second operand 17 states and 949 transitions. [2023-08-27 00:04:55,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 415 transitions, 6788 flow [2023-08-27 00:04:56,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 415 transitions, 5890 flow, removed 369 selfloop flow, removed 22 redundant places. [2023-08-27 00:04:56,124 INFO L231 Difference]: Finished difference. Result has 272 places, 379 transitions, 4969 flow [2023-08-27 00:04:56,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=4281, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=4969, PETRI_PLACES=272, PETRI_TRANSITIONS=379} [2023-08-27 00:04:56,124 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 252 predicate places. [2023-08-27 00:04:56,124 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 379 transitions, 4969 flow [2023-08-27 00:04:56,125 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 00:04:56,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:04:56,125 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:04:56,137 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 00:04:56,329 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 00:04:56,329 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 00:04:56,330 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:04:56,330 INFO L85 PathProgramCache]: Analyzing trace with hash -540026125, now seen corresponding path program 16 times [2023-08-27 00:04:56,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:04:56,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727867446] [2023-08-27 00:04:56,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:04:56,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:04:56,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:04:56,682 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 00:04:56,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:04:56,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727867446] [2023-08-27 00:04:56,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727867446] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:04:56,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210888476] [2023-08-27 00:04:56,682 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-27 00:04:56,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:04:56,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:04:56,685 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 00:04:56,687 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 00:04:56,739 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-27 00:04:56,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 00:04:56,740 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-27 00:04:56,741 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:04:56,893 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 00:04:56,893 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:05:00,315 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 00:05:00,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210888476] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:05:00,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:05:00,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2023-08-27 00:05:00,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538139784] [2023-08-27 00:05:00,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:05:00,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-27 00:05:00,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:05:00,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-27 00:05:00,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2023-08-27 00:05:00,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 141 [2023-08-27 00:05:00,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 379 transitions, 4969 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 00:05:00,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:05:00,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 141 [2023-08-27 00:05:00,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:05:01,967 INFO L124 PetriNetUnfolderBase]: 902/1704 cut-off events. [2023-08-27 00:05:01,967 INFO L125 PetriNetUnfolderBase]: For 19982/19982 co-relation queries the response was YES. [2023-08-27 00:05:01,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11599 conditions, 1704 events. 902/1704 cut-off events. For 19982/19982 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 10409 event pairs, 94 based on Foata normal form. 2/1704 useless extension candidates. Maximal degree in co-relation 11519. Up to 1547 conditions per place. [2023-08-27 00:05:01,997 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 347 selfloop transitions, 62 changer transitions 8/417 dead transitions. [2023-08-27 00:05:01,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 417 transitions, 6165 flow [2023-08-27 00:05:02,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-27 00:05:02,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-27 00:05:02,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1059 transitions. [2023-08-27 00:05:02,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39529675251959684 [2023-08-27 00:05:02,014 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1059 transitions. [2023-08-27 00:05:02,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1059 transitions. [2023-08-27 00:05:02,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:05:02,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1059 transitions. [2023-08-27 00:05:02,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 55.73684210526316) internal successors, (1059), 19 states have internal predecessors, (1059), 0 states have call successors, (0), 0 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 00:05:02,017 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 00:05:02,017 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 00:05:02,017 INFO L175 Difference]: Start difference. First operand has 272 places, 379 transitions, 4969 flow. Second operand 19 states and 1059 transitions. [2023-08-27 00:05:02,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 417 transitions, 6165 flow [2023-08-27 00:05:02,134 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 417 transitions, 5766 flow, removed 181 selfloop flow, removed 10 redundant places. [2023-08-27 00:05:02,139 INFO L231 Difference]: Finished difference. Result has 282 places, 384 transitions, 4953 flow [2023-08-27 00:05:02,140 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=4650, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=379, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=4953, PETRI_PLACES=282, PETRI_TRANSITIONS=384} [2023-08-27 00:05:02,140 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 262 predicate places. [2023-08-27 00:05:02,140 INFO L495 AbstractCegarLoop]: Abstraction has has 282 places, 384 transitions, 4953 flow [2023-08-27 00:05:02,140 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 00:05:02,140 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:05:02,140 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:05:02,146 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 00:05:02,346 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 00:05:02,346 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 00:05:02,346 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:05:02,346 INFO L85 PathProgramCache]: Analyzing trace with hash 2044327863, now seen corresponding path program 17 times [2023-08-27 00:05:02,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:05:02,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417349028] [2023-08-27 00:05:02,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:05:02,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:05:02,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:05:02,654 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 00:05:02,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:05:02,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417349028] [2023-08-27 00:05:02,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417349028] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:05:02,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073470781] [2023-08-27 00:05:02,654 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-27 00:05:02,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:05:02,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:05:02,665 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 00:05:02,693 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 00:05:02,770 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-08-27 00:05:02,770 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 00:05:02,771 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-27 00:05:02,772 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:05:02,932 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 00:05:02,932 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:05:05,066 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 00:05:05,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073470781] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:05:05,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:05:05,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2023-08-27 00:05:05,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266385140] [2023-08-27 00:05:05,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:05:05,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-27 00:05:05,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:05:05,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-27 00:05:05,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2023-08-27 00:05:05,069 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 141 [2023-08-27 00:05:05,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 384 transitions, 4953 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 00:05:05,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:05:05,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 141 [2023-08-27 00:05:05,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:05:07,864 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 00:05:08,619 INFO L124 PetriNetUnfolderBase]: 946/1780 cut-off events. [2023-08-27 00:05:08,620 INFO L125 PetriNetUnfolderBase]: For 23807/23807 co-relation queries the response was YES. [2023-08-27 00:05:08,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12346 conditions, 1780 events. 946/1780 cut-off events. For 23807/23807 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 10973 event pairs, 94 based on Foata normal form. 2/1780 useless extension candidates. Maximal degree in co-relation 12264. Up to 1602 conditions per place. [2023-08-27 00:05:08,633 INFO L140 encePairwiseOnDemand]: 132/141 looper letters, 367 selfloop transitions, 59 changer transitions 10/436 dead transitions. [2023-08-27 00:05:08,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 436 transitions, 6458 flow [2023-08-27 00:05:08,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-27 00:05:08,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-27 00:05:08,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1166 transitions. [2023-08-27 00:05:08,634 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3937858831475853 [2023-08-27 00:05:08,634 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1166 transitions. [2023-08-27 00:05:08,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1166 transitions. [2023-08-27 00:05:08,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:05:08,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1166 transitions. [2023-08-27 00:05:08,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 55.523809523809526) internal successors, (1166), 21 states have internal predecessors, (1166), 0 states have call successors, (0), 0 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 00:05:08,638 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 00:05:08,638 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 00:05:08,638 INFO L175 Difference]: Start difference. First operand has 282 places, 384 transitions, 4953 flow. Second operand 21 states and 1166 transitions. [2023-08-27 00:05:08,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 436 transitions, 6458 flow [2023-08-27 00:05:08,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 436 transitions, 6176 flow, removed 107 selfloop flow, removed 15 redundant places. [2023-08-27 00:05:08,762 INFO L231 Difference]: Finished difference. Result has 291 places, 397 transitions, 5242 flow [2023-08-27 00:05:08,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=4675, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=384, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=5242, PETRI_PLACES=291, PETRI_TRANSITIONS=397} [2023-08-27 00:05:08,763 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 271 predicate places. [2023-08-27 00:05:08,763 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 397 transitions, 5242 flow [2023-08-27 00:05:08,763 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 00:05:08,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:05:08,763 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:05:08,769 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 00:05:08,969 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 00:05:08,969 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 00:05:08,969 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:05:08,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1178912227, now seen corresponding path program 18 times [2023-08-27 00:05:08,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:05:08,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316160569] [2023-08-27 00:05:08,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:05:08,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:05:08,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:05:09,200 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 00:05:09,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:05:09,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316160569] [2023-08-27 00:05:09,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316160569] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:05:09,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625327453] [2023-08-27 00:05:09,201 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-27 00:05:09,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:05:09,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:05:09,202 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 00:05:09,204 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 00:05:09,266 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-08-27 00:05:09,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 00:05:09,268 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-27 00:05:09,268 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:05:09,421 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 00:05:09,421 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:05:13,176 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 00:05:13,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625327453] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:05:13,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:05:13,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 16 [2023-08-27 00:05:13,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638351364] [2023-08-27 00:05:13,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:05:13,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-27 00:05:13,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:05:13,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-27 00:05:13,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2023-08-27 00:05:13,178 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 141 [2023-08-27 00:05:13,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 397 transitions, 5242 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 00:05:13,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:05:13,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 141 [2023-08-27 00:05:13,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:05:14,577 INFO L124 PetriNetUnfolderBase]: 950/1795 cut-off events. [2023-08-27 00:05:14,577 INFO L125 PetriNetUnfolderBase]: For 24439/24439 co-relation queries the response was YES. [2023-08-27 00:05:14,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12520 conditions, 1795 events. 950/1795 cut-off events. For 24439/24439 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 11114 event pairs, 104 based on Foata normal form. 3/1796 useless extension candidates. Maximal degree in co-relation 12435. Up to 1702 conditions per place. [2023-08-27 00:05:14,595 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 383 selfloop transitions, 40 changer transitions 8/431 dead transitions. [2023-08-27 00:05:14,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 431 transitions, 6336 flow [2023-08-27 00:05:14,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-08-27 00:05:14,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-08-27 00:05:14,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 997 transitions. [2023-08-27 00:05:14,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39282899921197795 [2023-08-27 00:05:14,596 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 997 transitions. [2023-08-27 00:05:14,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 997 transitions. [2023-08-27 00:05:14,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:05:14,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 997 transitions. [2023-08-27 00:05:14,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 55.388888888888886) internal successors, (997), 18 states have internal predecessors, (997), 0 states have call successors, (0), 0 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 00:05:14,599 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 00:05:14,599 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 00:05:14,599 INFO L175 Difference]: Start difference. First operand has 291 places, 397 transitions, 5242 flow. Second operand 18 states and 997 transitions. [2023-08-27 00:05:14,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 431 transitions, 6336 flow [2023-08-27 00:05:14,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 290 places, 431 transitions, 6110 flow, removed 83 selfloop flow, removed 16 redundant places. [2023-08-27 00:05:14,787 INFO L231 Difference]: Finished difference. Result has 294 places, 400 transitions, 5201 flow [2023-08-27 00:05:14,788 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=5016, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=397, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=5201, PETRI_PLACES=294, PETRI_TRANSITIONS=400} [2023-08-27 00:05:14,788 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 274 predicate places. [2023-08-27 00:05:14,788 INFO L495 AbstractCegarLoop]: Abstraction has has 294 places, 400 transitions, 5201 flow [2023-08-27 00:05:14,788 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 00:05:14,789 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:05:14,789 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:05:14,793 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 00:05:14,993 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 00:05:14,993 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 00:05:14,993 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:05:14,994 INFO L85 PathProgramCache]: Analyzing trace with hash 2031066063, now seen corresponding path program 19 times [2023-08-27 00:05:14,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:05:14,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466056014] [2023-08-27 00:05:14,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:05:14,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:05:15,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:05:15,344 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 00:05:15,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:05:15,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466056014] [2023-08-27 00:05:15,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466056014] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:05:15,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687043949] [2023-08-27 00:05:15,345 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-27 00:05:15,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:05:15,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:05:15,346 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 00:05:15,348 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 00:05:15,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:05:15,408 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-27 00:05:15,409 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:05:15,579 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 00:05:15,579 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:05:20,500 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 00:05:20,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687043949] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:05:20,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:05:20,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 17 [2023-08-27 00:05:20,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147182991] [2023-08-27 00:05:20,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:05:20,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-27 00:05:20,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:05:20,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-27 00:05:20,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2023-08-27 00:05:20,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 141 [2023-08-27 00:05:20,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 400 transitions, 5201 flow. Second operand has 19 states, 19 states have (on average 48.1578947368421) internal successors, (915), 19 states have internal predecessors, (915), 0 states have call successors, (0), 0 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 00:05:20,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:05:20,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 141 [2023-08-27 00:05:20,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:05:22,586 INFO L124 PetriNetUnfolderBase]: 973/1846 cut-off events. [2023-08-27 00:05:22,586 INFO L125 PetriNetUnfolderBase]: For 26107/26107 co-relation queries the response was YES. [2023-08-27 00:05:22,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12959 conditions, 1846 events. 973/1846 cut-off events. For 26107/26107 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 11528 event pairs, 98 based on Foata normal form. 3/1847 useless extension candidates. Maximal degree in co-relation 12872. Up to 1623 conditions per place. [2023-08-27 00:05:22,605 INFO L140 encePairwiseOnDemand]: 132/141 looper letters, 381 selfloop transitions, 64 changer transitions 12/457 dead transitions. [2023-08-27 00:05:22,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 457 transitions, 6673 flow [2023-08-27 00:05:22,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-08-27 00:05:22,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-08-27 00:05:22,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1121 transitions. [2023-08-27 00:05:22,607 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36137975499677627 [2023-08-27 00:05:22,607 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 1121 transitions. [2023-08-27 00:05:22,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 1121 transitions. [2023-08-27 00:05:22,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:05:22,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1121 transitions. [2023-08-27 00:05:22,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 50.95454545454545) internal successors, (1121), 22 states have internal predecessors, (1121), 0 states have call successors, (0), 0 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 00:05:22,610 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 00:05:22,610 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 00:05:22,610 INFO L175 Difference]: Start difference. First operand has 294 places, 400 transitions, 5201 flow. Second operand 22 states and 1121 transitions. [2023-08-27 00:05:22,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 457 transitions, 6673 flow [2023-08-27 00:05:22,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 457 transitions, 6525 flow, removed 43 selfloop flow, removed 14 redundant places. [2023-08-27 00:05:22,772 INFO L231 Difference]: Finished difference. Result has 304 places, 407 transitions, 5501 flow [2023-08-27 00:05:22,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=5057, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=5501, PETRI_PLACES=304, PETRI_TRANSITIONS=407} [2023-08-27 00:05:22,777 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 284 predicate places. [2023-08-27 00:05:22,777 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 407 transitions, 5501 flow [2023-08-27 00:05:22,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 48.1578947368421) internal successors, (915), 19 states have internal predecessors, (915), 0 states have call successors, (0), 0 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 00:05:22,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:05:22,778 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:05:22,785 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 00:05:22,983 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 00:05:22,983 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 00:05:22,983 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:05:22,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1696248935, now seen corresponding path program 5 times [2023-08-27 00:05:22,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:05:22,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546104508] [2023-08-27 00:05:22,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:05:22,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:05:23,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:05:23,239 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 00:05:23,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:05:23,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546104508] [2023-08-27 00:05:23,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546104508] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:05:23,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625051210] [2023-08-27 00:05:23,240 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-27 00:05:23,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:05:23,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:05:23,241 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 00:05:23,243 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 00:05:23,325 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-08-27 00:05:23,325 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 00:05:23,326 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-27 00:05:23,327 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:05:23,429 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 00:05:23,429 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:05:23,567 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 00:05:23,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625051210] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:05:23,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:05:23,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 4] total 12 [2023-08-27 00:05:23,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017309351] [2023-08-27 00:05:23,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:05:23,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-27 00:05:23,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:05:23,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-27 00:05:23,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2023-08-27 00:05:23,568 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 141 [2023-08-27 00:05:23,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 407 transitions, 5501 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 00:05:23,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:05:23,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 141 [2023-08-27 00:05:23,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:05:24,368 INFO L124 PetriNetUnfolderBase]: 955/1838 cut-off events. [2023-08-27 00:05:24,369 INFO L125 PetriNetUnfolderBase]: For 27697/27697 co-relation queries the response was YES. [2023-08-27 00:05:24,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13091 conditions, 1838 events. 955/1838 cut-off events. For 27697/27697 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 11712 event pairs, 70 based on Foata normal form. 5/1841 useless extension candidates. Maximal degree in co-relation 13002. Up to 1508 conditions per place. [2023-08-27 00:05:24,389 INFO L140 encePairwiseOnDemand]: 135/141 looper letters, 351 selfloop transitions, 79 changer transitions 25/462 dead transitions. [2023-08-27 00:05:24,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 462 transitions, 6872 flow [2023-08-27 00:05:24,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-27 00:05:24,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-27 00:05:24,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1098 transitions. [2023-08-27 00:05:24,391 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45807259073842305 [2023-08-27 00:05:24,391 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1098 transitions. [2023-08-27 00:05:24,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1098 transitions. [2023-08-27 00:05:24,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:05:24,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1098 transitions. [2023-08-27 00:05:24,392 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 00:05:24,394 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 00:05:24,394 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 00:05:24,394 INFO L175 Difference]: Start difference. First operand has 304 places, 407 transitions, 5501 flow. Second operand 17 states and 1098 transitions. [2023-08-27 00:05:24,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 462 transitions, 6872 flow [2023-08-27 00:05:24,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 462 transitions, 6516 flow, removed 149 selfloop flow, removed 18 redundant places. [2023-08-27 00:05:24,583 INFO L231 Difference]: Finished difference. Result has 304 places, 406 transitions, 5353 flow [2023-08-27 00:05:24,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=5155, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=5353, PETRI_PLACES=304, PETRI_TRANSITIONS=406} [2023-08-27 00:05:24,584 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 284 predicate places. [2023-08-27 00:05:24,584 INFO L495 AbstractCegarLoop]: Abstraction has has 304 places, 406 transitions, 5353 flow [2023-08-27 00:05:24,584 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 00:05:24,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:05:24,585 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:05:24,592 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 00:05:24,792 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 00:05:24,793 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 00:05:24,794 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:05:24,794 INFO L85 PathProgramCache]: Analyzing trace with hash 904853901, now seen corresponding path program 6 times [2023-08-27 00:05:24,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:05:24,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082507075] [2023-08-27 00:05:24,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:05:24,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:05:24,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:05:25,041 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 00:05:25,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:05:25,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082507075] [2023-08-27 00:05:25,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082507075] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:05:25,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38564016] [2023-08-27 00:05:25,042 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-27 00:05:25,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:05:25,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:05:25,043 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 00:05:25,045 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 00:05:25,144 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-08-27 00:05:25,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 00:05:25,145 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-27 00:05:25,146 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:05:25,267 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 00:05:25,267 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:05:31,521 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_z_374 Int) (v_y_374 Int)) (let ((.cse0 (+ (* 2863311531 v_z_374) (* v_y_374 4294967296))) (.cse2 (+ .cse3 v_z_374))) (or (< v_z_374 0) (< 0 .cse0) (< .cse0 0) (= .cse1 .cse2) (<= 4294967296 .cse2)))) (forall ((v_z_374 Int) (v_y_374 Int)) (let ((.cse4 (+ (* 2863311531 v_z_374) (* v_y_374 4294967296))) (.cse5 (+ .cse3 v_z_374))) (or (< v_z_374 0) (< 0 .cse4) (< .cse4 0) (<= 4294967296 v_z_374) (= (+ .cse1 4294967296) .cse5) (= .cse1 .cse5)))))) is different from false [2023-08-27 00:05:40,184 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~x_2~0 4294967296)) (.cse2 (mod c_~x_1~0 4294967296))) (and (forall ((v_z_374 Int) (v_y_374 Int)) (let ((.cse0 (+ (* 2863311531 v_z_374) (* v_y_374 4294967296)))) (or (< v_z_374 0) (< 0 .cse0) (< .cse0 0) (<= 4294967296 v_z_374) (= .cse1 (+ .cse2 v_z_374))))) (forall ((v_z_374 Int) (v_y_374 Int)) (let ((.cse3 (+ (* 2863311531 v_z_374) (* v_y_374 4294967296))) (.cse4 (+ .cse2 v_z_374))) (or (< v_z_374 0) (< 0 .cse3) (< .cse3 0) (= .cse1 .cse4) (<= 4294967296 .cse4)))))) is different from false [2023-08-27 00:05:46,377 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 00:05:46,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38564016] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:05:46,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:05:46,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 15 [2023-08-27 00:05:46,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176030981] [2023-08-27 00:05:46,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:05:46,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-27 00:05:46,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:05:46,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-27 00:05:46,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=149, Unknown=2, NotChecked=54, Total=272 [2023-08-27 00:05:46,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 141 [2023-08-27 00:05:46,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 406 transitions, 5353 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 00:05:46,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:05:46,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 141 [2023-08-27 00:05:46,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:05:48,404 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~x_2~0 4294967296)) (.cse2 (mod c_~x_1~0 4294967296))) (and (forall ((v_z_374 Int) (v_y_374 Int)) (let ((.cse0 (+ (* 2863311531 v_z_374) (* v_y_374 4294967296)))) (or (< v_z_374 0) (< 0 .cse0) (< .cse0 0) (<= 4294967296 v_z_374) (= .cse1 (+ .cse2 v_z_374))))) (forall ((v_z_374 Int) (v_y_374 Int)) (let ((.cse3 (+ (* 2863311531 v_z_374) (* v_y_374 4294967296))) (.cse4 (+ .cse2 v_z_374))) (or (< v_z_374 0) (< 0 .cse3) (< .cse3 0) (= .cse1 .cse4) (<= 4294967296 .cse4)))) (= c_~x_2~0 0) (<= 0 c_~x_1~0) (<= c_~x_1~0 0))) is different from false [2023-08-27 00:05:50,438 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_z_374 Int) (v_y_374 Int)) (let ((.cse0 (+ (* 2863311531 v_z_374) (* v_y_374 4294967296))) (.cse2 (+ .cse3 v_z_374))) (or (< v_z_374 0) (< 0 .cse0) (< .cse0 0) (= .cse1 .cse2) (<= 4294967296 .cse2)))) (forall ((v_z_374 Int) (v_y_374 Int)) (let ((.cse4 (+ (* 2863311531 v_z_374) (* v_y_374 4294967296))) (.cse5 (+ .cse3 v_z_374))) (or (< v_z_374 0) (< 0 .cse4) (< .cse4 0) (<= 4294967296 v_z_374) (= (+ .cse1 4294967296) .cse5) (= .cse1 .cse5)))) (= c_~x_2~0 0) (<= 0 c_~x_1~0) (<= c_~x_1~0 0))) is different from false [2023-08-27 00:05:51,600 INFO L124 PetriNetUnfolderBase]: 1006/1939 cut-off events. [2023-08-27 00:05:51,600 INFO L125 PetriNetUnfolderBase]: For 32483/32483 co-relation queries the response was YES. [2023-08-27 00:05:51,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14181 conditions, 1939 events. 1006/1939 cut-off events. For 32483/32483 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 12438 event pairs, 95 based on Foata normal form. 3/1940 useless extension candidates. Maximal degree in co-relation 14091. Up to 1448 conditions per place. [2023-08-27 00:05:51,617 INFO L140 encePairwiseOnDemand]: 134/141 looper letters, 377 selfloop transitions, 79 changer transitions 10/473 dead transitions. [2023-08-27 00:05:51,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 473 transitions, 7168 flow [2023-08-27 00:05:51,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-27 00:05:51,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-27 00:05:51,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 911 transitions. [2023-08-27 00:05:51,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.461499493414387 [2023-08-27 00:05:51,619 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 911 transitions. [2023-08-27 00:05:51,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 911 transitions. [2023-08-27 00:05:51,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:05:51,619 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 911 transitions. [2023-08-27 00:05:51,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 65.07142857142857) internal successors, (911), 14 states have internal predecessors, (911), 0 states have call successors, (0), 0 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 00:05:51,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 141.0) internal successors, (2115), 15 states have internal predecessors, (2115), 0 states have call successors, (0), 0 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 00:05:51,621 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 141.0) internal successors, (2115), 15 states have internal predecessors, (2115), 0 states have call successors, (0), 0 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 00:05:51,621 INFO L175 Difference]: Start difference. First operand has 304 places, 406 transitions, 5353 flow. Second operand 14 states and 911 transitions. [2023-08-27 00:05:51,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 473 transitions, 7168 flow [2023-08-27 00:05:51,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 473 transitions, 7020 flow, removed 20 selfloop flow, removed 13 redundant places. [2023-08-27 00:05:51,790 INFO L231 Difference]: Finished difference. Result has 305 places, 417 transitions, 5737 flow [2023-08-27 00:05:51,791 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=5214, PETRI_DIFFERENCE_MINUEND_PLACES=288, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=406, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=5737, PETRI_PLACES=305, PETRI_TRANSITIONS=417} [2023-08-27 00:05:51,791 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 285 predicate places. [2023-08-27 00:05:51,791 INFO L495 AbstractCegarLoop]: Abstraction has has 305 places, 417 transitions, 5737 flow [2023-08-27 00:05:51,791 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 00:05:51,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:05:51,791 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:05:51,805 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 00:05:51,997 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 00:05:51,998 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 00:05:51,998 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:05:51,998 INFO L85 PathProgramCache]: Analyzing trace with hash -131827249, now seen corresponding path program 7 times [2023-08-27 00:05:51,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:05:51,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732754933] [2023-08-27 00:05:51,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:05:51,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:05:52,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:05:52,150 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 00:05:52,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:05:52,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732754933] [2023-08-27 00:05:52,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732754933] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:05:52,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081520594] [2023-08-27 00:05:52,150 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-27 00:05:52,150 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:05:52,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:05:52,151 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 00:05:52,154 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 00:05:52,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:05:52,240 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-27 00:05:52,241 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:05:52,356 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 00:05:52,356 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:06:15,116 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_z_378 Int) (v_y_378 Int)) (let ((.cse0 (+ (* v_y_378 4294967296) (* 2863311531 v_z_378))) (.cse1 (+ .cse3 v_z_378))) (or (< v_z_378 0) (< .cse0 0) (<= 4294967296 .cse1) (< 0 .cse0) (= .cse2 .cse1)))) (forall ((v_z_378 Int) (v_y_378 Int)) (let ((.cse4 (+ (* v_y_378 4294967296) (* 2863311531 v_z_378)))) (or (< v_z_378 0) (< .cse4 0) (< 0 .cse4) (<= 4294967296 v_z_378) (= .cse2 (+ .cse3 v_z_378))))) (forall ((v_z_378 Int) (v_y_378 Int)) (let ((.cse6 (+ (* v_y_378 4294967296) (* 2863311531 v_z_378))) (.cse5 (+ .cse3 v_z_378))) (or (= (+ .cse2 4294967296) .cse5) (< .cse6 0) (< 0 .cse6) (<= 4294967296 v_z_378) (< .cse5 4294967296)))))) is different from false [2023-08-27 00:06:29,497 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_z_378 Int) (v_y_378 Int)) (let ((.cse0 (+ (* v_y_378 4294967296) (* 2863311531 v_z_378))) (.cse1 (+ .cse3 v_z_378))) (or (< v_z_378 0) (< .cse0 0) (<= 4294967296 .cse1) (< 0 .cse0) (= .cse2 .cse1)))) (forall ((v_z_378 Int) (v_y_378 Int)) (let ((.cse4 (+ (* v_y_378 4294967296) (* 2863311531 v_z_378)))) (or (< v_z_378 0) (< .cse4 0) (< 0 .cse4) (<= 4294967296 v_z_378) (= .cse2 (+ .cse3 v_z_378))))))) is different from false [2023-08-27 00:06:29,653 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 00:06:29,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081520594] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:06:29,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:06:29,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 16 [2023-08-27 00:06:29,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858120342] [2023-08-27 00:06:29,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:06:29,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-27 00:06:29,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:06:29,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-27 00:06:29,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=175, Unknown=2, NotChecked=58, Total=306 [2023-08-27 00:06:29,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 141 [2023-08-27 00:06:29,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 417 transitions, 5737 flow. Second operand has 18 states, 18 states have (on average 61.111111111111114) internal successors, (1100), 18 states have internal predecessors, (1100), 0 states have call successors, (0), 0 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 00:06:29,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:06:29,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 141 [2023-08-27 00:06:29,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:06:31,681 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_z_378 Int) (v_y_378 Int)) (let ((.cse0 (+ (* v_y_378 4294967296) (* 2863311531 v_z_378))) (.cse1 (+ .cse3 v_z_378))) (or (< v_z_378 0) (< .cse0 0) (<= 4294967296 .cse1) (< 0 .cse0) (= .cse2 .cse1)))) (= c_~x_2~0 0) (forall ((v_z_378 Int) (v_y_378 Int)) (let ((.cse4 (+ (* v_y_378 4294967296) (* 2863311531 v_z_378)))) (or (< v_z_378 0) (< .cse4 0) (< 0 .cse4) (<= 4294967296 v_z_378) (= .cse2 (+ .cse3 v_z_378))))) (<= 0 c_~x_1~0) (<= c_~x_1~0 0))) is different from false [2023-08-27 00:06:33,738 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_z_378 Int) (v_y_378 Int)) (let ((.cse0 (+ (* v_y_378 4294967296) (* 2863311531 v_z_378))) (.cse1 (+ .cse3 v_z_378))) (or (< v_z_378 0) (< .cse0 0) (<= 4294967296 .cse1) (< 0 .cse0) (= .cse2 .cse1)))) (= c_~x_2~0 0) (forall ((v_z_378 Int) (v_y_378 Int)) (let ((.cse4 (+ (* v_y_378 4294967296) (* 2863311531 v_z_378)))) (or (< v_z_378 0) (< .cse4 0) (< 0 .cse4) (<= 4294967296 v_z_378) (= .cse2 (+ .cse3 v_z_378))))) (<= 0 c_~x_1~0) (forall ((v_z_378 Int) (v_y_378 Int)) (let ((.cse6 (+ (* v_y_378 4294967296) (* 2863311531 v_z_378))) (.cse5 (+ .cse3 v_z_378))) (or (= (+ .cse2 4294967296) .cse5) (< .cse6 0) (< 0 .cse6) (<= 4294967296 v_z_378) (< .cse5 4294967296)))) (<= c_~x_1~0 0))) is different from false [2023-08-27 00:06:35,764 INFO L124 PetriNetUnfolderBase]: 1198/2343 cut-off events. [2023-08-27 00:06:35,764 INFO L125 PetriNetUnfolderBase]: For 45205/45205 co-relation queries the response was YES. [2023-08-27 00:06:35,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17590 conditions, 2343 events. 1198/2343 cut-off events. For 45205/45205 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 15899 event pairs, 235 based on Foata normal form. 4/2343 useless extension candidates. Maximal degree in co-relation 17500. Up to 1639 conditions per place. [2023-08-27 00:06:35,794 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 425 selfloop transitions, 84 changer transitions 32/548 dead transitions. [2023-08-27 00:06:35,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 548 transitions, 8620 flow [2023-08-27 00:06:35,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-27 00:06:35,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-27 00:06:35,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 973 transitions. [2023-08-27 00:06:35,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46004728132387707 [2023-08-27 00:06:35,803 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 973 transitions. [2023-08-27 00:06:35,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 973 transitions. [2023-08-27 00:06:35,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:06:35,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 973 transitions. [2023-08-27 00:06:35,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 64.86666666666666) internal successors, (973), 15 states have internal predecessors, (973), 0 states have call successors, (0), 0 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 00:06:35,814 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 00:06:35,814 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 00:06:35,814 INFO L175 Difference]: Start difference. First operand has 305 places, 417 transitions, 5737 flow. Second operand 15 states and 973 transitions. [2023-08-27 00:06:35,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 548 transitions, 8620 flow [2023-08-27 00:06:36,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 548 transitions, 8385 flow, removed 94 selfloop flow, removed 5 redundant places. [2023-08-27 00:06:36,107 INFO L231 Difference]: Finished difference. Result has 327 places, 462 transitions, 6718 flow [2023-08-27 00:06:36,107 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=5612, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=6718, PETRI_PLACES=327, PETRI_TRANSITIONS=462} [2023-08-27 00:06:36,108 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 307 predicate places. [2023-08-27 00:06:36,108 INFO L495 AbstractCegarLoop]: Abstraction has has 327 places, 462 transitions, 6718 flow [2023-08-27 00:06:36,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 61.111111111111114) internal successors, (1100), 18 states have internal predecessors, (1100), 0 states have call successors, (0), 0 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 00:06:36,108 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:06:36,108 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:06:36,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2023-08-27 00:06:36,323 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 00:06:36,324 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 00:06:36,324 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:06:36,324 INFO L85 PathProgramCache]: Analyzing trace with hash 985373443, now seen corresponding path program 20 times [2023-08-27 00:06:36,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:06:36,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708255856] [2023-08-27 00:06:36,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:06:36,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:06:36,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:06:37,041 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 00:06:37,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:06:37,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708255856] [2023-08-27 00:06:37,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708255856] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:06:37,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928611372] [2023-08-27 00:06:37,042 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 00:06:37,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:06:37,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:06:37,043 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 00:06:37,044 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 00:06:37,178 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 00:06:37,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 00:06:37,179 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 29 conjunts are in the unsatisfiable core [2023-08-27 00:06:37,180 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:06:37,507 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 00:06:37,507 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:06:41,936 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse5 (* (div (+ (mod c_~x_1~0 4294967296) (- 4294967294)) 4294967296) 4294967296)) (.cse1 (* 4294967296 (div c_~x_1~0 4294967296))) (.cse3 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296))) (and (forall ((v_z_384 Int)) (or (<= v_z_384 .cse0) (let ((.cse2 (* 2 v_z_384))) (< (+ c_~x_2~0 .cse1 .cse2) (+ (* (div (+ c_~x_2~0 .cse2) 4294967296) 4294967296) c_~x_1~0 3))) (< .cse3 v_z_384))) (forall ((v_z_384 Int)) (or (<= v_z_384 .cse0) (let ((.cse4 (* 2 v_z_384))) (< (+ (* (div (+ c_~x_2~0 .cse4) 4294967296) 4294967296) c_~x_1~0) (+ .cse5 c_~x_2~0 4294967295 .cse1 .cse4))) (< .cse3 v_z_384))) (forall ((v_z_384 Int)) (or (<= v_z_384 .cse0) (forall ((v_y_387 Int)) (let ((.cse7 (* 2 v_z_384))) (let ((.cse8 (* (div (+ c_~x_2~0 .cse7) 4294967296) 4294967296)) (.cse6 (* v_y_387 4294967296))) (or (< 0 v_y_387) (< (+ c_~x_2~0 .cse6 .cse1 .cse7 4294967293) (+ .cse8 c_~x_1~0)) (< v_y_387 0) (< (+ .cse8 c_~x_1~0 1) (+ c_~x_2~0 .cse6 .cse1 .cse7)))))) (< .cse3 v_z_384))) (forall ((v_z_384 Int)) (or (<= v_z_384 .cse0) (< .cse3 v_z_384) (let ((.cse9 (* 2 v_z_384))) (< (+ (* (div (+ c_~x_2~0 .cse9) 4294967296) 4294967296) c_~x_1~0) (+ c_~x_2~0 4294967295 .cse1 .cse9))))) (forall ((v_z_384 Int)) (or (<= v_z_384 .cse0) (let ((.cse10 (* 2 v_z_384))) (< (+ .cse5 c_~x_2~0 .cse1 .cse10 4294967293) (+ (* (div (+ c_~x_2~0 .cse10) 4294967296) 4294967296) c_~x_1~0))) (< .cse3 v_z_384))))) is different from false [2023-08-27 00:06:42,181 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 00:06:42,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928611372] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:06:42,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:06:42,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 23 [2023-08-27 00:06:42,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971702131] [2023-08-27 00:06:42,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:06:42,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-27 00:06:42,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:06:42,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-27 00:06:42,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=447, Unknown=1, NotChecked=44, Total=600 [2023-08-27 00:06:42,183 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 141 [2023-08-27 00:06:42,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 462 transitions, 6718 flow. Second operand has 25 states, 25 states have (on average 47.84) internal successors, (1196), 25 states have internal predecessors, (1196), 0 states have call successors, (0), 0 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 00:06:42,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:06:42,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 141 [2023-08-27 00:06:42,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:06:45,668 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 00:06:49,180 INFO L124 PetriNetUnfolderBase]: 1226/2375 cut-off events. [2023-08-27 00:06:49,181 INFO L125 PetriNetUnfolderBase]: For 44514/44514 co-relation queries the response was YES. [2023-08-27 00:06:49,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18110 conditions, 2375 events. 1226/2375 cut-off events. For 44514/44514 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 15988 event pairs, 142 based on Foata normal form. 4/2377 useless extension candidates. Maximal degree in co-relation 18007. Up to 1928 conditions per place. [2023-08-27 00:06:49,207 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 396 selfloop transitions, 130 changer transitions 16/542 dead transitions. [2023-08-27 00:06:49,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 542 transitions, 8234 flow [2023-08-27 00:06:49,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-08-27 00:06:49,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-08-27 00:06:49,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 1438 transitions. [2023-08-27 00:06:49,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36423505572441744 [2023-08-27 00:06:49,210 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 1438 transitions. [2023-08-27 00:06:49,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 1438 transitions. [2023-08-27 00:06:49,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:06:49,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 1438 transitions. [2023-08-27 00:06:49,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 51.357142857142854) internal successors, (1438), 28 states have internal predecessors, (1438), 0 states have call successors, (0), 0 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 00:06:49,214 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 141.0) internal successors, (4089), 29 states have internal predecessors, (4089), 0 states have call successors, (0), 0 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 00:06:49,214 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 141.0) internal successors, (4089), 29 states have internal predecessors, (4089), 0 states have call successors, (0), 0 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 00:06:49,214 INFO L175 Difference]: Start difference. First operand has 327 places, 462 transitions, 6718 flow. Second operand 28 states and 1438 transitions. [2023-08-27 00:06:49,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 542 transitions, 8234 flow [2023-08-27 00:06:49,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 542 transitions, 8177 flow, removed 26 selfloop flow, removed 5 redundant places. [2023-08-27 00:06:49,491 INFO L231 Difference]: Finished difference. Result has 351 places, 469 transitions, 7137 flow [2023-08-27 00:06:49,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=6660, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=461, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=7137, PETRI_PLACES=351, PETRI_TRANSITIONS=469} [2023-08-27 00:06:49,492 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 331 predicate places. [2023-08-27 00:06:49,492 INFO L495 AbstractCegarLoop]: Abstraction has has 351 places, 469 transitions, 7137 flow [2023-08-27 00:06:49,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 47.84) internal successors, (1196), 25 states have internal predecessors, (1196), 0 states have call successors, (0), 0 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 00:06:49,493 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:06:49,493 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:06:49,498 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 00:06:49,698 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 00:06:49,698 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 00:06:49,698 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:06:49,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1698880673, now seen corresponding path program 8 times [2023-08-27 00:06:49,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:06:49,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612161999] [2023-08-27 00:06:49,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:06:49,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:06:49,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:06:49,860 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 00:06:49,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:06:49,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612161999] [2023-08-27 00:06:49,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612161999] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:06:49,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [687311708] [2023-08-27 00:06:49,861 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 00:06:49,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:06:49,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:06:49,877 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 00:06:49,888 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 00:06:49,999 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 00:06:49,999 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 00:06:50,000 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 22 conjunts are in the unsatisfiable core [2023-08-27 00:06:50,001 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:06:50,212 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 00:06:50,212 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:07:15,517 WARN L234 SmtUtils]: Spent 8.76s on a formula simplification. DAG size of input: 31 DAG size of output: 27 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 00:07:19,588 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_y_392 Int) (v_z_392 Int)) (let ((.cse2 (+ (* 2863311531 v_z_392) (* v_y_392 4294967296))) (.cse0 (+ (mod c_~x_1~0 4294967296) v_z_392)) (.cse1 (mod c_~x_2~0 4294967296))) (or (<= 4294967296 v_z_392) (= .cse0 (+ .cse1 4294967296)) (< v_z_392 0) (< 0 .cse2) (< .cse2 0) (= .cse0 .cse1)))) is different from false [2023-08-27 00:07:21,715 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_y_392 Int) (v_z_392 Int)) (let ((.cse0 (+ (* 2863311531 v_z_392) (* v_y_392 4294967296)))) (or (<= 4294967296 v_z_392) (< v_z_392 0) (< 0 .cse0) (< .cse0 0) (= (+ (mod c_~x_1~0 4294967296) v_z_392) (mod c_~x_2~0 4294967296))))) is different from false [2023-08-27 00:07:23,782 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 00:07:23,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [687311708] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:07:23,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:07:23,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 21 [2023-08-27 00:07:23,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436874841] [2023-08-27 00:07:23,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:07:23,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-27 00:07:23,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:07:23,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-27 00:07:23,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=323, Unknown=9, NotChecked=78, Total=506 [2023-08-27 00:07:23,784 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 141 [2023-08-27 00:07:23,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 469 transitions, 7137 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 00:07:23,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:07:23,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 141 [2023-08-27 00:07:23,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:07:25,793 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 00:07:27,831 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_y_392 Int) (v_z_392 Int)) (let ((.cse0 (+ (* 2863311531 v_z_392) (* v_y_392 4294967296)))) (or (<= 4294967296 v_z_392) (< v_z_392 0) (< 0 .cse0) (< .cse0 0) (= (+ (mod c_~x_1~0 4294967296) v_z_392) (mod c_~x_2~0 4294967296))))) (= c_~x_2~0 0) (<= 0 c_~x_1~0) (<= c_~x_1~0 0)) is different from false [2023-08-27 00:07:29,846 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 00:07:31,941 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 00:07:33,966 WARN L839 $PredicateComparison]: unable to prove that (and (= c_~x_2~0 0) (forall ((v_y_392 Int) (v_z_392 Int)) (let ((.cse2 (+ (* 2863311531 v_z_392) (* v_y_392 4294967296))) (.cse0 (+ (mod c_~x_1~0 4294967296) v_z_392)) (.cse1 (mod c_~x_2~0 4294967296))) (or (<= 4294967296 v_z_392) (= .cse0 (+ .cse1 4294967296)) (< v_z_392 0) (< 0 .cse2) (< .cse2 0) (= .cse0 .cse1)))) (<= 0 c_~x_1~0) (<= c_~x_1~0 0)) is different from false [2023-08-27 00:07:35,994 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 00:07:38,136 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 00:07:40,196 WARN L839 $PredicateComparison]: unable to prove that (and (or (< 4294967294 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (forall ((v_y_392 Int) (v_z_392 Int)) (let ((.cse2 (+ (* 2863311531 v_z_392) (* v_y_392 4294967296))) (.cse0 (+ (mod c_~x_1~0 4294967296) v_z_392)) (.cse1 (mod c_~x_2~0 4294967296))) (or (<= 4294967296 v_z_392) (= .cse0 (+ .cse1 4294967296)) (< v_z_392 0) (< 0 .cse2) (< .cse2 0) (= .cse0 .cse1))))) (= 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 00:07:42,244 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (< (mod c_thread2Thread1of1ForFork1_~i~1 4294967296) (mod c_~a~0 4294967296))) (.cse1 (mod c_~x_2~0 4294967296))) (and (or (< 4294967294 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (forall ((v_y_392 Int) (v_z_392 Int)) (let ((.cse2 (+ (* 2863311531 v_z_392) (* v_y_392 4294967296))) (.cse0 (+ (mod c_~x_1~0 4294967296) v_z_392))) (or (<= 4294967296 v_z_392) (= .cse0 (+ .cse1 4294967296)) (< v_z_392 0) (< 0 .cse2) (< .cse2 0) (= .cse0 .cse1))))) (or (= .cse1 (mod (+ c_~x_1~0 c_~a~0) 4294967296)) .cse3) (or .cse3 (= .cse1 (mod (+ c_~x_1~0 (* 2 c_~a~0)) 4294967296))) (= 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 00:07:44,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 00:07:49,366 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 00:07:51,382 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 00:07:55,779 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 00:08:01,976 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 00:08:03,987 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 00:08:06,107 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 00:08:08,135 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 00:08:12,462 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 00:08:14,477 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 00:08:16,488 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 00:08:18,514 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 00:08:20,589 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 00:08:22,677 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 00:08:24,735 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 00:08:26,753 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 00:08:28,800 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 00:08:30,865 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 00:08:32,885 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 00:08:34,927 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 00:08:36,967 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 00:08:39,008 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 00:08:39,057 INFO L124 PetriNetUnfolderBase]: 1331/2647 cut-off events. [2023-08-27 00:08:39,057 INFO L125 PetriNetUnfolderBase]: For 58335/58335 co-relation queries the response was YES. [2023-08-27 00:08:39,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21528 conditions, 2647 events. 1331/2647 cut-off events. For 58335/58335 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 18665 event pairs, 98 based on Foata normal form. 16/2661 useless extension candidates. Maximal degree in co-relation 21421. Up to 1761 conditions per place. [2023-08-27 00:08:39,084 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 420 selfloop transitions, 125 changer transitions 76/621 dead transitions. [2023-08-27 00:08:39,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 621 transitions, 10862 flow [2023-08-27 00:08:39,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-08-27 00:08:39,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-08-27 00:08:39,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1412 transitions. [2023-08-27 00:08:39,086 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4005673758865248 [2023-08-27 00:08:39,086 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 1412 transitions. [2023-08-27 00:08:39,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 1412 transitions. [2023-08-27 00:08:39,087 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:08:39,087 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 1412 transitions. [2023-08-27 00:08:39,088 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 56.48) internal successors, (1412), 25 states have internal predecessors, (1412), 0 states have call successors, (0), 0 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 00:08:39,090 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 00:08:39,090 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 00:08:39,090 INFO L175 Difference]: Start difference. First operand has 351 places, 469 transitions, 7137 flow. Second operand 25 states and 1412 transitions. [2023-08-27 00:08:39,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 621 transitions, 10862 flow [2023-08-27 00:08:39,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 621 transitions, 10546 flow, removed 54 selfloop flow, removed 20 redundant places. [2023-08-27 00:08:39,461 INFO L231 Difference]: Finished difference. Result has 365 places, 479 transitions, 7745 flow [2023-08-27 00:08:39,461 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=6883, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=469, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=86, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=7745, PETRI_PLACES=365, PETRI_TRANSITIONS=479} [2023-08-27 00:08:39,461 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 345 predicate places. [2023-08-27 00:08:39,462 INFO L495 AbstractCegarLoop]: Abstraction has has 365 places, 479 transitions, 7745 flow [2023-08-27 00:08:39,462 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 00:08:39,462 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:08:39,462 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:08:39,479 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 00:08:39,668 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 00:08:39,668 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 00:08:39,668 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:08:39,669 INFO L85 PathProgramCache]: Analyzing trace with hash 2034374791, now seen corresponding path program 21 times [2023-08-27 00:08:39,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:08:39,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383562337] [2023-08-27 00:08:39,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:08:39,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:08:39,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:08:40,139 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 00:08:40,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:08:40,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383562337] [2023-08-27 00:08:40,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383562337] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:08:40,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467043518] [2023-08-27 00:08:40,140 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-27 00:08:40,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:08:40,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:08:40,141 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 00:08:40,143 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 00:08:40,317 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-27 00:08:40,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 00:08:40,319 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 29 conjunts are in the unsatisfiable core [2023-08-27 00:08:40,320 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:08:40,701 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 00:08:40,701 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:08:42,405 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 00:08:42,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467043518] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:08:42,406 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:08:42,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 18 [2023-08-27 00:08:42,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435669642] [2023-08-27 00:08:42,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:08:42,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-27 00:08:42,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:08:42,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-27 00:08:42,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2023-08-27 00:08:42,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 141 [2023-08-27 00:08:42,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 479 transitions, 7745 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 00:08:42,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:08:42,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 141 [2023-08-27 00:08:42,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:08:44,909 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 00:08:47,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 00:08:50,277 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 00:08:52,292 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 00:08:54,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 [] [2023-08-27 00:08:57,160 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 00:08:58,054 INFO L124 PetriNetUnfolderBase]: 1170/2247 cut-off events. [2023-08-27 00:08:58,054 INFO L125 PetriNetUnfolderBase]: For 51576/51576 co-relation queries the response was YES. [2023-08-27 00:08:58,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19694 conditions, 2247 events. 1170/2247 cut-off events. For 51576/51576 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 14769 event pairs, 140 based on Foata normal form. 2/2247 useless extension candidates. Maximal degree in co-relation 19577. Up to 2055 conditions per place. [2023-08-27 00:08:58,078 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 397 selfloop transitions, 118 changer transitions 7/522 dead transitions. [2023-08-27 00:08:58,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 522 transitions, 9241 flow [2023-08-27 00:08:58,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-08-27 00:08:58,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-08-27 00:08:58,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1390 transitions. [2023-08-27 00:08:58,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3943262411347518 [2023-08-27 00:08:58,080 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 1390 transitions. [2023-08-27 00:08:58,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 1390 transitions. [2023-08-27 00:08:58,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:08:58,089 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 1390 transitions. [2023-08-27 00:08:58,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 55.6) internal successors, (1390), 25 states have internal predecessors, (1390), 0 states have call successors, (0), 0 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 00:08:58,111 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 00:08:58,111 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 00:08:58,111 INFO L175 Difference]: Start difference. First operand has 365 places, 479 transitions, 7745 flow. Second operand 25 states and 1390 transitions. [2023-08-27 00:08:58,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 522 transitions, 9241 flow [2023-08-27 00:08:58,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 522 transitions, 9000 flow, removed 70 selfloop flow, removed 19 redundant places. [2023-08-27 00:08:58,427 INFO L231 Difference]: Finished difference. Result has 357 places, 486 transitions, 7987 flow [2023-08-27 00:08:58,428 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=7554, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=479, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=7987, PETRI_PLACES=357, PETRI_TRANSITIONS=486} [2023-08-27 00:08:58,428 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 337 predicate places. [2023-08-27 00:08:58,428 INFO L495 AbstractCegarLoop]: Abstraction has has 357 places, 486 transitions, 7987 flow [2023-08-27 00:08:58,429 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 00:08:58,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:08:58,429 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:08:58,433 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 00:08:58,634 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 00:08:58,634 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 00:08:58,634 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:08:58,634 INFO L85 PathProgramCache]: Analyzing trace with hash 700864145, now seen corresponding path program 22 times [2023-08-27 00:08:58,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:08:58,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772140269] [2023-08-27 00:08:58,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:08:58,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:08:58,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:08:59,193 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 00:08:59,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:08:59,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772140269] [2023-08-27 00:08:59,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772140269] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:08:59,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114076268] [2023-08-27 00:08:59,194 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-27 00:08:59,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:08:59,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:08:59,195 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 00:08:59,208 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 00:08:59,288 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-27 00:08:59,288 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 00:08:59,289 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 29 conjunts are in the unsatisfiable core [2023-08-27 00:08:59,290 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:08:59,638 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 00:08:59,638 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:09:03,392 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse1 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse3 (* 4294967296 (div c_~x_1~0 4294967296))) (.cse4 (mod (+ c_thread2Thread1of1ForFork1_~i~1 1) 4294967296)) (.cse7 (mod c_~x_1~0 4294967296)) (.cse6 (mod (+ 2 c_thread2Thread1of1ForFork1_~i~1) 4294967296))) (and (forall ((v_z_423 Int)) (or (<= v_z_423 .cse0) (< .cse1 v_z_423) (let ((.cse2 (* 2 v_z_423))) (< (+ c_~x_2~0 .cse2 .cse3) (+ .cse4 (* (div (+ c_~x_2~0 .cse2) 4294967296) 4294967296) c_~x_1~0 2))))) (forall ((v_z_423 Int)) (or (let ((.cse5 (* 2 v_z_423))) (< (+ (* (div (+ c_~x_2~0 .cse5) 4294967296) 4294967296) c_~x_1~0 .cse6) (+ (* (div (+ .cse4 (- 4294967295)) 4294967296) 4294967296) c_~x_2~0 8589934593 .cse5 .cse3))) (<= v_z_423 .cse0) (< .cse1 v_z_423))) (or (forall ((v_z_423 Int)) (or (<= v_z_423 .cse0) (< .cse1 v_z_423) (< (+ (* 4294967296 (div (+ (- 1) (* (- 1) c_~x_2~0) c_~x_1~0 .cse6 (* (- 2) v_z_423)) 4294967296)) (* (div (+ c_~x_2~0 (* 2 v_z_423)) 4294967296) 4294967296) 4294967295) (+ .cse7 .cse3)))) (< 4294967294 (+ .cse7 .cse4))) (or (forall ((v_z_423 Int)) (or (<= v_z_423 .cse0) (< .cse1 v_z_423) (let ((.cse8 (* 2 v_z_423))) (< (+ c_~x_2~0 (* 4294967296 (div (+ (- 1) .cse7) 4294967296)) 4294967294 .cse8 .cse3) (+ .cse4 (* (div (+ c_~x_2~0 .cse8) 4294967296) 4294967296) c_~x_1~0))))) (< (div (+ .cse7 .cse6) 4294967296) 1)))) is different from false [2023-08-27 00:09:05,505 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (mod c_~x_1~0 4294967296)) (.cse0 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse1 (mod (+ c_thread1Thread1of1ForFork0_~i~0 1) 4294967296)) (.cse3 (* 4294967296 (div c_~x_1~0 4294967296)))) (and (forall ((v_z_423 Int)) (or (<= v_z_423 .cse0) (< .cse1 v_z_423) (let ((.cse2 (* 2 v_z_423))) (< (+ c_~x_2~0 .cse2 .cse3) (+ (* (div (+ c_~x_2~0 .cse2) 4294967296) 4294967296) c_~x_1~0 3))))) (or (< 4294967293 .cse4) (forall ((v_z_423 Int)) (or (<= v_z_423 .cse0) (< (+ (* (div (+ c_~x_2~0 (* 2 v_z_423)) 4294967296) 4294967296) 4294967295 (* 4294967296 (div (+ (* (- 1) c_~x_2~0) c_~x_1~0 (* (- 2) v_z_423) 1) 4294967296))) (+ .cse4 .cse3)) (< .cse1 v_z_423)))) (or (< (div (+ .cse4 2) 4294967296) 1) (forall ((v_z_423 Int)) (or (<= v_z_423 .cse0) (< .cse1 v_z_423) (let ((.cse5 (* 2 v_z_423))) (< (+ c_~x_2~0 (* 4294967296 (div (+ (- 1) .cse4) 4294967296)) .cse5 .cse3 4294967293) (+ (* (div (+ c_~x_2~0 .cse5) 4294967296) 4294967296) c_~x_1~0)))))) (forall ((v_z_423 Int)) (or (<= v_z_423 .cse0) (< .cse1 v_z_423) (let ((.cse6 (* 2 v_z_423))) (< (+ (* (div (+ c_~x_2~0 .cse6) 4294967296) 4294967296) c_~x_1~0) (+ c_~x_2~0 4294967295 .cse6 .cse3))))))) is different from false [2023-08-27 00:09:05,783 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 00:09:05,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114076268] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:09:05,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:09:05,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 21 [2023-08-27 00:09:05,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566086230] [2023-08-27 00:09:05,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:09:05,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-27 00:09:05,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:09:05,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-27 00:09:05,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=336, Unknown=2, NotChecked=78, Total=506 [2023-08-27 00:09:05,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 141 [2023-08-27 00:09:05,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 486 transitions, 7987 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 00:09:05,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:09:05,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 141 [2023-08-27 00:09:05,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:09:51,294 WARN L234 SmtUtils]: Spent 45.30s on a formula simplification. DAG size of input: 77 DAG size of output: 13 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 00:09:54,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-27 00:09:55,779 INFO L124 PetriNetUnfolderBase]: 1207/2310 cut-off events. [2023-08-27 00:09:55,780 INFO L125 PetriNetUnfolderBase]: For 48889/48889 co-relation queries the response was YES. [2023-08-27 00:09:55,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19998 conditions, 2310 events. 1207/2310 cut-off events. For 48889/48889 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 15258 event pairs, 153 based on Foata normal form. 2/2310 useless extension candidates. Maximal degree in co-relation 19888. Up to 2120 conditions per place. [2023-08-27 00:09:55,806 INFO L140 encePairwiseOnDemand]: 133/141 looper letters, 452 selfloop transitions, 76 changer transitions 12/540 dead transitions. [2023-08-27 00:09:55,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 540 transitions, 9620 flow [2023-08-27 00:09:55,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-27 00:09:55,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-27 00:09:55,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1020 transitions. [2023-08-27 00:09:55,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3617021276595745 [2023-08-27 00:09:55,808 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1020 transitions. [2023-08-27 00:09:55,808 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1020 transitions. [2023-08-27 00:09:55,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:09:55,808 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1020 transitions. [2023-08-27 00:09:55,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 51.0) internal successors, (1020), 20 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 00:09:55,810 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 00:09:55,811 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 00:09:55,811 INFO L175 Difference]: Start difference. First operand has 357 places, 486 transitions, 7987 flow. Second operand 20 states and 1020 transitions. [2023-08-27 00:09:55,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 540 transitions, 9620 flow [2023-08-27 00:09:56,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 540 transitions, 9349 flow, removed 47 selfloop flow, removed 22 redundant places. [2023-08-27 00:09:56,089 INFO L231 Difference]: Finished difference. Result has 361 places, 496 transitions, 8181 flow [2023-08-27 00:09:56,090 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=7716, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=486, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=8181, PETRI_PLACES=361, PETRI_TRANSITIONS=496} [2023-08-27 00:09:56,090 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 341 predicate places. [2023-08-27 00:09:56,090 INFO L495 AbstractCegarLoop]: Abstraction has has 361 places, 496 transitions, 8181 flow [2023-08-27 00:09:56,091 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 00:09:56,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:09:56,091 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:09:56,098 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 00:09:56,295 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 00:09:56,296 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 00:09:56,297 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:09:56,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1954541561, now seen corresponding path program 5 times [2023-08-27 00:09:56,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:09:56,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049692176] [2023-08-27 00:09:56,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:09:56,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:09:56,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:09:56,626 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 00:09:56,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:09:56,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049692176] [2023-08-27 00:09:56,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049692176] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:09:56,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597740185] [2023-08-27 00:09:56,626 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-27 00:09:56,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:09:56,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:09:56,627 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 00:09:56,630 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 00:09:56,712 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-08-27 00:09:56,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 00:09:56,714 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 28 conjunts are in the unsatisfiable core [2023-08-27 00:09:56,714 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:09:58,653 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 00:09:58,653 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:10:15,856 WARN L234 SmtUtils]: Spent 12.32s on a formula simplification. DAG size of input: 40 DAG size of output: 38 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 00:10:17,951 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse3 (mod c_~x_1~0 4294967296)) (.cse4 (mod c_~x_2~0 4294967296))) (and (forall ((v_y_427 Int) (v_z_427 Int)) (let ((.cse2 (+ (* v_y_427 4294967296) (* 2863311531 v_z_427))) (.cse0 (+ .cse4 v_z_427))) (or (<= 4294967296 .cse0) (< v_z_427 0) (< .cse1 .cse2) (< .cse2 0) (= .cse3 .cse0)))) (forall ((v_y_427 Int) (v_z_427 Int)) (let ((.cse5 (+ .cse4 v_z_427)) (.cse6 (+ (* v_y_427 4294967296) (* 2863311531 v_z_427)))) (or (<= 4294967296 v_z_427) (< .cse5 4294967296) (< .cse1 .cse6) (= (+ .cse3 4294967296) .cse5) (< .cse6 0)))))) is different from false [2023-08-27 00:10:34,513 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_~x_1~0 4294967296)) (.cse3 (mod c_~x_2~0 4294967296))) (and (forall ((v_y_427 Int) (v_z_427 Int)) (let ((.cse1 (+ (* v_y_427 4294967296) (* 2863311531 v_z_427))) (.cse0 (+ .cse3 v_z_427))) (or (<= 4294967296 .cse0) (< v_z_427 0) (< 0 .cse1) (< .cse1 0) (= .cse2 .cse0)))) (forall ((v_y_427 Int) (v_z_427 Int)) (let ((.cse4 (+ .cse3 v_z_427)) (.cse5 (+ (* v_y_427 4294967296) (* 2863311531 v_z_427)))) (or (<= 4294967296 v_z_427) (< .cse4 4294967296) (< 0 .cse5) (= (+ .cse2 4294967296) .cse4) (< .cse5 0)))))) is different from false [2023-08-27 00:10:47,876 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_y_427 Int) (v_z_427 Int)) (let ((.cse1 (+ (* v_y_427 4294967296) (* 2863311531 v_z_427))) (.cse0 (+ (mod c_~x_2~0 4294967296) v_z_427))) (or (<= 4294967296 .cse0) (< v_z_427 0) (< 0 .cse1) (< .cse1 0) (= (mod c_~x_1~0 4294967296) .cse0)))) is different from false [2023-08-27 00:10:52,073 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 00:10:52,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597740185] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:10:52,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:10:52,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 21 [2023-08-27 00:10:52,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914700468] [2023-08-27 00:10:52,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:10:52,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-27 00:10:52,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:10:52,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-27 00:10:52,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=296, Unknown=5, NotChecked=114, Total=506 [2023-08-27 00:10:52,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 141 [2023-08-27 00:10:52,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 496 transitions, 8181 flow. Second operand has 23 states, 23 states have (on average 52.82608695652174) internal successors, (1215), 23 states have internal predecessors, (1215), 0 states have call successors, (0), 0 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 00:10:52,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:10:52,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 141 [2023-08-27 00:10:52,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:10:54,112 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_y_427 Int) (v_z_427 Int)) (let ((.cse1 (+ (* v_y_427 4294967296) (* 2863311531 v_z_427))) (.cse0 (+ (mod c_~x_2~0 4294967296) v_z_427))) (or (<= 4294967296 .cse0) (< v_z_427 0) (< 0 .cse1) (< .cse1 0) (= (mod c_~x_1~0 4294967296) .cse0)))) (= c_~x_2~0 0) (<= 0 c_~x_1~0) (<= c_~x_1~0 0)) is different from false [2023-08-27 00:10:56,133 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 00:10:58,168 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_~x_1~0 4294967296)) (.cse3 (mod c_~x_2~0 4294967296))) (and (forall ((v_y_427 Int) (v_z_427 Int)) (let ((.cse1 (+ (* v_y_427 4294967296) (* 2863311531 v_z_427))) (.cse0 (+ .cse3 v_z_427))) (or (<= 4294967296 .cse0) (< v_z_427 0) (< 0 .cse1) (< .cse1 0) (= .cse2 .cse0)))) (= c_~x_2~0 0) (<= 0 c_~x_1~0) (forall ((v_y_427 Int) (v_z_427 Int)) (let ((.cse4 (+ .cse3 v_z_427)) (.cse5 (+ (* v_y_427 4294967296) (* 2863311531 v_z_427)))) (or (<= 4294967296 v_z_427) (< .cse4 4294967296) (< 0 .cse5) (= (+ .cse2 4294967296) .cse4) (< .cse5 0)))) (<= c_~x_1~0 0))) is different from false [2023-08-27 00:11:00,188 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 00:11:02,286 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse3 (mod c_~x_1~0 4294967296)) (.cse4 (mod c_~x_2~0 4294967296))) (and (= c_~x_2~0 0) (forall ((v_y_427 Int) (v_z_427 Int)) (let ((.cse2 (+ (* v_y_427 4294967296) (* 2863311531 v_z_427))) (.cse0 (+ .cse4 v_z_427))) (or (<= 4294967296 .cse0) (< v_z_427 0) (< .cse1 .cse2) (< .cse2 0) (= .cse3 .cse0)))) (forall ((v_y_427 Int) (v_z_427 Int)) (let ((.cse5 (+ .cse4 v_z_427)) (.cse6 (+ (* v_y_427 4294967296) (* 2863311531 v_z_427)))) (or (<= 4294967296 v_z_427) (< .cse5 4294967296) (< .cse1 .cse6) (= (+ .cse3 4294967296) .cse5) (< .cse6 0)))) (= c_thread1Thread1of1ForFork0_~i~0 0) (<= 0 c_~x_1~0) (<= c_~x_1~0 0))) is different from false [2023-08-27 00:11:04,295 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 00:11:06,314 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 00:11:08,354 WARN L839 $PredicateComparison]: unable to prove that (and (= c_~x_2~0 0) (= c_thread1Thread1of1ForFork0_~i~0 0) (<= 0 c_~x_1~0) (= c_thread2Thread1of1ForFork1_~i~1 0) (or (let ((.cse1 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse3 (mod c_~x_1~0 4294967296)) (.cse4 (mod c_~x_2~0 4294967296))) (and (forall ((v_y_427 Int) (v_z_427 Int)) (let ((.cse2 (+ (* v_y_427 4294967296) (* 2863311531 v_z_427))) (.cse0 (+ .cse4 v_z_427))) (or (<= 4294967296 .cse0) (< v_z_427 0) (< .cse1 .cse2) (< .cse2 0) (= .cse3 .cse0)))) (forall ((v_y_427 Int) (v_z_427 Int)) (let ((.cse5 (+ .cse4 v_z_427)) (.cse6 (+ (* v_y_427 4294967296) (* 2863311531 v_z_427)))) (or (<= 4294967296 v_z_427) (< .cse5 4294967296) (< .cse1 .cse6) (= (+ .cse3 4294967296) .cse5) (< .cse6 0)))))) (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296) (+ (mod c_thread2Thread1of1ForFork1_~i~1 4294967296) 1))) (<= c_~x_1~0 0)) is different from false [2023-08-27 00:11:10,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 00:11:12,423 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 00:11:18,855 INFO L124 PetriNetUnfolderBase]: 1253/2410 cut-off events. [2023-08-27 00:11:18,856 INFO L125 PetriNetUnfolderBase]: For 54248/54248 co-relation queries the response was YES. [2023-08-27 00:11:18,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21518 conditions, 2410 events. 1253/2410 cut-off events. For 54248/54248 co-relation queries the response was YES. Maximal size of possible extension queue 235. Compared 16093 event pairs, 183 based on Foata normal form. 3/2411 useless extension candidates. Maximal degree in co-relation 21402. Up to 2279 conditions per place. [2023-08-27 00:11:18,878 INFO L140 encePairwiseOnDemand]: 131/141 looper letters, 516 selfloop transitions, 49 changer transitions 13/578 dead transitions. [2023-08-27 00:11:18,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 578 transitions, 10576 flow [2023-08-27 00:11:18,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-08-27 00:11:18,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-08-27 00:11:18,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1279 transitions. [2023-08-27 00:11:18,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39438791242676535 [2023-08-27 00:11:18,881 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 1279 transitions. [2023-08-27 00:11:18,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 1279 transitions. [2023-08-27 00:11:18,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:11:18,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1279 transitions. [2023-08-27 00:11:18,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 55.608695652173914) internal successors, (1279), 23 states have internal predecessors, (1279), 0 states have call successors, (0), 0 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 00:11:18,884 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 00:11:18,884 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 00:11:18,884 INFO L175 Difference]: Start difference. First operand has 361 places, 496 transitions, 8181 flow. Second operand 23 states and 1279 transitions. [2023-08-27 00:11:18,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 578 transitions, 10576 flow [2023-08-27 00:11:19,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 578 transitions, 10331 flow, removed 71 selfloop flow, removed 12 redundant places. [2023-08-27 00:11:19,213 INFO L231 Difference]: Finished difference. Result has 381 places, 530 transitions, 9003 flow [2023-08-27 00:11:19,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=7974, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=496, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=460, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=9003, PETRI_PLACES=381, PETRI_TRANSITIONS=530} [2023-08-27 00:11:19,214 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 361 predicate places. [2023-08-27 00:11:19,214 INFO L495 AbstractCegarLoop]: Abstraction has has 381 places, 530 transitions, 9003 flow [2023-08-27 00:11:19,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 52.82608695652174) internal successors, (1215), 23 states have internal predecessors, (1215), 0 states have call successors, (0), 0 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 00:11:19,214 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:11:19,214 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:11:19,219 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 00:11:19,419 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 00:11:19,419 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 00:11:19,419 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:11:19,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1734571531, now seen corresponding path program 6 times [2023-08-27 00:11:19,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:11:19,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555383067] [2023-08-27 00:11:19,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:11:19,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:11:19,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:11:19,721 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 00:11:19,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:11:19,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555383067] [2023-08-27 00:11:19,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555383067] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:11:19,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395936494] [2023-08-27 00:11:19,722 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-27 00:11:19,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:11:19,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:11:19,723 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 00:11:19,724 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 00:11:19,805 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-08-27 00:11:19,805 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 00:11:19,806 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 28 conjunts are in the unsatisfiable core [2023-08-27 00:11:19,807 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:11:24,589 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 00:11:24,589 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:11:44,815 WARN L234 SmtUtils]: Spent 6.07s 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 00:11:46,865 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_z_432 Int) (v_y_432 Int)) (let ((.cse2 (+ (* 2863311531 v_z_432) (* v_y_432 4294967296))) (.cse0 (mod c_~x_1~0 4294967296)) (.cse1 (+ (mod c_~x_2~0 4294967296) v_z_432))) (or (= (+ .cse0 4294967296) .cse1) (< v_z_432 0) (< .cse2 0) (< (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) .cse2) (= .cse0 .cse1) (<= 4294967296 v_z_432)))) is different from false [2023-08-27 00:11:55,842 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_z_432 Int) (v_y_432 Int)) (let ((.cse2 (+ (* 2863311531 v_z_432) (* v_y_432 4294967296))) (.cse0 (mod c_~x_1~0 4294967296)) (.cse1 (+ (mod c_~x_2~0 4294967296) v_z_432))) (or (= (+ .cse0 4294967296) .cse1) (< 0 .cse2) (< v_z_432 0) (< .cse2 0) (= .cse0 .cse1) (<= 4294967296 v_z_432)))) is different from false [2023-08-27 00:12:18,019 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 00:12:18,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395936494] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:12:18,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:12:18,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 20 [2023-08-27 00:12:18,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236973705] [2023-08-27 00:12:18,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:12:18,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-27 00:12:18,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:12:18,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-27 00:12:18,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=283, Unknown=8, NotChecked=74, Total=462 [2023-08-27 00:12:18,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 141 [2023-08-27 00:12:18,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 530 transitions, 9003 flow. Second operand has 22 states, 22 states have (on average 52.90909090909091) internal successors, (1164), 22 states have internal predecessors, (1164), 0 states have call successors, (0), 0 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 00:12:18,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:12:18,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 141 [2023-08-27 00:12:18,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:12:20,054 WARN L839 $PredicateComparison]: unable to prove that (and (= c_~x_2~0 0) (forall ((v_z_432 Int) (v_y_432 Int)) (let ((.cse2 (+ (* 2863311531 v_z_432) (* v_y_432 4294967296))) (.cse0 (mod c_~x_1~0 4294967296)) (.cse1 (+ (mod c_~x_2~0 4294967296) v_z_432))) (or (= (+ .cse0 4294967296) .cse1) (< 0 .cse2) (< v_z_432 0) (< .cse2 0) (= .cse0 .cse1) (<= 4294967296 v_z_432)))) (<= 0 c_~x_1~0) (<= c_~x_1~0 0)) is different from false [2023-08-27 00:12:22,073 WARN L839 $PredicateComparison]: unable to prove that (and (= c_~x_2~0 0) (= c_thread1Thread1of1ForFork0_~i~0 0) (<= 0 c_~x_1~0) (forall ((v_z_432 Int) (v_y_432 Int)) (let ((.cse2 (+ (* 2863311531 v_z_432) (* v_y_432 4294967296))) (.cse0 (mod c_~x_1~0 4294967296)) (.cse1 (+ (mod c_~x_2~0 4294967296) v_z_432))) (or (= (+ .cse0 4294967296) .cse1) (< v_z_432 0) (< .cse2 0) (< (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) .cse2) (= .cse0 .cse1) (<= 4294967296 v_z_432)))) (<= c_~x_1~0 0)) is different from false [2023-08-27 00:12:24,099 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 00:12:26,197 WARN L839 $PredicateComparison]: unable to prove that (and (= 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) (or (forall ((v_z_432 Int) (v_y_432 Int)) (let ((.cse2 (+ (* 2863311531 v_z_432) (* v_y_432 4294967296))) (.cse0 (mod c_~x_1~0 4294967296)) (.cse1 (+ (mod c_~x_2~0 4294967296) v_z_432))) (or (= (+ .cse0 4294967296) .cse1) (< v_z_432 0) (< .cse2 0) (< (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) .cse2) (= .cse0 .cse1) (<= 4294967296 v_z_432)))) (< (mod (+ c_thread2Thread1of1ForFork1_~i~1 3) 4294967296) (+ (mod c_thread2Thread1of1ForFork1_~i~1 4294967296) 1)))) is different from false [2023-08-27 00:12:32,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 00:12:35,416 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 00:12:39,841 INFO L124 PetriNetUnfolderBase]: 1380/2646 cut-off events. [2023-08-27 00:12:39,841 INFO L125 PetriNetUnfolderBase]: For 71220/71220 co-relation queries the response was YES. [2023-08-27 00:12:39,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24924 conditions, 2646 events. 1380/2646 cut-off events. For 71220/71220 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 17887 event pairs, 238 based on Foata normal form. 4/2648 useless extension candidates. Maximal degree in co-relation 24797. Up to 2441 conditions per place. [2023-08-27 00:12:39,869 INFO L140 encePairwiseOnDemand]: 130/141 looper letters, 565 selfloop transitions, 63 changer transitions 17/645 dead transitions. [2023-08-27 00:12:39,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 401 places, 645 transitions, 12720 flow [2023-08-27 00:12:39,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-08-27 00:12:39,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-08-27 00:12:39,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1295 transitions. [2023-08-27 00:12:39,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39932161578785075 [2023-08-27 00:12:39,871 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 1295 transitions. [2023-08-27 00:12:39,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 1295 transitions. [2023-08-27 00:12:39,871 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:12:39,871 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1295 transitions. [2023-08-27 00:12:39,872 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 56.30434782608695) internal successors, (1295), 23 states have internal predecessors, (1295), 0 states have call successors, (0), 0 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 00:12:39,873 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 00:12:39,873 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 00:12:39,874 INFO L175 Difference]: Start difference. First operand has 381 places, 530 transitions, 9003 flow. Second operand 23 states and 1295 transitions. [2023-08-27 00:12:39,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 401 places, 645 transitions, 12720 flow [2023-08-27 00:12:40,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 645 transitions, 12520 flow, removed 85 selfloop flow, removed 5 redundant places. [2023-08-27 00:12:40,246 INFO L231 Difference]: Finished difference. Result has 415 places, 589 transitions, 10901 flow [2023-08-27 00:12:40,247 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=8864, PETRI_DIFFERENCE_MINUEND_PLACES=374, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=530, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=492, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=10901, PETRI_PLACES=415, PETRI_TRANSITIONS=589} [2023-08-27 00:12:40,247 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 395 predicate places. [2023-08-27 00:12:40,247 INFO L495 AbstractCegarLoop]: Abstraction has has 415 places, 589 transitions, 10901 flow [2023-08-27 00:12:40,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 52.90909090909091) internal successors, (1164), 22 states have internal predecessors, (1164), 0 states have call successors, (0), 0 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 00:12:40,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:12:40,247 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:12:40,255 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2023-08-27 00:12:40,457 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 00:12:40,457 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-27 00:12:40,457 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:12:40,457 INFO L85 PathProgramCache]: Analyzing trace with hash -749957901, now seen corresponding path program 9 times [2023-08-27 00:12:40,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:12:40,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767587226] [2023-08-27 00:12:40,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:12:40,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:12:40,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:12:40,721 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 00:12:40,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:12:40,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767587226] [2023-08-27 00:12:40,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767587226] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:12:40,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012055316] [2023-08-27 00:12:40,721 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-27 00:12:40,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:12:40,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:12:40,722 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 00:12:40,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2023-08-27 00:12:40,803 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-27 00:12:40,803 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 00:12:40,804 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 28 conjunts are in the unsatisfiable core [2023-08-27 00:12:40,804 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:12:41,007 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 00:12:41,007 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:12:55,498 WARN L234 SmtUtils]: Spent 6.07s 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 00:13:23,043 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_z_440 Int) (v_y_440 Int)) (let ((.cse0 (+ (* v_y_440 4294967296) (* 2863311531 v_z_440)))) (or (<= 4294967296 v_z_440) (< .cse0 0) (= (mod c_~x_2~0 4294967296) (+ (mod c_~x_1~0 4294967296) v_z_440)) (< v_z_440 0) (< 0 .cse0)))) is different from false [2023-08-27 00:13:23,083 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 00:13:23,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012055316] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:13:23,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:13:23,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 21 [2023-08-27 00:13:23,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382441800] [2023-08-27 00:13:23,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:13:23,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-27 00:13:23,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:13:23,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-27 00:13:23,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=336, Unknown=13, NotChecked=40, Total=506 [2023-08-27 00:13:23,084 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 141 [2023-08-27 00:13:23,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 589 transitions, 10901 flow. Second operand has 23 states, 23 states have (on average 52.95652173913044) internal successors, (1218), 23 states have internal predecessors, (1218), 0 states have call successors, (0), 0 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 00:13:23,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:13:23,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 141 [2023-08-27 00:13:23,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:13:25,091 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 00:13:27,135 WARN L839 $PredicateComparison]: unable to prove that (and (= c_~x_2~0 0) (<= 0 c_~x_1~0) (forall ((v_z_440 Int) (v_y_440 Int)) (let ((.cse0 (+ (* v_y_440 4294967296) (* 2863311531 v_z_440)))) (or (<= 4294967296 v_z_440) (< .cse0 0) (= (mod c_~x_2~0 4294967296) (+ (mod c_~x_1~0 4294967296) v_z_440)) (< v_z_440 0) (< 0 .cse0)))) (<= c_~x_1~0 0)) is different from false [2023-08-27 00:13:29,152 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_440 Int) (v_y_440 Int)) (let ((.cse0 (+ (* v_y_440 4294967296) (* 2863311531 v_z_440)))) (or (<= 4294967296 v_z_440) (< .cse0 0) (= (mod c_~x_2~0 4294967296) (+ (mod c_~x_1~0 4294967296) v_z_440)) (< v_z_440 0) (< 0 .cse0))))) (= 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 00:13:31,237 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 00:13:33,265 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 00:13:35,284 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 00:13:37,290 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 00:13:39,314 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 00:13:41,355 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_440 Int) (v_y_440 Int)) (let ((.cse1 (mod c_~x_2~0 4294967296)) (.cse2 (+ (mod c_~x_1~0 4294967296) v_z_440)) (.cse0 (+ (* v_y_440 4294967296) (* 2863311531 v_z_440)))) (or (<= 4294967296 v_z_440) (< .cse0 0) (= .cse1 .cse2) (= (+ .cse1 4294967296) .cse2) (< v_z_440 0) (< (mod c_thread2Thread1of1ForFork1_~i~1 4294967296) .cse0))))) (= 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 00:13:43,361 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 00:13:45,395 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 00:13:47,434 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 00:13:49,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 00:13:51,595 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 00:13:53,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 00:13:55,726 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 00:13:57,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 00:14:11,472 WARN L234 SmtUtils]: Spent 10.15s 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 00:14:13,853 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 00:14:30,261 WARN L234 SmtUtils]: Spent 10.15s on a formula simplification that was a NOOP. DAG size: 61 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 00:14:32,299 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 00:14:34,328 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 00:14:36,355 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 00:14:38,370 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 00:14:40,401 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 00:14:42,428 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 00:14:44,447 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 00:14:46,464 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 00:14:48,479 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 00:14:50,493 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 00:14:52,506 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 00:14:54,520 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 00:14:56,541 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 00:14:58,572 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 00:15:00,622 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 00:15:02,643 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 00:15:04,657 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 00:15:06,682 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 00:15:08,697 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 00:15:10,710 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 00:15:12,931 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 00:15:21,101 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 00:15:25,207 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 00:15:27,241 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 00:15:29,254 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 00:15:31,281 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 00:15:33,296 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 00:15:35,311 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 00:15:37,326 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 00:15:39,341 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 00:15:41,357 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 00:15:43,392 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 00:15:45,407 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 00:15:47,422 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 00:15:49,436 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 00:15:51,453 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 00:15:53,468 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 00:15:55,482 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 00:15:57,496 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 00:15:59,518 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 00:16:01,534 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 00:16:03,549 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 00:16:05,734 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 00:16:07,752 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 00:16:09,791 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 00:16:11,870 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 00:16:13,968 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 00:16:16,045 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 00:16:18,239 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 00:16:20,265 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 00:16:22,361 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 00:16:24,385 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 00:16:26,451 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 00:16:26,526 INFO L124 PetriNetUnfolderBase]: 1490/2853 cut-off events. [2023-08-27 00:16:26,526 INFO L125 PetriNetUnfolderBase]: For 84586/84586 co-relation queries the response was YES. [2023-08-27 00:16:26,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28198 conditions, 2853 events. 1490/2853 cut-off events. For 84586/84586 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 19405 event pairs, 213 based on Foata normal form. 7/2858 useless extension candidates. Maximal degree in co-relation 28054. Up to 2423 conditions per place. [2023-08-27 00:16:26,558 INFO L140 encePairwiseOnDemand]: 130/141 looper letters, 527 selfloop transitions, 177 changer transitions 12/716 dead transitions. [2023-08-27 00:16:26,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 716 transitions, 14912 flow [2023-08-27 00:16:26,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-08-27 00:16:26,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-08-27 00:16:26,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1391 transitions. [2023-08-27 00:16:26,559 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3946099290780142 [2023-08-27 00:16:26,559 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 1391 transitions. [2023-08-27 00:16:26,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 1391 transitions. [2023-08-27 00:16:26,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:16:26,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 1391 transitions. [2023-08-27 00:16:26,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 55.64) internal successors, (1391), 25 states have internal predecessors, (1391), 0 states have call successors, (0), 0 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 00:16:26,562 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 00:16:26,563 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 00:16:26,563 INFO L175 Difference]: Start difference. First operand has 415 places, 589 transitions, 10901 flow. Second operand 25 states and 1391 transitions. [2023-08-27 00:16:26,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 716 transitions, 14912 flow [2023-08-27 00:16:27,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 432 places, 716 transitions, 14097 flow, removed 406 selfloop flow, removed 4 redundant places. [2023-08-27 00:16:27,161 INFO L231 Difference]: Finished difference. Result has 448 places, 669 transitions, 12937 flow [2023-08-27 00:16:27,162 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=10094, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=589, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=12937, PETRI_PLACES=448, PETRI_TRANSITIONS=669} [2023-08-27 00:16:27,162 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 428 predicate places. [2023-08-27 00:16:27,162 INFO L495 AbstractCegarLoop]: Abstraction has has 448 places, 669 transitions, 12937 flow [2023-08-27 00:16:27,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 52.95652173913044) internal successors, (1218), 23 states have internal predecessors, (1218), 0 states have call successors, (0), 0 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 00:16:27,162 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:16:27,162 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:16:27,167 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2023-08-27 00:16:27,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2023-08-27 00:16:27,366 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-27 00:16:27,366 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:16:27,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1941991275, now seen corresponding path program 7 times [2023-08-27 00:16:27,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:16:27,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838813584] [2023-08-27 00:16:27,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:16:27,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:16:27,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:16:27,681 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 00:16:27,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:16:27,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838813584] [2023-08-27 00:16:27,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838813584] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:16:27,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056190623] [2023-08-27 00:16:27,682 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-27 00:16:27,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:16:27,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:16:27,683 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 00:16:27,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2023-08-27 00:16:27,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:16:27,779 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-27 00:16:27,779 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:16:27,929 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 00:16:27,929 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-27 00:16:39,158 WARN L234 SmtUtils]: Spent 6.11s on a formula simplification. DAG size of input: 36 DAG size of output: 29 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-27 00:16:41,199 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_z_444 Int) (v_y_444 Int)) (let ((.cse0 (mod c_~x_1~0 4294967296)) (.cse1 (+ (mod c_~x_2~0 4294967296) v_z_444)) (.cse2 (+ (* 2863311531 v_z_444) (* v_y_444 4294967296)))) (or (< v_z_444 0) (= .cse0 .cse1) (= (+ .cse0 4294967296) .cse1) (< .cse2 0) (< (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) .cse2) (<= 4294967296 v_z_444)))) is different from false [2023-08-27 00:16:53,779 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_z_444 Int) (v_y_444 Int)) (let ((.cse0 (mod c_~x_1~0 4294967296)) (.cse1 (+ (mod c_~x_2~0 4294967296) v_z_444)) (.cse2 (+ (* 2863311531 v_z_444) (* v_y_444 4294967296)))) (or (< v_z_444 0) (= .cse0 .cse1) (= (+ .cse0 4294967296) .cse1) (< .cse2 0) (< 0 .cse2) (<= 4294967296 v_z_444)))) is different from false [2023-08-27 00:16:58,418 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_z_444 Int) (v_y_444 Int)) (let ((.cse0 (+ (* 2863311531 v_z_444) (* v_y_444 4294967296)))) (or (< v_z_444 0) (= (mod c_~x_1~0 4294967296) (+ (mod c_~x_2~0 4294967296) v_z_444)) (< .cse0 0) (< 0 .cse0) (<= 4294967296 v_z_444)))) is different from false [2023-08-27 00:16:58,420 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 00:16:58,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056190623] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-27 00:16:58,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-27 00:16:58,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 17 [2023-08-27 00:16:58,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056103202] [2023-08-27 00:16:58,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-27 00:16:58,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-27 00:16:58,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 00:16:58,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-27 00:16:58,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=174, Unknown=5, NotChecked=90, Total=342 [2023-08-27 00:16:58,422 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 141 [2023-08-27 00:16:58,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 669 transitions, 12937 flow. Second operand has 19 states, 19 states have (on average 55.1578947368421) internal successors, (1048), 19 states have internal predecessors, (1048), 0 states have call successors, (0), 0 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 00:16:58,423 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 00:16:58,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 141 [2023-08-27 00:16:58,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 00:17:00,459 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_z_444 Int) (v_y_444 Int)) (let ((.cse0 (+ (* 2863311531 v_z_444) (* v_y_444 4294967296)))) (or (< v_z_444 0) (= (mod c_~x_1~0 4294967296) (+ (mod c_~x_2~0 4294967296) v_z_444)) (< .cse0 0) (< 0 .cse0) (<= 4294967296 v_z_444)))) (= c_~x_2~0 0) (<= 0 c_~x_1~0) (<= c_~x_1~0 0)) is different from false [2023-08-27 00:17:02,482 WARN L839 $PredicateComparison]: unable to prove that (and (= c_~x_2~0 0) (forall ((v_z_444 Int) (v_y_444 Int)) (let ((.cse0 (mod c_~x_1~0 4294967296)) (.cse1 (+ (mod c_~x_2~0 4294967296) v_z_444)) (.cse2 (+ (* 2863311531 v_z_444) (* v_y_444 4294967296)))) (or (< v_z_444 0) (= .cse0 .cse1) (= (+ .cse0 4294967296) .cse1) (< .cse2 0) (< 0 .cse2) (<= 4294967296 v_z_444)))) (<= 0 c_~x_1~0) (<= c_~x_1~0 0)) is different from false [2023-08-27 00:17:04,529 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_z_444 Int) (v_y_444 Int)) (let ((.cse0 (mod c_~x_1~0 4294967296)) (.cse1 (+ (mod c_~x_2~0 4294967296) v_z_444)) (.cse2 (+ (* 2863311531 v_z_444) (* v_y_444 4294967296)))) (or (< v_z_444 0) (= .cse0 .cse1) (= (+ .cse0 4294967296) .cse1) (< .cse2 0) (< (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) .cse2) (<= 4294967296 v_z_444)))) (= 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 00:17:06,600 WARN L839 $PredicateComparison]: unable to prove that (and (or (forall ((v_z_444 Int) (v_y_444 Int)) (let ((.cse0 (mod c_~x_1~0 4294967296)) (.cse1 (+ (mod c_~x_2~0 4294967296) v_z_444)) (.cse2 (+ (* 2863311531 v_z_444) (* v_y_444 4294967296)))) (or (< v_z_444 0) (= .cse0 .cse1) (= (+ .cse0 4294967296) .cse1) (< .cse2 0) (< (mod c_thread1Thread1of1ForFork0_~i~0 4294967296) .cse2) (<= 4294967296 v_z_444)))) (< 4294967294 (mod c_thread2Thread1of1ForFork1_~i~1 4294967296))) (= 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 00:17:09,016 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 00:17:11,376 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 00:17:14,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2023-08-27 00:17:16,586 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 00:17:18,599 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 00:17:19,693 INFO L124 PetriNetUnfolderBase]: 1535/2923 cut-off events. [2023-08-27 00:17:19,693 INFO L125 PetriNetUnfolderBase]: For 94232/94232 co-relation queries the response was YES. [2023-08-27 00:17:19,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30259 conditions, 2923 events. 1535/2923 cut-off events. For 94232/94232 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 19821 event pairs, 259 based on Foata normal form. 2/2923 useless extension candidates. Maximal degree in co-relation 30101. Up to 2781 conditions per place. [2023-08-27 00:17:19,733 INFO L140 encePairwiseOnDemand]: 131/141 looper letters, 682 selfloop transitions, 30 changer transitions 4/716 dead transitions. [2023-08-27 00:17:19,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 716 transitions, 15487 flow [2023-08-27 00:17:19,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-27 00:17:19,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-27 00:17:19,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 811 transitions. [2023-08-27 00:17:19,734 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41084093211752787 [2023-08-27 00:17:19,734 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 811 transitions. [2023-08-27 00:17:19,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 811 transitions. [2023-08-27 00:17:19,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 00:17:19,735 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 811 transitions. [2023-08-27 00:17:19,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 57.92857142857143) internal successors, (811), 14 states have internal predecessors, (811), 0 states have call successors, (0), 0 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 00:17:19,737 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 141.0) internal successors, (2115), 15 states have internal predecessors, (2115), 0 states have call successors, (0), 0 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 00:17:19,737 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 141.0) internal successors, (2115), 15 states have internal predecessors, (2115), 0 states have call successors, (0), 0 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 00:17:19,737 INFO L175 Difference]: Start difference. First operand has 448 places, 669 transitions, 12937 flow. Second operand 14 states and 811 transitions. [2023-08-27 00:17:19,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 460 places, 716 transitions, 15487 flow [2023-08-27 00:17:20,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 456 places, 716 transitions, 15006 flow, removed 234 selfloop flow, removed 4 redundant places. [2023-08-27 00:17:20,503 INFO L231 Difference]: Finished difference. Result has 462 places, 684 transitions, 13131 flow [2023-08-27 00:17:20,503 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=141, PETRI_DIFFERENCE_MINUEND_FLOW=12461, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=669, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=643, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=13131, PETRI_PLACES=462, PETRI_TRANSITIONS=684} [2023-08-27 00:17:20,504 INFO L281 CegarLoopForPetriNet]: 20 programPoint places, 442 predicate places. [2023-08-27 00:17:20,505 INFO L495 AbstractCegarLoop]: Abstraction has has 462 places, 684 transitions, 13131 flow [2023-08-27 00:17:20,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 55.1578947368421) internal successors, (1048), 19 states have internal predecessors, (1048), 0 states have call successors, (0), 0 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 00:17:20,505 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 00:17:20,505 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 00:17:20,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2023-08-27 00:17:20,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2023-08-27 00:17:20,709 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-27 00:17:20,709 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 00:17:20,709 INFO L85 PathProgramCache]: Analyzing trace with hash 340552413, now seen corresponding path program 8 times [2023-08-27 00:17:20,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 00:17:20,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405319246] [2023-08-27 00:17:20,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 00:17:20,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 00:17:20,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 00:17:21,029 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 00:17:21,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 00:17:21,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405319246] [2023-08-27 00:17:21,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405319246] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-27 00:17:21,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1376501977] [2023-08-27 00:17:21,030 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-27 00:17:21,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-27 00:17:21,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 00:17:21,031 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-27 00:17:21,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2023-08-27 00:17:21,112 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-27 00:17:21,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-27 00:17:21,113 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-27 00:17:21,114 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-27 00:17:21,230 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 00:17:21,230 INFO L327 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2023-08-27 00:17:23,386 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-27 00:17:23,406 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 00:17:23,657 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse6 (mod c_~x_1~0 4294967296))) (let ((.cse3 (+ .cse6 4294967296)) (.cse2 (mod c_thread1Thread1of1ForFork0_~i~0 4294967296)) (.cse4 (mod c_~x_2~0 4294967296))) (and (forall ((v_y_449 Int) (v_z_449 Int)) (let ((.cse1 (+ (* v_y_449 4294967296) (* 2863311531 v_z_449))) (.cse0 (+ .cse4 v_z_449))) (or (< .cse0 4294967296) (< .cse1 0) (< .cse2 .cse1) (<= 4294967296 v_z_449) (= .cse3 .cse0)))) (forall ((v_y_449 Int) (v_z_449 Int)) (let ((.cse5 (+ (* v_y_449 4294967296) (* 2863311531 v_z_449))) (.cse7 (+ .cse4 v_z_449))) (or (< v_z_449 0) (< .cse5 0) (< .cse2 .cse5) (<= 4294967296 v_z_449) (= .cse6 .cse7) (= .cse3 .cse7)))) (forall ((v_y_449 Int) (v_z_449 Int)) (let ((.cse8 (+ (* v_y_449 4294967296) (* 2863311531 v_z_449))) (.cse9 (+ .cse4 v_z_449))) (or (< v_z_449 0) (< .cse8 0) (< .cse2 .cse8) (= .cse6 .cse9) (<= 4294967296 .cse9))))))) is different from false [2023-08-27 00:17:23,671 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (2 of 3 remaining) [2023-08-27 00:17:23,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2023-08-27 00:17:23,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2023-08-27 00:17:23,872 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 17 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ∧-3-1 context. [2023-08-27 00:17:23,873 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-27 00:17:23,873 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-27 00:17:23,874 INFO L445 BasicCegarLoop]: Path program histogram: [22, 9, 8, 1] [2023-08-27 00:17:23,876 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 00:17:23,876 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 00:17:23,877 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 12:17:23 BasicIcfg [2023-08-27 00:17:23,877 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 00:17:23,878 INFO L158 Benchmark]: Toolchain (without parser) took 872627.60ms. Allocated memory was 308.3MB in the beginning and 536.9MB in the end (delta: 228.6MB). Free memory was 283.5MB in the beginning and 218.8MB in the end (delta: 64.7MB). Peak memory consumption was 295.2MB. Max. memory is 16.0GB. [2023-08-27 00:17:23,878 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 308.3MB. Free memory is still 284.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 00:17:23,878 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.18ms. Allocated memory is still 308.3MB. Free memory was 283.5MB in the beginning and 273.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-08-27 00:17:23,878 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.14ms. Allocated memory is still 308.3MB. Free memory was 273.0MB in the beginning and 270.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 00:17:23,878 INFO L158 Benchmark]: Boogie Preprocessor took 29.36ms. Allocated memory is still 308.3MB. Free memory was 270.9MB in the beginning and 270.1MB in the end (delta: 844.4kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 00:17:23,878 INFO L158 Benchmark]: RCFGBuilder took 359.08ms. Allocated memory is still 308.3MB. Free memory was 270.1MB in the beginning and 257.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-08-27 00:17:23,878 INFO L158 Benchmark]: TraceAbstraction took 872006.94ms. Allocated memory was 308.3MB in the beginning and 536.9MB in the end (delta: 228.6MB). Free memory was 256.3MB in the beginning and 218.8MB in the end (delta: 37.4MB). Peak memory consumption was 267.9MB. Max. memory is 16.0GB. [2023-08-27 00:17:23,879 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.11ms. Allocated memory is still 308.3MB. Free memory is still 284.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 199.18ms. Allocated memory is still 308.3MB. Free memory was 283.5MB in the beginning and 273.0MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 27.14ms. Allocated memory is still 308.3MB. Free memory was 273.0MB in the beginning and 270.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 29.36ms. Allocated memory is still 308.3MB. Free memory was 270.9MB in the beginning and 270.1MB in the end (delta: 844.4kB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 359.08ms. Allocated memory is still 308.3MB. Free memory was 270.1MB in the beginning and 257.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * TraceAbstraction took 872006.94ms. Allocated memory was 308.3MB in the beginning and 536.9MB in the end (delta: 228.6MB). Free memory was 256.3MB in the beginning and 218.8MB in the end (delta: 37.4MB). Peak memory consumption was 267.9MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.5s, 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 analyzing trace of length 17 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ∧-3-1 context. - 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 analyzing trace of length 17 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ∧-3-1 context. - 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 analyzing trace of length 17 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 5 xjuncts wrt. a ∧-3-1 context. - 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: 871.9s, OverallIterations: 40, TraceHistogramMax: 3, PathProgramHistogramMax: 22, EmptinessCheckTime: 0.0s, AutomataDifference: 485.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.6s, HoareTripleCheckerStatistics: 125 mSolverCounterUnknown, 1916 SdHoareTripleChecker+Valid, 297.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1916 mSDsluCounter, 579 SdHoareTripleChecker+Invalid, 293.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 3126 IncrementalHoareTripleChecker+Unchecked, 455 mSDsCounter, 631 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16194 IncrementalHoareTripleChecker+Invalid, 20076 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 631 mSolverCounterUnsat, 124 mSDtfsCounter, 16194 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1628 GetRequests, 625 SyntacticMatches, 104 SemanticMatches, 899 ConstructedPredicates, 41 IntricatePredicates, 0 DeprecatedPredicates, 6803 ImplicationChecksByTransitivity, 361.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13131occurred in iteration=39, InterpolantAutomatonStates: 731, 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.7s SatisfiabilityAnalysisTime, 370.1s InterpolantComputationTime, 1167 NumberOfCodeBlocks, 1167 NumberOfCodeBlocksAsserted, 116 NumberOfCheckSat, 1629 ConstructedInterpolants, 57 QuantifiedInterpolants, 48534 SizeOfPredicates, 142 NumberOfNonLiveVariables, 4443 ConjunctsInSsa, 890 ConjunctsInUnsatCore, 115 InterpolantComputations, 2 PerfectInterpolantSequences, 4/342 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