/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/bench-exp3x3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 07:20:06,596 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 07:20:06,672 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-24 07:20:06,676 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 07:20:06,676 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 07:20:06,704 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 07:20:06,704 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 07:20:06,704 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 07:20:06,705 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 07:20:06,708 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 07:20:06,708 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 07:20:06,709 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 07:20:06,709 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 07:20:06,709 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 07:20:06,709 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 07:20:06,710 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 07:20:06,710 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 07:20:06,710 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 07:20:06,710 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 07:20:06,710 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 07:20:06,710 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 07:20:06,711 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 07:20:06,711 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 07:20:06,711 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 07:20:06,712 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 07:20:06,712 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 07:20:06,712 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 07:20:06,712 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 07:20:06,712 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 07:20:06,713 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 07:20:06,713 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 07:20:06,713 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 07:20:06,714 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 07:20:06,714 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 07:20:06,714 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 07:20:06,714 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST [2023-08-24 07:20:06,989 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 07:20:07,009 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 07:20:07,011 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 07:20:07,011 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 07:20:07,012 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 07:20:07,012 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp3x3.wvr.c [2023-08-24 07:20:08,048 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 07:20:08,205 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 07:20:08,205 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp3x3.wvr.c [2023-08-24 07:20:08,210 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a2eed6e2/da571903b519463ab6fbb19541cacf50/FLAGf01a6549f [2023-08-24 07:20:08,219 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a2eed6e2/da571903b519463ab6fbb19541cacf50 [2023-08-24 07:20:08,221 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 07:20:08,222 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 07:20:08,222 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 07:20:08,222 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 07:20:08,224 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 07:20:08,225 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 07:20:08" (1/1) ... [2023-08-24 07:20:08,225 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@650c0569 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 07:20:08, skipping insertion in model container [2023-08-24 07:20:08,226 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 07:20:08" (1/1) ... [2023-08-24 07:20:08,240 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 07:20:08,366 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp3x3.wvr.c[2625,2638] [2023-08-24 07:20:08,367 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 07:20:08,374 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 07:20:08,400 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp3x3.wvr.c[2625,2638] [2023-08-24 07:20:08,401 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 07:20:08,413 INFO L206 MainTranslator]: Completed translation [2023-08-24 07:20:08,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 07:20:08 WrapperNode [2023-08-24 07:20:08,413 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 07:20:08,414 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 07:20:08,414 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 07:20:08,414 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 07:20:08,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 07:20:08" (1/1) ... [2023-08-24 07:20:08,430 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 07:20:08" (1/1) ... [2023-08-24 07:20:08,452 INFO L138 Inliner]: procedures = 22, calls = 44, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 132 [2023-08-24 07:20:08,452 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 07:20:08,453 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 07:20:08,453 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 07:20:08,453 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 07:20:08,459 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 07:20:08" (1/1) ... [2023-08-24 07:20:08,459 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 07:20:08" (1/1) ... [2023-08-24 07:20:08,468 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 07:20:08" (1/1) ... [2023-08-24 07:20:08,469 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 07:20:08" (1/1) ... [2023-08-24 07:20:08,477 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 07:20:08" (1/1) ... [2023-08-24 07:20:08,479 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 07:20:08" (1/1) ... [2023-08-24 07:20:08,485 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 07:20:08" (1/1) ... [2023-08-24 07:20:08,486 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 07:20:08" (1/1) ... [2023-08-24 07:20:08,487 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 07:20:08,487 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 07:20:08,488 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 07:20:08,488 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 07:20:08,488 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 07:20:08" (1/1) ... [2023-08-24 07:20:08,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 07:20:08,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 07:20:08,562 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-24 07:20:08,615 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-24 07:20:08,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 07:20:08,636 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-24 07:20:08,636 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-24 07:20:08,637 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-24 07:20:08,637 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-24 07:20:08,637 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-24 07:20:08,637 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-24 07:20:08,637 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-08-24 07:20:08,637 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-08-24 07:20:08,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 07:20:08,637 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2023-08-24 07:20:08,638 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2023-08-24 07:20:08,638 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2023-08-24 07:20:08,638 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2023-08-24 07:20:08,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 07:20:08,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 07:20:08,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 07:20:08,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 07:20:08,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-24 07:20:08,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 07:20:08,640 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 07:20:08,703 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 07:20:08,704 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 07:20:08,873 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 07:20:08,881 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 07:20:08,881 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-08-24 07:20:08,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 07:20:08 BoogieIcfgContainer [2023-08-24 07:20:08,882 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 07:20:08,884 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 07:20:08,884 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 07:20:08,888 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 07:20:08,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 07:20:08" (1/3) ... [2023-08-24 07:20:08,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@287ff1ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 07:20:08, skipping insertion in model container [2023-08-24 07:20:08,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 07:20:08" (2/3) ... [2023-08-24 07:20:08,896 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@287ff1ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 07:20:08, skipping insertion in model container [2023-08-24 07:20:08,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 07:20:08" (3/3) ... [2023-08-24 07:20:08,897 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp3x3.wvr.c [2023-08-24 07:20:08,908 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 07:20:08,920 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-24 07:20:08,921 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 07:20:09,024 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2023-08-24 07:20:09,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 174 places, 169 transitions, 386 flow [2023-08-24 07:20:09,134 INFO L124 PetriNetUnfolderBase]: 14/163 cut-off events. [2023-08-24 07:20:09,134 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-24 07:20:09,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 163 events. 14/163 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/148 useless extension candidates. Maximal degree in co-relation 122. Up to 2 conditions per place. [2023-08-24 07:20:09,139 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 169 transitions, 386 flow [2023-08-24 07:20:09,144 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 152 places, 147 transitions, 330 flow [2023-08-24 07:20:09,146 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 07:20:09,158 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 147 transitions, 330 flow [2023-08-24 07:20:09,162 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 147 transitions, 330 flow [2023-08-24 07:20:09,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 147 transitions, 330 flow [2023-08-24 07:20:09,203 INFO L124 PetriNetUnfolderBase]: 14/147 cut-off events. [2023-08-24 07:20:09,203 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-24 07:20:09,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 147 events. 14/147 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 62 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 122. Up to 2 conditions per place. [2023-08-24 07:20:09,206 INFO L119 LiptonReduction]: Number of co-enabled transitions 2916 [2023-08-24 07:20:14,631 INFO L134 LiptonReduction]: Checked pairs total: 3523 [2023-08-24 07:20:14,631 INFO L136 LiptonReduction]: Total number of compositions: 126 [2023-08-24 07:20:14,640 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 07:20:14,645 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;@7ffe0a20, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 07:20:14,645 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-24 07:20:14,659 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 07:20:14,659 INFO L124 PetriNetUnfolderBase]: 6/36 cut-off events. [2023-08-24 07:20:14,660 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-24 07:20:14,660 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 07:20:14,660 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 07:20:14,660 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 07:20:14,663 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 07:20:14,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1406052379, now seen corresponding path program 1 times [2023-08-24 07:20:14,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 07:20:14,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006572203] [2023-08-24 07:20:14,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 07:20:14,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 07:20:14,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 07:20:15,331 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-24 07:20:15,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 07:20:15,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006572203] [2023-08-24 07:20:15,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006572203] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 07:20:15,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 07:20:15,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 07:20:15,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17546966] [2023-08-24 07:20:15,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 07:20:15,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 07:20:15,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 07:20:15,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 07:20:15,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 07:20:15,359 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 295 [2023-08-24 07:20:15,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:15,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 07:20:15,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 295 [2023-08-24 07:20:15,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 07:20:15,744 INFO L124 PetriNetUnfolderBase]: 3473/4229 cut-off events. [2023-08-24 07:20:15,744 INFO L125 PetriNetUnfolderBase]: For 247/247 co-relation queries the response was YES. [2023-08-24 07:20:15,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8842 conditions, 4229 events. 3473/4229 cut-off events. For 247/247 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 11612 event pairs, 837 based on Foata normal form. 1/2430 useless extension candidates. Maximal degree in co-relation 6136. Up to 3015 conditions per place. [2023-08-24 07:20:15,762 INFO L140 encePairwiseOnDemand]: 287/295 looper letters, 63 selfloop transitions, 7 changer transitions 1/71 dead transitions. [2023-08-24 07:20:15,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 71 transitions, 353 flow [2023-08-24 07:20:15,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 07:20:15,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 07:20:15,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 420 transitions. [2023-08-24 07:20:15,779 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4745762711864407 [2023-08-24 07:20:15,779 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 420 transitions. [2023-08-24 07:20:15,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 420 transitions. [2023-08-24 07:20:15,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 07:20:15,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 420 transitions. [2023-08-24 07:20:15,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:15,790 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:15,790 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 295.0) internal successors, (1180), 4 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:15,791 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 110 flow. Second operand 3 states and 420 transitions. [2023-08-24 07:20:15,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 71 transitions, 353 flow [2023-08-24 07:20:15,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 71 transitions, 307 flow, removed 0 selfloop flow, removed 12 redundant places. [2023-08-24 07:20:15,800 INFO L231 Difference]: Finished difference. Result has 41 places, 43 transitions, 133 flow [2023-08-24 07:20:15,801 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=41, PETRI_TRANSITIONS=43} [2023-08-24 07:20:15,803 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -9 predicate places. [2023-08-24 07:20:15,803 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 43 transitions, 133 flow [2023-08-24 07:20:15,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:15,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 07:20:15,804 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 07:20:15,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 07:20:15,804 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 07:20:15,810 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 07:20:15,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1369672065, now seen corresponding path program 1 times [2023-08-24 07:20:15,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 07:20:15,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693105640] [2023-08-24 07:20:15,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 07:20:15,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 07:20:15,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 07:20:15,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 07:20:15,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 07:20:15,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693105640] [2023-08-24 07:20:15,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693105640] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 07:20:15,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 07:20:15,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 07:20:15,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648064176] [2023-08-24 07:20:15,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 07:20:15,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 07:20:15,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 07:20:15,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 07:20:15,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 07:20:15,989 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 295 [2023-08-24 07:20:15,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 43 transitions, 133 flow. Second operand has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:15,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 07:20:15,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 295 [2023-08-24 07:20:15,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 07:20:16,433 INFO L124 PetriNetUnfolderBase]: 5067/6189 cut-off events. [2023-08-24 07:20:16,434 INFO L125 PetriNetUnfolderBase]: For 2240/2240 co-relation queries the response was YES. [2023-08-24 07:20:16,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15972 conditions, 6189 events. 5067/6189 cut-off events. For 2240/2240 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 19154 event pairs, 259 based on Foata normal form. 122/6311 useless extension candidates. Maximal degree in co-relation 4985. Up to 3157 conditions per place. [2023-08-24 07:20:16,457 INFO L140 encePairwiseOnDemand]: 290/295 looper letters, 116 selfloop transitions, 10 changer transitions 0/126 dead transitions. [2023-08-24 07:20:16,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 126 transitions, 621 flow [2023-08-24 07:20:16,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 07:20:16,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 07:20:16,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 746 transitions. [2023-08-24 07:20:16,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5057627118644068 [2023-08-24 07:20:16,460 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 746 transitions. [2023-08-24 07:20:16,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 746 transitions. [2023-08-24 07:20:16,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 07:20:16,461 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 746 transitions. [2023-08-24 07:20:16,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 149.2) internal successors, (746), 5 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:16,465 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:16,465 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:16,465 INFO L175 Difference]: Start difference. First operand has 41 places, 43 transitions, 133 flow. Second operand 5 states and 746 transitions. [2023-08-24 07:20:16,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 126 transitions, 621 flow [2023-08-24 07:20:16,469 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 126 transitions, 609 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 07:20:16,470 INFO L231 Difference]: Finished difference. Result has 46 places, 50 transitions, 191 flow [2023-08-24 07:20:16,471 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=46, PETRI_TRANSITIONS=50} [2023-08-24 07:20:16,471 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2023-08-24 07:20:16,472 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 50 transitions, 191 flow [2023-08-24 07:20:16,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:16,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 07:20:16,472 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 07:20:16,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 07:20:16,472 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 07:20:16,473 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 07:20:16,473 INFO L85 PathProgramCache]: Analyzing trace with hash -388248143, now seen corresponding path program 1 times [2023-08-24 07:20:16,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 07:20:16,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232260159] [2023-08-24 07:20:16,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 07:20:16,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 07:20:16,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 07:20:16,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 07:20:16,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 07:20:16,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232260159] [2023-08-24 07:20:16,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232260159] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 07:20:16,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 07:20:16,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 07:20:16,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032136162] [2023-08-24 07:20:16,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 07:20:16,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 07:20:16,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 07:20:16,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 07:20:16,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 07:20:16,682 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 295 [2023-08-24 07:20:16,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 50 transitions, 191 flow. Second operand has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:16,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 07:20:16,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 295 [2023-08-24 07:20:16,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 07:20:17,067 INFO L124 PetriNetUnfolderBase]: 4881/6003 cut-off events. [2023-08-24 07:20:17,067 INFO L125 PetriNetUnfolderBase]: For 4584/4584 co-relation queries the response was YES. [2023-08-24 07:20:17,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16717 conditions, 6003 events. 4881/6003 cut-off events. For 4584/4584 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 19003 event pairs, 259 based on Foata normal form. 186/6189 useless extension candidates. Maximal degree in co-relation 7058. Up to 3157 conditions per place. [2023-08-24 07:20:17,096 INFO L140 encePairwiseOnDemand]: 290/295 looper letters, 116 selfloop transitions, 8 changer transitions 0/124 dead transitions. [2023-08-24 07:20:17,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 124 transitions, 642 flow [2023-08-24 07:20:17,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 07:20:17,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 07:20:17,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 745 transitions. [2023-08-24 07:20:17,098 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5050847457627119 [2023-08-24 07:20:17,098 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 745 transitions. [2023-08-24 07:20:17,098 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 745 transitions. [2023-08-24 07:20:17,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 07:20:17,099 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 745 transitions. [2023-08-24 07:20:17,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 149.0) internal successors, (745), 5 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:17,102 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:17,102 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:17,102 INFO L175 Difference]: Start difference. First operand has 46 places, 50 transitions, 191 flow. Second operand 5 states and 745 transitions. [2023-08-24 07:20:17,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 124 transitions, 642 flow [2023-08-24 07:20:17,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 124 transitions, 642 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 07:20:17,108 INFO L231 Difference]: Finished difference. Result has 51 places, 49 transitions, 205 flow [2023-08-24 07:20:17,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=205, PETRI_PLACES=51, PETRI_TRANSITIONS=49} [2023-08-24 07:20:17,109 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 1 predicate places. [2023-08-24 07:20:17,109 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 49 transitions, 205 flow [2023-08-24 07:20:17,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:17,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 07:20:17,110 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 07:20:17,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 07:20:17,110 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 07:20:17,110 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 07:20:17,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1430537406, now seen corresponding path program 1 times [2023-08-24 07:20:17,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 07:20:17,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805166379] [2023-08-24 07:20:17,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 07:20:17,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 07:20:17,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 07:20:17,209 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-24 07:20:17,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 07:20:17,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805166379] [2023-08-24 07:20:17,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805166379] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 07:20:17,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955952548] [2023-08-24 07:20:17,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 07:20:17,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 07:20:17,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 07:20:17,212 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-24 07:20:17,229 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-24 07:20:17,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 07:20:17,320 INFO L262 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-24 07:20:17,323 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 07:20:17,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 07:20:17,445 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 07:20:17,502 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-24 07:20:17,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955952548] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 07:20:17,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 07:20:17,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-08-24 07:20:17,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329914750] [2023-08-24 07:20:17,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 07:20:17,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 07:20:17,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 07:20:17,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 07:20:17,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-24 07:20:17,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 295 [2023-08-24 07:20:17,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 49 transitions, 205 flow. Second operand has 6 states, 6 states have (on average 133.33333333333334) internal successors, (800), 6 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:17,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 07:20:17,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 295 [2023-08-24 07:20:17,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 07:20:18,198 INFO L124 PetriNetUnfolderBase]: 10865/13371 cut-off events. [2023-08-24 07:20:18,198 INFO L125 PetriNetUnfolderBase]: For 16553/16553 co-relation queries the response was YES. [2023-08-24 07:20:18,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39650 conditions, 13371 events. 10865/13371 cut-off events. For 16553/16553 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 47176 event pairs, 2521 based on Foata normal form. 336/13707 useless extension candidates. Maximal degree in co-relation 19156. Up to 5541 conditions per place. [2023-08-24 07:20:18,249 INFO L140 encePairwiseOnDemand]: 290/295 looper letters, 138 selfloop transitions, 8 changer transitions 0/146 dead transitions. [2023-08-24 07:20:18,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 146 transitions, 898 flow [2023-08-24 07:20:18,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 07:20:18,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 07:20:18,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 748 transitions. [2023-08-24 07:20:18,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5071186440677966 [2023-08-24 07:20:18,251 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 748 transitions. [2023-08-24 07:20:18,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 748 transitions. [2023-08-24 07:20:18,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 07:20:18,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 748 transitions. [2023-08-24 07:20:18,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 149.6) internal successors, (748), 5 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-24 07:20:18,255 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:18,255 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:18,255 INFO L175 Difference]: Start difference. First operand has 51 places, 49 transitions, 205 flow. Second operand 5 states and 748 transitions. [2023-08-24 07:20:18,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 146 transitions, 898 flow [2023-08-24 07:20:18,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 146 transitions, 879 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 07:20:18,261 INFO L231 Difference]: Finished difference. Result has 57 places, 54 transitions, 253 flow [2023-08-24 07:20:18,261 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=253, PETRI_PLACES=57, PETRI_TRANSITIONS=54} [2023-08-24 07:20:18,262 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 7 predicate places. [2023-08-24 07:20:18,262 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 54 transitions, 253 flow [2023-08-24 07:20:18,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 133.33333333333334) internal successors, (800), 6 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:18,262 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 07:20:18,263 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 07:20:18,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-24 07:20:18,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 07:20:18,468 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 07:20:18,469 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 07:20:18,469 INFO L85 PathProgramCache]: Analyzing trace with hash -204521481, now seen corresponding path program 2 times [2023-08-24 07:20:18,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 07:20:18,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134823019] [2023-08-24 07:20:18,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 07:20:18,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 07:20:18,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 07:20:18,630 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-24 07:20:18,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 07:20:18,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134823019] [2023-08-24 07:20:18,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134823019] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 07:20:18,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036896138] [2023-08-24 07:20:18,631 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 07:20:18,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 07:20:18,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 07:20:18,632 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-24 07:20:18,661 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-24 07:20:18,785 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 07:20:18,786 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 07:20:18,787 INFO L262 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-24 07:20:18,788 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 07:20:18,854 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-24 07:20:18,854 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 07:20:18,887 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-24 07:20:18,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1036896138] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 07:20:18,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 07:20:18,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-08-24 07:20:18,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712717267] [2023-08-24 07:20:18,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 07:20:18,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 07:20:18,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 07:20:18,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 07:20:18,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-24 07:20:18,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 295 [2023-08-24 07:20:18,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 54 transitions, 253 flow. Second operand has 6 states, 6 states have (on average 132.66666666666666) internal successors, (796), 6 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:18,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 07:20:18,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 295 [2023-08-24 07:20:18,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 07:20:19,761 INFO L124 PetriNetUnfolderBase]: 13057/16015 cut-off events. [2023-08-24 07:20:19,762 INFO L125 PetriNetUnfolderBase]: For 28136/28136 co-relation queries the response was YES. [2023-08-24 07:20:19,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55836 conditions, 16015 events. 13057/16015 cut-off events. For 28136/28136 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 56951 event pairs, 4131 based on Foata normal form. 452/16467 useless extension candidates. Maximal degree in co-relation 28964. Up to 6947 conditions per place. [2023-08-24 07:20:19,849 INFO L140 encePairwiseOnDemand]: 290/295 looper letters, 134 selfloop transitions, 8 changer transitions 0/142 dead transitions. [2023-08-24 07:20:19,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 142 transitions, 885 flow [2023-08-24 07:20:19,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 07:20:19,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 07:20:19,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 746 transitions. [2023-08-24 07:20:19,851 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5057627118644068 [2023-08-24 07:20:19,851 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 746 transitions. [2023-08-24 07:20:19,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 746 transitions. [2023-08-24 07:20:19,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 07:20:19,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 746 transitions. [2023-08-24 07:20:19,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 149.2) internal successors, (746), 5 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:19,854 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:19,855 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:19,855 INFO L175 Difference]: Start difference. First operand has 57 places, 54 transitions, 253 flow. Second operand 5 states and 746 transitions. [2023-08-24 07:20:19,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 142 transitions, 885 flow [2023-08-24 07:20:19,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 142 transitions, 885 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 07:20:19,885 INFO L231 Difference]: Finished difference. Result has 63 places, 57 transitions, 303 flow [2023-08-24 07:20:19,885 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=303, PETRI_PLACES=63, PETRI_TRANSITIONS=57} [2023-08-24 07:20:19,886 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 13 predicate places. [2023-08-24 07:20:19,886 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 57 transitions, 303 flow [2023-08-24 07:20:19,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.66666666666666) internal successors, (796), 6 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:19,886 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 07:20:19,887 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 07:20:19,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-24 07:20:20,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 07:20:20,092 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 07:20:20,092 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 07:20:20,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1843659482, now seen corresponding path program 1 times [2023-08-24 07:20:20,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 07:20:20,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401886209] [2023-08-24 07:20:20,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 07:20:20,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 07:20:20,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 07:20:20,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 07:20:20,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 07:20:20,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401886209] [2023-08-24 07:20:20,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401886209] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 07:20:20,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 07:20:20,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 07:20:20,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546045656] [2023-08-24 07:20:20,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 07:20:20,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 07:20:20,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 07:20:20,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 07:20:20,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 07:20:20,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 295 [2023-08-24 07:20:20,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 57 transitions, 303 flow. Second operand has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:20,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 07:20:20,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 295 [2023-08-24 07:20:20,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 07:20:21,099 INFO L124 PetriNetUnfolderBase]: 12765/15723 cut-off events. [2023-08-24 07:20:21,099 INFO L125 PetriNetUnfolderBase]: For 35246/35246 co-relation queries the response was YES. [2023-08-24 07:20:21,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57810 conditions, 15723 events. 12765/15723 cut-off events. For 35246/35246 co-relation queries the response was YES. Maximal size of possible extension queue 381. Compared 58854 event pairs, 471 based on Foata normal form. 292/16015 useless extension candidates. Maximal degree in co-relation 39073. Up to 6655 conditions per place. [2023-08-24 07:20:21,275 INFO L140 encePairwiseOnDemand]: 290/295 looper letters, 152 selfloop transitions, 10 changer transitions 0/162 dead transitions. [2023-08-24 07:20:21,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 162 transitions, 1185 flow [2023-08-24 07:20:21,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 07:20:21,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 07:20:21,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 742 transitions. [2023-08-24 07:20:21,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5030508474576271 [2023-08-24 07:20:21,277 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 742 transitions. [2023-08-24 07:20:21,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 742 transitions. [2023-08-24 07:20:21,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 07:20:21,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 742 transitions. [2023-08-24 07:20:21,279 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 148.4) internal successors, (742), 5 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:21,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:21,281 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:21,281 INFO L175 Difference]: Start difference. First operand has 63 places, 57 transitions, 303 flow. Second operand 5 states and 742 transitions. [2023-08-24 07:20:21,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 162 transitions, 1185 flow [2023-08-24 07:20:21,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 162 transitions, 1156 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-08-24 07:20:21,330 INFO L231 Difference]: Finished difference. Result has 67 places, 62 transitions, 357 flow [2023-08-24 07:20:21,331 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=357, PETRI_PLACES=67, PETRI_TRANSITIONS=62} [2023-08-24 07:20:21,331 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 17 predicate places. [2023-08-24 07:20:21,331 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 62 transitions, 357 flow [2023-08-24 07:20:21,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:21,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 07:20:21,332 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 07:20:21,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 07:20:21,332 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 07:20:21,332 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 07:20:21,332 INFO L85 PathProgramCache]: Analyzing trace with hash 49168946, now seen corresponding path program 1 times [2023-08-24 07:20:21,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 07:20:21,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420194317] [2023-08-24 07:20:21,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 07:20:21,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 07:20:21,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 07:20:21,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 07:20:21,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 07:20:21,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420194317] [2023-08-24 07:20:21,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420194317] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 07:20:21,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305414968] [2023-08-24 07:20:21,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 07:20:21,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 07:20:21,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 07:20:21,447 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-24 07:20:21,487 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-24 07:20:21,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 07:20:21,559 INFO L262 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-24 07:20:21,560 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 07:20:21,647 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-24 07:20:21,647 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 07:20:21,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-24 07:20:21,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305414968] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 07:20:21,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 07:20:21,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-08-24 07:20:21,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193232819] [2023-08-24 07:20:21,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 07:20:21,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 07:20:21,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 07:20:21,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 07:20:21,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-24 07:20:21,698 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 295 [2023-08-24 07:20:21,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 62 transitions, 357 flow. Second operand has 6 states, 6 states have (on average 134.33333333333334) internal successors, (806), 6 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:21,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 07:20:21,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 295 [2023-08-24 07:20:21,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 07:20:23,709 INFO L124 PetriNetUnfolderBase]: 28973/35717 cut-off events. [2023-08-24 07:20:23,709 INFO L125 PetriNetUnfolderBase]: For 94890/94890 co-relation queries the response was YES. [2023-08-24 07:20:23,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137761 conditions, 35717 events. 28973/35717 cut-off events. For 94890/94890 co-relation queries the response was YES. Maximal size of possible extension queue 976. Compared 145456 event pairs, 5739 based on Foata normal form. 900/36617 useless extension candidates. Maximal degree in co-relation 88518. Up to 15928 conditions per place. [2023-08-24 07:20:23,871 INFO L140 encePairwiseOnDemand]: 290/295 looper letters, 179 selfloop transitions, 8 changer transitions 0/187 dead transitions. [2023-08-24 07:20:23,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 187 transitions, 1478 flow [2023-08-24 07:20:23,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 07:20:23,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 07:20:23,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 740 transitions. [2023-08-24 07:20:23,873 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5016949152542373 [2023-08-24 07:20:23,873 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 740 transitions. [2023-08-24 07:20:23,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 740 transitions. [2023-08-24 07:20:23,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 07:20:23,874 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 740 transitions. [2023-08-24 07:20:23,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 148.0) internal successors, (740), 5 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:23,877 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:23,877 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:23,877 INFO L175 Difference]: Start difference. First operand has 67 places, 62 transitions, 357 flow. Second operand 5 states and 740 transitions. [2023-08-24 07:20:23,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 187 transitions, 1478 flow [2023-08-24 07:20:23,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 187 transitions, 1430 flow, removed 16 selfloop flow, removed 1 redundant places. [2023-08-24 07:20:23,926 INFO L231 Difference]: Finished difference. Result has 73 places, 67 transitions, 397 flow [2023-08-24 07:20:23,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=397, PETRI_PLACES=73, PETRI_TRANSITIONS=67} [2023-08-24 07:20:23,927 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 23 predicate places. [2023-08-24 07:20:23,927 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 67 transitions, 397 flow [2023-08-24 07:20:23,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 134.33333333333334) internal successors, (806), 6 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:23,927 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 07:20:23,927 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 07:20:23,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-24 07:20:24,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 07:20:24,132 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 07:20:24,133 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 07:20:24,133 INFO L85 PathProgramCache]: Analyzing trace with hash 757953015, now seen corresponding path program 1 times [2023-08-24 07:20:24,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 07:20:24,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098923799] [2023-08-24 07:20:24,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 07:20:24,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 07:20:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 07:20:24,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 07:20:24,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 07:20:24,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098923799] [2023-08-24 07:20:24,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098923799] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 07:20:24,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 07:20:24,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 07:20:24,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396768370] [2023-08-24 07:20:24,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 07:20:24,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 07:20:24,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 07:20:24,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 07:20:24,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 07:20:24,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 295 [2023-08-24 07:20:24,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 67 transitions, 397 flow. Second operand has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:24,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 07:20:24,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 295 [2023-08-24 07:20:24,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 07:20:26,231 INFO L124 PetriNetUnfolderBase]: 28517/35261 cut-off events. [2023-08-24 07:20:26,231 INFO L125 PetriNetUnfolderBase]: For 98216/98216 co-relation queries the response was YES. [2023-08-24 07:20:26,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150029 conditions, 35261 events. 28517/35261 cut-off events. For 98216/98216 co-relation queries the response was YES. Maximal size of possible extension queue 975. Compared 146629 event pairs, 1619 based on Foata normal form. 456/35717 useless extension candidates. Maximal degree in co-relation 99537. Up to 15472 conditions per place. [2023-08-24 07:20:26,405 INFO L140 encePairwiseOnDemand]: 290/295 looper letters, 186 selfloop transitions, 10 changer transitions 0/196 dead transitions. [2023-08-24 07:20:26,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 196 transitions, 1571 flow [2023-08-24 07:20:26,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 07:20:26,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 07:20:26,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 738 transitions. [2023-08-24 07:20:26,408 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5003389830508475 [2023-08-24 07:20:26,408 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 738 transitions. [2023-08-24 07:20:26,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 738 transitions. [2023-08-24 07:20:26,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 07:20:26,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 738 transitions. [2023-08-24 07:20:26,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 147.6) internal successors, (738), 5 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:26,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:26,411 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:26,411 INFO L175 Difference]: Start difference. First operand has 73 places, 67 transitions, 397 flow. Second operand 5 states and 738 transitions. [2023-08-24 07:20:26,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 196 transitions, 1571 flow [2023-08-24 07:20:26,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 196 transitions, 1571 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 07:20:26,687 INFO L231 Difference]: Finished difference. Result has 78 places, 72 transitions, 460 flow [2023-08-24 07:20:26,687 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=460, PETRI_PLACES=78, PETRI_TRANSITIONS=72} [2023-08-24 07:20:26,688 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 28 predicate places. [2023-08-24 07:20:26,688 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 72 transitions, 460 flow [2023-08-24 07:20:26,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:26,688 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 07:20:26,688 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 07:20:26,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 07:20:26,688 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 07:20:26,689 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 07:20:26,689 INFO L85 PathProgramCache]: Analyzing trace with hash -48523343, now seen corresponding path program 2 times [2023-08-24 07:20:26,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 07:20:26,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245175753] [2023-08-24 07:20:26,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 07:20:26,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 07:20:26,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 07:20:26,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 07:20:26,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 07:20:26,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245175753] [2023-08-24 07:20:26,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245175753] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 07:20:26,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 07:20:26,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 07:20:26,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082835002] [2023-08-24 07:20:26,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 07:20:26,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 07:20:26,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 07:20:26,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 07:20:26,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 07:20:26,911 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 295 [2023-08-24 07:20:26,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 72 transitions, 460 flow. Second operand has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:26,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 07:20:26,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 295 [2023-08-24 07:20:26,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 07:20:29,110 INFO L124 PetriNetUnfolderBase]: 32569/40201 cut-off events. [2023-08-24 07:20:29,110 INFO L125 PetriNetUnfolderBase]: For 118580/118580 co-relation queries the response was YES. [2023-08-24 07:20:29,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178904 conditions, 40201 events. 32569/40201 cut-off events. For 118580/118580 co-relation queries the response was YES. Maximal size of possible extension queue 1053. Compared 166776 event pairs, 5319 based on Foata normal form. 888/41089 useless extension candidates. Maximal degree in co-relation 118526. Up to 23661 conditions per place. [2023-08-24 07:20:29,462 INFO L140 encePairwiseOnDemand]: 290/295 looper letters, 178 selfloop transitions, 10 changer transitions 0/188 dead transitions. [2023-08-24 07:20:29,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 188 transitions, 1539 flow [2023-08-24 07:20:29,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 07:20:29,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 07:20:29,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 734 transitions. [2023-08-24 07:20:29,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4976271186440678 [2023-08-24 07:20:29,464 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 734 transitions. [2023-08-24 07:20:29,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 734 transitions. [2023-08-24 07:20:29,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 07:20:29,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 734 transitions. [2023-08-24 07:20:29,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 146.8) internal successors, (734), 5 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:29,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:29,467 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:29,467 INFO L175 Difference]: Start difference. First operand has 78 places, 72 transitions, 460 flow. Second operand 5 states and 734 transitions. [2023-08-24 07:20:29,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 188 transitions, 1539 flow [2023-08-24 07:20:29,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 188 transitions, 1524 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-24 07:20:29,858 INFO L231 Difference]: Finished difference. Result has 83 places, 75 transitions, 499 flow [2023-08-24 07:20:29,858 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=499, PETRI_PLACES=83, PETRI_TRANSITIONS=75} [2023-08-24 07:20:29,858 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 33 predicate places. [2023-08-24 07:20:29,858 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 75 transitions, 499 flow [2023-08-24 07:20:29,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:29,859 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 07:20:29,859 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 07:20:29,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 07:20:29,859 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 07:20:29,859 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 07:20:29,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1305311766, now seen corresponding path program 2 times [2023-08-24 07:20:29,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 07:20:29,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225793632] [2023-08-24 07:20:29,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 07:20:29,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 07:20:29,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 07:20:29,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 07:20:29,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 07:20:29,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225793632] [2023-08-24 07:20:29,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225793632] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 07:20:29,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 07:20:29,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 07:20:29,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851882172] [2023-08-24 07:20:29,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 07:20:29,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 07:20:29,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 07:20:29,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 07:20:29,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 07:20:29,962 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 295 [2023-08-24 07:20:29,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 75 transitions, 499 flow. Second operand has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:29,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 07:20:29,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 295 [2023-08-24 07:20:29,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 07:20:32,010 INFO L124 PetriNetUnfolderBase]: 28961/35681 cut-off events. [2023-08-24 07:20:32,011 INFO L125 PetriNetUnfolderBase]: For 113304/113304 co-relation queries the response was YES. [2023-08-24 07:20:32,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165857 conditions, 35681 events. 28961/35681 cut-off events. For 113304/113304 co-relation queries the response was YES. Maximal size of possible extension queue 907. Compared 145276 event pairs, 1643 based on Foata normal form. 444/36125 useless extension candidates. Maximal degree in co-relation 145228. Up to 15910 conditions per place. [2023-08-24 07:20:32,208 INFO L140 encePairwiseOnDemand]: 290/295 looper letters, 187 selfloop transitions, 9 changer transitions 0/196 dead transitions. [2023-08-24 07:20:32,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 196 transitions, 1625 flow [2023-08-24 07:20:32,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 07:20:32,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 07:20:32,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 737 transitions. [2023-08-24 07:20:32,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49966101694915255 [2023-08-24 07:20:32,210 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 737 transitions. [2023-08-24 07:20:32,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 737 transitions. [2023-08-24 07:20:32,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 07:20:32,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 737 transitions. [2023-08-24 07:20:32,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 147.4) internal successors, (737), 5 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:32,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:32,215 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:32,215 INFO L175 Difference]: Start difference. First operand has 83 places, 75 transitions, 499 flow. Second operand 5 states and 737 transitions. [2023-08-24 07:20:32,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 196 transitions, 1625 flow [2023-08-24 07:20:32,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 196 transitions, 1601 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-08-24 07:20:32,944 INFO L231 Difference]: Finished difference. Result has 86 places, 74 transitions, 490 flow [2023-08-24 07:20:32,945 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=490, PETRI_PLACES=86, PETRI_TRANSITIONS=74} [2023-08-24 07:20:32,946 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 36 predicate places. [2023-08-24 07:20:32,946 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 74 transitions, 490 flow [2023-08-24 07:20:32,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:32,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 07:20:32,960 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 07:20:32,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-24 07:20:32,960 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 07:20:32,960 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 07:20:32,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1522859476, now seen corresponding path program 2 times [2023-08-24 07:20:32,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 07:20:32,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892630931] [2023-08-24 07:20:32,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 07:20:32,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 07:20:32,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 07:20:33,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 07:20:33,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 07:20:33,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892630931] [2023-08-24 07:20:33,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892630931] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 07:20:33,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 07:20:33,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 07:20:33,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691121357] [2023-08-24 07:20:33,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 07:20:33,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 07:20:33,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 07:20:33,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 07:20:33,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 07:20:33,053 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 295 [2023-08-24 07:20:33,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 74 transitions, 490 flow. Second operand has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:33,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 07:20:33,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 295 [2023-08-24 07:20:33,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 07:20:34,812 INFO L124 PetriNetUnfolderBase]: 24413/29993 cut-off events. [2023-08-24 07:20:34,812 INFO L125 PetriNetUnfolderBase]: For 112055/112055 co-relation queries the response was YES. [2023-08-24 07:20:34,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139706 conditions, 29993 events. 24413/29993 cut-off events. For 112055/112055 co-relation queries the response was YES. Maximal size of possible extension queue 762. Compared 122857 event pairs, 885 based on Foata normal form. 508/30501 useless extension candidates. Maximal degree in co-relation 122129. Up to 13182 conditions per place. [2023-08-24 07:20:35,000 INFO L140 encePairwiseOnDemand]: 290/295 looper letters, 198 selfloop transitions, 9 changer transitions 0/207 dead transitions. [2023-08-24 07:20:35,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 207 transitions, 1776 flow [2023-08-24 07:20:35,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 07:20:35,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 07:20:35,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 741 transitions. [2023-08-24 07:20:35,011 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5023728813559322 [2023-08-24 07:20:35,011 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 741 transitions. [2023-08-24 07:20:35,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 741 transitions. [2023-08-24 07:20:35,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 07:20:35,012 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 741 transitions. [2023-08-24 07:20:35,013 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 148.2) internal successors, (741), 5 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:35,015 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:35,015 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:35,015 INFO L175 Difference]: Start difference. First operand has 86 places, 74 transitions, 490 flow. Second operand 5 states and 741 transitions. [2023-08-24 07:20:35,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 207 transitions, 1776 flow [2023-08-24 07:20:35,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 207 transitions, 1739 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-08-24 07:20:35,226 INFO L231 Difference]: Finished difference. Result has 90 places, 73 transitions, 494 flow [2023-08-24 07:20:35,226 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=494, PETRI_PLACES=90, PETRI_TRANSITIONS=73} [2023-08-24 07:20:35,227 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 40 predicate places. [2023-08-24 07:20:35,227 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 73 transitions, 494 flow [2023-08-24 07:20:35,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:35,227 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 07:20:35,227 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 07:20:35,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-24 07:20:35,227 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 07:20:35,228 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 07:20:35,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1825918594, now seen corresponding path program 2 times [2023-08-24 07:20:35,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 07:20:35,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721674206] [2023-08-24 07:20:35,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 07:20:35,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 07:20:35,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 07:20:35,471 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-24 07:20:35,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 07:20:35,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721674206] [2023-08-24 07:20:35,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721674206] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 07:20:35,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210226613] [2023-08-24 07:20:35,471 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 07:20:35,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 07:20:35,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 07:20:35,486 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-24 07:20:35,487 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-24 07:20:35,611 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 07:20:35,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 07:20:35,612 INFO L262 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-24 07:20:35,614 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 07:20:35,708 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-24 07:20:35,708 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 07:20:35,778 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-24 07:20:35,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210226613] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 07:20:35,778 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 07:20:35,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-08-24 07:20:35,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701798572] [2023-08-24 07:20:35,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 07:20:35,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 07:20:35,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 07:20:35,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 07:20:35,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-24 07:20:35,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 295 [2023-08-24 07:20:35,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 73 transitions, 494 flow. Second operand has 6 states, 6 states have (on average 135.33333333333334) internal successors, (812), 6 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:35,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 07:20:35,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 295 [2023-08-24 07:20:35,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 07:20:37,945 INFO L124 PetriNetUnfolderBase]: 29277/35873 cut-off events. [2023-08-24 07:20:37,946 INFO L125 PetriNetUnfolderBase]: For 124698/124698 co-relation queries the response was YES. [2023-08-24 07:20:38,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170952 conditions, 35873 events. 29277/35873 cut-off events. For 124698/124698 co-relation queries the response was YES. Maximal size of possible extension queue 874. Compared 145192 event pairs, 5255 based on Foata normal form. 1016/36889 useless extension candidates. Maximal degree in co-relation 153598. Up to 20069 conditions per place. [2023-08-24 07:20:38,160 INFO L140 encePairwiseOnDemand]: 290/295 looper letters, 193 selfloop transitions, 8 changer transitions 0/201 dead transitions. [2023-08-24 07:20:38,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 201 transitions, 1711 flow [2023-08-24 07:20:38,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 07:20:38,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 07:20:38,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 738 transitions. [2023-08-24 07:20:38,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5003389830508475 [2023-08-24 07:20:38,162 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 738 transitions. [2023-08-24 07:20:38,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 738 transitions. [2023-08-24 07:20:38,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 07:20:38,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 738 transitions. [2023-08-24 07:20:38,180 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 147.6) internal successors, (738), 5 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:38,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:38,182 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:38,182 INFO L175 Difference]: Start difference. First operand has 90 places, 73 transitions, 494 flow. Second operand 5 states and 738 transitions. [2023-08-24 07:20:38,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 201 transitions, 1711 flow [2023-08-24 07:20:38,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 201 transitions, 1702 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-24 07:20:38,384 INFO L231 Difference]: Finished difference. Result has 95 places, 76 transitions, 535 flow [2023-08-24 07:20:38,385 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=535, PETRI_PLACES=95, PETRI_TRANSITIONS=76} [2023-08-24 07:20:38,386 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 45 predicate places. [2023-08-24 07:20:38,386 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 76 transitions, 535 flow [2023-08-24 07:20:38,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 135.33333333333334) internal successors, (812), 6 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:38,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 07:20:38,386 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 07:20:38,392 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-24 07:20:38,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 07:20:38,593 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 07:20:38,593 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 07:20:38,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1783679507, now seen corresponding path program 2 times [2023-08-24 07:20:38,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 07:20:38,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242431504] [2023-08-24 07:20:38,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 07:20:38,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 07:20:38,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 07:20:38,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 07:20:38,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 07:20:38,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242431504] [2023-08-24 07:20:38,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242431504] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 07:20:38,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 07:20:38,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 07:20:38,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702701667] [2023-08-24 07:20:38,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 07:20:38,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 07:20:38,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 07:20:38,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 07:20:38,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 07:20:38,706 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 295 [2023-08-24 07:20:38,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 76 transitions, 535 flow. Second operand has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:38,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 07:20:38,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 295 [2023-08-24 07:20:38,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 07:20:41,288 INFO L124 PetriNetUnfolderBase]: 33421/40853 cut-off events. [2023-08-24 07:20:41,288 INFO L125 PetriNetUnfolderBase]: For 170067/170067 co-relation queries the response was YES. [2023-08-24 07:20:41,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204727 conditions, 40853 events. 33421/40853 cut-off events. For 170067/170067 co-relation queries the response was YES. Maximal size of possible extension queue 989. Compared 162364 event pairs, 10579 based on Foata normal form. 836/41689 useless extension candidates. Maximal degree in co-relation 184652. Up to 23061 conditions per place. [2023-08-24 07:20:41,542 INFO L140 encePairwiseOnDemand]: 290/295 looper letters, 209 selfloop transitions, 8 changer transitions 0/217 dead transitions. [2023-08-24 07:20:41,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 217 transitions, 1913 flow [2023-08-24 07:20:41,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 07:20:41,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 07:20:41,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 742 transitions. [2023-08-24 07:20:41,544 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5030508474576271 [2023-08-24 07:20:41,544 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 742 transitions. [2023-08-24 07:20:41,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 742 transitions. [2023-08-24 07:20:41,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 07:20:41,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 742 transitions. [2023-08-24 07:20:41,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 148.4) internal successors, (742), 5 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:41,546 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:41,547 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 295.0) internal successors, (1770), 6 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:41,547 INFO L175 Difference]: Start difference. First operand has 95 places, 76 transitions, 535 flow. Second operand 5 states and 742 transitions. [2023-08-24 07:20:41,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 217 transitions, 1913 flow [2023-08-24 07:20:41,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 217 transitions, 1835 flow, removed 28 selfloop flow, removed 2 redundant places. [2023-08-24 07:20:41,921 INFO L231 Difference]: Finished difference. Result has 99 places, 79 transitions, 568 flow [2023-08-24 07:20:41,921 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=568, PETRI_PLACES=99, PETRI_TRANSITIONS=79} [2023-08-24 07:20:41,923 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 49 predicate places. [2023-08-24 07:20:41,923 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 79 transitions, 568 flow [2023-08-24 07:20:41,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:20:41,923 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 07:20:41,923 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 07:20:41,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-24 07:20:41,923 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 07:20:41,923 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 07:20:41,923 INFO L85 PathProgramCache]: Analyzing trace with hash 505429562, now seen corresponding path program 1 times [2023-08-24 07:20:41,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 07:20:41,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110110167] [2023-08-24 07:20:41,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 07:20:41,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 07:20:41,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 07:20:42,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-24 07:20:42,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 07:20:42,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110110167] [2023-08-24 07:20:42,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110110167] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 07:20:42,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807468790] [2023-08-24 07:20:42,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 07:20:42,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 07:20:42,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 07:20:42,609 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-24 07:20:42,611 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-24 07:20:42,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 07:20:42,874 INFO L262 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-24 07:20:42,876 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 07:22:23,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 07:22:23,791 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 07:22:49,179 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-24 07:22:49,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807468790] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 07:22:49,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 07:22:49,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 15 [2023-08-24 07:22:49,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007293762] [2023-08-24 07:22:49,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 07:22:49,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-24 07:22:49,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 07:22:49,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-24 07:22:49,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=186, Unknown=29, NotChecked=0, Total=272 [2023-08-24 07:22:49,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 295 [2023-08-24 07:22:49,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 79 transitions, 568 flow. Second operand has 17 states, 17 states have (on average 119.17647058823529) internal successors, (2026), 17 states have internal predecessors, (2026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:22:49,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 07:22:49,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 295 [2023-08-24 07:22:49,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 07:23:12,622 WARN L234 SmtUtils]: Spent 21.74s on a formula simplification. DAG size of input: 98 DAG size of output: 42 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 07:23:14,690 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 [] [2023-08-24 07:23:16,713 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-24 07:23:18,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 [] [2023-08-24 07:23:28,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 07:23:30,663 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-24 07:23:33,225 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-24 07:23:35,234 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-24 07:23:37,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-24 07:23:39,254 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 [] [2023-08-24 07:23:41,273 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 [] [2023-08-24 07:23:47,663 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-24 07:23:56,373 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-24 07:23:57,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 07:23:59,469 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-24 07:24:01,511 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-24 07:24:03,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 07:24:05,543 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-24 07:24:08,214 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-24 07:24:10,223 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-24 07:24:12,736 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-24 07:24:15,981 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-24 07:24:17,984 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-24 07:24:19,995 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-24 07:24:22,003 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-24 07:25:17,637 WARN L234 SmtUtils]: Spent 40.96s on a formula simplification. DAG size of input: 69 DAG size of output: 65 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 07:25:20,005 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-24 07:25:22,012 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-24 07:25:24,015 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-24 07:25:34,580 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-24 07:25:36,586 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-24 07:25:38,593 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-24 07:25:40,598 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-24 07:25:42,614 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 [] [2023-08-24 07:25:44,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 07:25:46,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 07:25:48,634 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 [] [2023-08-24 07:25:50,839 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-24 07:25:52,844 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-24 07:25:54,850 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-24 07:25:56,854 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-24 07:25:58,858 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-24 07:26:00,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-24 07:26:02,869 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-24 07:26:04,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 07:26:06,880 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-24 07:26:08,885 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-24 07:26:10,897 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-24 07:26:12,901 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-24 07:26:14,905 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-24 07:26:16,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-24 07:26:19,119 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-24 07:26:21,129 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-24 07:26:23,133 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-24 07:26:25,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 07:26:27,203 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-24 07:26:29,209 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-24 07:26:31,226 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 [] [2023-08-24 07:26:32,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 07:26:34,608 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-24 07:26:36,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 07:26:38,183 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-24 07:26:40,400 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-24 07:26:51,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 07:27:00,799 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-24 07:27:02,937 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-24 07:27:05,507 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-24 07:27:08,657 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-24 07:27:20,710 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-24 07:27:22,962 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-24 07:27:24,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 [] [2023-08-24 07:27:26,971 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-24 07:27:28,977 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-24 07:27:32,734 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 [] [2023-08-24 07:27:35,123 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 [] [2023-08-24 07:27:40,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 07:27:42,759 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-24 07:27:44,764 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-24 07:27:46,779 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-24 07:27:49,573 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-24 07:27:51,684 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-24 07:27:53,778 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 [] [2023-08-24 07:27:55,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 07:27:57,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 07:28:01,585 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-24 07:28:03,591 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-24 07:28:05,595 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-24 07:28:07,601 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-24 07:28:09,754 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-24 07:28:11,875 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 [] [2023-08-24 07:28:13,880 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 [] [2023-08-24 07:28:15,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 07:28:20,086 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-24 07:28:22,092 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-24 07:28:24,099 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-24 07:28:26,102 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-24 07:28:29,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 07:28:31,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 07:28:33,345 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 [] [2023-08-24 07:28:35,349 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 [] [2023-08-24 07:28:38,272 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-24 07:28:40,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-24 07:28:42,287 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-24 07:28:44,944 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 [] [2023-08-24 07:28:46,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 07:28:48,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 07:28:50,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 07:28:52,221 INFO L124 PetriNetUnfolderBase]: 41365/50853 cut-off events. [2023-08-24 07:28:52,221 INFO L125 PetriNetUnfolderBase]: For 193389/193389 co-relation queries the response was YES. [2023-08-24 07:28:52,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253641 conditions, 50853 events. 41365/50853 cut-off events. For 193389/193389 co-relation queries the response was YES. Maximal size of possible extension queue 1263. Compared 215561 event pairs, 7353 based on Foata normal form. 2/50855 useless extension candidates. Maximal degree in co-relation 232265. Up to 41769 conditions per place. [2023-08-24 07:28:52,770 INFO L140 encePairwiseOnDemand]: 285/295 looper letters, 366 selfloop transitions, 118 changer transitions 13/497 dead transitions. [2023-08-24 07:28:52,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 497 transitions, 3965 flow [2023-08-24 07:28:52,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-24 07:28:52,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-24 07:28:52,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2179 transitions. [2023-08-24 07:28:52,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46165254237288134 [2023-08-24 07:28:52,791 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 2179 transitions. [2023-08-24 07:28:52,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 2179 transitions. [2023-08-24 07:28:52,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 07:28:52,792 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 2179 transitions. [2023-08-24 07:28:52,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 136.1875) internal successors, (2179), 16 states have internal predecessors, (2179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:28:52,802 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 295.0) internal successors, (5015), 17 states have internal predecessors, (5015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:28:52,803 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 295.0) internal successors, (5015), 17 states have internal predecessors, (5015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:28:52,803 INFO L175 Difference]: Start difference. First operand has 99 places, 79 transitions, 568 flow. Second operand 16 states and 2179 transitions. [2023-08-24 07:28:52,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 497 transitions, 3965 flow [2023-08-24 07:28:53,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 497 transitions, 3898 flow, removed 18 selfloop flow, removed 1 redundant places. [2023-08-24 07:28:53,560 INFO L231 Difference]: Finished difference. Result has 120 places, 192 transitions, 1955 flow [2023-08-24 07:28:53,560 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1955, PETRI_PLACES=120, PETRI_TRANSITIONS=192} [2023-08-24 07:28:53,561 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 70 predicate places. [2023-08-24 07:28:53,561 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 192 transitions, 1955 flow [2023-08-24 07:28:53,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 119.17647058823529) internal successors, (2026), 17 states have internal predecessors, (2026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:28:53,566 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 07:28:53,570 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 07:28:53,575 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-24 07:28:53,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-08-24 07:28:53,775 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 07:28:53,775 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 07:28:53,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1464858319, now seen corresponding path program 1 times [2023-08-24 07:28:53,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 07:28:53,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389028661] [2023-08-24 07:28:53,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 07:28:53,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 07:28:53,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 07:28:54,300 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-24 07:28:54,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 07:28:54,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389028661] [2023-08-24 07:28:54,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389028661] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 07:28:54,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525140775] [2023-08-24 07:28:54,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 07:28:54,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 07:28:54,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 07:28:54,301 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-24 07:28:54,303 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-24 07:28:54,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 07:28:54,693 INFO L262 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-24 07:28:54,694 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 07:29:03,540 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-24 07:29:03,540 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 07:29:05,719 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-24 07:29:05,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525140775] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 07:29:05,719 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 07:29:05,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2023-08-24 07:29:05,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840780453] [2023-08-24 07:29:05,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 07:29:05,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-24 07:29:05,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 07:29:05,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-24 07:29:05,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=168, Unknown=1, NotChecked=0, Total=240 [2023-08-24 07:29:05,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 295 [2023-08-24 07:29:05,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 192 transitions, 1955 flow. Second operand has 16 states, 16 states have (on average 119.6875) internal successors, (1915), 16 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:29:05,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 07:29:05,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 295 [2023-08-24 07:29:05,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 07:29:08,615 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-24 07:29:10,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 07:29:11,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 07:29:14,737 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 [] [2023-08-24 07:29:16,523 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 [] [2023-08-24 07:29:18,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 07:29:20,489 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-24 07:29:22,505 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 [] [2023-08-24 07:29:25,726 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-24 07:29:27,767 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-24 07:29:29,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 07:29:31,765 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-24 07:29:33,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 07:29:36,886 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-24 07:29:38,981 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-24 07:29:41,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 07:29:42,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 07:29:47,007 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-24 07:29:50,412 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-24 07:29:52,433 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 [] [2023-08-24 07:29:54,447 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-24 07:29:57,884 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-24 07:30:01,011 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-24 07:30:03,025 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 [] [2023-08-24 07:30:04,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 07:30:08,185 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-24 07:30:11,158 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 [] [2023-08-24 07:30:13,628 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-24 07:30:18,057 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 [] [2023-08-24 07:30:20,462 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-24 07:30:22,883 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 [] [2023-08-24 07:30:24,159 INFO L124 PetriNetUnfolderBase]: 49655/61203 cut-off events. [2023-08-24 07:30:24,159 INFO L125 PetriNetUnfolderBase]: For 268660/268660 co-relation queries the response was YES. [2023-08-24 07:30:24,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334784 conditions, 61203 events. 49655/61203 cut-off events. For 268660/268660 co-relation queries the response was YES. Maximal size of possible extension queue 1533. Compared 270367 event pairs, 6983 based on Foata normal form. 90/61293 useless extension candidates. Maximal degree in co-relation 333267. Up to 52029 conditions per place. [2023-08-24 07:30:24,714 INFO L140 encePairwiseOnDemand]: 285/295 looper letters, 464 selfloop transitions, 116 changer transitions 9/589 dead transitions. [2023-08-24 07:30:24,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 589 transitions, 5571 flow [2023-08-24 07:30:24,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-24 07:30:24,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-24 07:30:24,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1931 transitions. [2023-08-24 07:30:24,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46755447941888617 [2023-08-24 07:30:24,732 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1931 transitions. [2023-08-24 07:30:24,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1931 transitions. [2023-08-24 07:30:24,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 07:30:24,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1931 transitions. [2023-08-24 07:30:24,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 137.92857142857142) internal successors, (1931), 14 states have internal predecessors, (1931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:30:24,738 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 295.0) internal successors, (4425), 15 states have internal predecessors, (4425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:30:24,738 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 295.0) internal successors, (4425), 15 states have internal predecessors, (4425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:30:24,738 INFO L175 Difference]: Start difference. First operand has 120 places, 192 transitions, 1955 flow. Second operand 14 states and 1931 transitions. [2023-08-24 07:30:24,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 589 transitions, 5571 flow [2023-08-24 07:30:26,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 589 transitions, 5328 flow, removed 118 selfloop flow, removed 1 redundant places. [2023-08-24 07:30:26,741 INFO L231 Difference]: Finished difference. Result has 140 places, 303 transitions, 3279 flow [2023-08-24 07:30:26,741 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=1712, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3279, PETRI_PLACES=140, PETRI_TRANSITIONS=303} [2023-08-24 07:30:26,742 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 90 predicate places. [2023-08-24 07:30:26,742 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 303 transitions, 3279 flow [2023-08-24 07:30:26,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 119.6875) internal successors, (1915), 16 states have internal predecessors, (1915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:30:26,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 07:30:26,742 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 07:30:26,747 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-24 07:30:26,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-24 07:30:26,948 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 07:30:26,948 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 07:30:26,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1235535718, now seen corresponding path program 2 times [2023-08-24 07:30:26,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 07:30:26,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935937461] [2023-08-24 07:30:26,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 07:30:26,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 07:30:27,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 07:30:27,504 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-24 07:30:27,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 07:30:27,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935937461] [2023-08-24 07:30:27,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935937461] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 07:30:27,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [158564798] [2023-08-24 07:30:27,505 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 07:30:27,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 07:30:27,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 07:30:27,513 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-24 07:30:27,513 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-24 07:30:27,747 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 07:30:27,748 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 07:30:27,749 INFO L262 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-24 07:30:27,750 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 07:30:50,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 07:30:50,271 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 07:31:08,290 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-24 07:31:08,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [158564798] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 07:31:08,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 07:31:08,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2023-08-24 07:31:08,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721956661] [2023-08-24 07:31:08,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 07:31:08,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-24 07:31:08,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 07:31:08,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-24 07:31:08,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=138, Unknown=16, NotChecked=0, Total=210 [2023-08-24 07:31:08,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 295 [2023-08-24 07:31:08,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 303 transitions, 3279 flow. Second operand has 15 states, 15 states have (on average 120.33333333333333) internal successors, (1805), 15 states have internal predecessors, (1805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:31:08,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 07:31:08,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 295 [2023-08-24 07:31:08,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 07:31:10,526 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-24 07:31:13,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 07:31:15,863 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-24 07:31:18,005 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-24 07:31:20,058 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-24 07:31:30,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 07:31:32,142 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 [] [2023-08-24 07:31:39,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 07:31:42,374 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-24 07:31:53,131 WARN L234 SmtUtils]: Spent 7.11s on a formula simplification. DAG size of input: 69 DAG size of output: 60 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 07:31:59,641 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-24 07:32:02,412 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 07:32:06,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 07:32:08,796 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-24 07:32:10,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 07:32:13,180 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-24 07:32:18,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 07:32:21,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 07:32:23,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 07:32:37,674 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-24 07:32:48,995 INFO L124 PetriNetUnfolderBase]: 69710/86052 cut-off events. [2023-08-24 07:32:48,995 INFO L125 PetriNetUnfolderBase]: For 487683/487683 co-relation queries the response was YES. [2023-08-24 07:32:49,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 506245 conditions, 86052 events. 69710/86052 cut-off events. For 487683/487683 co-relation queries the response was YES. Maximal size of possible extension queue 2266. Compared 397534 event pairs, 7615 based on Foata normal form. 253/86305 useless extension candidates. Maximal degree in co-relation 504893. Up to 65239 conditions per place. [2023-08-24 07:32:50,281 INFO L140 encePairwiseOnDemand]: 285/295 looper letters, 695 selfloop transitions, 320 changer transitions 18/1033 dead transitions. [2023-08-24 07:32:50,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 1033 transitions, 10810 flow [2023-08-24 07:32:50,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-08-24 07:32:50,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-08-24 07:32:50,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 3352 transitions. [2023-08-24 07:32:50,286 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4545084745762712 [2023-08-24 07:32:50,286 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 3352 transitions. [2023-08-24 07:32:50,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 3352 transitions. [2023-08-24 07:32:50,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 07:32:50,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 3352 transitions. [2023-08-24 07:32:50,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 134.08) internal successors, (3352), 25 states have internal predecessors, (3352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:32:50,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 295.0) internal successors, (7670), 26 states have internal predecessors, (7670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:32:50,296 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 295.0) internal successors, (7670), 26 states have internal predecessors, (7670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:32:50,296 INFO L175 Difference]: Start difference. First operand has 140 places, 303 transitions, 3279 flow. Second operand 25 states and 3352 transitions. [2023-08-24 07:32:50,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 1033 transitions, 10810 flow [2023-08-24 07:32:54,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 1033 transitions, 10417 flow, removed 193 selfloop flow, removed 1 redundant places. [2023-08-24 07:32:54,738 INFO L231 Difference]: Finished difference. Result has 173 places, 594 transitions, 7390 flow [2023-08-24 07:32:54,738 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=295, PETRI_DIFFERENCE_MINUEND_FLOW=2886, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=7390, PETRI_PLACES=173, PETRI_TRANSITIONS=594} [2023-08-24 07:32:54,739 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 123 predicate places. [2023-08-24 07:32:54,739 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 594 transitions, 7390 flow [2023-08-24 07:32:54,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 120.33333333333333) internal successors, (1805), 15 states have internal predecessors, (1805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 07:32:54,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 07:32:54,739 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 07:32:54,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-08-24 07:32:54,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 07:32:54,944 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-24 07:32:54,944 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 07:32:54,945 INFO L85 PathProgramCache]: Analyzing trace with hash -556185778, now seen corresponding path program 3 times [2023-08-24 07:32:54,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 07:32:54,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890249286] [2023-08-24 07:32:54,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 07:32:54,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 07:32:55,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 07:32:55,159 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-24 07:32:55,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 07:32:55,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890249286] [2023-08-24 07:32:55,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890249286] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 07:32:55,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884599980] [2023-08-24 07:32:55,159 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 07:32:55,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 07:32:55,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 07:32:55,160 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-24 07:32:55,162 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-24 07:32:55,421 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-24 07:32:55,421 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 07:32:55,423 INFO L262 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-24 07:32:55,424 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 07:33:47,158 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (div (* (- 1) c_~x6~0) 2))) (let ((.cse1 (mod c_~x1~0 4294967296)) (.cse2 (mod c_~x3~0 4294967296)) (.cse0 (mod (div (* (- 1) .cse5) 2) 4294967296)) (.cse4 (mod c_~x5~0 4294967296)) (.cse3 (+ (mod (* .cse5 4294967295) 4294967296) 1))) (and (= .cse0 (mod (* 4294967295 (div (* (- 1) c_~x5~0) 2)) 4294967296)) (< 0 .cse1) (= .cse1 (mod c_~x2~0 4294967296)) (= .cse2 (mod c_~x4~0 4294967296)) (<= .cse3 .cse4) (< 0 .cse2) (= (mod c_~x6~0 2) 0) (= (mod c_~x5~0 2) 0) (<= (+ .cse0 1) .cse4) (= (mod .cse5 2) 0) (<= .cse3 (mod c_~x6~0 4294967296))))) is different from false Received shutdown request... [2023-08-24 07:34:36,840 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-24 07:34:36,845 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-24 07:34:37,862 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-24 07:34:38,061 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-08-24 07:34:38,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2023-08-24 07:34:38,067 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-08-24 07:34:38,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-24 07:34:38,068 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.pop(UndoableWrapperScript.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.restore(UndoableWrapperScript.java:87) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:282) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:729) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-08-24 07:34:38,070 INFO L158 Benchmark]: Toolchain (without parser) took 869848.69ms. Allocated memory was 402.7MB in the beginning and 12.9GB in the end (delta: 12.5GB). Free memory was 378.1MB in the beginning and 8.8GB in the end (delta: -8.4GB). Peak memory consumption was 4.1GB. Max. memory is 16.0GB. [2023-08-24 07:34:38,070 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 402.7MB. Free memory was 380.6MB in the beginning and 380.4MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 07:34:38,071 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.76ms. Allocated memory is still 402.7MB. Free memory was 377.3MB in the beginning and 366.0MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-08-24 07:34:38,071 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.48ms. Allocated memory is still 402.7MB. Free memory was 366.0MB in the beginning and 363.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 07:34:38,071 INFO L158 Benchmark]: Boogie Preprocessor took 34.10ms. Allocated memory is still 402.7MB. Free memory was 363.9MB in the beginning and 362.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 07:34:38,072 INFO L158 Benchmark]: RCFGBuilder took 394.85ms. Allocated memory is still 402.7MB. Free memory was 362.6MB in the beginning and 344.8MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. [2023-08-24 07:34:38,072 INFO L158 Benchmark]: TraceAbstraction took 869186.41ms. Allocated memory was 402.7MB in the beginning and 12.9GB in the end (delta: 12.5GB). Free memory was 343.7MB in the beginning and 8.8GB in the end (delta: -8.4GB). Peak memory consumption was 4.0GB. Max. memory is 16.0GB. [2023-08-24 07:34:38,073 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 402.7MB. Free memory was 380.6MB in the beginning and 380.4MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 190.76ms. Allocated memory is still 402.7MB. Free memory was 377.3MB in the beginning and 366.0MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 38.48ms. Allocated memory is still 402.7MB. Free memory was 366.0MB in the beginning and 363.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 34.10ms. Allocated memory is still 402.7MB. Free memory was 363.9MB in the beginning and 362.6MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 394.85ms. Allocated memory is still 402.7MB. Free memory was 362.6MB in the beginning and 344.8MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.0GB. * TraceAbstraction took 869186.41ms. Allocated memory was 402.7MB in the beginning and 12.9GB in the end (delta: 12.5GB). Free memory was 343.7MB in the beginning and 8.8GB in the end (delta: -8.4GB). Peak memory consumption was 4.0GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.5s, 152 PlacesBefore, 50 PlacesAfterwards, 147 TransitionsBefore, 37 TransitionsAfterwards, 2916 CoEnabledTransitionPairs, 7 FixpointIterations, 60 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 7 TrivialYvCompositions, 12 ConcurrentYvCompositions, 8 ChoiceCompositions, 126 TotalNumberOfCompositions, 3523 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3523, independent: 3523, independent conditional: 0, independent unconditional: 3523, 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: 1562, independent: 1562, independent conditional: 0, independent unconditional: 1562, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3523, independent: 1961, independent conditional: 0, independent unconditional: 1961, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1562, unknown conditional: 0, unknown unconditional: 1562] , Statistics on independence cache: Total cache size (in pairs): 147, Positive cache size: 147, Positive conditional cache size: 0, Positive unconditional cache size: 147, 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 - ExceptionOrErrorResult: SMTLIBException: Not enough levels on assertion stack de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Not enough levels on assertion stack: de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown