/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/bench-exp2x6.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 15:43:18,059 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 15:43:18,144 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-SemanticLbe.epf [2023-11-17 15:43:18,171 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 15:43:18,172 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 15:43:18,172 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 15:43:18,172 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 15:43:18,173 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 15:43:18,173 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 15:43:18,174 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 15:43:18,174 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 15:43:18,174 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 15:43:18,174 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 15:43:18,175 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 15:43:18,175 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 15:43:18,175 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 15:43:18,176 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 15:43:18,176 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 15:43:18,176 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 15:43:18,176 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 15:43:18,177 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 15:43:18,177 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 15:43:18,177 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 15:43:18,178 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 15:43:18,178 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 15:43:18,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:43:18,178 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 15:43:18,178 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 15:43:18,179 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 15:43:18,179 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 15:43:18,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 15:43:18,179 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 15:43:18,179 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-11-17 15:43:18,406 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 15:43:18,434 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 15:43:18,436 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 15:43:18,437 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 15:43:18,437 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 15:43:18,438 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x6.wvr.c [2023-11-17 15:43:19,529 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 15:43:19,686 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 15:43:19,689 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x6.wvr.c [2023-11-17 15:43:19,696 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbd9bbad0/d65794b4645a4a259100481a776133b5/FLAGd43cec535 [2023-11-17 15:43:19,707 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbd9bbad0/d65794b4645a4a259100481a776133b5 [2023-11-17 15:43:19,710 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 15:43:19,711 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 15:43:19,712 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 15:43:19,712 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 15:43:19,720 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 15:43:19,721 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:43:19" (1/1) ... [2023-11-17 15:43:19,721 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2afcd9d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:43:19, skipping insertion in model container [2023-11-17 15:43:19,721 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 03:43:19" (1/1) ... [2023-11-17 15:43:19,747 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 15:43:19,871 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-exp2x6.wvr.c[2505,2518] [2023-11-17 15:43:19,875 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:43:19,882 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 15:43:19,905 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-exp2x6.wvr.c[2505,2518] [2023-11-17 15:43:19,906 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 15:43:19,918 INFO L206 MainTranslator]: Completed translation [2023-11-17 15:43:19,918 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:43:19 WrapperNode [2023-11-17 15:43:19,918 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 15:43:19,919 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 15:43:19,919 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 15:43:19,919 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 15:43:19,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:43:19" (1/1) ... [2023-11-17 15:43:19,932 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:43:19" (1/1) ... [2023-11-17 15:43:19,949 INFO L138 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 95 [2023-11-17 15:43:19,949 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 15:43:19,950 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 15:43:19,950 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 15:43:19,950 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 15:43:19,958 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:43:19" (1/1) ... [2023-11-17 15:43:19,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:43:19" (1/1) ... [2023-11-17 15:43:19,960 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:43:19" (1/1) ... [2023-11-17 15:43:19,961 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:43:19" (1/1) ... [2023-11-17 15:43:19,966 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:43:19" (1/1) ... [2023-11-17 15:43:19,969 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:43:19" (1/1) ... [2023-11-17 15:43:19,970 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:43:19" (1/1) ... [2023-11-17 15:43:19,971 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:43:19" (1/1) ... [2023-11-17 15:43:19,973 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 15:43:19,974 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 15:43:19,974 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 15:43:19,974 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 15:43:19,974 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:43:19" (1/1) ... [2023-11-17 15:43:19,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 15:43:19,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:43:20,009 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-17 15:43:20,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-17 15:43:20,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 15:43:20,035 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-17 15:43:20,036 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-17 15:43:20,036 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-17 15:43:20,036 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-17 15:43:20,036 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-17 15:43:20,036 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-17 15:43:20,036 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-11-17 15:43:20,036 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-11-17 15:43:20,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 15:43:20,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 15:43:20,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 15:43:20,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 15:43:20,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 15:43:20,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-17 15:43:20,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 15:43:20,038 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 15:43:20,125 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 15:43:20,127 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 15:43:20,359 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 15:43:20,370 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 15:43:20,371 INFO L307 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-17 15:43:20,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:43:20 BoogieIcfgContainer [2023-11-17 15:43:20,372 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 15:43:20,374 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 15:43:20,374 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 15:43:20,377 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 15:43:20,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 03:43:19" (1/3) ... [2023-11-17 15:43:20,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c389db2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:43:20, skipping insertion in model container [2023-11-17 15:43:20,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 03:43:19" (2/3) ... [2023-11-17 15:43:20,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c389db2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 03:43:20, skipping insertion in model container [2023-11-17 15:43:20,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 03:43:20" (3/3) ... [2023-11-17 15:43:20,379 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x6.wvr.c [2023-11-17 15:43:20,391 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 15:43:20,391 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-17 15:43:20,392 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 15:43:20,463 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-11-17 15:43:20,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 142 transitions, 312 flow [2023-11-17 15:43:20,559 INFO L124 PetriNetUnfolderBase]: 10/138 cut-off events. [2023-11-17 15:43:20,559 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-17 15:43:20,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 138 events. 10/138 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 96 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-11-17 15:43:20,565 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 142 transitions, 312 flow [2023-11-17 15:43:20,569 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 125 transitions, 274 flow [2023-11-17 15:43:20,574 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 15:43:20,593 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 125 transitions, 274 flow [2023-11-17 15:43:20,600 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 125 transitions, 274 flow [2023-11-17 15:43:20,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 125 transitions, 274 flow [2023-11-17 15:43:20,656 INFO L124 PetriNetUnfolderBase]: 10/125 cut-off events. [2023-11-17 15:43:20,657 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-17 15:43:20,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 125 events. 10/125 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 97 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-11-17 15:43:20,660 INFO L119 LiptonReduction]: Number of co-enabled transitions 2520 [2023-11-17 15:43:23,899 INFO L134 LiptonReduction]: Checked pairs total: 2394 [2023-11-17 15:43:23,900 INFO L136 LiptonReduction]: Total number of compositions: 109 [2023-11-17 15:43:23,918 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 15:43:23,925 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@365d599b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 15:43:23,925 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-17 15:43:23,939 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 15:43:23,939 INFO L124 PetriNetUnfolderBase]: 4/28 cut-off events. [2023-11-17 15:43:23,939 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-17 15:43:23,939 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:43:23,940 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:43:23,940 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-11-17 15:43:23,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:43:23,945 INFO L85 PathProgramCache]: Analyzing trace with hash 651984224, now seen corresponding path program 1 times [2023-11-17 15:43:23,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:43:23,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413529882] [2023-11-17 15:43:23,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:43:23,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:43:24,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:43:24,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:43:24,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:43:24,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413529882] [2023-11-17 15:43:24,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413529882] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:43:24,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:43:24,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 15:43:24,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683845529] [2023-11-17 15:43:24,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:43:24,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 15:43:24,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:43:24,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 15:43:24,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 15:43:24,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 251 [2023-11-17 15:43:24,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:43:24,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:43:24,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 251 [2023-11-17 15:43:24,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:43:24,657 INFO L124 PetriNetUnfolderBase]: 1537/1954 cut-off events. [2023-11-17 15:43:24,657 INFO L125 PetriNetUnfolderBase]: For 163/163 co-relation queries the response was YES. [2023-11-17 15:43:24,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4056 conditions, 1954 events. 1537/1954 cut-off events. For 163/163 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 6393 event pairs, 141 based on Foata normal form. 1/1129 useless extension candidates. Maximal degree in co-relation 3091. Up to 1733 conditions per place. [2023-11-17 15:43:24,674 INFO L140 encePairwiseOnDemand]: 245/251 looper letters, 41 selfloop transitions, 5 changer transitions 1/51 dead transitions. [2023-11-17 15:43:24,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 51 transitions, 241 flow [2023-11-17 15:43:24,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 15:43:24,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 15:43:24,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 327 transitions. [2023-11-17 15:43:24,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4342629482071713 [2023-11-17 15:43:24,694 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 327 transitions. [2023-11-17 15:43:24,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 327 transitions. [2023-11-17 15:43:24,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:43:24,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 327 transitions. [2023-11-17 15:43:24,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:43:24,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:43:24,710 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:43:24,712 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 82 flow. Second operand 3 states and 327 transitions. [2023-11-17 15:43:24,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 51 transitions, 241 flow [2023-11-17 15:43:24,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 51 transitions, 211 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-11-17 15:43:24,720 INFO L231 Difference]: Finished difference. Result has 33 places, 33 transitions, 99 flow [2023-11-17 15:43:24,721 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=33, PETRI_TRANSITIONS=33} [2023-11-17 15:43:24,725 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, -5 predicate places. [2023-11-17 15:43:24,725 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 33 transitions, 99 flow [2023-11-17 15:43:24,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:43:24,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:43:24,726 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:43:24,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 15:43:24,727 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-11-17 15:43:24,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:43:24,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1120519640, now seen corresponding path program 1 times [2023-11-17 15:43:24,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:43:24,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812481555] [2023-11-17 15:43:24,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:43:24,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:43:24,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:43:24,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:43:24,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:43:24,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812481555] [2023-11-17 15:43:24,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812481555] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:43:24,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:43:24,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:43:24,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234420026] [2023-11-17 15:43:24,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:43:24,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:43:24,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:43:24,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:43:24,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:43:24,948 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 251 [2023-11-17 15:43:24,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 33 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:43:24,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:43:24,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 251 [2023-11-17 15:43:24,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:43:25,225 INFO L124 PetriNetUnfolderBase]: 1749/2269 cut-off events. [2023-11-17 15:43:25,225 INFO L125 PetriNetUnfolderBase]: For 715/715 co-relation queries the response was YES. [2023-11-17 15:43:25,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5607 conditions, 2269 events. 1749/2269 cut-off events. For 715/715 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 7828 event pairs, 92 based on Foata normal form. 42/2277 useless extension candidates. Maximal degree in co-relation 1889. Up to 928 conditions per place. [2023-11-17 15:43:25,241 INFO L140 encePairwiseOnDemand]: 246/251 looper letters, 68 selfloop transitions, 10 changer transitions 0/82 dead transitions. [2023-11-17 15:43:25,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 82 transitions, 395 flow [2023-11-17 15:43:25,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:43:25,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:43:25,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 587 transitions. [2023-11-17 15:43:25,245 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46772908366533866 [2023-11-17 15:43:25,245 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 587 transitions. [2023-11-17 15:43:25,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 587 transitions. [2023-11-17 15:43:25,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:43:25,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 587 transitions. [2023-11-17 15:43:25,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:43:25,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:43:25,252 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:43:25,253 INFO L175 Difference]: Start difference. First operand has 33 places, 33 transitions, 99 flow. Second operand 5 states and 587 transitions. [2023-11-17 15:43:25,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 82 transitions, 395 flow [2023-11-17 15:43:25,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 82 transitions, 387 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 15:43:25,256 INFO L231 Difference]: Finished difference. Result has 38 places, 40 transitions, 159 flow [2023-11-17 15:43:25,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=159, PETRI_PLACES=38, PETRI_TRANSITIONS=40} [2023-11-17 15:43:25,256 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 0 predicate places. [2023-11-17 15:43:25,257 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 40 transitions, 159 flow [2023-11-17 15:43:25,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:43:25,258 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:43:25,258 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:43:25,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 15:43:25,258 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-11-17 15:43:25,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:43:25,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1782001082, now seen corresponding path program 1 times [2023-11-17 15:43:25,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:43:25,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892999905] [2023-11-17 15:43:25,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:43:25,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:43:25,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:43:25,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:43:25,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:43:25,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892999905] [2023-11-17 15:43:25,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892999905] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 15:43:25,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508286868] [2023-11-17 15:43:25,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:43:25,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 15:43:25,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:43:25,393 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 15:43:25,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-17 15:43:25,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:43:25,487 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-17 15:43:25,491 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 15:43:25,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:43:25,597 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 15:43:25,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:43:25,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508286868] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 15:43:25,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 15:43:25,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-11-17 15:43:25,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188280594] [2023-11-17 15:43:25,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 15:43:25,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:43:25,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:43:25,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:43:25,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:43:25,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 251 [2023-11-17 15:43:25,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 40 transitions, 159 flow. Second operand has 6 states, 6 states have (on average 107.83333333333333) internal successors, (647), 6 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:43:25,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:43:25,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 251 [2023-11-17 15:43:25,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:43:26,020 INFO L124 PetriNetUnfolderBase]: 2273/3030 cut-off events. [2023-11-17 15:43:26,020 INFO L125 PetriNetUnfolderBase]: For 3644/3656 co-relation queries the response was YES. [2023-11-17 15:43:26,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9515 conditions, 3030 events. 2273/3030 cut-off events. For 3644/3656 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 12559 event pairs, 395 based on Foata normal form. 92/3090 useless extension candidates. Maximal degree in co-relation 4641. Up to 1469 conditions per place. [2023-11-17 15:43:26,043 INFO L140 encePairwiseOnDemand]: 246/251 looper letters, 98 selfloop transitions, 8 changer transitions 0/110 dead transitions. [2023-11-17 15:43:26,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 110 transitions, 649 flow [2023-11-17 15:43:26,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:43:26,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:43:26,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 597 transitions. [2023-11-17 15:43:26,046 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4756972111553785 [2023-11-17 15:43:26,046 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 597 transitions. [2023-11-17 15:43:26,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 597 transitions. [2023-11-17 15:43:26,046 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:43:26,046 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 597 transitions. [2023-11-17 15:43:26,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.4) internal successors, (597), 5 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:43:26,050 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:43:26,051 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:43:26,051 INFO L175 Difference]: Start difference. First operand has 38 places, 40 transitions, 159 flow. Second operand 5 states and 597 transitions. [2023-11-17 15:43:26,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 110 transitions, 649 flow [2023-11-17 15:43:26,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 110 transitions, 649 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 15:43:26,057 INFO L231 Difference]: Finished difference. Result has 45 places, 45 transitions, 214 flow [2023-11-17 15:43:26,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=214, PETRI_PLACES=45, PETRI_TRANSITIONS=45} [2023-11-17 15:43:26,058 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 7 predicate places. [2023-11-17 15:43:26,058 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 45 transitions, 214 flow [2023-11-17 15:43:26,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.83333333333333) internal successors, (647), 6 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:43:26,059 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:43:26,059 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:43:26,068 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-11-17 15:43:26,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 15:43:26,265 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-11-17 15:43:26,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:43:26,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1262427593, now seen corresponding path program 1 times [2023-11-17 15:43:26,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:43:26,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684606113] [2023-11-17 15:43:26,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:43:26,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:43:26,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:43:26,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:43:26,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:43:26,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684606113] [2023-11-17 15:43:26,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684606113] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:43:26,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:43:26,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:43:26,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606081938] [2023-11-17 15:43:26,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:43:26,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:43:26,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:43:26,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:43:26,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:43:26,359 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 251 [2023-11-17 15:43:26,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 45 transitions, 214 flow. Second operand has 4 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:43:26,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:43:26,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 251 [2023-11-17 15:43:26,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:43:26,706 INFO L124 PetriNetUnfolderBase]: 2395/3284 cut-off events. [2023-11-17 15:43:26,707 INFO L125 PetriNetUnfolderBase]: For 5192/5198 co-relation queries the response was YES. [2023-11-17 15:43:26,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12023 conditions, 3284 events. 2395/3284 cut-off events. For 5192/5198 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 14329 event pairs, 423 based on Foata normal form. 99/3330 useless extension candidates. Maximal degree in co-relation 5032. Up to 1407 conditions per place. [2023-11-17 15:43:26,736 INFO L140 encePairwiseOnDemand]: 246/251 looper letters, 88 selfloop transitions, 10 changer transitions 0/102 dead transitions. [2023-11-17 15:43:26,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 102 transitions, 668 flow [2023-11-17 15:43:26,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:43:26,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:43:26,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2023-11-17 15:43:26,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4693227091633466 [2023-11-17 15:43:26,739 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 589 transitions. [2023-11-17 15:43:26,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 589 transitions. [2023-11-17 15:43:26,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:43:26,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 589 transitions. [2023-11-17 15:43:26,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:43:26,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:43:26,744 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:43:26,744 INFO L175 Difference]: Start difference. First operand has 45 places, 45 transitions, 214 flow. Second operand 5 states and 589 transitions. [2023-11-17 15:43:26,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 102 transitions, 668 flow [2023-11-17 15:43:26,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 102 transitions, 668 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-17 15:43:26,752 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 270 flow [2023-11-17 15:43:26,752 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=270, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2023-11-17 15:43:26,753 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 13 predicate places. [2023-11-17 15:43:26,753 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 270 flow [2023-11-17 15:43:26,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:43:26,753 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:43:26,754 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:43:26,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 15:43:26,754 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-11-17 15:43:26,754 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:43:26,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1031835038, now seen corresponding path program 2 times [2023-11-17 15:43:26,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:43:26,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948244239] [2023-11-17 15:43:26,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:43:26,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:43:26,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:43:26,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:43:26,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:43:26,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948244239] [2023-11-17 15:43:26,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948244239] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:43:26,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:43:26,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:43:26,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727708968] [2023-11-17 15:43:26,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:43:26,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:43:26,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:43:26,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:43:26,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:43:26,849 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 251 [2023-11-17 15:43:26,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 270 flow. Second operand has 4 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:43:26,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:43:26,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 251 [2023-11-17 15:43:26,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:43:27,171 INFO L124 PetriNetUnfolderBase]: 2069/2771 cut-off events. [2023-11-17 15:43:27,171 INFO L125 PetriNetUnfolderBase]: For 7004/7015 co-relation queries the response was YES. [2023-11-17 15:43:27,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11293 conditions, 2771 events. 2069/2771 cut-off events. For 7004/7015 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 11244 event pairs, 207 based on Foata normal form. 39/2804 useless extension candidates. Maximal degree in co-relation 7440. Up to 1176 conditions per place. [2023-11-17 15:43:27,198 INFO L140 encePairwiseOnDemand]: 246/251 looper letters, 106 selfloop transitions, 11 changer transitions 0/121 dead transitions. [2023-11-17 15:43:27,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 121 transitions, 915 flow [2023-11-17 15:43:27,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:43:27,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:43:27,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2023-11-17 15:43:27,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4709163346613546 [2023-11-17 15:43:27,201 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 591 transitions. [2023-11-17 15:43:27,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 591 transitions. [2023-11-17 15:43:27,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:43:27,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 591 transitions. [2023-11-17 15:43:27,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.2) internal successors, (591), 5 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:43:27,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:43:27,206 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:43:27,206 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 270 flow. Second operand 5 states and 591 transitions. [2023-11-17 15:43:27,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 121 transitions, 915 flow [2023-11-17 15:43:27,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 121 transitions, 886 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-11-17 15:43:27,224 INFO L231 Difference]: Finished difference. Result has 55 places, 53 transitions, 320 flow [2023-11-17 15:43:27,225 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=320, PETRI_PLACES=55, PETRI_TRANSITIONS=53} [2023-11-17 15:43:27,225 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 17 predicate places. [2023-11-17 15:43:27,226 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 53 transitions, 320 flow [2023-11-17 15:43:27,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:43:27,226 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:43:27,226 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:43:27,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 15:43:27,226 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-11-17 15:43:27,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:43:27,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1941519891, now seen corresponding path program 1 times [2023-11-17 15:43:27,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:43:27,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6365209] [2023-11-17 15:43:27,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:43:27,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:43:27,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:43:27,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:43:27,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:43:27,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6365209] [2023-11-17 15:43:27,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6365209] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:43:27,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:43:27,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:43:27,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314819419] [2023-11-17 15:43:27,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:43:27,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:43:27,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:43:27,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:43:27,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:43:27,311 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 251 [2023-11-17 15:43:27,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 53 transitions, 320 flow. Second operand has 4 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:43:27,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:43:27,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 251 [2023-11-17 15:43:27,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:43:27,670 INFO L124 PetriNetUnfolderBase]: 2003/2705 cut-off events. [2023-11-17 15:43:27,671 INFO L125 PetriNetUnfolderBase]: For 8255/8263 co-relation queries the response was YES. [2023-11-17 15:43:27,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11631 conditions, 2705 events. 2003/2705 cut-off events. For 8255/8263 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 11448 event pairs, 175 based on Foata normal form. 67/2766 useless extension candidates. Maximal degree in co-relation 7734. Up to 1155 conditions per place. [2023-11-17 15:43:27,699 INFO L140 encePairwiseOnDemand]: 246/251 looper letters, 105 selfloop transitions, 8 changer transitions 2/119 dead transitions. [2023-11-17 15:43:27,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 119 transitions, 899 flow [2023-11-17 15:43:27,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:43:27,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:43:27,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 590 transitions. [2023-11-17 15:43:27,702 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4701195219123506 [2023-11-17 15:43:27,702 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 590 transitions. [2023-11-17 15:43:27,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 590 transitions. [2023-11-17 15:43:27,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:43:27,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 590 transitions. [2023-11-17 15:43:27,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:43:27,706 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:43:27,706 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:43:27,707 INFO L175 Difference]: Start difference. First operand has 55 places, 53 transitions, 320 flow. Second operand 5 states and 590 transitions. [2023-11-17 15:43:27,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 119 transitions, 899 flow [2023-11-17 15:43:27,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 119 transitions, 888 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-11-17 15:43:27,716 INFO L231 Difference]: Finished difference. Result has 59 places, 52 transitions, 323 flow [2023-11-17 15:43:27,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=323, PETRI_PLACES=59, PETRI_TRANSITIONS=52} [2023-11-17 15:43:27,718 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 21 predicate places. [2023-11-17 15:43:27,718 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 323 flow [2023-11-17 15:43:27,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:43:27,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:43:27,719 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:43:27,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 15:43:27,719 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-11-17 15:43:27,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:43:27,720 INFO L85 PathProgramCache]: Analyzing trace with hash -646837651, now seen corresponding path program 2 times [2023-11-17 15:43:27,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:43:27,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749355086] [2023-11-17 15:43:27,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:43:27,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:43:27,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:43:27,808 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:43:27,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:43:27,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749355086] [2023-11-17 15:43:27,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749355086] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:43:27,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:43:27,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:43:27,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203073428] [2023-11-17 15:43:27,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:43:27,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:43:27,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:43:27,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:43:27,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:43:27,811 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 251 [2023-11-17 15:43:27,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 52 transitions, 323 flow. Second operand has 4 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:43:27,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:43:27,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 251 [2023-11-17 15:43:27,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:43:28,130 INFO L124 PetriNetUnfolderBase]: 1801/2437 cut-off events. [2023-11-17 15:43:28,130 INFO L125 PetriNetUnfolderBase]: For 6854/6860 co-relation queries the response was YES. [2023-11-17 15:43:28,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10743 conditions, 2437 events. 1801/2437 cut-off events. For 6854/6860 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 9502 event pairs, 99 based on Foata normal form. 39/2448 useless extension candidates. Maximal degree in co-relation 7263. Up to 987 conditions per place. [2023-11-17 15:43:28,146 INFO L140 encePairwiseOnDemand]: 246/251 looper letters, 98 selfloop transitions, 9 changer transitions 4/115 dead transitions. [2023-11-17 15:43:28,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 115 transitions, 907 flow [2023-11-17 15:43:28,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:43:28,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:43:28,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 586 transitions. [2023-11-17 15:43:28,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46693227091633466 [2023-11-17 15:43:28,148 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 586 transitions. [2023-11-17 15:43:28,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 586 transitions. [2023-11-17 15:43:28,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:43:28,149 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 586 transitions. [2023-11-17 15:43:28,150 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.2) internal successors, (586), 5 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:43:28,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:43:28,152 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:43:28,152 INFO L175 Difference]: Start difference. First operand has 59 places, 52 transitions, 323 flow. Second operand 5 states and 586 transitions. [2023-11-17 15:43:28,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 115 transitions, 907 flow [2023-11-17 15:43:28,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 115 transitions, 874 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-11-17 15:43:28,160 INFO L231 Difference]: Finished difference. Result has 63 places, 51 transitions, 327 flow [2023-11-17 15:43:28,161 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=327, PETRI_PLACES=63, PETRI_TRANSITIONS=51} [2023-11-17 15:43:28,161 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 25 predicate places. [2023-11-17 15:43:28,161 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 51 transitions, 327 flow [2023-11-17 15:43:28,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:43:28,162 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:43:28,162 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:43:28,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 15:43:28,162 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-11-17 15:43:28,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:43:28,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1170478510, now seen corresponding path program 2 times [2023-11-17 15:43:28,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:43:28,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210959992] [2023-11-17 15:43:28,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:43:28,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:43:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:43:28,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:43:28,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:43:28,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210959992] [2023-11-17 15:43:28,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210959992] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 15:43:28,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369661640] [2023-11-17 15:43:28,238 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 15:43:28,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 15:43:28,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:43:28,240 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 15:43:28,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-17 15:43:28,370 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 15:43:28,371 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 15:43:28,372 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-17 15:43:28,374 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 15:43:28,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:43:28,513 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 15:43:28,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:43:28,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369661640] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 15:43:28,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 15:43:28,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-11-17 15:43:28,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206667177] [2023-11-17 15:43:28,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 15:43:28,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:43:28,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:43:28,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:43:28,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:43:28,595 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 251 [2023-11-17 15:43:28,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 51 transitions, 327 flow. Second operand has 6 states, 6 states have (on average 109.66666666666667) internal successors, (658), 6 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:43:28,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:43:28,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 251 [2023-11-17 15:43:28,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:43:28,932 INFO L124 PetriNetUnfolderBase]: 1725/2373 cut-off events. [2023-11-17 15:43:28,932 INFO L125 PetriNetUnfolderBase]: For 6568/6574 co-relation queries the response was YES. [2023-11-17 15:43:28,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10783 conditions, 2373 events. 1725/2373 cut-off events. For 6568/6574 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 9816 event pairs, 293 based on Foata normal form. 77/2410 useless extension candidates. Maximal degree in co-relation 6726. Up to 1307 conditions per place. [2023-11-17 15:43:28,947 INFO L140 encePairwiseOnDemand]: 246/251 looper letters, 101 selfloop transitions, 8 changer transitions 0/113 dead transitions. [2023-11-17 15:43:28,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 113 transitions, 903 flow [2023-11-17 15:43:28,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:43:28,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:43:28,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 583 transitions. [2023-11-17 15:43:28,950 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4645418326693227 [2023-11-17 15:43:28,950 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 583 transitions. [2023-11-17 15:43:28,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 583 transitions. [2023-11-17 15:43:28,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:43:28,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 583 transitions. [2023-11-17 15:43:28,952 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 116.6) internal successors, (583), 5 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:43:28,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:43:28,956 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:43:28,956 INFO L175 Difference]: Start difference. First operand has 63 places, 51 transitions, 327 flow. Second operand 5 states and 583 transitions. [2023-11-17 15:43:28,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 113 transitions, 903 flow [2023-11-17 15:43:28,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 113 transitions, 896 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 15:43:28,962 INFO L231 Difference]: Finished difference. Result has 68 places, 54 transitions, 374 flow [2023-11-17 15:43:28,963 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=374, PETRI_PLACES=68, PETRI_TRANSITIONS=54} [2023-11-17 15:43:28,965 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 30 predicate places. [2023-11-17 15:43:28,965 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 54 transitions, 374 flow [2023-11-17 15:43:28,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.66666666666667) internal successors, (658), 6 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:43:28,965 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:43:28,965 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:43:28,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-17 15:43:29,172 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,SelfDestructingSolverStorable7 [2023-11-17 15:43:29,173 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-11-17 15:43:29,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:43:29,173 INFO L85 PathProgramCache]: Analyzing trace with hash -467406497, now seen corresponding path program 2 times [2023-11-17 15:43:29,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:43:29,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388319698] [2023-11-17 15:43:29,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:43:29,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:43:29,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:43:29,263 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:43:29,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:43:29,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388319698] [2023-11-17 15:43:29,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388319698] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 15:43:29,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 15:43:29,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 15:43:29,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178426520] [2023-11-17 15:43:29,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 15:43:29,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 15:43:29,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:43:29,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 15:43:29,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 15:43:29,266 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 251 [2023-11-17 15:43:29,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 54 transitions, 374 flow. Second operand has 4 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:43:29,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:43:29,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 251 [2023-11-17 15:43:29,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:43:29,557 INFO L124 PetriNetUnfolderBase]: 1657/2288 cut-off events. [2023-11-17 15:43:29,558 INFO L125 PetriNetUnfolderBase]: For 8833/8865 co-relation queries the response was YES. [2023-11-17 15:43:29,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11195 conditions, 2288 events. 1657/2288 cut-off events. For 8833/8865 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 9707 event pairs, 481 based on Foata normal form. 72/2341 useless extension candidates. Maximal degree in co-relation 9727. Up to 1331 conditions per place. [2023-11-17 15:43:29,579 INFO L140 encePairwiseOnDemand]: 246/251 looper letters, 117 selfloop transitions, 8 changer transitions 0/129 dead transitions. [2023-11-17 15:43:29,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 129 transitions, 1162 flow [2023-11-17 15:43:29,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 15:43:29,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 15:43:29,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 587 transitions. [2023-11-17 15:43:29,581 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46772908366533866 [2023-11-17 15:43:29,581 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 587 transitions. [2023-11-17 15:43:29,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 587 transitions. [2023-11-17 15:43:29,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:43:29,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 587 transitions. [2023-11-17 15:43:29,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:43:29,585 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:43:29,585 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:43:29,585 INFO L175 Difference]: Start difference. First operand has 68 places, 54 transitions, 374 flow. Second operand 5 states and 587 transitions. [2023-11-17 15:43:29,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 129 transitions, 1162 flow [2023-11-17 15:43:29,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 129 transitions, 1121 flow, removed 16 selfloop flow, removed 1 redundant places. [2023-11-17 15:43:29,598 INFO L231 Difference]: Finished difference. Result has 73 places, 57 transitions, 412 flow [2023-11-17 15:43:29,598 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=361, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=412, PETRI_PLACES=73, PETRI_TRANSITIONS=57} [2023-11-17 15:43:29,598 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 35 predicate places. [2023-11-17 15:43:29,599 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 57 transitions, 412 flow [2023-11-17 15:43:29,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:43:29,599 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:43:29,599 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:43:29,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 15:43:29,600 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-11-17 15:43:29,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:43:29,600 INFO L85 PathProgramCache]: Analyzing trace with hash -23061601, now seen corresponding path program 1 times [2023-11-17 15:43:29,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:43:29,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819034637] [2023-11-17 15:43:29,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:43:29,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:43:29,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:43:30,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:43:30,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:43:30,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819034637] [2023-11-17 15:43:30,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819034637] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 15:43:30,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689726810] [2023-11-17 15:43:30,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:43:30,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 15:43:30,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:43:30,162 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 15:43:30,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-17 15:43:34,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:43:34,618 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-17 15:43:34,620 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 15:43:55,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:43:55,057 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 15:44:05,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:44:05,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689726810] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 15:44:05,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 15:44:05,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2023-11-17 15:44:05,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632647162] [2023-11-17 15:44:05,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 15:44:05,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-17 15:44:05,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:44:05,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-17 15:44:05,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=134, Unknown=13, NotChecked=0, Total=182 [2023-11-17 15:44:05,915 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 251 [2023-11-17 15:44:05,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 57 transitions, 412 flow. Second operand has 14 states, 14 states have (on average 95.5) internal successors, (1337), 14 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:44:05,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:44:05,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 251 [2023-11-17 15:44:05,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:44:29,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 15:44:31,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 15:44:33,616 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-11-17 15:44:36,293 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-11-17 15:44:38,711 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-11-17 15:44:41,195 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-11-17 15:44:43,203 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-11-17 15:44:48,191 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-11-17 15:44:49,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 15:44:53,430 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-11-17 15:44:55,607 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-11-17 15:44:58,753 INFO L124 PetriNetUnfolderBase]: 2371/3290 cut-off events. [2023-11-17 15:44:58,753 INFO L125 PetriNetUnfolderBase]: For 11739/11739 co-relation queries the response was YES. [2023-11-17 15:44:58,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16992 conditions, 3290 events. 2371/3290 cut-off events. For 11739/11739 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 14821 event pairs, 357 based on Foata normal form. 2/3277 useless extension candidates. Maximal degree in co-relation 15716. Up to 2257 conditions per place. [2023-11-17 15:44:58,775 INFO L140 encePairwiseOnDemand]: 244/251 looper letters, 146 selfloop transitions, 31 changer transitions 5/186 dead transitions. [2023-11-17 15:44:58,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 186 transitions, 1528 flow [2023-11-17 15:44:58,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-17 15:44:58,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-17 15:44:58,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 960 transitions. [2023-11-17 15:44:58,779 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4249667994687915 [2023-11-17 15:44:58,779 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 960 transitions. [2023-11-17 15:44:58,779 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 960 transitions. [2023-11-17 15:44:58,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:44:58,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 960 transitions. [2023-11-17 15:44:58,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 106.66666666666667) internal successors, (960), 9 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:44:58,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 251.0) internal successors, (2510), 10 states have internal predecessors, (2510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:44:58,786 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 251.0) internal successors, (2510), 10 states have internal predecessors, (2510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:44:58,786 INFO L175 Difference]: Start difference. First operand has 73 places, 57 transitions, 412 flow. Second operand 9 states and 960 transitions. [2023-11-17 15:44:58,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 186 transitions, 1528 flow [2023-11-17 15:44:58,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 186 transitions, 1484 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-11-17 15:44:58,801 INFO L231 Difference]: Finished difference. Result has 84 places, 83 transitions, 792 flow [2023-11-17 15:44:58,801 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=792, PETRI_PLACES=84, PETRI_TRANSITIONS=83} [2023-11-17 15:44:58,802 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 46 predicate places. [2023-11-17 15:44:58,802 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 83 transitions, 792 flow [2023-11-17 15:44:58,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 95.5) internal successors, (1337), 14 states have internal predecessors, (1337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:44:58,803 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:44:58,803 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:44:58,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-17 15:44:59,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 15:44:59,013 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-11-17 15:44:59,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:44:59,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1566888079, now seen corresponding path program 2 times [2023-11-17 15:44:59,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:44:59,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684497854] [2023-11-17 15:44:59,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:44:59,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:44:59,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:44:59,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:44:59,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:44:59,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684497854] [2023-11-17 15:44:59,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684497854] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 15:44:59,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107539861] [2023-11-17 15:44:59,478 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 15:44:59,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 15:44:59,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:44:59,481 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 15:44:59,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-17 15:44:59,981 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 15:44:59,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 15:44:59,983 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-17 15:44:59,984 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 15:45:05,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:45:05,565 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 15:45:07,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:45:07,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107539861] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 15:45:07,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 15:45:07,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2023-11-17 15:45:07,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488574091] [2023-11-17 15:45:07,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 15:45:07,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-17 15:45:07,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:45:07,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-17 15:45:07,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=93, Unknown=1, NotChecked=0, Total=132 [2023-11-17 15:45:07,941 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 251 [2023-11-17 15:45:07,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 83 transitions, 792 flow. Second operand has 12 states, 12 states have (on average 96.41666666666667) internal successors, (1157), 12 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-11-17 15:45:07,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:45:07,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 251 [2023-11-17 15:45:07,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:45:15,073 WARN L293 SmtUtils]: Spent 5.29s on a formula simplification. DAG size of input: 70 DAG size of output: 56 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-17 15:45:17,467 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-11-17 15:45:20,641 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 15:45:22,700 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-11-17 15:45:26,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 15:45:29,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 15:45:31,619 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-11-17 15:45:32,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 15:45:35,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 15:45:37,161 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-11-17 15:45:39,182 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-11-17 15:45:42,809 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-11-17 15:45:45,606 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-11-17 15:45:47,972 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-11-17 15:45:50,113 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-11-17 15:45:52,122 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-11-17 15:45:55,311 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-11-17 15:45:57,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-11-17 15:46:00,422 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-11-17 15:46:02,763 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-11-17 15:46:08,210 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-11-17 15:46:10,221 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-11-17 15:46:10,520 INFO L124 PetriNetUnfolderBase]: 2839/3942 cut-off events. [2023-11-17 15:46:10,520 INFO L125 PetriNetUnfolderBase]: For 16894/16894 co-relation queries the response was YES. [2023-11-17 15:46:10,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21880 conditions, 3942 events. 2839/3942 cut-off events. For 16894/16894 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 18224 event pairs, 399 based on Foata normal form. 2/3929 useless extension candidates. Maximal degree in co-relation 20810. Up to 3107 conditions per place. [2023-11-17 15:46:10,551 INFO L140 encePairwiseOnDemand]: 245/251 looper letters, 142 selfloop transitions, 22 changer transitions 5/173 dead transitions. [2023-11-17 15:46:10,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 173 transitions, 1683 flow [2023-11-17 15:46:10,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 15:46:10,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 15:46:10,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 747 transitions. [2023-11-17 15:46:10,554 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42515651678998295 [2023-11-17 15:46:10,555 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 747 transitions. [2023-11-17 15:46:10,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 747 transitions. [2023-11-17 15:46:10,555 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:46:10,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 747 transitions. [2023-11-17 15:46:10,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 106.71428571428571) internal successors, (747), 7 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:46:10,559 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:46:10,559 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:46:10,560 INFO L175 Difference]: Start difference. First operand has 84 places, 83 transitions, 792 flow. Second operand 7 states and 747 transitions. [2023-11-17 15:46:10,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 173 transitions, 1683 flow [2023-11-17 15:46:10,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 173 transitions, 1592 flow, removed 43 selfloop flow, removed 1 redundant places. [2023-11-17 15:46:10,628 INFO L231 Difference]: Finished difference. Result has 92 places, 98 transitions, 979 flow [2023-11-17 15:46:10,629 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=979, PETRI_PLACES=92, PETRI_TRANSITIONS=98} [2023-11-17 15:46:10,629 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 54 predicate places. [2023-11-17 15:46:10,629 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 98 transitions, 979 flow [2023-11-17 15:46:10,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 96.41666666666667) internal successors, (1157), 12 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-11-17 15:46:10,630 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:46:10,630 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:46:10,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-17 15:46:10,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 15:46:10,837 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 15:46:10,837 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:46:10,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1970639821, now seen corresponding path program 1 times [2023-11-17 15:46:10,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:46:10,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556027576] [2023-11-17 15:46:10,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:46:10,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:46:10,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:46:11,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:46:11,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:46:11,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556027576] [2023-11-17 15:46:11,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556027576] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 15:46:11,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534147678] [2023-11-17 15:46:11,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:46:11,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 15:46:11,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:46:11,249 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 15:46:11,259 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-17 15:46:26,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:46:26,325 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-17 15:46:26,327 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 15:47:07,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:47:07,358 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 15:47:18,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:47:18,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534147678] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 15:47:18,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 15:47:18,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 15 [2023-11-17 15:47:18,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792663017] [2023-11-17 15:47:18,985 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 15:47:18,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-17 15:47:18,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:47:18,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-17 15:47:18,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=188, Unknown=18, NotChecked=0, Total=272 [2023-11-17 15:47:18,987 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 251 [2023-11-17 15:47:18,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 98 transitions, 979 flow. Second operand has 17 states, 17 states have (on average 94.58823529411765) internal successors, (1608), 17 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:47:18,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:47:18,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 251 [2023-11-17 15:47:18,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:47:21,016 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-11-17 15:47:34,338 WARN L293 SmtUtils]: Spent 6.17s on a formula simplification. DAG size of input: 59 DAG size of output: 52 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-17 15:47:36,364 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-11-17 15:47:38,477 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-11-17 15:47:40,482 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-11-17 15:47:42,548 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-11-17 15:47:44,589 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-11-17 15:47:50,959 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-11-17 15:47:53,317 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-11-17 15:47:55,325 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-11-17 15:47:57,381 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-11-17 15:47:59,504 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-11-17 15:48:01,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 15:48:03,920 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-11-17 15:48:05,923 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-11-17 15:48:08,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 15:48:10,387 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-11-17 15:48:33,420 WARN L293 SmtUtils]: Spent 18.39s on a formula simplification. DAG size of input: 76 DAG size of output: 68 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-17 15:48:35,431 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-11-17 15:48:37,813 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-11-17 15:48:40,014 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-11-17 15:48:42,024 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-11-17 15:48:44,103 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-11-17 15:48:46,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 15:48:48,113 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-11-17 15:48:50,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-11-17 15:48:52,132 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-11-17 15:48:55,510 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-11-17 15:48:57,520 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-11-17 15:48:59,824 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-11-17 15:49:05,980 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-11-17 15:49:08,066 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-11-17 15:49:10,083 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-11-17 15:49:12,088 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-11-17 15:49:14,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 15:49:15,399 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-11-17 15:49:18,738 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-11-17 15:49:20,742 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-11-17 15:49:22,747 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-11-17 15:49:25,597 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-11-17 15:49:34,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 15:49:35,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 15:49:42,189 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-11-17 15:49:44,218 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-11-17 15:49:45,292 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-11-17 15:49:47,305 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-11-17 15:49:50,478 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-11-17 15:49:52,694 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-11-17 15:49:55,903 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-11-17 15:49:58,789 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-11-17 15:50:00,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 15:50:03,717 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-11-17 15:50:04,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 15:50:08,271 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-11-17 15:50:10,281 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-11-17 15:50:12,292 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-11-17 15:50:14,303 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-11-17 15:50:16,311 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-11-17 15:50:18,322 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-11-17 15:50:19,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 15:50:22,082 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-11-17 15:50:24,089 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-11-17 15:50:26,957 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-11-17 15:50:28,971 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-11-17 15:50:30,577 INFO L124 PetriNetUnfolderBase]: 3707/5179 cut-off events. [2023-11-17 15:50:30,577 INFO L125 PetriNetUnfolderBase]: For 22040/22040 co-relation queries the response was YES. [2023-11-17 15:50:30,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27808 conditions, 5179 events. 3707/5179 cut-off events. For 22040/22040 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 25515 event pairs, 287 based on Foata normal form. 44/5208 useless extension candidates. Maximal degree in co-relation 26827. Up to 3881 conditions per place. [2023-11-17 15:50:30,627 INFO L140 encePairwiseOnDemand]: 239/251 looper letters, 221 selfloop transitions, 59 changer transitions 21/305 dead transitions. [2023-11-17 15:50:30,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 305 transitions, 2751 flow [2023-11-17 15:50:30,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-17 15:50:30,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-17 15:50:30,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1476 transitions. [2023-11-17 15:50:30,632 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42003414911781445 [2023-11-17 15:50:30,632 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1476 transitions. [2023-11-17 15:50:30,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1476 transitions. [2023-11-17 15:50:30,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:50:30,633 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1476 transitions. [2023-11-17 15:50:30,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 105.42857142857143) internal successors, (1476), 14 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:50:30,641 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 251.0) internal successors, (3765), 15 states have internal predecessors, (3765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:50:30,642 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 251.0) internal successors, (3765), 15 states have internal predecessors, (3765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:50:30,642 INFO L175 Difference]: Start difference. First operand has 92 places, 98 transitions, 979 flow. Second operand 14 states and 1476 transitions. [2023-11-17 15:50:30,643 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 305 transitions, 2751 flow [2023-11-17 15:50:30,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 305 transitions, 2672 flow, removed 37 selfloop flow, removed 1 redundant places. [2023-11-17 15:50:30,715 INFO L231 Difference]: Finished difference. Result has 111 places, 155 transitions, 1660 flow [2023-11-17 15:50:30,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=900, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1660, PETRI_PLACES=111, PETRI_TRANSITIONS=155} [2023-11-17 15:50:30,716 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 73 predicate places. [2023-11-17 15:50:30,716 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 155 transitions, 1660 flow [2023-11-17 15:50:30,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 94.58823529411765) internal successors, (1608), 17 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:50:30,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:50:30,717 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:50:30,729 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-17 15:50:30,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-17 15:50:30,927 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 15:50:30,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:50:30,927 INFO L85 PathProgramCache]: Analyzing trace with hash -739862925, now seen corresponding path program 2 times [2023-11-17 15:50:30,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:50:30,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688575693] [2023-11-17 15:50:30,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:50:30,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:50:30,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:50:31,441 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:50:31,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:50:31,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688575693] [2023-11-17 15:50:31,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688575693] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 15:50:31,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1366477662] [2023-11-17 15:50:31,442 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-17 15:50:31,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 15:50:31,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:50:31,445 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 15:50:31,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-17 15:50:31,845 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-17 15:50:31,846 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-17 15:50:31,849 INFO L262 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-17 15:50:31,851 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-17 15:50:40,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:50:40,599 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-17 15:50:43,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:50:43,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1366477662] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-17 15:50:43,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-17 15:50:43,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 10 [2023-11-17 15:50:43,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182766546] [2023-11-17 15:50:43,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-17 15:50:43,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-17 15:50:43,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:50:43,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-17 15:50:43,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=97, Unknown=4, NotChecked=0, Total=132 [2023-11-17 15:50:43,312 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 251 [2023-11-17 15:50:43,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 155 transitions, 1660 flow. Second operand has 12 states, 12 states have (on average 96.08333333333333) internal successors, (1153), 12 states have internal predecessors, (1153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:50:43,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:50:43,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 251 [2023-11-17 15:50:43,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:50:45,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 15:50:55,698 WARN L293 SmtUtils]: Spent 5.95s on a formula simplification. DAG size of input: 65 DAG size of output: 58 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-17 15:50:57,930 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-11-17 15:50:59,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 15:51:01,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 15:51:03,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-11-17 15:51:13,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 15:51:19,251 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-11-17 15:51:23,118 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-11-17 15:51:26,644 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-11-17 15:51:29,431 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-11-17 15:51:31,547 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-11-17 15:51:35,098 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-11-17 15:51:38,379 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-11-17 15:51:41,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 15:51:43,284 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-11-17 15:51:45,293 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-11-17 15:51:47,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 15:51:48,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 15:51:52,437 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-11-17 15:51:55,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 15:51:57,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 15:52:00,429 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-11-17 15:52:02,445 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-11-17 15:52:03,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-17 15:52:06,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-17 15:52:09,375 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-11-17 15:52:10,300 INFO L124 PetriNetUnfolderBase]: 4339/6067 cut-off events. [2023-11-17 15:52:10,300 INFO L125 PetriNetUnfolderBase]: For 32524/32524 co-relation queries the response was YES. [2023-11-17 15:52:10,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34901 conditions, 6067 events. 4339/6067 cut-off events. For 32524/32524 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 30844 event pairs, 413 based on Foata normal form. 2/6054 useless extension candidates. Maximal degree in co-relation 33889. Up to 5047 conditions per place. [2023-11-17 15:52:10,334 INFO L140 encePairwiseOnDemand]: 244/251 looper letters, 227 selfloop transitions, 25 changer transitions 9/265 dead transitions. [2023-11-17 15:52:10,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 265 transitions, 2853 flow [2023-11-17 15:52:10,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 15:52:10,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 15:52:10,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 860 transitions. [2023-11-17 15:52:10,338 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42828685258964144 [2023-11-17 15:52:10,338 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 860 transitions. [2023-11-17 15:52:10,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 860 transitions. [2023-11-17 15:52:10,339 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 15:52:10,339 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 860 transitions. [2023-11-17 15:52:10,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 107.5) internal successors, (860), 8 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:52:10,343 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 251.0) internal successors, (2259), 9 states have internal predecessors, (2259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:52:10,343 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 251.0) internal successors, (2259), 9 states have internal predecessors, (2259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:52:10,343 INFO L175 Difference]: Start difference. First operand has 111 places, 155 transitions, 1660 flow. Second operand 8 states and 860 transitions. [2023-11-17 15:52:10,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 265 transitions, 2853 flow [2023-11-17 15:52:10,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 265 transitions, 2710 flow, removed 69 selfloop flow, removed 1 redundant places. [2023-11-17 15:52:10,420 INFO L231 Difference]: Finished difference. Result has 120 places, 170 transitions, 1769 flow [2023-11-17 15:52:10,420 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=1521, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1769, PETRI_PLACES=120, PETRI_TRANSITIONS=170} [2023-11-17 15:52:10,421 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 82 predicate places. [2023-11-17 15:52:10,421 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 170 transitions, 1769 flow [2023-11-17 15:52:10,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 96.08333333333333) internal successors, (1153), 12 states have internal predecessors, (1153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:52:10,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 15:52:10,421 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 15:52:10,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-17 15:52:10,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 15:52:10,622 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-17 15:52:10,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 15:52:10,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1624743955, now seen corresponding path program 3 times [2023-11-17 15:52:10,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 15:52:10,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224609845] [2023-11-17 15:52:10,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 15:52:10,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 15:52:10,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 15:52:10,762 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 15:52:10,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 15:52:10,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224609845] [2023-11-17 15:52:10,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224609845] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-17 15:52:10,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977535525] [2023-11-17 15:52:10,763 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-17 15:52:10,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-17 15:52:10,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 15:52:10,764 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-17 15:52:10,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process Received shutdown request... [2023-11-17 15:52:50,928 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-11-17 15:52:50,928 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-11-17 15:52:51,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 [2023-11-17 15:52:52,129 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forcibly destroying the process [2023-11-17 15:52:52,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 137 [2023-11-17 15:52:52,134 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-17 15:52:52,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-11-17 15:52:52,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2023-11-17 15:52:52,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003836188] [2023-11-17 15:52:52,134 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-11-17 15:52:52,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 15:52:52,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 15:52:52,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 15:52:52,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-17 15:52:52,135 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 251 [2023-11-17 15:52:52,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 170 transitions, 1769 flow. Second operand has 6 states, 6 states have (on average 107.0) internal successors, (642), 6 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-17 15:52:52,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 15:52:52,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 251 [2023-11-17 15:52:52,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 15:52:52,137 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-11-17 15:52:52,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-17 15:52:52,138 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-11-17 15:52:52,139 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2023-11-17 15:52:52,140 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-11-17 15:52:52,140 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-11-17 15:52:52,140 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2023-11-17 15:52:52,140 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 2, 2, 1] [2023-11-17 15:52:52,144 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 15:52:52,144 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 15:52:52,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 03:52:52 BasicIcfg [2023-11-17 15:52:52,146 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 15:52:52,146 INFO L158 Benchmark]: Toolchain (without parser) took 572435.21ms. Allocated memory was 303.0MB in the beginning and 463.5MB in the end (delta: 160.4MB). Free memory was 254.4MB in the beginning and 225.2MB in the end (delta: 29.2MB). Peak memory consumption was 190.7MB. Max. memory is 8.0GB. [2023-11-17 15:52:52,147 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 200.3MB. Free memory is still 154.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 15:52:52,147 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.24ms. Allocated memory is still 303.0MB. Free memory was 254.4MB in the beginning and 242.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-11-17 15:52:52,147 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.53ms. Allocated memory is still 303.0MB. Free memory was 242.9MB in the beginning and 241.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 15:52:52,147 INFO L158 Benchmark]: Boogie Preprocessor took 23.15ms. Allocated memory is still 303.0MB. Free memory was 241.3MB in the beginning and 239.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-11-17 15:52:52,147 INFO L158 Benchmark]: RCFGBuilder took 398.64ms. Allocated memory is still 303.0MB. Free memory was 239.8MB in the beginning and 223.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-11-17 15:52:52,148 INFO L158 Benchmark]: TraceAbstraction took 571771.86ms. Allocated memory was 303.0MB in the beginning and 463.5MB in the end (delta: 160.4MB). Free memory was 222.5MB in the beginning and 225.2MB in the end (delta: -2.8MB). Peak memory consumption was 158.2MB. Max. memory is 8.0GB. [2023-11-17 15:52:52,149 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.12ms. Allocated memory is still 200.3MB. Free memory is still 154.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 206.24ms. Allocated memory is still 303.0MB. Free memory was 254.4MB in the beginning and 242.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 30.53ms. Allocated memory is still 303.0MB. Free memory was 242.9MB in the beginning and 241.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.15ms. Allocated memory is still 303.0MB. Free memory was 241.3MB in the beginning and 239.8MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 398.64ms. Allocated memory is still 303.0MB. Free memory was 239.8MB in the beginning and 223.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 571771.86ms. Allocated memory was 303.0MB in the beginning and 463.5MB in the end (delta: 160.4MB). Free memory was 222.5MB in the beginning and 225.2MB in the end (delta: -2.8MB). Peak memory consumption was 158.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 128 PlacesBefore, 38 PlacesAfterwards, 125 TransitionsBefore, 29 TransitionsAfterwards, 2520 CoEnabledTransitionPairs, 6 FixpointIterations, 50 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 8 TrivialYvCompositions, 8 ConcurrentYvCompositions, 6 ChoiceCompositions, 109 TotalNumberOfCompositions, 2394 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2394, independent: 2394, independent conditional: 0, independent unconditional: 2394, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1668, independent: 1668, independent conditional: 0, independent unconditional: 1668, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1668, independent: 1668, independent conditional: 0, independent unconditional: 1668, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2394, independent: 726, independent conditional: 0, independent unconditional: 726, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1668, unknown conditional: 0, unknown unconditional: 1668] , Statistics on independence cache: Total cache size (in pairs): 112, Positive cache size: 112, Positive conditional cache size: 0, Positive unconditional cache size: 112, 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: 104]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 95]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 173 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: 571.7s, OverallIterations: 14, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 397.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 95 mSolverCounterUnknown, 762 SdHoareTripleChecker+Valid, 295.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 762 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 293.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 39 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3408 IncrementalHoareTripleChecker+Invalid, 3543 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 39 mSolverCounterUnsat, 0 mSDtfsCounter, 3408 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 383 GetRequests, 278 SyntacticMatches, 11 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 190.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1769occurred in iteration=13, InterpolantAutomatonStates: 81, 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.6s SatisfiabilityAnalysisTime, 106.5s InterpolantComputationTime, 529 NumberOfCodeBlocks, 529 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 663 ConstructedInterpolants, 0 QuantifiedInterpolants, 16123 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1260 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 26 InterpolantComputations, 7 PerfectInterpolantSequences, 7/40 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