/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 23:08:28,725 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 23:08:28,806 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 23:08:28,811 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 23:08:28,812 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 23:08:28,850 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 23:08:28,853 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 23:08:28,853 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 23:08:28,854 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 23:08:28,858 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 23:08:28,858 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 23:08:28,858 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 23:08:28,859 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 23:08:28,860 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 23:08:28,860 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 23:08:28,860 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 23:08:28,860 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 23:08:28,861 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 23:08:28,861 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 23:08:28,861 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 23:08:28,861 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 23:08:28,862 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 23:08:28,862 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 23:08:28,863 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 23:08:28,863 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 23:08:28,863 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 23:08:28,864 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 23:08:28,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 23:08:28,864 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 23:08:28,864 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 23:08:28,865 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 23:08:28,866 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 23:08:28,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 23:08:28,866 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 23:08:28,866 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 23:08:28,867 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-26 23:08:29,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 23:08:29,215 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 23:08:29,219 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 23:08:29,220 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 23:08:29,220 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 23:08:29,222 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c [2023-08-26 23:08:30,473 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 23:08:30,723 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 23:08:30,723 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp1x3.wvr.c [2023-08-26 23:08:30,729 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9637370f3/d70d7220727f4c9eb1040afd991d576a/FLAGdb33504cd [2023-08-26 23:08:30,739 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9637370f3/d70d7220727f4c9eb1040afd991d576a [2023-08-26 23:08:30,741 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 23:08:30,742 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 23:08:30,743 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 23:08:30,744 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 23:08:30,746 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 23:08:30,747 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 11:08:30" (1/1) ... [2023-08-26 23:08:30,747 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@215308d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:08:30, skipping insertion in model container [2023-08-26 23:08:30,748 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 11:08:30" (1/1) ... [2023-08-26 23:08:30,764 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 23:08:30,914 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 23:08:30,924 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 23:08:30,949 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 23:08:30,965 INFO L206 MainTranslator]: Completed translation [2023-08-26 23:08:30,965 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:08:30 WrapperNode [2023-08-26 23:08:30,965 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 23:08:30,967 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 23:08:30,967 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 23:08:30,967 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 23:08:30,973 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:08:30" (1/1) ... [2023-08-26 23:08:30,979 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:08:30" (1/1) ... [2023-08-26 23:08:31,001 INFO L138 Inliner]: procedures = 18, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 62 [2023-08-26 23:08:31,001 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 23:08:31,003 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 23:08:31,003 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 23:08:31,003 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 23:08:31,011 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:08:30" (1/1) ... [2023-08-26 23:08:31,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:08:30" (1/1) ... [2023-08-26 23:08:31,021 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:08:30" (1/1) ... [2023-08-26 23:08:31,021 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:08:30" (1/1) ... [2023-08-26 23:08:31,025 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:08:30" (1/1) ... [2023-08-26 23:08:31,033 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:08:30" (1/1) ... [2023-08-26 23:08:31,035 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:08:30" (1/1) ... [2023-08-26 23:08:31,035 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:08:30" (1/1) ... [2023-08-26 23:08:31,037 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 23:08:31,038 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 23:08:31,038 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 23:08:31,038 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 23:08:31,038 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:08:30" (1/1) ... [2023-08-26 23:08:31,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 23:08:31,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 23:08:31,078 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 23:08:31,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 23:08:31,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 23:08:31,119 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-26 23:08:31,119 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-26 23:08:31,119 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-26 23:08:31,119 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-26 23:08:31,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 23:08:31,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 23:08:31,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 23:08:31,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 23:08:31,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 23:08:31,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 23:08:31,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 23:08:31,122 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 23:08:31,211 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 23:08:31,213 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 23:08:31,344 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 23:08:31,350 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 23:08:31,350 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-26 23:08:31,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 11:08:31 BoogieIcfgContainer [2023-08-26 23:08:31,352 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 23:08:31,354 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 23:08:31,354 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 23:08:31,356 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 23:08:31,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 11:08:30" (1/3) ... [2023-08-26 23:08:31,357 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e26db1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 11:08:31, skipping insertion in model container [2023-08-26 23:08:31,357 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:08:30" (2/3) ... [2023-08-26 23:08:31,358 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e26db1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 11:08:31, skipping insertion in model container [2023-08-26 23:08:31,358 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 11:08:31" (3/3) ... [2023-08-26 23:08:31,359 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp1x3.wvr.c [2023-08-26 23:08:31,375 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 23:08:31,375 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-26 23:08:31,375 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 23:08:31,448 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-26 23:08:31,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 79 places, 78 transitions, 172 flow [2023-08-26 23:08:31,519 INFO L124 PetriNetUnfolderBase]: 6/76 cut-off events. [2023-08-26 23:08:31,520 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-26 23:08:31,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85 conditions, 76 events. 6/76 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 0/69 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2023-08-26 23:08:31,524 INFO L82 GeneralOperation]: Start removeDead. Operand has 79 places, 78 transitions, 172 flow [2023-08-26 23:08:31,527 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 67 transitions, 146 flow [2023-08-26 23:08:31,530 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 23:08:31,539 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 67 transitions, 146 flow [2023-08-26 23:08:31,541 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 68 places, 67 transitions, 146 flow [2023-08-26 23:08:31,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 68 places, 67 transitions, 146 flow [2023-08-26 23:08:31,578 INFO L124 PetriNetUnfolderBase]: 6/67 cut-off events. [2023-08-26 23:08:31,579 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-26 23:08:31,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 67 events. 6/67 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 23 event pairs, 0 based on Foata normal form. 0/61 useless extension candidates. Maximal degree in co-relation 46. Up to 2 conditions per place. [2023-08-26 23:08:31,580 INFO L119 LiptonReduction]: Number of co-enabled transitions 252 [2023-08-26 23:08:33,722 INFO L134 LiptonReduction]: Checked pairs total: 297 [2023-08-26 23:08:33,722 INFO L136 LiptonReduction]: Total number of compositions: 67 [2023-08-26 23:08:33,735 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 23:08:33,741 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@217bec07, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 23:08:33,741 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-26 23:08:33,745 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 23:08:33,745 INFO L124 PetriNetUnfolderBase]: 2/12 cut-off events. [2023-08-26 23:08:33,745 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-26 23:08:33,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 23:08:33,746 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 23:08:33,747 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-26 23:08:33,751 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 23:08:33,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1349114579, now seen corresponding path program 1 times [2023-08-26 23:08:33,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 23:08:33,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154993139] [2023-08-26 23:08:33,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:08:33,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 23:08:33,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:08:34,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:08:34,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 23:08:34,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154993139] [2023-08-26 23:08:34,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154993139] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 23:08:34,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 23:08:34,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 23:08:34,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486346024] [2023-08-26 23:08:34,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 23:08:34,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 23:08:34,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 23:08:34,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 23:08:34,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 23:08:34,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 145 [2023-08-26 23:08:34,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 18 places, 13 transitions, 38 flow. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:34,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 23:08:34,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 145 [2023-08-26 23:08:34,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 23:08:34,277 INFO L124 PetriNetUnfolderBase]: 41/77 cut-off events. [2023-08-26 23:08:34,277 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2023-08-26 23:08:34,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 77 events. 41/77 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 169 event pairs, 9 based on Foata normal form. 1/54 useless extension candidates. Maximal degree in co-relation 120. Up to 51 conditions per place. [2023-08-26 23:08:34,279 INFO L140 encePairwiseOnDemand]: 141/145 looper letters, 19 selfloop transitions, 3 changer transitions 1/23 dead transitions. [2023-08-26 23:08:34,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 23 transitions, 113 flow [2023-08-26 23:08:34,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 23:08:34,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 23:08:34,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 195 transitions. [2023-08-26 23:08:34,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4482758620689655 [2023-08-26 23:08:34,292 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 195 transitions. [2023-08-26 23:08:34,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 195 transitions. [2023-08-26 23:08:34,294 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 23:08:34,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 195 transitions. [2023-08-26 23:08:34,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:34,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:34,302 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 145.0) internal successors, (580), 4 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:34,304 INFO L175 Difference]: Start difference. First operand has 18 places, 13 transitions, 38 flow. Second operand 3 states and 195 transitions. [2023-08-26 23:08:34,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 23 transitions, 113 flow [2023-08-26 23:08:34,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 16 places, 23 transitions, 99 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 23:08:34,308 INFO L231 Difference]: Finished difference. Result has 17 places, 15 transitions, 49 flow [2023-08-26 23:08:34,310 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=30, PETRI_DIFFERENCE_MINUEND_PLACES=14, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=13, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=49, PETRI_PLACES=17, PETRI_TRANSITIONS=15} [2023-08-26 23:08:34,313 INFO L281 CegarLoopForPetriNet]: 18 programPoint places, -1 predicate places. [2023-08-26 23:08:34,313 INFO L495 AbstractCegarLoop]: Abstraction has has 17 places, 15 transitions, 49 flow [2023-08-26 23:08:34,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:34,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 23:08:34,313 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 23:08:34,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 23:08:34,314 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-26 23:08:34,314 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 23:08:34,314 INFO L85 PathProgramCache]: Analyzing trace with hash -807345088, now seen corresponding path program 1 times [2023-08-26 23:08:34,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 23:08:34,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618939143] [2023-08-26 23:08:34,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:08:34,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 23:08:34,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:08:34,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:08:34,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 23:08:34,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618939143] [2023-08-26 23:08:34,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618939143] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 23:08:34,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 23:08:34,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 23:08:34,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269777468] [2023-08-26 23:08:34,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 23:08:34,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 23:08:34,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 23:08:34,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 23:08:34,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 23:08:34,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 145 [2023-08-26 23:08:34,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 17 places, 15 transitions, 49 flow. Second operand has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:34,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 23:08:34,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 145 [2023-08-26 23:08:34,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 23:08:34,517 INFO L124 PetriNetUnfolderBase]: 35/71 cut-off events. [2023-08-26 23:08:34,518 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-08-26 23:08:34,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 71 events. 35/71 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 152 event pairs, 6 based on Foata normal form. 6/77 useless extension candidates. Maximal degree in co-relation 55. Up to 45 conditions per place. [2023-08-26 23:08:34,520 INFO L140 encePairwiseOnDemand]: 140/145 looper letters, 15 selfloop transitions, 3 changer transitions 10/28 dead transitions. [2023-08-26 23:08:34,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 20 places, 28 transitions, 135 flow [2023-08-26 23:08:34,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 23:08:34,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 23:08:34,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 250 transitions. [2023-08-26 23:08:34,523 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43103448275862066 [2023-08-26 23:08:34,523 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 250 transitions. [2023-08-26 23:08:34,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 250 transitions. [2023-08-26 23:08:34,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 23:08:34,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 250 transitions. [2023-08-26 23:08:34,525 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 62.5) internal successors, (250), 4 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:34,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 145.0) internal successors, (725), 5 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:34,526 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 145.0) internal successors, (725), 5 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:34,526 INFO L175 Difference]: Start difference. First operand has 17 places, 15 transitions, 49 flow. Second operand 4 states and 250 transitions. [2023-08-26 23:08:34,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 20 places, 28 transitions, 135 flow [2023-08-26 23:08:34,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 28 transitions, 132 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 23:08:34,528 INFO L231 Difference]: Finished difference. Result has 20 places, 15 transitions, 59 flow [2023-08-26 23:08:34,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=16, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=59, PETRI_PLACES=20, PETRI_TRANSITIONS=15} [2023-08-26 23:08:34,529 INFO L281 CegarLoopForPetriNet]: 18 programPoint places, 2 predicate places. [2023-08-26 23:08:34,529 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 15 transitions, 59 flow [2023-08-26 23:08:34,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:34,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 23:08:34,530 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 23:08:34,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 23:08:34,530 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-26 23:08:34,530 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 23:08:34,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1745735394, now seen corresponding path program 2 times [2023-08-26 23:08:34,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 23:08:34,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448902185] [2023-08-26 23:08:34,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:08:34,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 23:08:34,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:08:34,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:08:34,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 23:08:34,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448902185] [2023-08-26 23:08:34,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448902185] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 23:08:34,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385509819] [2023-08-26 23:08:34,626 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 23:08:34,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 23:08:34,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 23:08:34,633 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 23:08:34,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-26 23:08:34,727 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 23:08:34,728 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 23:08:34,730 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-26 23:08:34,733 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 23:08:34,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:08:34,904 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 23:08:35,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:08:35,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385509819] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 23:08:35,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 23:08:35,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-08-26 23:08:35,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903705772] [2023-08-26 23:08:35,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 23:08:35,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 23:08:35,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 23:08:35,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 23:08:35,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 23:08:35,012 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 145 [2023-08-26 23:08:35,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 15 transitions, 59 flow. Second operand has 6 states, 6 states have (on average 58.5) internal successors, (351), 6 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:35,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 23:08:35,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 145 [2023-08-26 23:08:35,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 23:08:35,117 INFO L124 PetriNetUnfolderBase]: 34/63 cut-off events. [2023-08-26 23:08:35,118 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2023-08-26 23:08:35,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190 conditions, 63 events. 34/63 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 106 event pairs, 4 based on Foata normal form. 6/69 useless extension candidates. Maximal degree in co-relation 49. Up to 39 conditions per place. [2023-08-26 23:08:35,119 INFO L140 encePairwiseOnDemand]: 140/145 looper letters, 22 selfloop transitions, 6 changer transitions 0/28 dead transitions. [2023-08-26 23:08:35,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 28 transitions, 152 flow [2023-08-26 23:08:35,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 23:08:35,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 23:08:35,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 305 transitions. [2023-08-26 23:08:35,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4206896551724138 [2023-08-26 23:08:35,121 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 305 transitions. [2023-08-26 23:08:35,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 305 transitions. [2023-08-26 23:08:35,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 23:08:35,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 305 transitions. [2023-08-26 23:08:35,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 61.0) internal successors, (305), 5 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:35,125 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 145.0) internal successors, (870), 6 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:35,126 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 145.0) internal successors, (870), 6 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:35,126 INFO L175 Difference]: Start difference. First operand has 20 places, 15 transitions, 59 flow. Second operand 5 states and 305 transitions. [2023-08-26 23:08:35,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 28 transitions, 152 flow [2023-08-26 23:08:35,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 28 transitions, 144 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-26 23:08:35,128 INFO L231 Difference]: Finished difference. Result has 23 places, 18 transitions, 88 flow [2023-08-26 23:08:35,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=51, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=88, PETRI_PLACES=23, PETRI_TRANSITIONS=18} [2023-08-26 23:08:35,129 INFO L281 CegarLoopForPetriNet]: 18 programPoint places, 5 predicate places. [2023-08-26 23:08:35,129 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 18 transitions, 88 flow [2023-08-26 23:08:35,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 58.5) internal successors, (351), 6 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:35,130 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 23:08:35,130 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 23:08:35,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-26 23:08:35,336 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-08-26 23:08:35,337 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-26 23:08:35,337 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 23:08:35,338 INFO L85 PathProgramCache]: Analyzing trace with hash 573129495, now seen corresponding path program 1 times [2023-08-26 23:08:35,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 23:08:35,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325603669] [2023-08-26 23:08:35,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:08:35,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 23:08:35,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:08:35,480 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:08:35,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 23:08:35,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325603669] [2023-08-26 23:08:35,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325603669] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 23:08:35,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 23:08:35,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 23:08:35,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188521440] [2023-08-26 23:08:35,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 23:08:35,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 23:08:35,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 23:08:35,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 23:08:35,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 23:08:35,485 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 145 [2023-08-26 23:08:35,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 18 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:35,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 23:08:35,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 145 [2023-08-26 23:08:35,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 23:08:35,567 INFO L124 PetriNetUnfolderBase]: 40/73 cut-off events. [2023-08-26 23:08:35,567 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2023-08-26 23:08:35,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267 conditions, 73 events. 40/73 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 136 event pairs, 4 based on Foata normal form. 4/77 useless extension candidates. Maximal degree in co-relation 113. Up to 61 conditions per place. [2023-08-26 23:08:35,573 INFO L140 encePairwiseOnDemand]: 141/145 looper letters, 21 selfloop transitions, 4 changer transitions 0/25 dead transitions. [2023-08-26 23:08:35,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 25 transitions, 165 flow [2023-08-26 23:08:35,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 23:08:35,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 23:08:35,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 243 transitions. [2023-08-26 23:08:35,575 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4189655172413793 [2023-08-26 23:08:35,575 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 243 transitions. [2023-08-26 23:08:35,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 243 transitions. [2023-08-26 23:08:35,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 23:08:35,576 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 243 transitions. [2023-08-26 23:08:35,577 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 60.75) internal successors, (243), 4 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:35,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 145.0) internal successors, (725), 5 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:35,579 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 145.0) internal successors, (725), 5 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:35,579 INFO L175 Difference]: Start difference. First operand has 23 places, 18 transitions, 88 flow. Second operand 4 states and 243 transitions. [2023-08-26 23:08:35,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 25 transitions, 165 flow [2023-08-26 23:08:35,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 25 transitions, 158 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-26 23:08:35,582 INFO L231 Difference]: Finished difference. Result has 26 places, 19 transitions, 99 flow [2023-08-26 23:08:35,582 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=99, PETRI_PLACES=26, PETRI_TRANSITIONS=19} [2023-08-26 23:08:35,584 INFO L281 CegarLoopForPetriNet]: 18 programPoint places, 8 predicate places. [2023-08-26 23:08:35,584 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 19 transitions, 99 flow [2023-08-26 23:08:35,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 4 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:35,585 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 23:08:35,585 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 23:08:35,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 23:08:35,585 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-26 23:08:35,586 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 23:08:35,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1390828202, now seen corresponding path program 1 times [2023-08-26 23:08:35,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 23:08:35,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430915860] [2023-08-26 23:08:35,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:08:35,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 23:08:35,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:08:35,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:08:35,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 23:08:35,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430915860] [2023-08-26 23:08:35,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430915860] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 23:08:35,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509023031] [2023-08-26 23:08:35,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:08:35,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 23:08:35,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 23:08:35,990 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 23:08:35,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-26 23:08:36,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:08:36,128 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-26 23:08:36,129 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 23:08:39,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:08:39,718 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 23:08:40,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:08:40,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509023031] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 23:08:40,326 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 23:08:40,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2023-08-26 23:08:40,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50909948] [2023-08-26 23:08:40,326 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 23:08:40,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-08-26 23:08:40,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 23:08:40,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-08-26 23:08:40,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=110, Unknown=1, NotChecked=0, Total=156 [2023-08-26 23:08:40,328 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 145 [2023-08-26 23:08:40,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 99 flow. Second operand has 13 states, 13 states have (on average 57.30769230769231) internal successors, (745), 13 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:08:40,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 23:08:40,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 145 [2023-08-26 23:08:40,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 23:08:46,976 WARN L234 SmtUtils]: Spent 6.35s on a formula simplification. DAG size of input: 52 DAG size of output: 32 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 23:08:49,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:08:51,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:08:56,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:09:00,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:09:01,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:09: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-08-26 23:09:10,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:09:12,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:09:21,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:09:25,871 INFO L124 PetriNetUnfolderBase]: 136/265 cut-off events. [2023-08-26 23:09:25,871 INFO L125 PetriNetUnfolderBase]: For 285/285 co-relation queries the response was YES. [2023-08-26 23:09:25,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 973 conditions, 265 events. 136/265 cut-off events. For 285/285 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 970 event pairs, 6 based on Foata normal form. 2/267 useless extension candidates. Maximal degree in co-relation 431. Up to 89 conditions per place. [2023-08-26 23:09:25,873 INFO L140 encePairwiseOnDemand]: 139/145 looper letters, 74 selfloop transitions, 32 changer transitions 9/115 dead transitions. [2023-08-26 23:09:25,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 115 transitions, 734 flow [2023-08-26 23:09:25,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-26 23:09:25,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-26 23:09:25,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1159 transitions. [2023-08-26 23:09:25,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4206896551724138 [2023-08-26 23:09:25,877 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1159 transitions. [2023-08-26 23:09:25,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1159 transitions. [2023-08-26 23:09:25,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 23:09:25,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1159 transitions. [2023-08-26 23:09:25,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 61.0) internal successors, (1159), 19 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:09:25,884 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 145.0) internal successors, (2900), 20 states have internal predecessors, (2900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:09:25,885 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 145.0) internal successors, (2900), 20 states have internal predecessors, (2900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:09:25,885 INFO L175 Difference]: Start difference. First operand has 26 places, 19 transitions, 99 flow. Second operand 19 states and 1159 transitions. [2023-08-26 23:09:25,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 115 transitions, 734 flow [2023-08-26 23:09:25,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 115 transitions, 726 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-26 23:09:25,890 INFO L231 Difference]: Finished difference. Result has 48 places, 49 transitions, 401 flow [2023-08-26 23:09:25,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=401, PETRI_PLACES=48, PETRI_TRANSITIONS=49} [2023-08-26 23:09:25,891 INFO L281 CegarLoopForPetriNet]: 18 programPoint places, 30 predicate places. [2023-08-26 23:09:25,891 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 49 transitions, 401 flow [2023-08-26 23:09:25,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 57.30769230769231) internal successors, (745), 13 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:09:25,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 23:09:25,891 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 23:09:25,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-26 23:09:26,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 23:09:26,092 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-26 23:09:26,093 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 23:09:26,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1112896662, now seen corresponding path program 2 times [2023-08-26 23:09:26,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 23:09:26,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322548484] [2023-08-26 23:09:26,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:09:26,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 23:09:26,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:09:26,462 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:09:26,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 23:09:26,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322548484] [2023-08-26 23:09:26,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322548484] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 23:09:26,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693873379] [2023-08-26 23:09:26,463 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-26 23:09:26,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 23:09:26,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 23:09:26,465 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 23:09:26,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-26 23:09:26,588 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 23:09:26,588 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 23:09:26,589 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-26 23:09:26,591 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 23:10:00,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:10:00,697 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 23:10:21,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:10:21,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693873379] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 23:10:21,579 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 23:10:21,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2023-08-26 23:10:21,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799244771] [2023-08-26 23:10:21,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 23:10:21,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-26 23:10:21,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 23:10:21,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-26 23:10:21,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=138, Unknown=24, NotChecked=0, Total=210 [2023-08-26 23:10:21,582 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 145 [2023-08-26 23:10:21,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 49 transitions, 401 flow. Second operand has 15 states, 15 states have (on average 57.333333333333336) internal successors, (860), 15 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-08-26 23:10:21,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 23:10:21,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 145 [2023-08-26 23:10:21,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 23:10:41,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:10:48,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:10:59,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:11:01,129 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:11:08,072 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-08-26 23:11:13,568 INFO L124 PetriNetUnfolderBase]: 263/538 cut-off events. [2023-08-26 23:11:13,569 INFO L125 PetriNetUnfolderBase]: For 2319/2319 co-relation queries the response was YES. [2023-08-26 23:11:13,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2531 conditions, 538 events. 263/538 cut-off events. For 2319/2319 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 2643 event pairs, 16 based on Foata normal form. 10/548 useless extension candidates. Maximal degree in co-relation 2368. Up to 257 conditions per place. [2023-08-26 23:11:13,573 INFO L140 encePairwiseOnDemand]: 139/145 looper letters, 103 selfloop transitions, 41 changer transitions 19/163 dead transitions. [2023-08-26 23:11:13,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 163 transitions, 1415 flow [2023-08-26 23:11:13,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-26 23:11:13,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-26 23:11:13,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1229 transitions. [2023-08-26 23:11:13,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42379310344827587 [2023-08-26 23:11:13,578 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1229 transitions. [2023-08-26 23:11:13,578 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1229 transitions. [2023-08-26 23:11:13,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 23:11:13,579 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1229 transitions. [2023-08-26 23:11:13,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 61.45) internal successors, (1229), 20 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:11:13,586 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 145.0) internal successors, (3045), 21 states have internal predecessors, (3045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:11:13,586 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 145.0) internal successors, (3045), 21 states have internal predecessors, (3045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:11:13,586 INFO L175 Difference]: Start difference. First operand has 48 places, 49 transitions, 401 flow. Second operand 20 states and 1229 transitions. [2023-08-26 23:11:13,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 163 transitions, 1415 flow [2023-08-26 23:11:13,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 163 transitions, 1228 flow, removed 88 selfloop flow, removed 2 redundant places. [2023-08-26 23:11:13,602 INFO L231 Difference]: Finished difference. Result has 78 places, 88 transitions, 765 flow [2023-08-26 23:11:13,602 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=765, PETRI_PLACES=78, PETRI_TRANSITIONS=88} [2023-08-26 23:11:13,603 INFO L281 CegarLoopForPetriNet]: 18 programPoint places, 60 predicate places. [2023-08-26 23:11:13,603 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 88 transitions, 765 flow [2023-08-26 23:11:13,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 57.333333333333336) internal successors, (860), 15 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-08-26 23:11:13,604 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 23:11:13,604 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 23:11:13,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-26 23:11:13,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 23:11:13,805 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-26 23:11:13,805 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 23:11:13,805 INFO L85 PathProgramCache]: Analyzing trace with hash -716753162, now seen corresponding path program 3 times [2023-08-26 23:11:13,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 23:11:13,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265699245] [2023-08-26 23:11:13,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:11:13,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 23:11:13,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:11:14,050 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:11:14,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 23:11:14,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265699245] [2023-08-26 23:11:14,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265699245] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 23:11:14,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2116561621] [2023-08-26 23:11:14,051 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-26 23:11:14,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 23:11:14,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 23:11:14,053 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 23:11:14,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-26 23:11:15,994 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-26 23:11:15,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 23:11:15,996 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-26 23:11:15,998 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 23:11:49,207 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (* (- 1) c_~x2~0)) (.cse2 (div (* (- 1) c_~x1~0) 2))) (let ((.cse4 (+ .cse2 (* (div (* (- 1) .cse2) 4294967296) 4294967296))) (.cse3 (let ((.cse6 (div .cse5 4))) (+ .cse6 (* (div (* (- 1) .cse6) 4294967296) 4294967296)))) (.cse1 (div .cse5 2)) (.cse0 (mod c_~n~0 4294967296))) (and (<= .cse0 (mod c_~x1~0 4294967296)) (= (mod .cse1 2) 0) (< (mod (* 4294967295 .cse2) 4294967296) .cse0) (= (mod c_~x1~0 2) 0) (<= .cse3 .cse4) (<= .cse4 .cse3) (< (mod (* .cse1 4294967295) 4294967296) .cse0)))) is different from false [2023-08-26 23:12:16,575 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse8 (* (- 1) c_~x2~0))) (let ((.cse0 (div .cse8 2)) (.cse9 (div (* (- 1) c_~x1~0) 2))) (let ((.cse2 (mod c_~x1~0 4294967296)) (.cse3 (+ (mod (* 4294967295 .cse9) 4294967296) 1)) (.cse6 (+ .cse9 (* (div (* (- 1) .cse9) 4294967296) 4294967296))) (.cse5 (let ((.cse7 (div .cse8 4))) (+ .cse7 (* (div (* (- 1) .cse7) 4294967296) 4294967296)))) (.cse1 (+ (mod (* .cse0 4294967295) 4294967296) 1)) (.cse4 (mod c_~x2~0 4294967296))) (and (= (mod .cse0 2) 0) (<= .cse1 .cse2) (<= .cse3 .cse2) (= (mod c_~x1~0 2) 0) (<= .cse3 .cse4) (<= .cse5 .cse6) (<= .cse6 .cse5) (<= .cse1 .cse4))))) is different from false [2023-08-26 23:12:41,295 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-08-26 23:12:41,296 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 23:12:52,415 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:12:52,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2116561621] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 23:12:52,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 23:12:52,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2023-08-26 23:12:52,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190941476] [2023-08-26 23:12:52,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 23:12:52,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-26 23:12:52,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 23:12:52,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-26 23:12:52,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=155, Unknown=10, NotChecked=54, Total=272 [2023-08-26 23:12:52,418 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 145 [2023-08-26 23:12:52,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 88 transitions, 765 flow. Second operand has 17 states, 17 states have (on average 57.1764705882353) internal successors, (972), 17 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:12:52,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 23:12:52,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 145 [2023-08-26 23:12:52,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 23:12:53,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:13:03,562 WARN L234 SmtUtils]: Spent 7.64s on a formula simplification. DAG size of input: 65 DAG size of output: 28 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 23:13:06,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:13:08,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:13:09,551 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:13:12,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:13:15,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:13:17,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:13:39,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:13:42,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:13:44,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:13:46,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:13:46,540 INFO L124 PetriNetUnfolderBase]: 255/525 cut-off events. [2023-08-26 23:13:46,540 INFO L125 PetriNetUnfolderBase]: For 3354/3354 co-relation queries the response was YES. [2023-08-26 23:13:46,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2584 conditions, 525 events. 255/525 cut-off events. For 3354/3354 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2580 event pairs, 6 based on Foata normal form. 15/534 useless extension candidates. Maximal degree in co-relation 2476. Up to 166 conditions per place. [2023-08-26 23:13:46,545 INFO L140 encePairwiseOnDemand]: 139/145 looper letters, 95 selfloop transitions, 37 changer transitions 28/160 dead transitions. [2023-08-26 23:13:46,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 160 transitions, 1439 flow [2023-08-26 23:13:46,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-26 23:13:46,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-26 23:13:46,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1151 transitions. [2023-08-26 23:13:46,550 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4177858439201452 [2023-08-26 23:13:46,550 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1151 transitions. [2023-08-26 23:13:46,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1151 transitions. [2023-08-26 23:13:46,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 23:13:46,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1151 transitions. [2023-08-26 23:13:46,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 60.578947368421055) internal successors, (1151), 19 states have internal predecessors, (1151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:13:46,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 145.0) internal successors, (2900), 20 states have internal predecessors, (2900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:13:46,558 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 145.0) internal successors, (2900), 20 states have internal predecessors, (2900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:13:46,558 INFO L175 Difference]: Start difference. First operand has 78 places, 88 transitions, 765 flow. Second operand 19 states and 1151 transitions. [2023-08-26 23:13:46,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 160 transitions, 1439 flow [2023-08-26 23:13:46,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 160 transitions, 1167 flow, removed 127 selfloop flow, removed 6 redundant places. [2023-08-26 23:13:46,575 INFO L231 Difference]: Finished difference. Result has 92 places, 86 transitions, 613 flow [2023-08-26 23:13:46,576 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=613, PETRI_PLACES=92, PETRI_TRANSITIONS=86} [2023-08-26 23:13:46,577 INFO L281 CegarLoopForPetriNet]: 18 programPoint places, 74 predicate places. [2023-08-26 23:13:46,577 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 86 transitions, 613 flow [2023-08-26 23:13:46,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 57.1764705882353) internal successors, (972), 17 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:13:46,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 23:13:46,578 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 23:13:46,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-26 23:13:46,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 23:13:46,785 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-26 23:13:46,785 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 23:13:46,785 INFO L85 PathProgramCache]: Analyzing trace with hash -46174474, now seen corresponding path program 4 times [2023-08-26 23:13:46,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 23:13:46,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732710012] [2023-08-26 23:13:46,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:13:46,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 23:13:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:13:46,910 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:13:46,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 23:13:46,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732710012] [2023-08-26 23:13:46,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732710012] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 23:13:46,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502168853] [2023-08-26 23:13:46,911 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-26 23:13:46,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 23:13:46,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 23:13:46,913 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 23:13:46,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-26 23:13:56,284 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-26 23:13:56,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 23:13:56,287 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-26 23:13:56,288 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 23:14:23,005 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (mod (* 4294967295 (div (* (- 1) c_~x1~0) 2)) 4294967296)) (.cse1 (div (* (- 1) c_~x2~0) 2)) (.cse0 (mod c_~n~0 4294967296))) (and (<= .cse0 (mod c_~x1~0 4294967296)) (= (mod .cse1 2) 0) (< .cse2 .cse0) (= (mod c_~x1~0 2) 0) (= .cse2 (mod (div (* (- 1) .cse1) 2) 4294967296)) (< (mod (* .cse1 4294967295) 4294967296) .cse0))) is different from false [2023-08-26 23:15:17,549 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (div (* (- 1) c_~x2~0) 2)) (.cse5 (mod (* 4294967295 (div (* (- 1) c_~x1~0) 2)) 4294967296))) (let ((.cse2 (mod c_~x1~0 4294967296)) (.cse3 (+ .cse5 1)) (.cse1 (+ (mod (* .cse0 4294967295) 4294967296) 1)) (.cse4 (mod c_~x2~0 4294967296))) (and (= (mod .cse0 2) 0) (<= .cse1 .cse2) (<= .cse3 .cse2) (= (mod c_~x1~0 2) 0) (<= .cse3 .cse4) (= .cse5 (mod (div (* (- 1) .cse0) 2) 4294967296)) (<= .cse1 .cse4)))) is different from false [2023-08-26 23:15:39,753 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-08-26 23:15:39,754 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 23:15:58,808 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:15:58,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502168853] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 23:15:58,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 23:15:58,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2023-08-26 23:15:58,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414054473] [2023-08-26 23:15:58,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 23:15:58,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-26 23:15:58,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 23:15:58,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-26 23:15:58,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=152, Unknown=12, NotChecked=54, Total=272 [2023-08-26 23:15:58,811 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 145 [2023-08-26 23:15:58,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 86 transitions, 613 flow. Second operand has 17 states, 17 states have (on average 57.470588235294116) internal successors, (977), 17 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:15:58,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 23:15:58,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 145 [2023-08-26 23:15:58,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 23:16:00,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:16:35,488 WARN L234 SmtUtils]: Spent 34.92s on a formula simplification. DAG size of input: 62 DAG size of output: 20 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 23:16:37,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:16:39,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-08-26 23:16:46,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:16:48,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:16:50,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:16:52,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:16:53,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:16:59,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:17:01,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:17:03,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:17:05,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:17:07,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:17:09,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:17:11,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:17:22,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:17:24,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:17:26,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:17:33,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:17:35,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:17:37,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:17:39,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:17:41,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:17:43,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:17:46,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:17:48,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-08-26 23:17:50,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-08-26 23:17:52,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:17:54,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:17:56,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:17:58,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:18:00,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:18:02,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:18:04,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:18:13,730 WARN L234 SmtUtils]: Spent 5.61s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 23:18:16,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:18:18,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:18:20,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:18:23,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:18:25,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:18:27,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:18:29,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:18:31,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:18:33,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:18:35,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:18:37,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:18:39,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:18:41,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:18:45,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:18:47,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:18:50,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:18:52,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:18:56,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:18:58,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:19:01,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:19:03,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-08-26 23:19:05,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:19:08,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:19:08,813 INFO L124 PetriNetUnfolderBase]: 296/604 cut-off events. [2023-08-26 23:19:08,813 INFO L125 PetriNetUnfolderBase]: For 3105/3105 co-relation queries the response was YES. [2023-08-26 23:19:08,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2691 conditions, 604 events. 296/604 cut-off events. For 3105/3105 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3078 event pairs, 8 based on Foata normal form. 9/601 useless extension candidates. Maximal degree in co-relation 2555. Up to 270 conditions per place. [2023-08-26 23:19:08,818 INFO L140 encePairwiseOnDemand]: 139/145 looper letters, 106 selfloop transitions, 64 changer transitions 8/178 dead transitions. [2023-08-26 23:19:08,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 178 transitions, 1490 flow [2023-08-26 23:19:08,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-26 23:19:08,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-26 23:19:08,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1048 transitions. [2023-08-26 23:19:08,822 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4251521298174442 [2023-08-26 23:19:08,822 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1048 transitions. [2023-08-26 23:19:08,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1048 transitions. [2023-08-26 23:19:08,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 23:19:08,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1048 transitions. [2023-08-26 23:19:08,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 61.64705882352941) internal successors, (1048), 17 states have internal predecessors, (1048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:19:08,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 145.0) internal successors, (2610), 18 states have internal predecessors, (2610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:19:08,829 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 145.0) internal successors, (2610), 18 states have internal predecessors, (2610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:19:08,829 INFO L175 Difference]: Start difference. First operand has 92 places, 86 transitions, 613 flow. Second operand 17 states and 1048 transitions. [2023-08-26 23:19:08,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 178 transitions, 1490 flow [2023-08-26 23:19:08,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 178 transitions, 1339 flow, removed 56 selfloop flow, removed 15 redundant places. [2023-08-26 23:19:08,843 INFO L231 Difference]: Finished difference. Result has 97 places, 113 transitions, 1006 flow [2023-08-26 23:19:08,843 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1006, PETRI_PLACES=97, PETRI_TRANSITIONS=113} [2023-08-26 23:19:08,847 INFO L281 CegarLoopForPetriNet]: 18 programPoint places, 79 predicate places. [2023-08-26 23:19:08,847 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 113 transitions, 1006 flow [2023-08-26 23:19:08,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 57.470588235294116) internal successors, (977), 17 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:19:08,847 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 23:19:08,847 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 23:19:08,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-26 23:19:09,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 23:19:09,054 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-26 23:19:09,055 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 23:19:09,055 INFO L85 PathProgramCache]: Analyzing trace with hash 602085162, now seen corresponding path program 5 times [2023-08-26 23:19:09,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 23:19:09,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566205513] [2023-08-26 23:19:09,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:19:09,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 23:19:09,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:19:10,013 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:19:10,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 23:19:10,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566205513] [2023-08-26 23:19:10,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566205513] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 23:19:10,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379468442] [2023-08-26 23:19:10,013 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-26 23:19:10,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 23:19:10,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 23:19:10,014 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 23:19:10,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-26 23:19:53,724 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-26 23:19:53,724 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 23:19:53,730 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-26 23:19:53,730 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 23:19:59,992 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 1 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 23:19:59,993 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 23:20:03,409 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-26 23:20:03,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379468442] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 23:20:03,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 23:20:03,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 15 [2023-08-26 23:20:03,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932804185] [2023-08-26 23:20:03,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 23:20:03,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-26 23:20:03,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 23:20:03,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-26 23:20:03,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=194, Unknown=4, NotChecked=0, Total=240 [2023-08-26 23:20:03,411 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 145 [2023-08-26 23:20:03,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 113 transitions, 1006 flow. Second operand has 16 states, 16 states have (on average 57.4375) internal successors, (919), 16 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:20:03,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 23:20:03,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 145 [2023-08-26 23:20:03,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 23:20:08,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:20:10,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:20:17,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:20:19,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:20:21,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:20:22,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:20:24,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:20:26,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:20:29,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:20:32,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:20:43,468 WARN L234 SmtUtils]: Spent 5.55s on a formula simplification. DAG size of input: 34 DAG size of output: 28 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-26 23:20:45,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:20:47,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:20:48,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:20:51,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-08-26 23:20:53,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-26 23:20:57,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:20:59,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:21:00,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-26 23:21:00,629 INFO L124 PetriNetUnfolderBase]: 277/570 cut-off events. [2023-08-26 23:21:00,629 INFO L125 PetriNetUnfolderBase]: For 3809/3809 co-relation queries the response was YES. [2023-08-26 23:21:00,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2777 conditions, 570 events. 277/570 cut-off events. For 3809/3809 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2847 event pairs, 18 based on Foata normal form. 8/578 useless extension candidates. Maximal degree in co-relation 2666. Up to 303 conditions per place. [2023-08-26 23:21:00,634 INFO L140 encePairwiseOnDemand]: 140/145 looper letters, 105 selfloop transitions, 30 changer transitions 10/145 dead transitions. [2023-08-26 23:21:00,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 145 transitions, 1445 flow [2023-08-26 23:21:00,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-26 23:21:00,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-26 23:21:00,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 606 transitions. [2023-08-26 23:21:00,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41793103448275865 [2023-08-26 23:21:00,636 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 606 transitions. [2023-08-26 23:21:00,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 606 transitions. [2023-08-26 23:21:00,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 23:21:00,637 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 606 transitions. [2023-08-26 23:21:00,638 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 60.6) internal successors, (606), 10 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:21:00,640 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 145.0) internal successors, (1595), 11 states have internal predecessors, (1595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:21:00,641 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 145.0) internal successors, (1595), 11 states have internal predecessors, (1595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:21:00,641 INFO L175 Difference]: Start difference. First operand has 97 places, 113 transitions, 1006 flow. Second operand 10 states and 606 transitions. [2023-08-26 23:21:00,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 145 transitions, 1445 flow [2023-08-26 23:21:00,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 145 transitions, 1328 flow, removed 50 selfloop flow, removed 6 redundant places. [2023-08-26 23:21:00,657 INFO L231 Difference]: Finished difference. Result has 100 places, 111 transitions, 947 flow [2023-08-26 23:21:00,658 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=883, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=947, PETRI_PLACES=100, PETRI_TRANSITIONS=111} [2023-08-26 23:21:00,658 INFO L281 CegarLoopForPetriNet]: 18 programPoint places, 82 predicate places. [2023-08-26 23:21:00,658 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 111 transitions, 947 flow [2023-08-26 23:21:00,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 57.4375) internal successors, (919), 16 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:21:00,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 23:21:00,659 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 23:21:00,669 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-08-26 23:21:00,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 23:21:00,868 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-26 23:21:00,868 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 23:21:00,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1524638539, now seen corresponding path program 6 times [2023-08-26 23:21:00,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 23:21:00,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173885494] [2023-08-26 23:21:00,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:21:00,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 23:21:00,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:21:01,027 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:21:01,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 23:21:01,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173885494] [2023-08-26 23:21:01,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173885494] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 23:21:01,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32052845] [2023-08-26 23:21:01,027 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-26 23:21:01,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 23:21:01,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 23:21:01,029 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 23:21:01,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-26 23:21:01,448 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-08-26 23:21:01,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-26 23:21:01,450 INFO L262 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-26 23:21:01,450 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-26 23:21:03,700 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:21:03,700 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-26 23:21:04,043 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:21:04,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32052845] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-26 23:21:04,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-26 23:21:04,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2023-08-26 23:21:04,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848015024] [2023-08-26 23:21:04,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-26 23:21:04,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-26 23:21:04,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 23:21:04,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-26 23:21:04,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=83, Unknown=1, NotChecked=0, Total=110 [2023-08-26 23:21:04,045 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 145 [2023-08-26 23:21:04,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 111 transitions, 947 flow. Second operand has 11 states, 11 states have (on average 57.54545454545455) internal successors, (633), 11 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:21:04,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 23:21:04,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 145 [2023-08-26 23:21:04,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 23:21:07,235 INFO L124 PetriNetUnfolderBase]: 339/709 cut-off events. [2023-08-26 23:21:07,236 INFO L125 PetriNetUnfolderBase]: For 7499/7499 co-relation queries the response was YES. [2023-08-26 23:21:07,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3729 conditions, 709 events. 339/709 cut-off events. For 7499/7499 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3761 event pairs, 34 based on Foata normal form. 30/739 useless extension candidates. Maximal degree in co-relation 3528. Up to 445 conditions per place. [2023-08-26 23:21:07,242 INFO L140 encePairwiseOnDemand]: 140/145 looper letters, 132 selfloop transitions, 40 changer transitions 0/172 dead transitions. [2023-08-26 23:21:07,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 172 transitions, 1773 flow [2023-08-26 23:21:07,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-26 23:21:07,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-26 23:21:07,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 800 transitions. [2023-08-26 23:21:07,244 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4244031830238727 [2023-08-26 23:21:07,244 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 800 transitions. [2023-08-26 23:21:07,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 800 transitions. [2023-08-26 23:21:07,245 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 23:21:07,245 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 800 transitions. [2023-08-26 23:21:07,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 61.53846153846154) internal successors, (800), 13 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:21:07,249 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 145.0) internal successors, (2030), 14 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:21:07,249 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 145.0) internal successors, (2030), 14 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:21:07,249 INFO L175 Difference]: Start difference. First operand has 100 places, 111 transitions, 947 flow. Second operand 13 states and 800 transitions. [2023-08-26 23:21:07,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 172 transitions, 1773 flow [2023-08-26 23:21:07,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 172 transitions, 1710 flow, removed 2 selfloop flow, removed 6 redundant places. [2023-08-26 23:21:07,291 INFO L231 Difference]: Finished difference. Result has 110 places, 126 transitions, 1211 flow [2023-08-26 23:21:07,291 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=859, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1211, PETRI_PLACES=110, PETRI_TRANSITIONS=126} [2023-08-26 23:21:07,291 INFO L281 CegarLoopForPetriNet]: 18 programPoint places, 92 predicate places. [2023-08-26 23:21:07,291 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 126 transitions, 1211 flow [2023-08-26 23:21:07,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 57.54545454545455) internal successors, (633), 11 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:21:07,292 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 23:21:07,292 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 23:21:07,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-26 23:21:07,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 23:21:07,498 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-26 23:21:07,498 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 23:21:07,498 INFO L85 PathProgramCache]: Analyzing trace with hash 615215829, now seen corresponding path program 7 times [2023-08-26 23:21:07,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 23:21:07,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869045689] [2023-08-26 23:21:07,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 23:21:07,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 23:21:07,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 23:21:07,633 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 23:21:07,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 23:21:07,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869045689] [2023-08-26 23:21:07,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869045689] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-26 23:21:07,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932326561] [2023-08-26 23:21:07,634 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-26 23:21:07,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-26 23:21:07,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 23:21:07,635 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-26 23:21:07,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process Received shutdown request... [2023-08-26 23:23:07,156 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-26 23:23:07,156 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-26 23:23:08,170 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-08-26 23:23:08,364 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forcibly destroying the process [2023-08-26 23:23:08,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 137 [2023-08-26 23:23:08,373 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-08-26 23:23:08,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-08-26 23:23:08,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2023-08-26 23:23:08,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156897826] [2023-08-26 23:23:08,373 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-08-26 23:23:08,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 23:23:08,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 23:23:08,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 23:23:08,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-26 23:23:08,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 145 [2023-08-26 23:23:08,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 126 transitions, 1211 flow. Second operand has 6 states, 6 states have (on average 57.333333333333336) internal successors, (344), 6 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 23:23:08,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 23:23:08,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 145 [2023-08-26 23:23:08,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 23:23:08,377 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (2 of 3 remaining) [2023-08-26 23:23:08,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 23:23:08,377 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-08-26 23:23:08,378 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-26 23:23:08,378 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-26 23:23:08,378 INFO L445 BasicCegarLoop]: Path program histogram: [7, 2, 1, 1] [2023-08-26 23:23:08,381 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 23:23:08,381 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 23:23:08,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 11:23:08 BasicIcfg [2023-08-26 23:23:08,383 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 23:23:08,383 INFO L158 Benchmark]: Toolchain (without parser) took 877640.69ms. Allocated memory was 350.2MB in the beginning and 421.5MB in the end (delta: 71.3MB). Free memory was 326.7MB in the beginning and 342.0MB in the end (delta: -15.3MB). Peak memory consumption was 58.3MB. Max. memory is 16.0GB. [2023-08-26 23:23:08,383 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 350.2MB. Free memory is still 326.9MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 23:23:08,383 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.32ms. Allocated memory is still 350.2MB. Free memory was 326.2MB in the beginning and 315.9MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-08-26 23:23:08,384 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.01ms. Allocated memory is still 350.2MB. Free memory was 315.9MB in the beginning and 314.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 23:23:08,384 INFO L158 Benchmark]: Boogie Preprocessor took 34.21ms. Allocated memory is still 350.2MB. Free memory was 314.4MB in the beginning and 313.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 23:23:08,384 INFO L158 Benchmark]: RCFGBuilder took 314.25ms. Allocated memory is still 350.2MB. Free memory was 313.3MB in the beginning and 300.8MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-08-26 23:23:08,384 INFO L158 Benchmark]: TraceAbstraction took 877029.10ms. Allocated memory was 350.2MB in the beginning and 421.5MB in the end (delta: 71.3MB). Free memory was 300.2MB in the beginning and 342.0MB in the end (delta: -41.8MB). Peak memory consumption was 31.1MB. Max. memory is 16.0GB. [2023-08-26 23:23:08,385 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.15ms. Allocated memory is still 350.2MB. Free memory is still 326.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 222.32ms. Allocated memory is still 350.2MB. Free memory was 326.2MB in the beginning and 315.9MB in the end (delta: 10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 35.01ms. Allocated memory is still 350.2MB. Free memory was 315.9MB in the beginning and 314.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 34.21ms. Allocated memory is still 350.2MB. Free memory was 314.4MB in the beginning and 313.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 314.25ms. Allocated memory is still 350.2MB. Free memory was 313.3MB in the beginning and 300.8MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * TraceAbstraction took 877029.10ms. Allocated memory was 350.2MB in the beginning and 421.5MB in the end (delta: 71.3MB). Free memory was 300.2MB in the beginning and 342.0MB in the end (delta: -41.8MB). Peak memory consumption was 31.1MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.2s, 68 PlacesBefore, 18 PlacesAfterwards, 67 TransitionsBefore, 13 TransitionsAfterwards, 252 CoEnabledTransitionPairs, 6 FixpointIterations, 42 TrivialSequentialCompositions, 11 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 4 ConcurrentYvCompositions, 4 ChoiceCompositions, 67 TotalNumberOfCompositions, 297 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 297, independent: 297, independent conditional: 0, independent unconditional: 297, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 140, independent: 140, independent conditional: 0, independent unconditional: 140, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 297, independent: 157, independent conditional: 0, independent unconditional: 157, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 140, unknown conditional: 0, unknown unconditional: 140] , Statistics on independence cache: Total cache size (in pairs): 13, Positive cache size: 13, Positive conditional cache size: 0, Positive unconditional cache size: 13, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 21]: Timeout (TraceAbstraction) Unable to prove that assertion always holds Cancelled while executing Executor. - TimeoutResultAtElement [Line: 64]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 65]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 85 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 876.9s, OverallIterations: 11, TraceHistogramMax: 3, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 402.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.3s, HoareTripleCheckerStatistics: 79 mSolverCounterUnknown, 497 SdHoareTripleChecker+Valid, 230.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 497 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 228.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 418 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2519 IncrementalHoareTripleChecker+Invalid, 3105 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 0 mSDtfsCounter, 2519 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 278 GetRequests, 123 SyntacticMatches, 13 SemanticMatches, 142 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 294.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1211occurred in iteration=10, InterpolantAutomatonStates: 114, 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, 55.8s SatisfiabilityAnalysisTime, 293.4s InterpolantComputationTime, 239 NumberOfCodeBlocks, 239 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 309 ConstructedInterpolants, 0 QuantifiedInterpolants, 8437 SizeOfPredicates, 29 NumberOfNonLiveVariables, 775 ConjunctsInSsa, 102 ConjunctsInUnsatCore, 25 InterpolantComputations, 3 PerfectInterpolantSequences, 18/78 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