/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 PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 13:20:11,654 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 13:20:11,743 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 13:20:11,748 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 13:20:11,749 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 13:20:11,781 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 13:20:11,782 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 13:20:11,783 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 13:20:11,783 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 13:20:11,787 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 13:20:11,787 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 13:20:11,788 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 13:20:11,788 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 13:20:11,789 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 13:20:11,789 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 13:20:11,789 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 13:20:11,790 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 13:20:11,790 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 13:20:11,790 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 13:20:11,790 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 13:20:11,791 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 13:20:11,791 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 13:20:11,792 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 13:20:11,792 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 13:20:11,792 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 13:20:11,793 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 13:20:11,793 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 13:20:11,793 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 13:20:11,793 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 13:20:11,794 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 13:20:11,795 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 13:20:11,795 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 13:20:11,795 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 13:20:11,795 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 13:20:11,795 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 13:20:11,796 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 -> PROGRAM_FIRST [2023-08-24 13:20:12,121 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 13:20:12,150 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 13:20:12,152 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 13:20:12,153 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 13:20:12,154 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 13:20:12,156 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c [2023-08-24 13:20:13,452 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 13:20:13,697 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 13:20:13,698 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c [2023-08-24 13:20:13,707 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6b9d4a30/fc1d3ec5e680440a928ee0cc64bd109b/FLAG45995446b [2023-08-24 13:20:13,726 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6b9d4a30/fc1d3ec5e680440a928ee0cc64bd109b [2023-08-24 13:20:13,732 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 13:20:13,733 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 13:20:13,736 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 13:20:13,737 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 13:20:13,739 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 13:20:13,741 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 01:20:13" (1/1) ... [2023-08-24 13:20:13,742 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48d16d5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:20:13, skipping insertion in model container [2023-08-24 13:20:13,742 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 01:20:13" (1/1) ... [2023-08-24 13:20:13,765 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 13:20:13,956 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-exp2x4.wvr.c[2309,2322] [2023-08-24 13:20:13,961 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 13:20:13,971 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 13:20:14,007 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-exp2x4.wvr.c[2309,2322] [2023-08-24 13:20:14,008 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 13:20:14,024 INFO L206 MainTranslator]: Completed translation [2023-08-24 13:20:14,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:20:14 WrapperNode [2023-08-24 13:20:14,024 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 13:20:14,025 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 13:20:14,026 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 13:20:14,026 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 13:20:14,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:20:14" (1/1) ... [2023-08-24 13:20:14,046 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:20:14" (1/1) ... [2023-08-24 13:20:14,075 INFO L138 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 96 [2023-08-24 13:20:14,076 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 13:20:14,077 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 13:20:14,077 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 13:20:14,077 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 13:20:14,084 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:20:14" (1/1) ... [2023-08-24 13:20:14,085 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:20:14" (1/1) ... [2023-08-24 13:20:14,097 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:20:14" (1/1) ... [2023-08-24 13:20:14,097 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:20:14" (1/1) ... [2023-08-24 13:20:14,104 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:20:14" (1/1) ... [2023-08-24 13:20:14,107 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:20:14" (1/1) ... [2023-08-24 13:20:14,109 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:20:14" (1/1) ... [2023-08-24 13:20:14,109 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:20:14" (1/1) ... [2023-08-24 13:20:14,111 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 13:20:14,112 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 13:20:14,112 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 13:20:14,119 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 13:20:14,120 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:20:14" (1/1) ... [2023-08-24 13:20:14,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 13:20:14,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 13:20:14,154 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 13:20:14,184 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 13:20:14,200 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 13:20:14,201 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-24 13:20:14,201 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-24 13:20:14,201 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-24 13:20:14,202 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-24 13:20:14,202 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-24 13:20:14,202 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-24 13:20:14,202 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-08-24 13:20:14,202 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-08-24 13:20:14,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 13:20:14,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 13:20:14,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 13:20:14,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 13:20:14,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 13:20:14,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-24 13:20:14,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 13:20:14,204 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 13:20:14,300 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 13:20:14,302 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 13:20:14,607 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 13:20:14,614 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 13:20:14,615 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-24 13:20:14,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 01:20:14 BoogieIcfgContainer [2023-08-24 13:20:14,619 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 13:20:14,621 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 13:20:14,622 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 13:20:14,624 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 13:20:14,625 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 01:20:13" (1/3) ... [2023-08-24 13:20:14,626 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@518a5c5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 01:20:14, skipping insertion in model container [2023-08-24 13:20:14,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 01:20:14" (2/3) ... [2023-08-24 13:20:14,626 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@518a5c5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 01:20:14, skipping insertion in model container [2023-08-24 13:20:14,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 01:20:14" (3/3) ... [2023-08-24 13:20:14,628 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x4.wvr.c [2023-08-24 13:20:14,645 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 13:20:14,645 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-24 13:20:14,645 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 13:20:14,757 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-24 13:20:14,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 127 transitions, 286 flow [2023-08-24 13:20:14,852 INFO L124 PetriNetUnfolderBase]: 10/123 cut-off events. [2023-08-24 13:20:14,852 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-24 13:20:14,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 123 events. 10/123 cut-off events. For 4/4 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/112 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-08-24 13:20:14,858 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 127 transitions, 286 flow [2023-08-24 13:20:14,862 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 114 places, 111 transitions, 246 flow [2023-08-24 13:20:14,865 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 13:20:14,872 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 114 places, 111 transitions, 246 flow [2023-08-24 13:20:14,875 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 114 places, 111 transitions, 246 flow [2023-08-24 13:20:14,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 114 places, 111 transitions, 246 flow [2023-08-24 13:20:14,917 INFO L124 PetriNetUnfolderBase]: 10/111 cut-off events. [2023-08-24 13:20:14,918 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-24 13:20:14,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128 conditions, 111 events. 10/111 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 61 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2023-08-24 13:20:14,920 INFO L119 LiptonReduction]: Number of co-enabled transitions 1512 [2023-08-24 13:20:18,445 INFO L134 LiptonReduction]: Checked pairs total: 1649 [2023-08-24 13:20:18,446 INFO L136 LiptonReduction]: Total number of compositions: 99 [2023-08-24 13:20:18,458 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 13:20:18,464 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;@5d6ffc0c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 13:20:18,464 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-24 13:20:18,469 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 13:20:18,470 INFO L124 PetriNetUnfolderBase]: 4/24 cut-off events. [2023-08-24 13:20:18,470 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-24 13:20:18,470 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 13:20:18,471 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] [2023-08-24 13:20:18,471 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 2 more)] === [2023-08-24 13:20:18,475 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 13:20:18,475 INFO L85 PathProgramCache]: Analyzing trace with hash 340783593, now seen corresponding path program 1 times [2023-08-24 13:20:18,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 13:20:18,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748736042] [2023-08-24 13:20:18,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:20:18,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 13:20:18,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:20:19,121 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 13:20:19,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 13:20:19,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748736042] [2023-08-24 13:20:19,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748736042] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 13:20:19,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 13:20:19,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 13:20:19,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179123146] [2023-08-24 13:20:19,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 13:20:19,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 13:20:19,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 13:20:19,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 13:20:19,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 13:20:19,153 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 226 [2023-08-24 13:20:19,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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 13:20:19,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 13:20:19,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 226 [2023-08-24 13:20:19,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 13:20:19,331 INFO L124 PetriNetUnfolderBase]: 497/677 cut-off events. [2023-08-24 13:20:19,331 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2023-08-24 13:20:19,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1448 conditions, 677 events. 497/677 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1778 event pairs, 117 based on Foata normal form. 1/414 useless extension candidates. Maximal degree in co-relation 1016. Up to 471 conditions per place. [2023-08-24 13:20:19,338 INFO L140 encePairwiseOnDemand]: 220/226 looper letters, 41 selfloop transitions, 5 changer transitions 1/47 dead transitions. [2023-08-24 13:20:19,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 47 transitions, 233 flow [2023-08-24 13:20:19,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 13:20:19,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 13:20:19,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2023-08-24 13:20:19,351 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45132743362831856 [2023-08-24 13:20:19,352 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 306 transitions. [2023-08-24 13:20:19,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 306 transitions. [2023-08-24 13:20:19,353 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 13:20:19,355 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 306 transitions. [2023-08-24 13:20:19,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states 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 13:20:19,361 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 states 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 13:20:19,362 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 states 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 13:20:19,364 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 74 flow. Second operand 3 states and 306 transitions. [2023-08-24 13:20:19,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 47 transitions, 233 flow [2023-08-24 13:20:19,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 47 transitions, 203 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-08-24 13:20:19,369 INFO L231 Difference]: Finished difference. Result has 29 places, 29 transitions, 91 flow [2023-08-24 13:20:19,371 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=29, PETRI_TRANSITIONS=29} [2023-08-24 13:20:19,373 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -5 predicate places. [2023-08-24 13:20:19,374 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 29 transitions, 91 flow [2023-08-24 13:20:19,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states 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 13:20:19,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 13:20:19,374 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] [2023-08-24 13:20:19,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 13:20:19,375 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 2 more)] === [2023-08-24 13:20:19,375 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 13:20:19,375 INFO L85 PathProgramCache]: Analyzing trace with hash -321644511, now seen corresponding path program 1 times [2023-08-24 13:20:19,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 13:20:19,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496767501] [2023-08-24 13:20:19,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:20:19,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 13:20:19,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:20:19,591 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 13:20:19,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 13:20:19,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496767501] [2023-08-24 13:20:19,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496767501] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 13:20:19,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 13:20:19,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 13:20:19,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775697408] [2023-08-24 13:20:19,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 13:20:19,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 13:20:19,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 13:20:19,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 13:20:19,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 13:20:19,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 226 [2023-08-24 13:20:19,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 29 transitions, 91 flow. Second operand has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 states 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 13:20:19,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 13:20:19,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 226 [2023-08-24 13:20:19,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 13:20:19,793 INFO L124 PetriNetUnfolderBase]: 461/641 cut-off events. [2023-08-24 13:20:19,793 INFO L125 PetriNetUnfolderBase]: For 177/177 co-relation queries the response was YES. [2023-08-24 13:20:19,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1641 conditions, 641 events. 461/641 cut-off events. For 177/177 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1830 event pairs, 17 based on Foata normal form. 36/677 useless extension candidates. Maximal degree in co-relation 586. Up to 435 conditions per place. [2023-08-24 13:20:19,797 INFO L140 encePairwiseOnDemand]: 219/226 looper letters, 50 selfloop transitions, 9 changer transitions 1/60 dead transitions. [2023-08-24 13:20:19,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 60 transitions, 289 flow [2023-08-24 13:20:19,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 13:20:19,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 13:20:19,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 398 transitions. [2023-08-24 13:20:19,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44026548672566373 [2023-08-24 13:20:19,801 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 398 transitions. [2023-08-24 13:20:19,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 398 transitions. [2023-08-24 13:20:19,801 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 13:20:19,801 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 398 transitions. [2023-08-24 13:20:19,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states 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 13:20:19,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 226.0) internal successors, (1130), 5 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states 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 13:20:19,805 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 226.0) internal successors, (1130), 5 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states 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 13:20:19,806 INFO L175 Difference]: Start difference. First operand has 29 places, 29 transitions, 91 flow. Second operand 4 states and 398 transitions. [2023-08-24 13:20:19,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 60 transitions, 289 flow [2023-08-24 13:20:19,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 60 transitions, 282 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 13:20:19,807 INFO L231 Difference]: Finished difference. Result has 32 places, 33 transitions, 127 flow [2023-08-24 13:20:19,808 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=127, PETRI_PLACES=32, PETRI_TRANSITIONS=33} [2023-08-24 13:20:19,808 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-08-24 13:20:19,809 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 33 transitions, 127 flow [2023-08-24 13:20:19,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 states 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 13:20:19,809 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 13:20:19,809 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] [2023-08-24 13:20:19,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 13:20:19,810 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 2 more)] === [2023-08-24 13:20:19,810 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 13:20:19,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1574738466, now seen corresponding path program 1 times [2023-08-24 13:20:19,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 13:20:19,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474668217] [2023-08-24 13:20:19,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:20:19,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 13:20:19,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:20:20,072 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 13:20:20,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 13:20:20,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474668217] [2023-08-24 13:20:20,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474668217] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 13:20:20,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 13:20:20,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 13:20:20,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145502596] [2023-08-24 13:20:20,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 13:20:20,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 13:20:20,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 13:20:20,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 13:20:20,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 13:20:20,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 226 [2023-08-24 13:20:20,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 33 transitions, 127 flow. Second operand has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 states 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 13:20:20,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 13:20:20,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 226 [2023-08-24 13:20:20,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 13:20:20,255 INFO L124 PetriNetUnfolderBase]: 431/611 cut-off events. [2023-08-24 13:20:20,255 INFO L125 PetriNetUnfolderBase]: For 478/478 co-relation queries the response was YES. [2023-08-24 13:20:20,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1721 conditions, 611 events. 431/611 cut-off events. For 478/478 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1711 event pairs, 47 based on Foata normal form. 30/641 useless extension candidates. Maximal degree in co-relation 523. Up to 405 conditions per place. [2023-08-24 13:20:20,259 INFO L140 encePairwiseOnDemand]: 219/226 looper letters, 44 selfloop transitions, 11 changer transitions 11/66 dead transitions. [2023-08-24 13:20:20,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 66 transitions, 359 flow [2023-08-24 13:20:20,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 13:20:20,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 13:20:20,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 398 transitions. [2023-08-24 13:20:20,261 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44026548672566373 [2023-08-24 13:20:20,261 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 398 transitions. [2023-08-24 13:20:20,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 398 transitions. [2023-08-24 13:20:20,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 13:20:20,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 398 transitions. [2023-08-24 13:20:20,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states 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 13:20:20,264 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 226.0) internal successors, (1130), 5 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states 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 13:20:20,265 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 226.0) internal successors, (1130), 5 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states 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 13:20:20,265 INFO L175 Difference]: Start difference. First operand has 32 places, 33 transitions, 127 flow. Second operand 4 states and 398 transitions. [2023-08-24 13:20:20,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 66 transitions, 359 flow [2023-08-24 13:20:20,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 66 transitions, 341 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 13:20:20,267 INFO L231 Difference]: Finished difference. Result has 34 places, 37 transitions, 162 flow [2023-08-24 13:20:20,268 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=34, PETRI_TRANSITIONS=37} [2023-08-24 13:20:20,268 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 0 predicate places. [2023-08-24 13:20:20,268 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 37 transitions, 162 flow [2023-08-24 13:20:20,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 states 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 13:20:20,269 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 13:20:20,269 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] [2023-08-24 13:20:20,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 13:20:20,269 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 2 more)] === [2023-08-24 13:20:20,270 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 13:20:20,270 INFO L85 PathProgramCache]: Analyzing trace with hash 763566634, now seen corresponding path program 1 times [2023-08-24 13:20:20,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 13:20:20,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671892895] [2023-08-24 13:20:20,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:20:20,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 13:20:20,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:20:20,416 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 13:20:20,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 13:20:20,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671892895] [2023-08-24 13:20:20,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671892895] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 13:20:20,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539606761] [2023-08-24 13:20:20,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:20:20,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 13:20:20,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 13:20:20,421 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 13:20:20,448 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 13:20:20,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:20:20,551 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-24 13:20:20,556 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 13:20:20,738 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 13:20:20,739 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 13:20:20,817 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 13:20:20,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539606761] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 13:20:20,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 13:20:20,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-24 13:20:20,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797660447] [2023-08-24 13:20:20,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 13:20:20,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 13:20:20,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 13:20:20,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 13:20:20,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-24 13:20:20,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 226 [2023-08-24 13:20:20,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 37 transitions, 162 flow. Second operand has 7 states, 7 states have (on average 92.0) internal successors, (644), 7 states have internal predecessors, (644), 0 states have call successors, (0), 0 states 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 13:20:20,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 13:20:20,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 226 [2023-08-24 13:20:20,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 13:20:21,101 INFO L124 PetriNetUnfolderBase]: 809/1129 cut-off events. [2023-08-24 13:20:21,102 INFO L125 PetriNetUnfolderBase]: For 716/716 co-relation queries the response was YES. [2023-08-24 13:20:21,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3396 conditions, 1129 events. 809/1129 cut-off events. For 716/716 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3542 event pairs, 185 based on Foata normal form. 30/1159 useless extension candidates. Maximal degree in co-relation 819. Up to 422 conditions per place. [2023-08-24 13:20:21,109 INFO L140 encePairwiseOnDemand]: 219/226 looper letters, 85 selfloop transitions, 14 changer transitions 3/102 dead transitions. [2023-08-24 13:20:21,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 102 transitions, 567 flow [2023-08-24 13:20:21,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 13:20:21,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 13:20:21,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 600 transitions. [2023-08-24 13:20:21,113 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4424778761061947 [2023-08-24 13:20:21,113 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 600 transitions. [2023-08-24 13:20:21,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 600 transitions. [2023-08-24 13:20:21,113 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 13:20:21,114 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 600 transitions. [2023-08-24 13:20:21,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 100.0) internal successors, (600), 6 states have internal predecessors, (600), 0 states have call successors, (0), 0 states 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 13:20:21,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 226.0) internal successors, (1582), 7 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states 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 13:20:21,118 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 226.0) internal successors, (1582), 7 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states 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 13:20:21,118 INFO L175 Difference]: Start difference. First operand has 34 places, 37 transitions, 162 flow. Second operand 6 states and 600 transitions. [2023-08-24 13:20:21,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 102 transitions, 567 flow [2023-08-24 13:20:21,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 102 transitions, 558 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 13:20:21,124 INFO L231 Difference]: Finished difference. Result has 41 places, 42 transitions, 224 flow [2023-08-24 13:20:21,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=224, PETRI_PLACES=41, PETRI_TRANSITIONS=42} [2023-08-24 13:20:21,125 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 7 predicate places. [2023-08-24 13:20:21,126 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 42 transitions, 224 flow [2023-08-24 13:20:21,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.0) internal successors, (644), 7 states have internal predecessors, (644), 0 states have call successors, (0), 0 states 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 13:20:21,126 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 13:20:21,126 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] [2023-08-24 13:20:21,136 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 13:20:21,332 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 13:20:21,333 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 2 more)] === [2023-08-24 13:20:21,334 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 13:20:21,334 INFO L85 PathProgramCache]: Analyzing trace with hash -266488156, now seen corresponding path program 2 times [2023-08-24 13:20:21,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 13:20:21,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350090669] [2023-08-24 13:20:21,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:20:21,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 13:20:21,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:20:21,507 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 13:20:21,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 13:20:21,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350090669] [2023-08-24 13:20:21,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350090669] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 13:20:21,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 13:20:21,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 13:20:21,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872601837] [2023-08-24 13:20:21,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 13:20:21,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 13:20:21,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 13:20:21,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 13:20:21,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 13:20:21,510 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 226 [2023-08-24 13:20:21,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 42 transitions, 224 flow. Second operand has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 states 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 13:20:21,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 13:20:21,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 226 [2023-08-24 13:20:21,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 13:20:21,714 INFO L124 PetriNetUnfolderBase]: 897/1245 cut-off events. [2023-08-24 13:20:21,714 INFO L125 PetriNetUnfolderBase]: For 1855/1855 co-relation queries the response was YES. [2023-08-24 13:20:21,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4386 conditions, 1245 events. 897/1245 cut-off events. For 1855/1855 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3982 event pairs, 229 based on Foata normal form. 28/1273 useless extension candidates. Maximal degree in co-relation 2498. Up to 937 conditions per place. [2023-08-24 13:20:21,722 INFO L140 encePairwiseOnDemand]: 220/226 looper letters, 59 selfloop transitions, 10 changer transitions 3/72 dead transitions. [2023-08-24 13:20:21,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 72 transitions, 473 flow [2023-08-24 13:20:21,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 13:20:21,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 13:20:21,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 396 transitions. [2023-08-24 13:20:21,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43805309734513276 [2023-08-24 13:20:21,724 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 396 transitions. [2023-08-24 13:20:21,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 396 transitions. [2023-08-24 13:20:21,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 13:20:21,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 396 transitions. [2023-08-24 13:20:21,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 13:20:21,728 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 226.0) internal successors, (1130), 5 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states 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 13:20:21,728 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 226.0) internal successors, (1130), 5 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states 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 13:20:21,728 INFO L175 Difference]: Start difference. First operand has 41 places, 42 transitions, 224 flow. Second operand 4 states and 396 transitions. [2023-08-24 13:20:21,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 72 transitions, 473 flow [2023-08-24 13:20:21,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 72 transitions, 462 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-24 13:20:21,734 INFO L231 Difference]: Finished difference. Result has 44 places, 43 transitions, 246 flow [2023-08-24 13:20:21,734 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=246, PETRI_PLACES=44, PETRI_TRANSITIONS=43} [2023-08-24 13:20:21,735 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 10 predicate places. [2023-08-24 13:20:21,735 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 43 transitions, 246 flow [2023-08-24 13:20:21,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 states 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 13:20:21,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 13:20:21,736 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] [2023-08-24 13:20:21,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 13:20:21,736 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 2 more)] === [2023-08-24 13:20:21,736 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 13:20:21,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1410911463, now seen corresponding path program 2 times [2023-08-24 13:20:21,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 13:20:21,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852999065] [2023-08-24 13:20:21,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:20:21,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 13:20:21,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:20:21,859 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 13:20:21,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 13:20:21,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852999065] [2023-08-24 13:20:21,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852999065] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 13:20:21,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396370097] [2023-08-24 13:20:21,859 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 13:20:21,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 13:20:21,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 13:20:21,861 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 13:20:21,885 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 13:20:21,975 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 13:20:21,975 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 13:20:21,977 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-24 13:20:21,978 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 13:20:22,073 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 13:20:22,073 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 13:20:22,146 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 13:20:22,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396370097] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 13:20:22,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 13:20:22,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-24 13:20:22,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539871926] [2023-08-24 13:20:22,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 13:20:22,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 13:20:22,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 13:20:22,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 13:20:22,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-24 13:20:22,149 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 226 [2023-08-24 13:20:22,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 43 transitions, 246 flow. Second operand has 7 states, 7 states have (on average 90.28571428571429) internal successors, (632), 7 states have internal predecessors, (632), 0 states have call successors, (0), 0 states 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 13:20:22,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 13:20:22,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 226 [2023-08-24 13:20:22,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 13:20:22,548 INFO L124 PetriNetUnfolderBase]: 1793/2461 cut-off events. [2023-08-24 13:20:22,549 INFO L125 PetriNetUnfolderBase]: For 4636/4636 co-relation queries the response was YES. [2023-08-24 13:20:22,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9082 conditions, 2461 events. 1793/2461 cut-off events. For 4636/4636 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9125 event pairs, 325 based on Foata normal form. 104/2565 useless extension candidates. Maximal degree in co-relation 4890. Up to 1139 conditions per place. [2023-08-24 13:20:22,563 INFO L140 encePairwiseOnDemand]: 219/226 looper letters, 111 selfloop transitions, 14 changer transitions 3/128 dead transitions. [2023-08-24 13:20:22,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 128 transitions, 880 flow [2023-08-24 13:20:22,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 13:20:22,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 13:20:22,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 604 transitions. [2023-08-24 13:20:22,566 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44542772861356933 [2023-08-24 13:20:22,566 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 604 transitions. [2023-08-24 13:20:22,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 604 transitions. [2023-08-24 13:20:22,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 13:20:22,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 604 transitions. [2023-08-24 13:20:22,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 0 states have call successors, (0), 0 states 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 13:20:22,569 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 226.0) internal successors, (1582), 7 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states 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 13:20:22,570 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 226.0) internal successors, (1582), 7 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states 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 13:20:22,570 INFO L175 Difference]: Start difference. First operand has 44 places, 43 transitions, 246 flow. Second operand 6 states and 604 transitions. [2023-08-24 13:20:22,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 128 transitions, 880 flow [2023-08-24 13:20:22,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 128 transitions, 844 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-24 13:20:22,584 INFO L231 Difference]: Finished difference. Result has 50 places, 48 transitions, 296 flow [2023-08-24 13:20:22,584 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=296, PETRI_PLACES=50, PETRI_TRANSITIONS=48} [2023-08-24 13:20:22,585 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 16 predicate places. [2023-08-24 13:20:22,585 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 48 transitions, 296 flow [2023-08-24 13:20:22,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.28571428571429) internal successors, (632), 7 states have internal predecessors, (632), 0 states have call successors, (0), 0 states 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 13:20:22,585 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 13:20:22,585 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] [2023-08-24 13:20:22,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-24 13:20:22,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-08-24 13:20:22,796 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 2 more)] === [2023-08-24 13:20:22,796 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 13:20:22,796 INFO L85 PathProgramCache]: Analyzing trace with hash -115641799, now seen corresponding path program 1 times [2023-08-24 13:20:22,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 13:20:22,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603440134] [2023-08-24 13:20:22,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:20:22,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 13:20:22,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:20:22,923 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 13:20:22,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 13:20:22,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603440134] [2023-08-24 13:20:22,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603440134] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 13:20:22,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315242382] [2023-08-24 13:20:22,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:20:22,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 13:20:22,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 13:20:22,925 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 13:20:22,927 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 13:20:23,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:20:23,009 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-24 13:20:23,011 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 13:20:23,088 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 13:20:23,088 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 13:20:23,146 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 13:20:23,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315242382] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 13:20:23,146 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 13:20:23,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-24 13:20:23,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128751105] [2023-08-24 13:20:23,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 13:20:23,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 13:20:23,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 13:20:23,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 13:20:23,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-24 13:20:23,149 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 226 [2023-08-24 13:20:23,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 48 transitions, 296 flow. Second operand has 7 states, 7 states have (on average 90.28571428571429) internal successors, (632), 7 states have internal predecessors, (632), 0 states have call successors, (0), 0 states 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 13:20:23,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 13:20:23,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 226 [2023-08-24 13:20:23,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 13:20:23,616 INFO L124 PetriNetUnfolderBase]: 2267/3107 cut-off events. [2023-08-24 13:20:23,616 INFO L125 PetriNetUnfolderBase]: For 8064/8064 co-relation queries the response was YES. [2023-08-24 13:20:23,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12686 conditions, 3107 events. 2267/3107 cut-off events. For 8064/8064 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 11984 event pairs, 505 based on Foata normal form. 76/3183 useless extension candidates. Maximal degree in co-relation 6978. Up to 1779 conditions per place. [2023-08-24 13:20:23,640 INFO L140 encePairwiseOnDemand]: 219/226 looper letters, 114 selfloop transitions, 14 changer transitions 3/131 dead transitions. [2023-08-24 13:20:23,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 131 transitions, 935 flow [2023-08-24 13:20:23,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 13:20:23,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 13:20:23,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 604 transitions. [2023-08-24 13:20:23,643 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44542772861356933 [2023-08-24 13:20:23,643 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 604 transitions. [2023-08-24 13:20:23,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 604 transitions. [2023-08-24 13:20:23,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 13:20:23,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 604 transitions. [2023-08-24 13:20:23,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 0 states have call successors, (0), 0 states 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 13:20:23,647 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 226.0) internal successors, (1582), 7 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states 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 13:20:23,648 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 226.0) internal successors, (1582), 7 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states 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 13:20:23,648 INFO L175 Difference]: Start difference. First operand has 50 places, 48 transitions, 296 flow. Second operand 6 states and 604 transitions. [2023-08-24 13:20:23,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 131 transitions, 935 flow [2023-08-24 13:20:23,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 131 transitions, 924 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-24 13:20:23,665 INFO L231 Difference]: Finished difference. Result has 56 places, 51 transitions, 348 flow [2023-08-24 13:20:23,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=348, PETRI_PLACES=56, PETRI_TRANSITIONS=51} [2023-08-24 13:20:23,666 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 22 predicate places. [2023-08-24 13:20:23,666 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 348 flow [2023-08-24 13:20:23,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.28571428571429) internal successors, (632), 7 states have internal predecessors, (632), 0 states have call successors, (0), 0 states 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 13:20:23,667 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 13:20:23,667 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] [2023-08-24 13:20:23,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-24 13:20:23,873 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 13:20:23,873 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 2 more)] === [2023-08-24 13:20:23,873 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 13:20:23,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1691541935, now seen corresponding path program 1 times [2023-08-24 13:20:23,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 13:20:23,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064833715] [2023-08-24 13:20:23,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:20:23,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 13:20:23,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:20:24,437 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 13:20:24,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 13:20:24,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064833715] [2023-08-24 13:20:24,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064833715] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 13:20:24,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742223040] [2023-08-24 13:20:24,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:20:24,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 13:20:24,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 13:20:24,439 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 13:20:24,442 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 13:20:25,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:20:25,731 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-24 13:20:25,733 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 13:20:44,095 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 13:20:44,095 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 13:20:58,691 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 13:20:58,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742223040] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 13:20:58,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 13:20:58,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2023-08-24 13:20:58,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509422594] [2023-08-24 13:20:58,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 13:20:58,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-24 13:20:58,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 13:20:58,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-24 13:20:58,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=115, Unknown=12, NotChecked=0, Total=156 [2023-08-24 13:20:58,694 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 226 [2023-08-24 13:20:58,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 348 flow. Second operand has 13 states, 13 states have (on average 89.0) internal successors, (1157), 13 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states 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 13:20:58,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 13:20:58,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 226 [2023-08-24 13:20:58,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 13:21:06,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 13:21:08,388 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 13:21:18,415 WARN L234 SmtUtils]: Spent 7.74s on a formula simplification. DAG size of input: 80 DAG size of output: 50 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 13:21:20,964 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 13:21:25,888 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 13:21:39,077 WARN L234 SmtUtils]: Spent 9.54s on a formula simplification. DAG size of input: 34 DAG size of output: 31 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 13:21:41,300 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 13:21:43,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 13:21:46,352 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 13:21:49,504 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 13:21:55,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 13:22:02,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 13:22:04,599 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 13:22:06,741 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 13:22:08,932 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 13:22:13,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 13:22:16,067 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 13:22:19,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 13:22:21,166 INFO L124 PetriNetUnfolderBase]: 3161/4327 cut-off events. [2023-08-24 13:22:21,166 INFO L125 PetriNetUnfolderBase]: For 15732/15732 co-relation queries the response was YES. [2023-08-24 13:22:21,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19260 conditions, 4327 events. 3161/4327 cut-off events. For 15732/15732 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 17741 event pairs, 629 based on Foata normal form. 2/4329 useless extension candidates. Maximal degree in co-relation 16271. Up to 3231 conditions per place. [2023-08-24 13:22:21,193 INFO L140 encePairwiseOnDemand]: 219/226 looper letters, 142 selfloop transitions, 41 changer transitions 5/188 dead transitions. [2023-08-24 13:22:21,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 188 transitions, 1442 flow [2023-08-24 13:22:21,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-24 13:22:21,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-24 13:22:21,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1091 transitions. [2023-08-24 13:22:21,197 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43885760257441675 [2023-08-24 13:22:21,197 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1091 transitions. [2023-08-24 13:22:21,197 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1091 transitions. [2023-08-24 13:22:21,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 13:22:21,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1091 transitions. [2023-08-24 13:22:21,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 99.18181818181819) internal successors, (1091), 11 states have internal predecessors, (1091), 0 states have call successors, (0), 0 states 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 13:22:21,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 226.0) internal successors, (2712), 12 states have internal predecessors, (2712), 0 states have call successors, (0), 0 states 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 13:22:21,204 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 226.0) internal successors, (2712), 12 states have internal predecessors, (2712), 0 states have call successors, (0), 0 states 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 13:22:21,204 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 348 flow. Second operand 11 states and 1091 transitions. [2023-08-24 13:22:21,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 188 transitions, 1442 flow [2023-08-24 13:22:21,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 188 transitions, 1377 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-08-24 13:22:21,223 INFO L231 Difference]: Finished difference. Result has 69 places, 83 transitions, 696 flow [2023-08-24 13:22:21,223 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=696, PETRI_PLACES=69, PETRI_TRANSITIONS=83} [2023-08-24 13:22:21,224 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 35 predicate places. [2023-08-24 13:22:21,224 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 83 transitions, 696 flow [2023-08-24 13:22:21,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 89.0) internal successors, (1157), 13 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states 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 13:22:21,225 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 13:22:21,225 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] [2023-08-24 13:22:21,232 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 13:22:21,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 13:22:21,429 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 2 more)] === [2023-08-24 13:22:21,429 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 13:22:21,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1719575699, now seen corresponding path program 2 times [2023-08-24 13:22:21,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 13:22:21,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948068849] [2023-08-24 13:22:21,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:22:21,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 13:22:21,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:22:21,973 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 13:22:21,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 13:22:21,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948068849] [2023-08-24 13:22:21,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948068849] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 13:22:21,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857763006] [2023-08-24 13:22:21,974 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 13:22:21,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 13:22:21,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 13:22:21,975 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 13:22:21,978 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 13:22:27,478 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 13:22:27,478 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 13:22:27,481 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-24 13:22:27,483 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 13:22:37,022 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~x1~0 4294967296)) (.cse1 (mod (div c_~x3~0 4) 4294967296)) (.cse2 (mod c_~n~0 4294967296))) (and (< 0 .cse0) (= .cse0 (mod c_~x2~0 4294967296)) (= (mod (* 3 c_~x4~0) 4) 0) (= (mod c_~x3~0 4) 0) (= .cse1 (mod (* 4294967295 (div (* (- 1) c_~x4~0) 4)) 4294967296)) (< .cse1 .cse2) (<= .cse2 (mod c_~x3~0 4294967296)))) is different from false [2023-08-24 13:23:11,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-24 13:23:11,094 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 13:23:30,115 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 13:23:30,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857763006] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 13:23:30,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 13:23:30,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2023-08-24 13:23:30,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504169980] [2023-08-24 13:23:30,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 13:23:30,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-24 13:23:30,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 13:23:30,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-24 13:23:30,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=139, Unknown=18, NotChecked=26, Total=240 [2023-08-24 13:23:30,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 226 [2023-08-24 13:23:30,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 83 transitions, 696 flow. Second operand has 16 states, 16 states have (on average 88.0625) internal successors, (1409), 16 states have internal predecessors, (1409), 0 states have call successors, (0), 0 states 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 13:23:30,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 13:23:30,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 226 [2023-08-24 13:23:30,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 13:24:20,171 WARN L234 SmtUtils]: Spent 45.11s on a formula simplification. DAG size of input: 80 DAG size of output: 77 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 13:24:23,092 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 13:24:25,405 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 13:24:27,413 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 13:24:29,416 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 13:24:31,541 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 13:24:34,364 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 13:24:36,369 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 13:24:38,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 13:24:41,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 13:24:43,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 13:24:45,052 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 13:24:48,096 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 13:24:50,102 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 13:24:52,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 13:24:54,115 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 13:24:56,121 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 13:24:58,129 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 13:25:00,140 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 13:25:02,252 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 13:25:04,991 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~x1~0 4294967296)) (.cse1 (* 3 c_~x4~0)) (.cse8 (mod (div c_~x3~0 4) 4294967296))) (and (< 0 .cse0) (= .cse0 (mod c_~x2~0 4294967296)) (= (mod .cse1 4) 0) (= (mod c_~x3~0 4) 0) (let ((.cse2 (div c_~n~0 4294967296)) (.cse4 (div c_~x3~0 4294967296)) (.cse3 (div c_~x4~0 4294967296))) (or (<= (+ (* 17179869184 .cse2) (* c_~x3~0 4) (* .cse3 12884901888) 17179869188) (+ .cse1 (* 17179869184 .cse4) (* c_~n~0 4))) (let ((.cse7 (* .cse3 4294967296))) (let ((.cse6 (+ c_~x3~0 .cse7)) (.cse5 (* 4294967296 .cse4))) (and (<= (+ .cse5 c_~x4~0) .cse6) (or (< .cse6 (+ .cse5 c_~x4~0 1)) (<= (+ (* 4294967296 .cse2) 6 c_~x4~0) (+ c_~n~0 .cse7))) (= (+ c_~x1~0 (* (div c_~x2~0 4294967296) 4294967296)) (+ (* 4294967296 (div c_~x1~0 4294967296)) c_~x2~0))))))) (= .cse8 (mod (* 4294967295 (div (* (- 1) c_~x4~0) 4)) 4294967296)) (< .cse8 (mod c_~n~0 4294967296)) (< 0 .cse8))) is different from false [2023-08-24 13:25:06,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 13:25:08,687 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 13:25:10,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 13:25:12,848 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 13:25:15,121 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 13:25:16,650 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 13:25:18,655 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 13:26:10,807 WARN L234 SmtUtils]: Spent 35.54s on a formula simplification. DAG size of input: 56 DAG size of output: 54 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 13:26:13,323 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 13:26:15,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 13:26:17,325 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 13:26:19,328 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 13:26:21,331 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 13:26:23,761 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 13:26:33,990 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 13:26:35,999 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 13:26:38,004 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 13:26:40,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 13:26:42,021 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 13:26:44,027 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 13:26:46,034 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 13:27:14,147 WARN L234 SmtUtils]: Spent 20.31s on a formula simplification. DAG size of input: 55 DAG size of output: 53 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 13:27:26,693 WARN L234 SmtUtils]: Spent 7.97s on a formula simplification. DAG size of input: 39 DAG size of output: 34 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 13:27:28,699 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 13:27:30,709 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 13:27:32,716 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 13:27:34,739 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 13:27:36,744 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 13:27:38,753 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 13:27:40,758 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 13:27:42,765 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 13:27:44,771 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 13:27:46,777 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 13:27:48,784 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 13:27:50,790 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 13:27:52,800 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 13:27:54,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 13:27:56,838 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 13:27:58,852 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 13:28:00,860 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 13:28:02,866 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 13:28:04,872 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 13:28: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 13:28:08,891 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 13:28:11,261 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 13:28:13,485 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 13:28:14,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 13:28:16,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 13:28:17,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 13:28:19,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 13:28:22,319 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 13:28:23,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 13:28:25,866 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 13:28:29,112 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 13:28:31,117 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 13:28:34,140 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 13:28:36,324 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 13:28:38,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 13:28:40,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 13:28:42,249 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 13:28:44,422 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 13:28:46,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 13:28:49,165 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 13:28:51,219 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 13:28:53,228 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 13:28:55,232 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 13:28:57,243 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 13:28:59,264 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 13:29:01,271 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 13:29:03,276 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 13:29:05,336 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 13:29:07,783 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 13:29:09,791 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 13:29:11,908 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 13:29:13,913 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 13:29:16,341 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 13:29:18,891 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 13:29:21,686 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 13:29:23,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 13:29:26,855 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 13:29:28,864 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 13:29:29,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 13:29:31,895 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 13:29:33,899 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 13:29:36,522 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 13:29:37,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 13:29:40,357 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 13:29:42,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 13:29:44,948 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 13:29:46,953 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 13:29:48,964 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 13:29:50,969 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 13:29:52,978 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 13:29:54,989 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 13:29:58,327 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 13:30:00,568 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 13:30:02,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 13:30:04,612 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 13:30:06,632 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 13:30:08,635 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 13:30:10,640 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 13:30:12,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 13:30:14,659 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 13:30:16,815 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 13:30:18,822 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 13:30:21,460 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 13:30:23,596 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 13:30:23,788 INFO L124 PetriNetUnfolderBase]: 4627/6393 cut-off events. [2023-08-24 13:30:23,789 INFO L125 PetriNetUnfolderBase]: For 24432/24432 co-relation queries the response was YES. [2023-08-24 13:30:23,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30643 conditions, 6393 events. 4627/6393 cut-off events. For 24432/24432 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 28923 event pairs, 356 based on Foata normal form. 3/6396 useless extension candidates. Maximal degree in co-relation 29952. Up to 4461 conditions per place. [2023-08-24 13:30:23,828 INFO L140 encePairwiseOnDemand]: 209/226 looper letters, 194 selfloop transitions, 123 changer transitions 14/331 dead transitions. [2023-08-24 13:30:23,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 331 transitions, 2786 flow [2023-08-24 13:30:23,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-24 13:30:23,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-24 13:30:23,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1678 transitions. [2023-08-24 13:30:23,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4367516918271733 [2023-08-24 13:30:23,834 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1678 transitions. [2023-08-24 13:30:23,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1678 transitions. [2023-08-24 13:30:23,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 13:30:23,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1678 transitions. [2023-08-24 13:30:23,838 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 98.70588235294117) internal successors, (1678), 17 states have internal predecessors, (1678), 0 states have call successors, (0), 0 states 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 13:30:23,843 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 226.0) internal successors, (4068), 18 states have internal predecessors, (4068), 0 states have call successors, (0), 0 states 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 13:30:23,844 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 226.0) internal successors, (4068), 18 states have internal predecessors, (4068), 0 states have call successors, (0), 0 states 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 13:30:23,844 INFO L175 Difference]: Start difference. First operand has 69 places, 83 transitions, 696 flow. Second operand 17 states and 1678 transitions. [2023-08-24 13:30:23,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 331 transitions, 2786 flow [2023-08-24 13:30:23,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 331 transitions, 2677 flow, removed 50 selfloop flow, removed 1 redundant places. [2023-08-24 13:30:23,921 INFO L231 Difference]: Finished difference. Result has 94 places, 185 transitions, 1906 flow [2023-08-24 13:30:23,921 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=621, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1906, PETRI_PLACES=94, PETRI_TRANSITIONS=185} [2023-08-24 13:30:23,922 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 60 predicate places. [2023-08-24 13:30:23,922 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 185 transitions, 1906 flow [2023-08-24 13:30:23,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 88.0625) internal successors, (1409), 16 states have internal predecessors, (1409), 0 states have call successors, (0), 0 states 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 13:30:23,922 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 13:30:23,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] [2023-08-24 13:30:23,931 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 13:30:24,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 13:30:24,129 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 2 more)] === [2023-08-24 13:30:24,130 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 13:30:24,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1159057439, now seen corresponding path program 3 times [2023-08-24 13:30:24,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 13:30:24,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136156479] [2023-08-24 13:30:24,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:30:24,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 13:30:24,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:30:24,524 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 13:30:24,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 13:30:24,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136156479] [2023-08-24 13:30:24,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136156479] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 13:30:24,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242981740] [2023-08-24 13:30:24,525 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 13:30:24,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 13:30:24,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 13:30:24,526 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 13:30:24,528 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 13:30:32,368 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-24 13:30:32,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 13:30:32,371 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-24 13:30:32,373 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 13:31:23,340 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 13:31:23,340 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 13:31:46,885 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 13:31:46,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242981740] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 13:31:46,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 13:31:46,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 5] total 14 [2023-08-24 13:31:46,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325558615] [2023-08-24 13:31:46,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 13:31:46,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-24 13:31:46,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 13:31:46,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-24 13:31:46,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=167, Unknown=23, NotChecked=0, Total=240 [2023-08-24 13:31:46,888 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 226 [2023-08-24 13:31:46,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 185 transitions, 1906 flow. Second operand has 16 states, 16 states have (on average 88.0625) internal successors, (1409), 16 states have internal predecessors, (1409), 0 states have call successors, (0), 0 states 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 13:31:46,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 13:31:46,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 226 [2023-08-24 13:31:46,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 13:31:58,221 WARN L234 SmtUtils]: Spent 5.85s on a formula simplification. DAG size of input: 59 DAG size of output: 33 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 13:32:01,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 13:32:12,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 13:32:16,098 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 13:32:27,344 WARN L234 SmtUtils]: Spent 8.84s on a formula simplification. DAG size of input: 58 DAG size of output: 32 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 13:32:31,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 13:32:33,120 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 13:32:35,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 13:32:37,701 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 13:32:44,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 13:32:47,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 13:32:50,073 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-24 13:32:56,523 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 13:32:59,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-24 13:33:00,603 INFO L124 PetriNetUnfolderBase]: 7636/10765 cut-off events. [2023-08-24 13:33:00,603 INFO L125 PetriNetUnfolderBase]: For 94876/94876 co-relation queries the response was YES. [2023-08-24 13:33:00,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71445 conditions, 10765 events. 7636/10765 cut-off events. For 94876/94876 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 55282 event pairs, 346 based on Foata normal form. 60/10825 useless extension candidates. Maximal degree in co-relation 70614. Up to 5211 conditions per place. [2023-08-24 13:33:00,670 INFO L140 encePairwiseOnDemand]: 218/226 looper letters, 303 selfloop transitions, 229 changer transitions 30/562 dead transitions. [2023-08-24 13:33:00,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 562 transitions, 6692 flow [2023-08-24 13:33:00,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-08-24 13:33:00,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-08-24 13:33:00,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1788 transitions. [2023-08-24 13:33:00,675 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43952802359882004 [2023-08-24 13:33:00,675 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1788 transitions. [2023-08-24 13:33:00,675 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1788 transitions. [2023-08-24 13:33:00,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 13:33:00,676 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1788 transitions. [2023-08-24 13:33:00,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 99.33333333333333) internal successors, (1788), 18 states have internal predecessors, (1788), 0 states have call successors, (0), 0 states 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 13:33:00,685 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 226.0) internal successors, (4294), 19 states have internal predecessors, (4294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 13:33:00,686 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 226.0) internal successors, (4294), 19 states have internal predecessors, (4294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 13:33:00,686 INFO L175 Difference]: Start difference. First operand has 94 places, 185 transitions, 1906 flow. Second operand 18 states and 1788 transitions. [2023-08-24 13:33:00,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 562 transitions, 6692 flow [2023-08-24 13:33:01,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 562 transitions, 6319 flow, removed 173 selfloop flow, removed 4 redundant places. [2023-08-24 13:33:01,021 INFO L231 Difference]: Finished difference. Result has 114 places, 341 transitions, 4033 flow [2023-08-24 13:33:01,021 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=1655, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=4033, PETRI_PLACES=114, PETRI_TRANSITIONS=341} [2023-08-24 13:33:01,022 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 80 predicate places. [2023-08-24 13:33:01,022 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 341 transitions, 4033 flow [2023-08-24 13:33:01,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 88.0625) internal successors, (1409), 16 states have internal predecessors, (1409), 0 states have call successors, (0), 0 states 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 13:33:01,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 13:33:01,022 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] [2023-08-24 13:33:01,031 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 13:33:01,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 13:33:01,230 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 2 more)] === [2023-08-24 13:33:01,230 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 13:33:01,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1357387647, now seen corresponding path program 1 times [2023-08-24 13:33:01,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 13:33:01,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045378489] [2023-08-24 13:33:01,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:33:01,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 13:33:01,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:33:01,713 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 13:33:01,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 13:33:01,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045378489] [2023-08-24 13:33:01,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045378489] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 13:33:01,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604041776] [2023-08-24 13:33:01,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 13:33:01,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 13:33:01,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 13:33:01,715 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 13:33:01,721 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 13:33:07,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 13:33:07,130 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-24 13:33:07,131 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 13:34:24,176 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 13:34:24,176 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 13:34:40,547 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 13:34:40,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604041776] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 13:34:40,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 13:34:40,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2023-08-24 13:34:40,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277480004] [2023-08-24 13:34:40,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 13:34:40,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-24 13:34:40,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 13:34:40,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-24 13:34:40,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=164, Unknown=21, NotChecked=0, Total=240 [2023-08-24 13:34:40,549 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 226 [2023-08-24 13:34:40,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 341 transitions, 4033 flow. Second operand has 16 states, 16 states have (on average 87.8125) internal successors, (1405), 16 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 13:34:40,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 13:34:40,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 226 [2023-08-24 13:34:40,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 13:34:42,644 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 [] Received shutdown request... [2023-08-24 13:34:44,968 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-24 13:34:44,973 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 13:34:45,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-24 13:34:46,174 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 13:34:46,180 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 13:34:46,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 13:34:46,182 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-08-24 13:34:46,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-24 13:34:46,182 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-08-24 13:34:46,183 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2023-08-24 13:34:46,183 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-08-24 13:34:46,183 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-08-24 13:34:46,183 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2023-08-24 13:34:46,184 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1] [2023-08-24 13:34:46,186 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 13:34:46,186 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 13:34:46,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 01:34:46 BasicIcfg [2023-08-24 13:34:46,188 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 13:34:46,188 INFO L158 Benchmark]: Toolchain (without parser) took 872455.57ms. Allocated memory was 348.1MB in the beginning and 503.3MB in the end (delta: 155.2MB). Free memory was 324.3MB in the beginning and 315.9MB in the end (delta: 8.4MB). Peak memory consumption was 164.6MB. Max. memory is 16.0GB. [2023-08-24 13:34:46,189 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 348.1MB. Free memory is still 324.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 13:34:46,189 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.61ms. Allocated memory is still 348.1MB. Free memory was 323.8MB in the beginning and 312.9MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-08-24 13:34:46,189 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.17ms. Allocated memory is still 348.1MB. Free memory was 312.9MB in the beginning and 310.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 13:34:46,189 INFO L158 Benchmark]: Boogie Preprocessor took 34.86ms. Allocated memory is still 348.1MB. Free memory was 310.9MB in the beginning and 309.8MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-24 13:34:46,189 INFO L158 Benchmark]: RCFGBuilder took 506.47ms. Allocated memory is still 348.1MB. Free memory was 309.8MB in the beginning and 294.6MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. [2023-08-24 13:34:46,190 INFO L158 Benchmark]: TraceAbstraction took 871566.72ms. Allocated memory was 348.1MB in the beginning and 503.3MB in the end (delta: 155.2MB). Free memory was 293.9MB in the beginning and 315.9MB in the end (delta: -22.0MB). Peak memory consumption was 135.3MB. Max. memory is 16.0GB. [2023-08-24 13:34:46,191 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.18ms. Allocated memory is still 348.1MB. Free memory is still 324.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 288.61ms. Allocated memory is still 348.1MB. Free memory was 323.8MB in the beginning and 312.9MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 50.17ms. Allocated memory is still 348.1MB. Free memory was 312.9MB in the beginning and 310.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.0GB. * Boogie Preprocessor took 34.86ms. Allocated memory is still 348.1MB. Free memory was 310.9MB in the beginning and 309.8MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 506.47ms. Allocated memory is still 348.1MB. Free memory was 309.8MB in the beginning and 294.6MB in the end (delta: 15.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.0GB. * TraceAbstraction took 871566.72ms. Allocated memory was 348.1MB in the beginning and 503.3MB in the end (delta: 155.2MB). Free memory was 293.9MB in the beginning and 315.9MB in the end (delta: -22.0MB). Peak memory consumption was 135.3MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 114 PlacesBefore, 34 PlacesAfterwards, 111 TransitionsBefore, 25 TransitionsAfterwards, 1512 CoEnabledTransitionPairs, 6 FixpointIterations, 50 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 8 ConcurrentYvCompositions, 6 ChoiceCompositions, 99 TotalNumberOfCompositions, 1649 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1649, independent: 1649, independent conditional: 0, independent unconditional: 1649, 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: 814, independent: 814, independent conditional: 0, independent unconditional: 814, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1649, independent: 835, independent conditional: 0, independent unconditional: 835, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 814, unknown conditional: 0, unknown unconditional: 814] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 62, Positive conditional cache size: 0, Positive unconditional cache size: 62, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 87]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 86]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 146 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 871.4s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 578.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 128 mSolverCounterUnknown, 834 SdHoareTripleChecker+Valid, 361.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 834 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 359.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 426 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 75 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3007 IncrementalHoareTripleChecker+Invalid, 3636 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 75 mSolverCounterUnsat, 0 mSDtfsCounter, 3007 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 372 GetRequests, 258 SyntacticMatches, 10 SemanticMatches, 103 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 395.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4033occurred in iteration=10, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 20.3s SatisfiabilityAnalysisTime, 267.2s InterpolantComputationTime, 403 NumberOfCodeBlocks, 403 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 536 ConstructedInterpolants, 0 QuantifiedInterpolants, 19247 SizeOfPredicates, 31 NumberOfNonLiveVariables, 1412 ConjunctsInSsa, 88 ConjunctsInUnsatCore, 25 InterpolantComputations, 4 PerfectInterpolantSequences, 3/36 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown