/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 -i ../../../trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 02:27:51,631 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 02:27:51,703 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-24 02:27:51,707 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 02:27:51,707 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 02:27:51,738 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 02:27:51,739 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 02:27:51,739 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 02:27:51,740 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 02:27:51,740 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 02:27:51,741 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 02:27:51,741 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 02:27:51,741 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 02:27:51,742 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 02:27:51,742 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 02:27:51,743 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 02:27:51,743 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 02:27:51,743 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 02:27:51,744 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 02:27:51,744 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 02:27:51,744 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 02:27:51,745 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 02:27:51,746 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 02:27:51,746 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 02:27:51,746 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 02:27:51,747 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 02:27:51,747 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 02:27:51,747 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 02:27:51,747 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 02:27:51,747 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 02:27:51,748 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 02:27:51,748 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 02:27:51,749 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 02:27:51,749 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 02:27:51,749 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 02:27:51,749 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 [2023-08-24 02:27:52,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 02:27:52,048 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 02:27:52,051 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 02:27:52,051 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 02:27:52,053 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 02:27:52,054 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c [2023-08-24 02:27:53,288 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 02:27:53,536 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 02:27:53,538 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c [2023-08-24 02:27:53,546 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca31d423a/cf4dcdefdeb54bf9bce1e82d7ce34bae/FLAG8f04774f8 [2023-08-24 02:27:53,562 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca31d423a/cf4dcdefdeb54bf9bce1e82d7ce34bae [2023-08-24 02:27:53,568 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 02:27:53,570 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 02:27:53,571 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 02:27:53,571 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 02:27:53,573 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 02:27:53,575 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 02:27:53" (1/1) ... [2023-08-24 02:27:53,576 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17a49165 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:27:53, skipping insertion in model container [2023-08-24 02:27:53,576 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 02:27:53" (1/1) ... [2023-08-24 02:27:53,603 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 02:27:53,792 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c[3019,3032] [2023-08-24 02:27:53,803 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 02:27:53,815 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 02:27:53,853 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c[3019,3032] [2023-08-24 02:27:53,856 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 02:27:53,866 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 02:27:53,866 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 02:27:53,872 INFO L206 MainTranslator]: Completed translation [2023-08-24 02:27:53,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:27:53 WrapperNode [2023-08-24 02:27:53,873 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 02:27:53,874 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 02:27:53,874 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 02:27:53,874 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 02:27:53,880 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:27:53" (1/1) ... [2023-08-24 02:27:53,900 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:27:53" (1/1) ... [2023-08-24 02:27:53,930 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 141 [2023-08-24 02:27:53,930 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 02:27:53,932 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 02:27:53,932 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 02:27:53,932 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 02:27:53,939 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:27:53" (1/1) ... [2023-08-24 02:27:53,939 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:27:53" (1/1) ... [2023-08-24 02:27:53,952 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:27:53" (1/1) ... [2023-08-24 02:27:53,952 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:27:53" (1/1) ... [2023-08-24 02:27:53,960 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:27:53" (1/1) ... [2023-08-24 02:27:53,963 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:27:53" (1/1) ... [2023-08-24 02:27:53,964 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:27:53" (1/1) ... [2023-08-24 02:27:53,965 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:27:53" (1/1) ... [2023-08-24 02:27:53,967 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 02:27:53,968 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 02:27:53,968 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 02:27:53,968 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 02:27:53,969 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:27:53" (1/1) ... [2023-08-24 02:27:53,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 02:27:53,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 02:27:53,995 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-24 02:27:54,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-24 02:27:54,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 02:27:54,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 02:27:54,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 02:27:54,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-24 02:27:54,028 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-24 02:27:54,028 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-24 02:27:54,028 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-24 02:27:54,028 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-24 02:27:54,028 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-24 02:27:54,028 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-24 02:27:54,028 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-08-24 02:27:54,028 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-08-24 02:27:54,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 02:27:54,029 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 02:27:54,029 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 02:27:54,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-24 02:27:54,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 02:27:54,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 02:27:54,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 02:27:54,030 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 02:27:54,117 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 02:27:54,119 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 02:27:54,486 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 02:27:54,580 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 02:27:54,580 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-24 02:27:54,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 02:27:54 BoogieIcfgContainer [2023-08-24 02:27:54,582 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 02:27:54,584 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 02:27:54,585 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 02:27:54,587 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 02:27:54,587 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 02:27:53" (1/3) ... [2023-08-24 02:27:54,588 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@92c6e9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 02:27:54, skipping insertion in model container [2023-08-24 02:27:54,588 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 02:27:53" (2/3) ... [2023-08-24 02:27:54,589 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@92c6e9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 02:27:54, skipping insertion in model container [2023-08-24 02:27:54,589 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 02:27:54" (3/3) ... [2023-08-24 02:27:54,591 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-min-max-dec.wvr.c [2023-08-24 02:27:54,604 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 02:27:54,604 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-24 02:27:54,604 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 02:27:54,679 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-24 02:27:54,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 167 places, 166 transitions, 364 flow [2023-08-24 02:27:54,809 INFO L124 PetriNetUnfolderBase]: 12/162 cut-off events. [2023-08-24 02:27:54,810 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-24 02:27:54,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 162 events. 12/162 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 132 event pairs, 0 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 130. Up to 2 conditions per place. [2023-08-24 02:27:54,817 INFO L82 GeneralOperation]: Start removeDead. Operand has 167 places, 166 transitions, 364 flow [2023-08-24 02:27:54,822 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 150 transitions, 324 flow [2023-08-24 02:27:54,825 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 02:27:54,832 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 150 transitions, 324 flow [2023-08-24 02:27:54,834 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 150 transitions, 324 flow [2023-08-24 02:27:54,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 150 transitions, 324 flow [2023-08-24 02:27:54,880 INFO L124 PetriNetUnfolderBase]: 12/150 cut-off events. [2023-08-24 02:27:54,881 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-24 02:27:54,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 150 events. 12/150 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 131 event pairs, 0 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 130. Up to 2 conditions per place. [2023-08-24 02:27:54,886 INFO L119 LiptonReduction]: Number of co-enabled transitions 2548 [2023-08-24 02:28:00,607 INFO L134 LiptonReduction]: Checked pairs total: 3658 [2023-08-24 02:28:00,608 INFO L136 LiptonReduction]: Total number of compositions: 137 [2023-08-24 02:28:00,620 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 02:28:00,625 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;@18e44d9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 02:28:00,625 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-24 02:28:00,634 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 02:28:00,634 INFO L124 PetriNetUnfolderBase]: 4/30 cut-off events. [2023-08-24 02:28:00,634 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-24 02:28:00,634 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:28:00,635 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 02:28:00,635 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 02:28:00,640 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:28:00,640 INFO L85 PathProgramCache]: Analyzing trace with hash -924532907, now seen corresponding path program 1 times [2023-08-24 02:28:00,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:28:00,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635459936] [2023-08-24 02:28:00,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:28:00,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:28:00,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:28:01,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 02:28:01,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:28:01,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635459936] [2023-08-24 02:28:01,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635459936] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 02:28:01,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 02:28:01,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 02:28:01,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963494695] [2023-08-24 02:28:01,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 02:28:01,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 02:28:01,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:28:01,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 02:28:01,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 02:28:01,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 303 [2023-08-24 02:28:01,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 136.5) internal successors, (546), 4 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:28:01,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:28:01,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 303 [2023-08-24 02:28:01,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:28:01,374 INFO L124 PetriNetUnfolderBase]: 1410/1888 cut-off events. [2023-08-24 02:28:01,374 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2023-08-24 02:28:01,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3978 conditions, 1888 events. 1410/1888 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 7213 event pairs, 760 based on Foata normal form. 0/1422 useless extension candidates. Maximal degree in co-relation 3477. Up to 1542 conditions per place. [2023-08-24 02:28:01,391 INFO L140 encePairwiseOnDemand]: 299/303 looper letters, 42 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2023-08-24 02:28:01,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 46 transitions, 215 flow [2023-08-24 02:28:01,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 02:28:01,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 02:28:01,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 566 transitions. [2023-08-24 02:28:01,414 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.466996699669967 [2023-08-24 02:28:01,414 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 566 transitions. [2023-08-24 02:28:01,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 566 transitions. [2023-08-24 02:28:01,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:28:01,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 566 transitions. [2023-08-24 02:28:01,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 141.5) internal successors, (566), 4 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:28:01,433 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:28:01,433 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:28:01,435 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 86 flow. Second operand 4 states and 566 transitions. [2023-08-24 02:28:01,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 46 transitions, 215 flow [2023-08-24 02:28:01,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 193 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-08-24 02:28:01,447 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 84 flow [2023-08-24 02:28:01,449 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=36, PETRI_TRANSITIONS=32} [2023-08-24 02:28:01,452 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2023-08-24 02:28:01,452 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 84 flow [2023-08-24 02:28:01,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 136.5) internal successors, (546), 4 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:28:01,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:28:01,453 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 02:28:01,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 02:28:01,453 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 02:28:01,454 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:28:01,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1308158109, now seen corresponding path program 1 times [2023-08-24 02:28:01,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:28:01,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517453501] [2023-08-24 02:28:01,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:28:01,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:28:01,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:28:01,581 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 02:28:01,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:28:01,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517453501] [2023-08-24 02:28:01,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517453501] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 02:28:01,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 02:28:01,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 02:28:01,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855510472] [2023-08-24 02:28:01,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 02:28:01,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 02:28:01,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:28:01,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 02:28:01,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 02:28:01,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 303 [2023-08-24 02:28:01,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:28:01,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:28:01,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 303 [2023-08-24 02:28:01,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:28:01,813 INFO L124 PetriNetUnfolderBase]: 1718/2336 cut-off events. [2023-08-24 02:28:01,813 INFO L125 PetriNetUnfolderBase]: For 527/527 co-relation queries the response was YES. [2023-08-24 02:28:01,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5313 conditions, 2336 events. 1718/2336 cut-off events. For 527/527 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 8122 event pairs, 977 based on Foata normal form. 0/1943 useless extension candidates. Maximal degree in co-relation 1800. Up to 1790 conditions per place. [2023-08-24 02:28:01,827 INFO L140 encePairwiseOnDemand]: 299/303 looper letters, 47 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2023-08-24 02:28:01,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 50 transitions, 233 flow [2023-08-24 02:28:01,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 02:28:01,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 02:28:01,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 569 transitions. [2023-08-24 02:28:01,830 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46947194719471946 [2023-08-24 02:28:01,830 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 569 transitions. [2023-08-24 02:28:01,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 569 transitions. [2023-08-24 02:28:01,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:28:01,831 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 569 transitions. [2023-08-24 02:28:01,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.25) internal successors, (569), 4 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:28:01,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:28:01,835 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:28:01,835 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 84 flow. Second operand 4 states and 569 transitions. [2023-08-24 02:28:01,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 50 transitions, 233 flow [2023-08-24 02:28:01,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 50 transitions, 223 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-24 02:28:01,837 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 92 flow [2023-08-24 02:28:01,837 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2023-08-24 02:28:01,838 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2023-08-24 02:28:01,838 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 92 flow [2023-08-24 02:28:01,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:28:01,839 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:28:01,839 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 02:28:01,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 02:28:01,839 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 02:28:01,840 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:28:01,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1319455662, now seen corresponding path program 1 times [2023-08-24 02:28:01,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:28:01,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123354324] [2023-08-24 02:28:01,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:28:01,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:28:01,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:28:01,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 02:28:01,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:28:01,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123354324] [2023-08-24 02:28:01,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123354324] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 02:28:01,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 02:28:01,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 02:28:01,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305904789] [2023-08-24 02:28:01,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 02:28:01,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 02:28:01,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:28:01,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 02:28:01,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 02:28:01,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 303 [2023-08-24 02:28:01,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:28:01,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:28:01,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 303 [2023-08-24 02:28:01,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:28:02,179 INFO L124 PetriNetUnfolderBase]: 1632/2234 cut-off events. [2023-08-24 02:28:02,180 INFO L125 PetriNetUnfolderBase]: For 531/686 co-relation queries the response was YES. [2023-08-24 02:28:02,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5582 conditions, 2234 events. 1632/2234 cut-off events. For 531/686 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 8451 event pairs, 977 based on Foata normal form. 155/1997 useless extension candidates. Maximal degree in co-relation 1676. Up to 1790 conditions per place. [2023-08-24 02:28:02,193 INFO L140 encePairwiseOnDemand]: 299/303 looper letters, 46 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2023-08-24 02:28:02,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 50 transitions, 240 flow [2023-08-24 02:28:02,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 02:28:02,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 02:28:02,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 566 transitions. [2023-08-24 02:28:02,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.466996699669967 [2023-08-24 02:28:02,196 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 566 transitions. [2023-08-24 02:28:02,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 566 transitions. [2023-08-24 02:28:02,196 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:28:02,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 566 transitions. [2023-08-24 02:28:02,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 141.5) internal successors, (566), 4 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:28:02,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:28:02,201 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:28:02,201 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 92 flow. Second operand 4 states and 566 transitions. [2023-08-24 02:28:02,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 50 transitions, 240 flow [2023-08-24 02:28:02,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 50 transitions, 231 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-24 02:28:02,203 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 100 flow [2023-08-24 02:28:02,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2023-08-24 02:28:02,204 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2023-08-24 02:28:02,204 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 100 flow [2023-08-24 02:28:02,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:28:02,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:28:02,205 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 02:28:02,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 02:28:02,205 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 02:28:02,206 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:28:02,206 INFO L85 PathProgramCache]: Analyzing trace with hash 409706382, now seen corresponding path program 1 times [2023-08-24 02:28:02,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:28:02,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181313341] [2023-08-24 02:28:02,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:28:02,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:28:02,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:28:02,332 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 02:28:02,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:28:02,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181313341] [2023-08-24 02:28:02,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181313341] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 02:28:02,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 02:28:02,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 02:28:02,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35316223] [2023-08-24 02:28:02,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 02:28:02,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 02:28:02,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:28:02,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 02:28:02,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 02:28:02,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 303 [2023-08-24 02:28:02,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:28:02,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:28:02,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 303 [2023-08-24 02:28:02,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:28:02,567 INFO L124 PetriNetUnfolderBase]: 1632/2235 cut-off events. [2023-08-24 02:28:02,567 INFO L125 PetriNetUnfolderBase]: For 884/1039 co-relation queries the response was YES. [2023-08-24 02:28:02,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5797 conditions, 2235 events. 1632/2235 cut-off events. For 884/1039 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 8181 event pairs, 1243 based on Foata normal form. 155/1994 useless extension candidates. Maximal degree in co-relation 1879. Up to 2223 conditions per place. [2023-08-24 02:28:02,582 INFO L140 encePairwiseOnDemand]: 300/303 looper letters, 32 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2023-08-24 02:28:02,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 35 transitions, 170 flow [2023-08-24 02:28:02,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 02:28:02,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 02:28:02,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 398 transitions. [2023-08-24 02:28:02,585 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43784378437843785 [2023-08-24 02:28:02,585 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 398 transitions. [2023-08-24 02:28:02,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 398 transitions. [2023-08-24 02:28:02,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:28:02,585 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 398 transitions. [2023-08-24 02:28:02,586 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:28:02,588 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 303.0) internal successors, (1212), 4 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:28:02,588 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 303.0) internal successors, (1212), 4 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:28:02,589 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 100 flow. Second operand 3 states and 398 transitions. [2023-08-24 02:28:02,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 35 transitions, 170 flow [2023-08-24 02:28:02,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 35 transitions, 164 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-24 02:28:02,591 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 106 flow [2023-08-24 02:28:02,591 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=41, PETRI_TRANSITIONS=35} [2023-08-24 02:28:02,592 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2023-08-24 02:28:02,592 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 106 flow [2023-08-24 02:28:02,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:28:02,592 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:28:02,593 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 02:28:02,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 02:28:02,593 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 02:28:02,593 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:28:02,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1402270999, now seen corresponding path program 1 times [2023-08-24 02:28:02,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:28:02,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998567691] [2023-08-24 02:28:02,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:28:02,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:28:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:28:03,163 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 02:28:03,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:28:03,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998567691] [2023-08-24 02:28:03,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998567691] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 02:28:03,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506703006] [2023-08-24 02:28:03,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:28:03,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:28:03,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 02:28:03,173 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 02:28:03,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-24 02:28:03,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:28:03,311 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 37 conjunts are in the unsatisfiable core [2023-08-24 02:28:03,326 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 02:28:03,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 02:28:03,538 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-08-24 02:28:03,666 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-08-24 02:28:03,724 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2023-08-24 02:28:03,778 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 02:28:03,779 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 02:28:06,553 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 02:28:06,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506703006] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 02:28:06,553 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 02:28:06,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 12, 10] total 25 [2023-08-24 02:28:06,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73807954] [2023-08-24 02:28:06,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 02:28:06,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-24 02:28:06,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:28:06,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-24 02:28:06,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=498, Unknown=2, NotChecked=0, Total=650 [2023-08-24 02:28:06,558 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 303 [2023-08-24 02:28:06,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 106 flow. Second operand has 26 states, 26 states have (on average 104.23076923076923) internal successors, (2710), 26 states have internal predecessors, (2710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:28:06,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:28:06,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 303 [2023-08-24 02:28:06,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:28:12,885 INFO L124 PetriNetUnfolderBase]: 19766/27044 cut-off events. [2023-08-24 02:28:12,885 INFO L125 PetriNetUnfolderBase]: For 7499/7499 co-relation queries the response was YES. [2023-08-24 02:28:12,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69987 conditions, 27044 events. 19766/27044 cut-off events. For 7499/7499 co-relation queries the response was YES. Maximal size of possible extension queue 978. Compared 149115 event pairs, 1040 based on Foata normal form. 14/21400 useless extension candidates. Maximal degree in co-relation 69973. Up to 5638 conditions per place. [2023-08-24 02:28:13,102 INFO L140 encePairwiseOnDemand]: 289/303 looper letters, 345 selfloop transitions, 129 changer transitions 473/947 dead transitions. [2023-08-24 02:28:13,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 947 transitions, 4714 flow [2023-08-24 02:28:13,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-08-24 02:28:13,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2023-08-24 02:28:13,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 6724 transitions. [2023-08-24 02:28:13,122 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38261067486058953 [2023-08-24 02:28:13,122 INFO L72 ComplementDD]: Start complementDD. Operand 58 states and 6724 transitions. [2023-08-24 02:28:13,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 6724 transitions. [2023-08-24 02:28:13,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:28:13,127 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 58 states and 6724 transitions. [2023-08-24 02:28:13,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 59 states, 58 states have (on average 115.93103448275862) internal successors, (6724), 58 states have internal predecessors, (6724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:28:13,166 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 59 states, 59 states have (on average 303.0) internal successors, (17877), 59 states have internal predecessors, (17877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:28:13,176 INFO L81 ComplementDD]: Finished complementDD. Result has 59 states, 59 states have (on average 303.0) internal successors, (17877), 59 states have internal predecessors, (17877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:28:13,176 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 106 flow. Second operand 58 states and 6724 transitions. [2023-08-24 02:28:13,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 947 transitions, 4714 flow [2023-08-24 02:28:13,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 947 transitions, 4710 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-24 02:28:13,290 INFO L231 Difference]: Finished difference. Result has 141 places, 196 transitions, 1280 flow [2023-08-24 02:28:13,290 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=58, PETRI_FLOW=1280, PETRI_PLACES=141, PETRI_TRANSITIONS=196} [2023-08-24 02:28:13,292 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 101 predicate places. [2023-08-24 02:28:13,293 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 196 transitions, 1280 flow [2023-08-24 02:28:13,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 104.23076923076923) internal successors, (2710), 26 states have internal predecessors, (2710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:28:13,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:28:13,294 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 02:28:13,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-24 02:28:13,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:28:13,495 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 02:28:13,496 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:28:13,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1959356175, now seen corresponding path program 2 times [2023-08-24 02:28:13,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:28:13,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840597255] [2023-08-24 02:28:13,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:28:13,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:28:13,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:28:13,819 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-24 02:28:13,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:28:13,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840597255] [2023-08-24 02:28:13,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840597255] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 02:28:13,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 02:28:13,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 02:28:13,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795959763] [2023-08-24 02:28:13,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 02:28:13,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 02:28:13,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:28:13,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 02:28:13,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 02:28:13,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 303 [2023-08-24 02:28:13,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 196 transitions, 1280 flow. Second operand has 4 states, 4 states have (on average 146.5) internal successors, (586), 4 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:28:13,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:28:13,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 303 [2023-08-24 02:28:13,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:28:16,055 INFO L124 PetriNetUnfolderBase]: 13138/18484 cut-off events. [2023-08-24 02:28:16,055 INFO L125 PetriNetUnfolderBase]: For 312079/313917 co-relation queries the response was YES. [2023-08-24 02:28:16,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101377 conditions, 18484 events. 13138/18484 cut-off events. For 312079/313917 co-relation queries the response was YES. Maximal size of possible extension queue 791. Compared 105044 event pairs, 1579 based on Foata normal form. 1515/19664 useless extension candidates. Maximal degree in co-relation 101314. Up to 10991 conditions per place. [2023-08-24 02:28:16,181 INFO L140 encePairwiseOnDemand]: 299/303 looper letters, 157 selfloop transitions, 4 changer transitions 338/500 dead transitions. [2023-08-24 02:28:16,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 500 transitions, 4304 flow [2023-08-24 02:28:16,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 02:28:16,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 02:28:16,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 767 transitions. [2023-08-24 02:28:16,184 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5062706270627063 [2023-08-24 02:28:16,184 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 767 transitions. [2023-08-24 02:28:16,184 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 767 transitions. [2023-08-24 02:28:16,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:28:16,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 767 transitions. [2023-08-24 02:28:16,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 153.4) internal successors, (767), 5 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:28:16,188 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:28:16,188 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:28:16,188 INFO L175 Difference]: Start difference. First operand has 141 places, 196 transitions, 1280 flow. Second operand 5 states and 767 transitions. [2023-08-24 02:28:16,189 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 500 transitions, 4304 flow [2023-08-24 02:28:16,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 500 transitions, 4175 flow, removed 64 selfloop flow, removed 20 redundant places. [2023-08-24 02:28:16,745 INFO L231 Difference]: Finished difference. Result has 99 places, 122 transitions, 725 flow [2023-08-24 02:28:16,746 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=1213, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=725, PETRI_PLACES=99, PETRI_TRANSITIONS=122} [2023-08-24 02:28:16,746 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 59 predicate places. [2023-08-24 02:28:16,746 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 122 transitions, 725 flow [2023-08-24 02:28:16,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 146.5) internal successors, (586), 4 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:28:16,747 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:28:16,747 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 02:28:16,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 02:28:16,747 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 02:28:16,747 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:28:16,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1437768239, now seen corresponding path program 3 times [2023-08-24 02:28:16,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:28:16,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311649661] [2023-08-24 02:28:16,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:28:16,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:28:16,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:28:17,368 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 02:28:17,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:28:17,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311649661] [2023-08-24 02:28:17,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311649661] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 02:28:17,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341625216] [2023-08-24 02:28:17,369 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 02:28:17,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:28:17,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 02:28:17,370 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 02:28:17,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-24 02:28:17,565 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-24 02:28:17,565 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 02:28:17,567 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 37 conjunts are in the unsatisfiable core [2023-08-24 02:28:17,570 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 02:28:17,663 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-24 02:28:17,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 02:28:17,739 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 02:28:17,840 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-08-24 02:28:17,873 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 02:28:17,874 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 02:28:26,403 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_282 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_282) c_~A~0.base) c_~A~0.offset))) (or (<= 2147483647 .cse0) (<= (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) (+ .cse0 1))))) is different from false [2023-08-24 02:28:26,419 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:28:26,419 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 45 [2023-08-24 02:28:26,427 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 72 [2023-08-24 02:28:26,445 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2023-08-24 02:28:26,448 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2023-08-24 02:28:26,489 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 02:28:26,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341625216] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 02:28:26,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 02:28:26,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 11] total 27 [2023-08-24 02:28:26,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067279234] [2023-08-24 02:28:26,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 02:28:26,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-24 02:28:26,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:28:26,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-24 02:28:26,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=608, Unknown=13, NotChecked=52, Total=812 [2023-08-24 02:28:26,494 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 303 [2023-08-24 02:28:26,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 122 transitions, 725 flow. Second operand has 29 states, 29 states have (on average 104.0) internal successors, (3016), 29 states have internal predecessors, (3016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:28:26,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:28:26,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 303 [2023-08-24 02:28:26,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:28:36,093 INFO L124 PetriNetUnfolderBase]: 31337/42953 cut-off events. [2023-08-24 02:28:36,093 INFO L125 PetriNetUnfolderBase]: For 643247/643247 co-relation queries the response was YES. [2023-08-24 02:28:36,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228210 conditions, 42953 events. 31337/42953 cut-off events. For 643247/643247 co-relation queries the response was YES. Maximal size of possible extension queue 1527. Compared 251344 event pairs, 1614 based on Foata normal form. 23/42125 useless extension candidates. Maximal degree in co-relation 228163. Up to 9103 conditions per place. [2023-08-24 02:28:36,355 INFO L140 encePairwiseOnDemand]: 290/303 looper letters, 530 selfloop transitions, 229 changer transitions 1226/1985 dead transitions. [2023-08-24 02:28:36,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 1985 transitions, 17215 flow [2023-08-24 02:28:36,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2023-08-24 02:28:36,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2023-08-24 02:28:36,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 10007 transitions. [2023-08-24 02:28:36,376 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3753000300030003 [2023-08-24 02:28:36,376 INFO L72 ComplementDD]: Start complementDD. Operand 88 states and 10007 transitions. [2023-08-24 02:28:36,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 10007 transitions. [2023-08-24 02:28:36,382 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:28:36,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 88 states and 10007 transitions. [2023-08-24 02:28:36,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 89 states, 88 states have (on average 113.7159090909091) internal successors, (10007), 88 states have internal predecessors, (10007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:28:36,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 89 states, 89 states have (on average 303.0) internal successors, (26967), 89 states have internal predecessors, (26967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:28:36,436 INFO L81 ComplementDD]: Finished complementDD. Result has 89 states, 89 states have (on average 303.0) internal successors, (26967), 89 states have internal predecessors, (26967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:28:36,436 INFO L175 Difference]: Start difference. First operand has 99 places, 122 transitions, 725 flow. Second operand 88 states and 10007 transitions. [2023-08-24 02:28:36,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 1985 transitions, 17215 flow [2023-08-24 02:28:38,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 1985 transitions, 15275 flow, removed 930 selfloop flow, removed 12 redundant places. [2023-08-24 02:28:38,509 INFO L231 Difference]: Finished difference. Result has 233 places, 315 transitions, 3184 flow [2023-08-24 02:28:38,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=88, PETRI_FLOW=3184, PETRI_PLACES=233, PETRI_TRANSITIONS=315} [2023-08-24 02:28:38,510 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 193 predicate places. [2023-08-24 02:28:38,510 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 315 transitions, 3184 flow [2023-08-24 02:28:38,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 104.0) internal successors, (3016), 29 states have internal predecessors, (3016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:28:38,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:28:38,512 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 02:28:38,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-24 02:28:38,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-08-24 02:28:38,718 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 02:28:38,719 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:28:38,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1175093357, now seen corresponding path program 4 times [2023-08-24 02:28:38,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:28:38,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608500316] [2023-08-24 02:28:38,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:28:38,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:28:38,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:28:39,403 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 02:28:39,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:28:39,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608500316] [2023-08-24 02:28:39,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608500316] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 02:28:39,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [770835266] [2023-08-24 02:28:39,404 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-24 02:28:39,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:28:39,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 02:28:39,405 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 02:28:39,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-24 02:28:39,532 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-24 02:28:39,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 02:28:39,534 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 45 conjunts are in the unsatisfiable core [2023-08-24 02:28:39,538 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 02:28:39,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 02:28:39,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 02:28:39,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 02:28:39,549 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-08-24 02:28:39,591 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-24 02:28:39,639 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 02:28:39,676 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 02:28:39,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 02:28:39,785 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 02:28:39,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 02:28:39,824 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 02:28:39,881 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:28:39,882 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 36 [2023-08-24 02:28:39,942 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 02:28:39,942 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 02:28:40,833 WARN L839 $PredicateComparison]: unable to prove that (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_355))) (let ((.cse2 (select (store (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse1 (select .cse2 (+ c_~A~0.offset (* thread2Thread1of1ForFork0_~i~1 4))))) (or (<= (select (select .cse0 c_~A~0.base) c_~A~0.offset) (+ .cse1 1)) (< .cse1 (select .cse2 c_~A~0.offset)) (<= 2147483647 .cse1)))))) is different from false [2023-08-24 02:28:40,861 WARN L839 $PredicateComparison]: unable to prove that (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_355 (Array Int Int)) (v_ArrVal_354 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_354) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_355))) (let ((.cse1 (select (store (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse0 (select .cse1 (+ (* thread2Thread1of1ForFork0_~i~1 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (<= 2147483647 .cse0) (< .cse0 (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (<= (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ .cse0 1))))))) is different from false [2023-08-24 02:28:40,872 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:28:40,872 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 110 [2023-08-24 02:28:40,908 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:28:40,910 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58688 treesize of output 55304 [2023-08-24 02:28:41,012 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:28:41,012 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 462 treesize of output 442 [2023-08-24 02:28:41,042 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:28:41,043 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 920 treesize of output 848 [2023-08-24 02:28:41,072 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:28:41,073 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 840 treesize of output 688 [2023-08-24 02:28:41,109 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:28:41,110 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 367 treesize of output 319 [2023-08-24 02:28:42,807 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 1 times theorem prover too weak. 1 trivial. 1 not checked. [2023-08-24 02:28:42,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [770835266] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 02:28:42,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 02:28:42,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 12] total 31 [2023-08-24 02:28:42,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190423551] [2023-08-24 02:28:42,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 02:28:42,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-24 02:28:42,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:28:42,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-24 02:28:42,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=753, Unknown=37, NotChecked=118, Total=1056 [2023-08-24 02:28:42,812 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 303 [2023-08-24 02:28:42,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 315 transitions, 3184 flow. Second operand has 33 states, 33 states have (on average 90.78787878787878) internal successors, (2996), 33 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:28:42,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:28:42,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 303 [2023-08-24 02:28:42,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:28:57,068 INFO L124 PetriNetUnfolderBase]: 30369/41996 cut-off events. [2023-08-24 02:28:57,069 INFO L125 PetriNetUnfolderBase]: For 3107118/3107118 co-relation queries the response was YES. [2023-08-24 02:28:57,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 400878 conditions, 41996 events. 30369/41996 cut-off events. For 3107118/3107118 co-relation queries the response was YES. Maximal size of possible extension queue 1515. Compared 249628 event pairs, 2675 based on Foata normal form. 15/42010 useless extension candidates. Maximal degree in co-relation 400767. Up to 10312 conditions per place. [2023-08-24 02:28:57,971 INFO L140 encePairwiseOnDemand]: 292/303 looper letters, 266 selfloop transitions, 184 changer transitions 956/1406 dead transitions. [2023-08-24 02:28:57,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 1406 transitions, 21500 flow [2023-08-24 02:28:57,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-08-24 02:28:57,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2023-08-24 02:28:57,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 4604 transitions. [2023-08-24 02:28:57,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3303199885205912 [2023-08-24 02:28:57,978 INFO L72 ComplementDD]: Start complementDD. Operand 46 states and 4604 transitions. [2023-08-24 02:28:57,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 4604 transitions. [2023-08-24 02:28:57,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:28:57,979 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 46 states and 4604 transitions. [2023-08-24 02:28:57,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 47 states, 46 states have (on average 100.08695652173913) internal successors, (4604), 46 states have internal predecessors, (4604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:28:57,998 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 47 states, 47 states have (on average 303.0) internal successors, (14241), 47 states have internal predecessors, (14241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:28:58,000 INFO L81 ComplementDD]: Finished complementDD. Result has 47 states, 47 states have (on average 303.0) internal successors, (14241), 47 states have internal predecessors, (14241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:28:58,000 INFO L175 Difference]: Start difference. First operand has 233 places, 315 transitions, 3184 flow. Second operand 46 states and 4604 transitions. [2023-08-24 02:28:58,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 1406 transitions, 21500 flow [2023-08-24 02:29:12,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 1406 transitions, 16508 flow, removed 2358 selfloop flow, removed 45 redundant places. [2023-08-24 02:29:12,270 INFO L231 Difference]: Finished difference. Result has 216 places, 329 transitions, 4013 flow [2023-08-24 02:29:12,271 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=2809, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=163, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=4013, PETRI_PLACES=216, PETRI_TRANSITIONS=329} [2023-08-24 02:29:12,271 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 176 predicate places. [2023-08-24 02:29:12,271 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 329 transitions, 4013 flow [2023-08-24 02:29:12,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 90.78787878787878) internal successors, (2996), 33 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:29:12,272 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:29:12,272 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 02:29:12,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-24 02:29:12,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:29:12,478 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 02:29:12,479 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:29:12,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1649871177, now seen corresponding path program 5 times [2023-08-24 02:29:12,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:29:12,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211806068] [2023-08-24 02:29:12,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:29:12,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:29:12,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:29:12,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-24 02:29:12,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:29:12,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211806068] [2023-08-24 02:29:12,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211806068] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 02:29:12,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 02:29:12,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 02:29:12,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21635414] [2023-08-24 02:29:12,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 02:29:12,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 02:29:12,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:29:12,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 02:29:12,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 02:29:12,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 303 [2023-08-24 02:29:12,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 329 transitions, 4013 flow. Second operand has 4 states, 4 states have (on average 146.5) internal successors, (586), 4 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:29:12,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:29:12,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 303 [2023-08-24 02:29:12,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:29:17,247 INFO L124 PetriNetUnfolderBase]: 18760/26408 cut-off events. [2023-08-24 02:29:17,248 INFO L125 PetriNetUnfolderBase]: For 1608508/1611772 co-relation queries the response was YES. [2023-08-24 02:29:17,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233472 conditions, 26408 events. 18760/26408 cut-off events. For 1608508/1611772 co-relation queries the response was YES. Maximal size of possible extension queue 1050. Compared 153657 event pairs, 3864 based on Foata normal form. 1096/27218 useless extension candidates. Maximal degree in co-relation 233365. Up to 19626 conditions per place. [2023-08-24 02:29:17,744 INFO L140 encePairwiseOnDemand]: 299/303 looper letters, 327 selfloop transitions, 21 changer transitions 243/606 dead transitions. [2023-08-24 02:29:17,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 606 transitions, 8777 flow [2023-08-24 02:29:17,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 02:29:17,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 02:29:17,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 761 transitions. [2023-08-24 02:29:17,746 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5023102310231023 [2023-08-24 02:29:17,746 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 761 transitions. [2023-08-24 02:29:17,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 761 transitions. [2023-08-24 02:29:17,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:29:17,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 761 transitions. [2023-08-24 02:29:17,747 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 152.2) internal successors, (761), 5 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:29:17,748 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:29:17,749 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:29:17,749 INFO L175 Difference]: Start difference. First operand has 216 places, 329 transitions, 4013 flow. Second operand 5 states and 761 transitions. [2023-08-24 02:29:17,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 606 transitions, 8777 flow [2023-08-24 02:29:23,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 606 transitions, 8047 flow, removed 343 selfloop flow, removed 38 redundant places. [2023-08-24 02:29:23,082 INFO L231 Difference]: Finished difference. Result has 149 places, 317 transitions, 3535 flow [2023-08-24 02:29:23,082 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=3621, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3535, PETRI_PLACES=149, PETRI_TRANSITIONS=317} [2023-08-24 02:29:23,082 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 109 predicate places. [2023-08-24 02:29:23,083 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 317 transitions, 3535 flow [2023-08-24 02:29:23,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 146.5) internal successors, (586), 4 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:29:23,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:29:23,083 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 02:29:23,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 02:29:23,083 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 02:29:23,084 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:29:23,084 INFO L85 PathProgramCache]: Analyzing trace with hash -152982893, now seen corresponding path program 6 times [2023-08-24 02:29:23,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:29:23,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508005372] [2023-08-24 02:29:23,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:29:23,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:29:23,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:29:23,365 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 02:29:23,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:29:23,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508005372] [2023-08-24 02:29:23,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508005372] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 02:29:23,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752649608] [2023-08-24 02:29:23,367 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-24 02:29:23,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:29:23,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 02:29:23,369 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 02:29:23,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-24 02:29:23,660 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-08-24 02:29:23,660 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 02:29:23,662 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 28 conjunts are in the unsatisfiable core [2023-08-24 02:29:23,664 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 02:29:23,796 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-08-24 02:29:23,825 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 02:29:23,825 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 02:29:24,035 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 02:29:24,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752649608] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 02:29:24,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 02:29:24,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 7] total 19 [2023-08-24 02:29:24,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937146004] [2023-08-24 02:29:24,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 02:29:24,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-24 02:29:24,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:29:24,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-24 02:29:24,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=286, Unknown=0, NotChecked=0, Total=380 [2023-08-24 02:29:24,038 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 303 [2023-08-24 02:29:24,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 317 transitions, 3535 flow. Second operand has 20 states, 20 states have (on average 115.0) internal successors, (2300), 20 states have internal predecessors, (2300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:29:24,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:29:24,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 303 [2023-08-24 02:29:24,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:29:37,558 INFO L124 PetriNetUnfolderBase]: 59386/82692 cut-off events. [2023-08-24 02:29:37,558 INFO L125 PetriNetUnfolderBase]: For 2446699/2449339 co-relation queries the response was YES. [2023-08-24 02:29:38,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 597366 conditions, 82692 events. 59386/82692 cut-off events. For 2446699/2449339 co-relation queries the response was YES. Maximal size of possible extension queue 3278. Compared 548959 event pairs, 5861 based on Foata normal form. 2138/84667 useless extension candidates. Maximal degree in co-relation 597292. Up to 20959 conditions per place. [2023-08-24 02:29:38,777 INFO L140 encePairwiseOnDemand]: 291/303 looper letters, 486 selfloop transitions, 162 changer transitions 1689/2350 dead transitions. [2023-08-24 02:29:38,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 2350 transitions, 31609 flow [2023-08-24 02:29:38,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-08-24 02:29:38,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2023-08-24 02:29:38,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 6247 transitions. [2023-08-24 02:29:38,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41234323432343234 [2023-08-24 02:29:38,786 INFO L72 ComplementDD]: Start complementDD. Operand 50 states and 6247 transitions. [2023-08-24 02:29:38,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 6247 transitions. [2023-08-24 02:29:38,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:29:38,788 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 50 states and 6247 transitions. [2023-08-24 02:29:38,802 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 51 states, 50 states have (on average 124.94) internal successors, (6247), 50 states have internal predecessors, (6247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:29:38,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 51 states, 51 states have (on average 303.0) internal successors, (15453), 51 states have internal predecessors, (15453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:29:38,821 INFO L81 ComplementDD]: Finished complementDD. Result has 51 states, 51 states have (on average 303.0) internal successors, (15453), 51 states have internal predecessors, (15453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:29:38,821 INFO L175 Difference]: Start difference. First operand has 149 places, 317 transitions, 3535 flow. Second operand 50 states and 6247 transitions. [2023-08-24 02:29:38,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 2350 transitions, 31609 flow [2023-08-24 02:29:54,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 2350 transitions, 31377 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-08-24 02:29:54,423 INFO L231 Difference]: Finished difference. Result has 240 places, 401 transitions, 6139 flow [2023-08-24 02:29:54,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=3489, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=6139, PETRI_PLACES=240, PETRI_TRANSITIONS=401} [2023-08-24 02:29:54,424 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 200 predicate places. [2023-08-24 02:29:54,424 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 401 transitions, 6139 flow [2023-08-24 02:29:54,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 115.0) internal successors, (2300), 20 states have internal predecessors, (2300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:29:54,425 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:29:54,425 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 02:29:54,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-24 02:29:54,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:29:54,630 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 02:29:54,631 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:29:54,631 INFO L85 PathProgramCache]: Analyzing trace with hash 2060274039, now seen corresponding path program 7 times [2023-08-24 02:29:54,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:29:54,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885380235] [2023-08-24 02:29:54,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:29:54,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:29:54,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:29:55,027 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 02:29:55,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:29:55,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885380235] [2023-08-24 02:29:55,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885380235] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 02:29:55,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267748520] [2023-08-24 02:29:55,028 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-24 02:29:55,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:29:55,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 02:29:55,029 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 02:29:55,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-24 02:29:55,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:29:55,154 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 26 conjunts are in the unsatisfiable core [2023-08-24 02:29:55,159 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 02:29:55,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 02:29:55,275 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 02:29:55,318 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-08-24 02:29:55,344 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 02:29:55,344 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 02:29:55,690 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:29:55,691 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 85 [2023-08-24 02:29:55,697 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2023-08-24 02:29:55,701 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2023-08-24 02:29:55,777 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 02:29:55,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267748520] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-24 02:29:55,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-24 02:29:55,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7, 8] total 21 [2023-08-24 02:29:55,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727859381] [2023-08-24 02:29:55,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 02:29:55,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-24 02:29:55,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:29:55,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-24 02:29:55,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2023-08-24 02:29:55,781 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 303 [2023-08-24 02:29:55,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 401 transitions, 6139 flow. Second operand has 11 states, 11 states have (on average 115.72727272727273) internal successors, (1273), 11 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:29:55,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:29:55,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 303 [2023-08-24 02:29:55,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:30:06,374 INFO L124 PetriNetUnfolderBase]: 35539/50056 cut-off events. [2023-08-24 02:30:06,375 INFO L125 PetriNetUnfolderBase]: For 4447234/4448851 co-relation queries the response was YES. [2023-08-24 02:30:07,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 537930 conditions, 50056 events. 35539/50056 cut-off events. For 4447234/4448851 co-relation queries the response was YES. Maximal size of possible extension queue 1966. Compared 316598 event pairs, 9978 based on Foata normal form. 1231/51221 useless extension candidates. Maximal degree in co-relation 537809. Up to 24568 conditions per place. [2023-08-24 02:30:07,476 INFO L140 encePairwiseOnDemand]: 295/303 looper letters, 453 selfloop transitions, 26 changer transitions 265/757 dead transitions. [2023-08-24 02:30:07,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 757 transitions, 13922 flow [2023-08-24 02:30:07,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 02:30:07,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 02:30:07,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1012 transitions. [2023-08-24 02:30:07,478 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4174917491749175 [2023-08-24 02:30:07,478 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1012 transitions. [2023-08-24 02:30:07,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1012 transitions. [2023-08-24 02:30:07,479 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:30:07,479 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1012 transitions. [2023-08-24 02:30:07,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 126.5) internal successors, (1012), 8 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:30:07,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 303.0) internal successors, (2727), 9 states have internal predecessors, (2727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:30:07,481 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 303.0) internal successors, (2727), 9 states have internal predecessors, (2727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:30:07,481 INFO L175 Difference]: Start difference. First operand has 240 places, 401 transitions, 6139 flow. Second operand 8 states and 1012 transitions. [2023-08-24 02:30:07,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 757 transitions, 13922 flow [2023-08-24 02:30:21,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 757 transitions, 12936 flow, removed 466 selfloop flow, removed 27 redundant places. [2023-08-24 02:30:21,930 INFO L231 Difference]: Finished difference. Result has 189 places, 407 transitions, 5904 flow [2023-08-24 02:30:21,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=5663, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5904, PETRI_PLACES=189, PETRI_TRANSITIONS=407} [2023-08-24 02:30:21,931 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 149 predicate places. [2023-08-24 02:30:21,931 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 407 transitions, 5904 flow [2023-08-24 02:30:21,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 115.72727272727273) internal successors, (1273), 11 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:30:21,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:30:21,931 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 02:30:21,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-24 02:30:22,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-08-24 02:30:22,132 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 02:30:22,133 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:30:22,133 INFO L85 PathProgramCache]: Analyzing trace with hash -807789207, now seen corresponding path program 8 times [2023-08-24 02:30:22,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:30:22,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397691578] [2023-08-24 02:30:22,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:30:22,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:30:22,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:30:22,510 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 02:30:22,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:30:22,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397691578] [2023-08-24 02:30:22,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397691578] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 02:30:22,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71115532] [2023-08-24 02:30:22,510 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 02:30:22,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:30:22,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 02:30:22,512 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 02:30:22,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-24 02:30:22,742 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 02:30:22,742 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 02:30:22,744 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-24 02:30:22,747 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 02:30:22,753 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 74 [2023-08-24 02:30:22,876 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 02:30:22,973 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-08-24 02:30:23,003 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 02:30:23,003 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 02:30:23,334 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2023-08-24 02:30:23,343 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 02:30:23,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71115532] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-24 02:30:23,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-24 02:30:23,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [7, 10] total 25 [2023-08-24 02:30:23,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878120574] [2023-08-24 02:30:23,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 02:30:23,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-24 02:30:23,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:30:23,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-24 02:30:23,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=562, Unknown=1, NotChecked=0, Total=702 [2023-08-24 02:30:23,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 303 [2023-08-24 02:30:23,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 407 transitions, 5904 flow. Second operand has 12 states, 12 states have (on average 109.5) internal successors, (1314), 12 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:30:23,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:30:23,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 303 [2023-08-24 02:30:23,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:30:32,721 INFO L124 PetriNetUnfolderBase]: 33026/46451 cut-off events. [2023-08-24 02:30:32,721 INFO L125 PetriNetUnfolderBase]: For 3041107/3042093 co-relation queries the response was YES. [2023-08-24 02:30:33,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 458753 conditions, 46451 events. 33026/46451 cut-off events. For 3041107/3042093 co-relation queries the response was YES. Maximal size of possible extension queue 1837. Compared 290775 event pairs, 6138 based on Foata normal form. 752/47161 useless extension candidates. Maximal degree in co-relation 458653. Up to 13165 conditions per place. [2023-08-24 02:30:33,512 INFO L140 encePairwiseOnDemand]: 292/303 looper letters, 366 selfloop transitions, 95 changer transitions 512/986 dead transitions. [2023-08-24 02:30:33,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 986 transitions, 17447 flow [2023-08-24 02:30:33,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-24 02:30:33,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-24 02:30:33,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1453 transitions. [2023-08-24 02:30:33,514 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3996149614961496 [2023-08-24 02:30:33,514 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1453 transitions. [2023-08-24 02:30:33,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1453 transitions. [2023-08-24 02:30:33,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:30:33,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1453 transitions. [2023-08-24 02:30:33,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 121.08333333333333) internal successors, (1453), 12 states have internal predecessors, (1453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:30:33,518 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 303.0) internal successors, (3939), 13 states have internal predecessors, (3939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:30:33,518 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 303.0) internal successors, (3939), 13 states have internal predecessors, (3939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:30:33,519 INFO L175 Difference]: Start difference. First operand has 189 places, 407 transitions, 5904 flow. Second operand 12 states and 1453 transitions. [2023-08-24 02:30:33,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 986 transitions, 17447 flow [2023-08-24 02:30:44,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 986 transitions, 16703 flow, removed 356 selfloop flow, removed 11 redundant places. [2023-08-24 02:30:44,880 INFO L231 Difference]: Finished difference. Result has 198 places, 351 transitions, 5472 flow [2023-08-24 02:30:44,880 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=5708, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=5472, PETRI_PLACES=198, PETRI_TRANSITIONS=351} [2023-08-24 02:30:44,881 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 158 predicate places. [2023-08-24 02:30:44,881 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 351 transitions, 5472 flow [2023-08-24 02:30:44,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 109.5) internal successors, (1314), 12 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:30:44,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:30:44,881 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 02:30:44,889 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-24 02:30:45,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:30:45,088 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 02:30:45,088 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:30:45,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1765596765, now seen corresponding path program 9 times [2023-08-24 02:30:45,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:30:45,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719669295] [2023-08-24 02:30:45,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:30:45,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:30:45,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:30:45,522 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 02:30:45,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:30:45,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719669295] [2023-08-24 02:30:45,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719669295] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 02:30:45,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588142277] [2023-08-24 02:30:45,523 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 02:30:45,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:30:45,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 02:30:45,525 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 02:30:45,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-24 02:30:45,778 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-24 02:30:45,778 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 02:30:45,780 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 30 conjunts are in the unsatisfiable core [2023-08-24 02:30:45,782 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 02:30:45,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 02:30:45,910 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 02:30:45,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 02:30:45,943 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 02:30:46,006 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-08-24 02:30:46,042 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 02:30:46,042 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 02:30:46,438 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 141 treesize of output 113 [2023-08-24 02:30:46,443 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2023-08-24 02:30:46,446 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 15 [2023-08-24 02:30:46,489 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 02:30:46,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588142277] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 02:30:46,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 02:30:46,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 11] total 27 [2023-08-24 02:30:46,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714527883] [2023-08-24 02:30:46,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 02:30:46,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-24 02:30:46,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:30:46,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-24 02:30:46,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=655, Unknown=10, NotChecked=0, Total=812 [2023-08-24 02:30:46,492 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 303 [2023-08-24 02:30:46,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 351 transitions, 5472 flow. Second operand has 29 states, 29 states have (on average 107.0) internal successors, (3103), 29 states have internal predecessors, (3103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:30:46,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:30:46,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 303 [2023-08-24 02:30:46,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:30:55,325 INFO L124 PetriNetUnfolderBase]: 30742/43621 cut-off events. [2023-08-24 02:30:55,325 INFO L125 PetriNetUnfolderBase]: For 2606268/2607137 co-relation queries the response was YES. [2023-08-24 02:30:55,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 414492 conditions, 43621 events. 30742/43621 cut-off events. For 2606268/2607137 co-relation queries the response was YES. Maximal size of possible extension queue 1801. Compared 276193 event pairs, 1995 based on Foata normal form. 739/44335 useless extension candidates. Maximal degree in co-relation 414391. Up to 11588 conditions per place. [2023-08-24 02:30:55,917 INFO L140 encePairwiseOnDemand]: 293/303 looper letters, 280 selfloop transitions, 112 changer transitions 620/1019 dead transitions. [2023-08-24 02:30:55,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 1019 transitions, 18576 flow [2023-08-24 02:30:55,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-08-24 02:30:55,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-08-24 02:30:55,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 3345 transitions. [2023-08-24 02:30:55,921 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3806759986343462 [2023-08-24 02:30:55,922 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 3345 transitions. [2023-08-24 02:30:55,922 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 3345 transitions. [2023-08-24 02:30:55,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:30:55,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 3345 transitions. [2023-08-24 02:30:55,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 115.34482758620689) internal successors, (3345), 29 states have internal predecessors, (3345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:30:55,931 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 303.0) internal successors, (9090), 30 states have internal predecessors, (9090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:30:55,932 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 303.0) internal successors, (9090), 30 states have internal predecessors, (9090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:30:55,932 INFO L175 Difference]: Start difference. First operand has 198 places, 351 transitions, 5472 flow. Second operand 29 states and 3345 transitions. [2023-08-24 02:30:55,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 1019 transitions, 18576 flow [2023-08-24 02:31:01,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 1019 transitions, 17813 flow, removed 290 selfloop flow, removed 16 redundant places. [2023-08-24 02:31:01,795 INFO L231 Difference]: Finished difference. Result has 228 places, 280 transitions, 5056 flow [2023-08-24 02:31:01,795 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=5295, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=5056, PETRI_PLACES=228, PETRI_TRANSITIONS=280} [2023-08-24 02:31:01,796 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 188 predicate places. [2023-08-24 02:31:01,796 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 280 transitions, 5056 flow [2023-08-24 02:31:01,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 107.0) internal successors, (3103), 29 states have internal predecessors, (3103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:31:01,796 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:31:01,796 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 02:31:01,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-24 02:31:01,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:31:01,997 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 02:31:01,997 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:31:01,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1315853358, now seen corresponding path program 10 times [2023-08-24 02:31:01,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:31:01,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239764083] [2023-08-24 02:31:01,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:31:01,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:31:02,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:31:02,118 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 02:31:02,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:31:02,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239764083] [2023-08-24 02:31:02,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239764083] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 02:31:02,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113635644] [2023-08-24 02:31:02,119 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-24 02:31:02,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:31:02,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 02:31:02,120 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 02:31:02,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-24 02:31:02,259 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-24 02:31:02,259 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 02:31:02,261 INFO L262 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-24 02:31:02,264 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 02:31:02,320 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 02:31:02,320 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 02:31:02,373 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 02:31:02,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113635644] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 02:31:02,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 02:31:02,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 15 [2023-08-24 02:31:02,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000387983] [2023-08-24 02:31:02,374 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 02:31:02,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-24 02:31:02,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:31:02,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-24 02:31:02,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2023-08-24 02:31:02,375 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 303 [2023-08-24 02:31:02,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 280 transitions, 5056 flow. Second operand has 15 states, 15 states have (on average 117.6) internal successors, (1764), 15 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:31:02,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:31:02,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 303 [2023-08-24 02:31:02,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:31:11,352 INFO L124 PetriNetUnfolderBase]: 30008/42332 cut-off events. [2023-08-24 02:31:11,353 INFO L125 PetriNetUnfolderBase]: For 3418209/3418209 co-relation queries the response was YES. [2023-08-24 02:31:11,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 456437 conditions, 42332 events. 30008/42332 cut-off events. For 3418209/3418209 co-relation queries the response was YES. Maximal size of possible extension queue 1698. Compared 261747 event pairs, 7452 based on Foata normal form. 929/43259 useless extension candidates. Maximal degree in co-relation 455995. Up to 17685 conditions per place. [2023-08-24 02:31:12,053 INFO L140 encePairwiseOnDemand]: 294/303 looper letters, 636 selfloop transitions, 170 changer transitions 221/1027 dead transitions. [2023-08-24 02:31:12,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 1027 transitions, 20841 flow [2023-08-24 02:31:12,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-08-24 02:31:12,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2023-08-24 02:31:12,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 3948 transitions. [2023-08-24 02:31:12,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40717821782178215 [2023-08-24 02:31:12,058 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 3948 transitions. [2023-08-24 02:31:12,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 3948 transitions. [2023-08-24 02:31:12,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:31:12,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 3948 transitions. [2023-08-24 02:31:12,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 123.375) internal successors, (3948), 32 states have internal predecessors, (3948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:31:12,281 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 303.0) internal successors, (9999), 33 states have internal predecessors, (9999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:31:12,282 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 303.0) internal successors, (9999), 33 states have internal predecessors, (9999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:31:12,282 INFO L175 Difference]: Start difference. First operand has 228 places, 280 transitions, 5056 flow. Second operand 32 states and 3948 transitions. [2023-08-24 02:31:12,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 1027 transitions, 20841 flow [2023-08-24 02:31:18,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 1027 transitions, 18218 flow, removed 1080 selfloop flow, removed 34 redundant places. [2023-08-24 02:31:18,486 INFO L231 Difference]: Finished difference. Result has 214 places, 371 transitions, 6617 flow [2023-08-24 02:31:18,486 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=4418, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=6617, PETRI_PLACES=214, PETRI_TRANSITIONS=371} [2023-08-24 02:31:18,486 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 174 predicate places. [2023-08-24 02:31:18,487 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 371 transitions, 6617 flow [2023-08-24 02:31:18,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 117.6) internal successors, (1764), 15 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:31:18,487 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:31:18,487 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 02:31:18,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-24 02:31:18,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-08-24 02:31:18,688 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 02:31:18,688 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:31:18,688 INFO L85 PathProgramCache]: Analyzing trace with hash -248644329, now seen corresponding path program 11 times [2023-08-24 02:31:18,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:31:18,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718796998] [2023-08-24 02:31:18,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:31:18,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:31:18,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:31:18,816 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-24 02:31:18,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:31:18,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718796998] [2023-08-24 02:31:18,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718796998] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 02:31:18,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20045942] [2023-08-24 02:31:18,817 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-24 02:31:18,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:31:18,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 02:31:18,821 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 02:31:18,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-24 02:31:18,964 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 02:31:18,964 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 02:31:18,966 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-24 02:31:18,967 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 02:31:19,035 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-24 02:31:19,035 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 02:31:19,094 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-24 02:31:19,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20045942] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 02:31:19,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 02:31:19,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2023-08-24 02:31:19,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266469546] [2023-08-24 02:31:19,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 02:31:19,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-24 02:31:19,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:31:19,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-24 02:31:19,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-08-24 02:31:19,097 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 303 [2023-08-24 02:31:19,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 371 transitions, 6617 flow. Second operand has 16 states, 16 states have (on average 117.5) internal successors, (1880), 16 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:31:19,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:31:19,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 303 [2023-08-24 02:31:19,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:31:25,455 INFO L124 PetriNetUnfolderBase]: 22989/31915 cut-off events. [2023-08-24 02:31:25,455 INFO L125 PetriNetUnfolderBase]: For 1613565/1613565 co-relation queries the response was YES. [2023-08-24 02:31:25,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334412 conditions, 31915 events. 22989/31915 cut-off events. For 1613565/1613565 co-relation queries the response was YES. Maximal size of possible extension queue 1339. Compared 183615 event pairs, 7131 based on Foata normal form. 1535/33449 useless extension candidates. Maximal degree in co-relation 334300. Up to 20390 conditions per place. [2023-08-24 02:31:25,903 INFO L140 encePairwiseOnDemand]: 295/303 looper letters, 434 selfloop transitions, 112 changer transitions 0/546 dead transitions. [2023-08-24 02:31:25,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 546 transitions, 11435 flow [2023-08-24 02:31:25,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-24 02:31:25,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-24 02:31:25,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1229 transitions. [2023-08-24 02:31:25,905 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4056105610561056 [2023-08-24 02:31:25,905 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1229 transitions. [2023-08-24 02:31:25,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1229 transitions. [2023-08-24 02:31:25,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:31:25,905 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1229 transitions. [2023-08-24 02:31:25,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 122.9) internal successors, (1229), 10 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-24 02:31:25,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 303.0) internal successors, (3333), 11 states have internal predecessors, (3333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:31:25,908 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 303.0) internal successors, (3333), 11 states have internal predecessors, (3333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:31:25,908 INFO L175 Difference]: Start difference. First operand has 214 places, 371 transitions, 6617 flow. Second operand 10 states and 1229 transitions. [2023-08-24 02:31:25,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 546 transitions, 11435 flow [2023-08-24 02:31:30,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 546 transitions, 10386 flow, removed 485 selfloop flow, removed 18 redundant places. [2023-08-24 02:31:30,052 INFO L231 Difference]: Finished difference. Result has 192 places, 365 transitions, 6016 flow [2023-08-24 02:31:30,052 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=5792, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6016, PETRI_PLACES=192, PETRI_TRANSITIONS=365} [2023-08-24 02:31:30,052 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 152 predicate places. [2023-08-24 02:31:30,053 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 365 transitions, 6016 flow [2023-08-24 02:31:30,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 117.5) internal successors, (1880), 16 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:31:30,053 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:31:30,053 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 02:31:30,058 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-08-24 02:31:30,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-24 02:31:30,254 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 02:31:30,254 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:31:30,254 INFO L85 PathProgramCache]: Analyzing trace with hash 909702135, now seen corresponding path program 12 times [2023-08-24 02:31:30,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:31:30,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458230859] [2023-08-24 02:31:30,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:31:30,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:31:30,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:31:30,409 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 02:31:30,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:31:30,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458230859] [2023-08-24 02:31:30,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458230859] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 02:31:30,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876209911] [2023-08-24 02:31:30,410 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-24 02:31:30,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:31:30,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 02:31:30,413 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 02:31:30,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-24 02:31:30,782 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-08-24 02:31:30,782 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 02:31:30,783 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-24 02:31:30,784 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 02:31:30,849 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 02:31:30,849 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 02:31:30,914 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 02:31:30,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876209911] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 02:31:30,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 02:31:30,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2023-08-24 02:31:30,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089086019] [2023-08-24 02:31:30,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 02:31:30,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-24 02:31:30,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:31:30,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-24 02:31:30,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2023-08-24 02:31:30,916 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 303 [2023-08-24 02:31:30,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 365 transitions, 6016 flow. Second operand has 15 states, 15 states have (on average 120.86666666666666) internal successors, (1813), 15 states have internal predecessors, (1813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:31:30,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:31:30,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 303 [2023-08-24 02:31:30,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:31:35,973 INFO L124 PetriNetUnfolderBase]: 22729/31398 cut-off events. [2023-08-24 02:31:35,973 INFO L125 PetriNetUnfolderBase]: For 1150721/1150911 co-relation queries the response was YES. [2023-08-24 02:31:36,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310857 conditions, 31398 events. 22729/31398 cut-off events. For 1150721/1150911 co-relation queries the response was YES. Maximal size of possible extension queue 1281. Compared 178600 event pairs, 5139 based on Foata normal form. 2423/33801 useless extension candidates. Maximal degree in co-relation 310759. Up to 18255 conditions per place. [2023-08-24 02:31:36,617 INFO L140 encePairwiseOnDemand]: 297/303 looper letters, 452 selfloop transitions, 48 changer transitions 9/520 dead transitions. [2023-08-24 02:31:36,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 520 transitions, 9847 flow [2023-08-24 02:31:36,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 02:31:36,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 02:31:36,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1001 transitions. [2023-08-24 02:31:36,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41295379537953797 [2023-08-24 02:31:36,619 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1001 transitions. [2023-08-24 02:31:36,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1001 transitions. [2023-08-24 02:31:36,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:31:36,619 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1001 transitions. [2023-08-24 02:31:36,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 125.125) internal successors, (1001), 8 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:31:36,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 303.0) internal successors, (2727), 9 states have internal predecessors, (2727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:31:36,621 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 303.0) internal successors, (2727), 9 states have internal predecessors, (2727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:31:36,622 INFO L175 Difference]: Start difference. First operand has 192 places, 365 transitions, 6016 flow. Second operand 8 states and 1001 transitions. [2023-08-24 02:31:36,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 520 transitions, 9847 flow [2023-08-24 02:31:38,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 520 transitions, 9505 flow, removed 6 selfloop flow, removed 8 redundant places. [2023-08-24 02:31:38,528 INFO L231 Difference]: Finished difference. Result has 192 places, 366 transitions, 5944 flow [2023-08-24 02:31:38,529 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=5782, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5944, PETRI_PLACES=192, PETRI_TRANSITIONS=366} [2023-08-24 02:31:38,530 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 152 predicate places. [2023-08-24 02:31:38,530 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 366 transitions, 5944 flow [2023-08-24 02:31:38,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 120.86666666666666) internal successors, (1813), 15 states have internal predecessors, (1813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:31:38,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:31:38,530 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 02:31:38,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-24 02:31:38,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-24 02:31:38,736 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 02:31:38,736 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:31:38,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1021362029, now seen corresponding path program 13 times [2023-08-24 02:31:38,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:31:38,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431448565] [2023-08-24 02:31:38,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:31:38,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:31:38,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:31:39,434 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 02:31:39,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:31:39,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431448565] [2023-08-24 02:31:39,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431448565] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 02:31:39,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846355404] [2023-08-24 02:31:39,434 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-24 02:31:39,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:31:39,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 02:31:39,435 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 02:31:39,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-24 02:31:39,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:31:39,568 INFO L262 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 32 conjunts are in the unsatisfiable core [2023-08-24 02:31:39,570 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 02:31:39,807 INFO L322 Elim1Store]: treesize reduction 14, result has 61.1 percent of original size [2023-08-24 02:31:39,808 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 40 [2023-08-24 02:31:39,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 02:31:39,842 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-08-24 02:31:39,871 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-08-24 02:31:39,897 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 02:31:39,897 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 02:31:58,762 WARN L234 SmtUtils]: Spent 16.11s on a formula simplification. DAG size of input: 71 DAG size of output: 60 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 02:31:58,798 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 1 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 02:31:58,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846355404] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 02:31:58,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 02:31:58,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 9] total 32 [2023-08-24 02:31:58,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185878186] [2023-08-24 02:31:58,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 02:31:58,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-24 02:31:58,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:31:58,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-24 02:31:58,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=904, Unknown=1, NotChecked=0, Total=1056 [2023-08-24 02:31:58,802 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 303 [2023-08-24 02:31:58,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 366 transitions, 5944 flow. Second operand has 33 states, 33 states have (on average 94.03030303030303) internal successors, (3103), 33 states have internal predecessors, (3103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:31:58,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:31:58,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 303 [2023-08-24 02:31:58,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:32:07,183 WARN L234 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 68 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 02:32:09,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:32:11,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:32:13,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:32:21,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:32:23,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:32:25,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:32:33,964 WARN L234 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 74 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 02:32:36,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:32:38,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:32:48,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:32:50,298 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 [1] [2023-08-24 02:32:52,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:32:54,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:32:56,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:32:59,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:33:01,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:33:03,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:33:04,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:33:09,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:33:17,462 WARN L234 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 71 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 02:33:19,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:33:21,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:33:26,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:33:28,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:33:30,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:33:32,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:33:40,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:33:41,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:33:43,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:33:46,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:33:48,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:33:51,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:33:53,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:33:55,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:33:57,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:33:59,283 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 [1] [2023-08-24 02:34:01,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:34:03,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:34:05,310 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 [1] [2023-08-24 02:34:07,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:34:09,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:34:11,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:34:13,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:34:15,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:34:17,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:34:19,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:34:21,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:34:23,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:34:25,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:34:27,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:34:35,848 WARN L234 SmtUtils]: Spent 8.12s on a formula simplification that was a NOOP. DAG size: 73 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 02:34:37,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:34:39,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:34:41,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:34:43,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:34:45,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:34:47,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:34:50,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:34:52,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:35:03,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:35:05,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:35:07,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:35:09,221 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 [0, 1] [2023-08-24 02:35:11,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:35:13,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:35:15,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:35:17,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:35:19,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:35:21,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:35:23,896 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:35:26,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:35:28,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:35:31,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:35:33,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:35:35,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:35:37,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:35:39,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:35:42,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:35:44,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:35:46,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:35:48,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:35:50,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:35:52,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:35:54,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:35:56,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:35:58,262 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:36:07,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:36:09,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:36:14,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:36:16,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:36:21,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:36:33,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:36:34,893 INFO L124 PetriNetUnfolderBase]: 85081/116864 cut-off events. [2023-08-24 02:36:34,893 INFO L125 PetriNetUnfolderBase]: For 4391507/4391507 co-relation queries the response was YES. [2023-08-24 02:36:36,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1184074 conditions, 116864 events. 85081/116864 cut-off events. For 4391507/4391507 co-relation queries the response was YES. Maximal size of possible extension queue 4383. Compared 778835 event pairs, 11616 based on Foata normal form. 48/116912 useless extension candidates. Maximal degree in co-relation 1183974. Up to 40208 conditions per place. [2023-08-24 02:36:36,632 INFO L140 encePairwiseOnDemand]: 288/303 looper letters, 658 selfloop transitions, 560 changer transitions 1672/2890 dead transitions. [2023-08-24 02:36:36,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 2890 transitions, 56060 flow [2023-08-24 02:36:36,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2023-08-24 02:36:36,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2023-08-24 02:36:36,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 8907 transitions. [2023-08-24 02:36:36,640 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3378855126892 [2023-08-24 02:36:36,640 INFO L72 ComplementDD]: Start complementDD. Operand 87 states and 8907 transitions. [2023-08-24 02:36:36,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 8907 transitions. [2023-08-24 02:36:36,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 02:36:36,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 87 states and 8907 transitions. [2023-08-24 02:36:36,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 88 states, 87 states have (on average 102.37931034482759) internal successors, (8907), 87 states have internal predecessors, (8907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:36:36,668 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 88 states, 88 states have (on average 303.0) internal successors, (26664), 88 states have internal predecessors, (26664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:36:36,670 INFO L81 ComplementDD]: Finished complementDD. Result has 88 states, 88 states have (on average 303.0) internal successors, (26664), 88 states have internal predecessors, (26664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:36:36,670 INFO L175 Difference]: Start difference. First operand has 192 places, 366 transitions, 5944 flow. Second operand 87 states and 8907 transitions. [2023-08-24 02:36:36,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 2890 transitions, 56060 flow [2023-08-24 02:36:54,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 2890 transitions, 54920 flow, removed 213 selfloop flow, removed 6 redundant places. [2023-08-24 02:36:54,516 INFO L231 Difference]: Finished difference. Result has 341 places, 815 transitions, 15962 flow [2023-08-24 02:36:54,516 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=5864, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=191, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=87, PETRI_FLOW=15962, PETRI_PLACES=341, PETRI_TRANSITIONS=815} [2023-08-24 02:36:54,517 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 301 predicate places. [2023-08-24 02:36:54,517 INFO L495 AbstractCegarLoop]: Abstraction has has 341 places, 815 transitions, 15962 flow [2023-08-24 02:36:54,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 94.03030303030303) internal successors, (3103), 33 states have internal predecessors, (3103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:36:54,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 02:36:54,518 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 02:36:54,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-24 02:36:54,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-24 02:36:54,724 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 02:36:54,724 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 02:36:54,724 INFO L85 PathProgramCache]: Analyzing trace with hash 418727089, now seen corresponding path program 14 times [2023-08-24 02:36:54,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 02:36:54,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262782383] [2023-08-24 02:36:54,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 02:36:54,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 02:36:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 02:36:55,792 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-24 02:36:55,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 02:36:55,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262782383] [2023-08-24 02:36:55,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262782383] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 02:36:55,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474668677] [2023-08-24 02:36:55,793 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 02:36:55,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 02:36:55,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 02:36:55,794 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 02:36:55,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-24 02:36:55,960 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 02:36:55,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 02:36:55,962 INFO L262 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 47 conjunts are in the unsatisfiable core [2023-08-24 02:36:55,965 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 02:36:56,296 INFO L322 Elim1Store]: treesize reduction 14, result has 61.1 percent of original size [2023-08-24 02:36:56,297 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 40 [2023-08-24 02:36:56,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 02:36:56,338 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-24 02:36:56,389 INFO L322 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-08-24 02:36:56,389 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2023-08-24 02:36:56,548 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:36:56,548 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 45 [2023-08-24 02:36:56,611 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 02:36:56,611 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 02:36:59,332 WARN L839 $PredicateComparison]: unable to prove that (or (forall ((|thread3Thread1of1ForFork1_~i~2#1| Int) (v_ArrVal_1017 (Array Int Int)) (v_subst_3 Int) (v_ArrVal_1018 Int)) (let ((.cse1 (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1017) c_~A~0.base) (+ c_~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)) v_ArrVal_1018))) (let ((.cse0 (select .cse1 (+ c_~A~0.offset (* 4 v_subst_3))))) (or (<= c_~min~0 (+ 1 .cse0)) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) c_~N~0) (<= 2147483647 .cse0) (< .cse0 (select .cse1 c_~A~0.offset)))))) (= (mod c_~b1~0 256) 0)) is different from false [2023-08-24 02:36:59,355 WARN L839 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1016 Int) (v_subst_3 Int) (v_ArrVal_1018 Int) (|v_thread3Thread1of1ForFork1_~i~2#1_77| Int)) (let ((.cse2 (select |c_#memory_int| c_~A~0.base)) (.cse3 (+ c_~A~0.offset (* |c_thread3Thread1of1ForFork1_~i~2#1| 4)))) (let ((.cse1 (store (select (store (store |c_#memory_int| c_~A~0.base (store .cse2 .cse3 v_ArrVal_1016)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1017) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork1_~i~2#1_77| 4)) v_ArrVal_1018))) (let ((.cse0 (select .cse1 (+ c_~A~0.offset (* 4 v_subst_3))))) (or (<= 2147483647 .cse0) (<= c_~min~0 (+ .cse0 1)) (< .cse0 (select .cse1 c_~A~0.offset)) (< (+ |v_thread3Thread1of1ForFork1_~i~2#1_77| 1) c_~N~0) (< (+ v_ArrVal_1016 1) (select .cse2 .cse3))))))) (= (mod c_~b1~0 256) 0)) is different from false [2023-08-24 02:36:59,378 WARN L839 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1017 (Array Int Int)) (v_ArrVal_1016 Int) (v_subst_3 Int) (v_ArrVal_1018 Int) (|v_thread3Thread1of1ForFork1_~i~2#1_77| Int)) (let ((.cse1 (select |c_#memory_int| c_~A~0.base))) (let ((.cse2 (store (select (store (store |c_#memory_int| c_~A~0.base (store .cse1 c_~A~0.offset v_ArrVal_1016)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1017) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork1_~i~2#1_77| 4)) v_ArrVal_1018))) (let ((.cse0 (select .cse2 (+ c_~A~0.offset (* 4 v_subst_3))))) (or (< (+ |v_thread3Thread1of1ForFork1_~i~2#1_77| 1) c_~N~0) (<= c_~min~0 (+ .cse0 1)) (<= 2147483647 .cse0) (< (+ v_ArrVal_1016 1) (select .cse1 c_~A~0.offset)) (< .cse0 (select .cse2 c_~A~0.offset))))))) (= (mod c_~b1~0 256) 0)) is different from false [2023-08-24 02:37:27,415 WARN L234 SmtUtils]: Spent 20.56s on a formula simplification. DAG size of input: 88 DAG size of output: 86 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 02:37:36,211 WARN L234 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 82 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 02:37:36,255 INFO L322 Elim1Store]: treesize reduction 16, result has 68.0 percent of original size [2023-08-24 02:37:36,255 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 144 treesize of output 121 [2023-08-24 02:37:36,261 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 168 [2023-08-24 02:37:36,285 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:37:36,285 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 90 [2023-08-24 02:37:36,314 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 02:37:36,314 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 135 treesize of output 123 [2023-08-24 02:37:36,575 INFO L322 Elim1Store]: treesize reduction 49, result has 2.0 percent of original size [2023-08-24 02:37:36,575 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 140 treesize of output 1 [2023-08-24 02:37:38,774 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 4 not checked. [2023-08-24 02:37:38,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474668677] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 02:37:38,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 02:37:38,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18, 18] total 47 [2023-08-24 02:37:38,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617890088] [2023-08-24 02:37:38,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 02:37:38,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-08-24 02:37:38,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 02:37:38,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-08-24 02:37:38,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=1770, Unknown=15, NotChecked=270, Total=2352 [2023-08-24 02:37:38,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 303 [2023-08-24 02:37:38,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 815 transitions, 15962 flow. Second operand has 49 states, 49 states have (on average 85.12244897959184) internal successors, (4171), 49 states have internal predecessors, (4171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 02:37:38,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 02:37:38,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 303 [2023-08-24 02:37:38,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 02:39:15,989 WARN L234 SmtUtils]: Spent 1.58m on a formula simplification. DAG size of input: 122 DAG size of output: 119 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 02:39:18,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:39:20,074 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 [1] [2023-08-24 02:39:22,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:39:46,744 WARN L234 SmtUtils]: Spent 21.99s on a formula simplification. DAG size of input: 97 DAG size of output: 88 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 02:39:50,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:39:52,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:39:54,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:39:56,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:39:58,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:40:09,026 WARN L234 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 02:40:13,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:40:15,923 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 [1] [2023-08-24 02:40:17,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:40:19,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:40:21,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:40:23,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 [1] [2023-08-24 02:40:25,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:40:27,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:40:49,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:40:51,861 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 [1] [2023-08-24 02:40:58,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:41:00,216 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 [1] [2023-08-24 02:41:02,224 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 [1] [2023-08-24 02:41:04,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 02:41:22,855 WARN L234 SmtUtils]: Spent 6.18s on a formula simplification. DAG size of input: 88 DAG size of output: 54 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-08-24 02:41:30,812 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-24 02:41:30,812 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-24 02:41:31,822 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-24 02:41:32,013 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-08-24 02:41:32,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2023-08-24 02:41:32,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-08-24 02:41:32,104 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-08-24 02:41:32,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-24 02:41:32,104 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2023-08-24 02:41:32,105 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2023-08-24 02:41:32,105 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-08-24 02:41:32,105 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-08-24 02:41:32,105 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2023-08-24 02:41:32,106 INFO L445 BasicCegarLoop]: Path program histogram: [14, 1, 1, 1, 1] [2023-08-24 02:41:32,108 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 02:41:32,108 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 02:41:32,110 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 02:41:32 BasicIcfg [2023-08-24 02:41:32,110 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 02:41:32,111 INFO L158 Benchmark]: Toolchain (without parser) took 818541.26ms. Allocated memory was 373.3MB in the beginning and 14.9GB in the end (delta: 14.6GB). Free memory was 349.3MB in the beginning and 11.5GB in the end (delta: -11.2GB). Peak memory consumption was 3.4GB. Max. memory is 16.0GB. [2023-08-24 02:41:32,111 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 373.3MB. Free memory is still 350.3MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 02:41:32,111 INFO L158 Benchmark]: CACSL2BoogieTranslator took 302.36ms. Allocated memory is still 373.3MB. Free memory was 349.3MB in the beginning and 337.0MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-08-24 02:41:32,111 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.65ms. Allocated memory is still 373.3MB. Free memory was 337.0MB in the beginning and 334.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 02:41:32,111 INFO L158 Benchmark]: Boogie Preprocessor took 35.91ms. Allocated memory is still 373.3MB. Free memory was 334.9MB in the beginning and 333.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 02:41:32,112 INFO L158 Benchmark]: RCFGBuilder took 614.01ms. Allocated memory is still 373.3MB. Free memory was 333.3MB in the beginning and 308.8MB in the end (delta: 24.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-24 02:41:32,112 INFO L158 Benchmark]: TraceAbstraction took 817525.93ms. Allocated memory was 373.3MB in the beginning and 14.9GB in the end (delta: 14.6GB). Free memory was 308.2MB in the beginning and 11.5GB in the end (delta: -11.2GB). Peak memory consumption was 3.3GB. Max. memory is 16.0GB. [2023-08-24 02:41:32,113 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 373.3MB. Free memory is still 350.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 302.36ms. Allocated memory is still 373.3MB. Free memory was 349.3MB in the beginning and 337.0MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 56.65ms. Allocated memory is still 373.3MB. Free memory was 337.0MB in the beginning and 334.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 35.91ms. Allocated memory is still 373.3MB. Free memory was 334.9MB in the beginning and 333.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 614.01ms. Allocated memory is still 373.3MB. Free memory was 333.3MB in the beginning and 308.8MB in the end (delta: 24.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * TraceAbstraction took 817525.93ms. Allocated memory was 373.3MB in the beginning and 14.9GB in the end (delta: 14.6GB). Free memory was 308.2MB in the beginning and 11.5GB in the end (delta: -11.2GB). Peak memory consumption was 3.3GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.8s, 151 PlacesBefore, 40 PlacesAfterwards, 150 TransitionsBefore, 31 TransitionsAfterwards, 2548 CoEnabledTransitionPairs, 7 FixpointIterations, 68 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 16 TrivialYvCompositions, 6 ConcurrentYvCompositions, 8 ChoiceCompositions, 137 TotalNumberOfCompositions, 3658 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2741, independent: 2655, independent conditional: 0, independent unconditional: 2655, dependent: 86, dependent conditional: 0, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1361, independent: 1329, independent conditional: 0, independent unconditional: 1329, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2741, independent: 1326, independent conditional: 0, independent unconditional: 1326, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 1361, unknown conditional: 0, unknown unconditional: 1361] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 98, Positive conditional cache size: 0, Positive unconditional cache size: 98, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 120]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 111]: 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: 113]: 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: 110]: 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: 112]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 197 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 817.4s, OverallIterations: 18, TraceHistogramMax: 2, PathProgramHistogramMax: 14, EmptinessCheckTime: 0.0s, AutomataDifference: 719.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.9s, HoareTripleCheckerStatistics: 111 mSolverCounterUnknown, 5382 SdHoareTripleChecker+Valid, 237.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5382 mSDsluCounter, 321 SdHoareTripleChecker+Invalid, 235.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 2263 IncrementalHoareTripleChecker+Unchecked, 281 mSDsCounter, 463 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14830 IncrementalHoareTripleChecker+Invalid, 17667 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 463 mSolverCounterUnsat, 40 mSDtfsCounter, 14830 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1363 GetRequests, 632 SyntacticMatches, 23 SemanticMatches, 707 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 16768 ImplicationChecksByTransitivity, 337.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15962occurred in iteration=17, InterpolantAutomatonStates: 453, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 86.2s InterpolantComputationTime, 948 NumberOfCodeBlocks, 948 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 1292 ConstructedInterpolants, 74 QuantifiedInterpolants, 14205 SizeOfPredicates, 173 NumberOfNonLiveVariables, 3596 ConjunctsInSsa, 343 ConjunctsInUnsatCore, 42 InterpolantComputations, 8 PerfectInterpolantSequences, 149/242 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