/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 09:24:01,836 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 09:24:01,926 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 09:24:01,930 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 09:24:01,930 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 09:24:01,966 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 09:24:01,967 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 09:24:01,972 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 09:24:01,973 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 09:24:01,976 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 09:24:01,976 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 09:24:01,977 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 09:24:01,977 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 09:24:01,978 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 09:24:01,978 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 09:24:01,978 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 09:24:01,978 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 09:24:01,979 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 09:24:01,979 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 09:24:01,979 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 09:24:01,979 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 09:24:01,980 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 09:24:01,980 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 09:24:01,981 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 09:24:01,981 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 09:24:01,981 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 09:24:01,981 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 09:24:01,982 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 09:24:01,982 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 09:24:01,982 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 09:24:01,983 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 09:24:01,983 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 09:24:01,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 09:24:01,983 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 09:24:01,983 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 09:24:01,984 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST [2023-08-24 09:24:02,287 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 09:24:02,304 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 09:24:02,305 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 09:24:02,306 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 09:24:02,308 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 09:24:02,309 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c [2023-08-24 09:24:03,409 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 09:24:03,627 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 09:24:03,627 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array-hom.wvr.c [2023-08-24 09:24:03,637 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd9814798/3ac9589a87654e7d969884c909c4d72b/FLAG6e9650b5f [2023-08-24 09:24:03,653 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd9814798/3ac9589a87654e7d969884c909c4d72b [2023-08-24 09:24:03,658 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 09:24:03,659 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 09:24:03,662 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 09:24:03,662 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 09:24:03,665 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 09:24:03,666 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 09:24:03" (1/1) ... [2023-08-24 09:24:03,667 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ae5c661 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:24:03, skipping insertion in model container [2023-08-24 09:24:03,667 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 09:24:03" (1/1) ... [2023-08-24 09:24:03,691 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 09:24:03,874 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-more-max-array-hom.wvr.c[2586,2599] [2023-08-24 09:24:03,884 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 09:24:03,893 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 09:24:03,928 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-more-max-array-hom.wvr.c[2586,2599] [2023-08-24 09:24:03,930 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 09:24:03,939 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 09:24:03,940 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 09:24:03,946 INFO L206 MainTranslator]: Completed translation [2023-08-24 09:24:03,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:24:03 WrapperNode [2023-08-24 09:24:03,947 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 09:24:03,948 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 09:24:03,948 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 09:24:03,948 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 09:24:03,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:24:03" (1/1) ... [2023-08-24 09:24:03,971 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:24:03" (1/1) ... [2023-08-24 09:24:03,999 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 106 [2023-08-24 09:24:04,000 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 09:24:04,001 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 09:24:04,001 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 09:24:04,001 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 09:24:04,008 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:24:03" (1/1) ... [2023-08-24 09:24:04,008 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:24:03" (1/1) ... [2023-08-24 09:24:04,023 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:24:03" (1/1) ... [2023-08-24 09:24:04,023 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:24:03" (1/1) ... [2023-08-24 09:24:04,028 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:24:03" (1/1) ... [2023-08-24 09:24:04,031 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:24:03" (1/1) ... [2023-08-24 09:24:04,032 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:24:03" (1/1) ... [2023-08-24 09:24:04,033 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:24:03" (1/1) ... [2023-08-24 09:24:04,035 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 09:24:04,036 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 09:24:04,036 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 09:24:04,036 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 09:24:04,046 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:24:03" (1/1) ... [2023-08-24 09:24:04,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 09:24:04,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:24:04,074 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 09:24:04,099 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 09:24:04,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 09:24:04,116 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-24 09:24:04,116 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-24 09:24:04,117 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-24 09:24:04,117 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-24 09:24:04,117 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-24 09:24:04,117 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-24 09:24:04,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 09:24:04,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 09:24:04,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 09:24:04,117 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 09:24:04,117 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 09:24:04,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-24 09:24:04,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 09:24:04,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 09:24:04,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-24 09:24:04,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 09:24:04,121 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 09:24:04,236 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 09:24:04,237 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 09:24:04,455 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 09:24:04,524 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 09:24:04,524 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-24 09:24:04,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 09:24:04 BoogieIcfgContainer [2023-08-24 09:24:04,527 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 09:24:04,530 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 09:24:04,530 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 09:24:04,533 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 09:24:04,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 09:24:03" (1/3) ... [2023-08-24 09:24:04,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@232b6e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 09:24:04, skipping insertion in model container [2023-08-24 09:24:04,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 09:24:03" (2/3) ... [2023-08-24 09:24:04,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@232b6e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 09:24:04, skipping insertion in model container [2023-08-24 09:24:04,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 09:24:04" (3/3) ... [2023-08-24 09:24:04,536 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array-hom.wvr.c [2023-08-24 09:24:04,547 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 09:24:04,548 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-24 09:24:04,548 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 09:24:04,607 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-24 09:24:04,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 149 transitions, 322 flow [2023-08-24 09:24:04,703 INFO L124 PetriNetUnfolderBase]: 12/146 cut-off events. [2023-08-24 09:24:04,704 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-24 09:24:04,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 12/146 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 100 event pairs, 0 based on Foata normal form. 0/133 useless extension candidates. Maximal degree in co-relation 109. Up to 2 conditions per place. [2023-08-24 09:24:04,712 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 149 transitions, 322 flow [2023-08-24 09:24:04,720 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 136 transitions, 290 flow [2023-08-24 09:24:04,723 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 09:24:04,730 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 136 transitions, 290 flow [2023-08-24 09:24:04,732 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 136 transitions, 290 flow [2023-08-24 09:24:04,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 136 transitions, 290 flow [2023-08-24 09:24:04,767 INFO L124 PetriNetUnfolderBase]: 12/136 cut-off events. [2023-08-24 09:24:04,767 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-24 09:24:04,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 136 events. 12/136 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 101 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 109. Up to 2 conditions per place. [2023-08-24 09:24:04,770 INFO L119 LiptonReduction]: Number of co-enabled transitions 1518 [2023-08-24 09:24:09,419 INFO L134 LiptonReduction]: Checked pairs total: 1571 [2023-08-24 09:24:09,419 INFO L136 LiptonReduction]: Total number of compositions: 127 [2023-08-24 09:24:09,441 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 09:24:09,447 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;@7195c1d7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 09:24:09,448 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-24 09:24:09,457 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 09:24:09,457 INFO L124 PetriNetUnfolderBase]: 4/23 cut-off events. [2023-08-24 09:24:09,457 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-24 09:24:09,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:24:09,458 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] [2023-08-24 09:24:09,459 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 1 more)] === [2023-08-24 09:24:09,465 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:24:09,465 INFO L85 PathProgramCache]: Analyzing trace with hash -87050362, now seen corresponding path program 1 times [2023-08-24 09:24:09,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:24:09,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353729731] [2023-08-24 09:24:09,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:24:09,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:24:09,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:24:10,014 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 09:24:10,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:24:10,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353729731] [2023-08-24 09:24:10,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353729731] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 09:24:10,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 09:24:10,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 09:24:10,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637224255] [2023-08-24 09:24:10,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 09:24:10,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 09:24:10,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:24:10,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 09:24:10,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 09:24:10,047 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 276 [2023-08-24 09:24:10,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 66 flow. Second operand has 3 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 09:24:10,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:24:10,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 276 [2023-08-24 09:24:10,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:24:10,150 INFO L124 PetriNetUnfolderBase]: 360/508 cut-off events. [2023-08-24 09:24:10,151 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2023-08-24 09:24:10,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1068 conditions, 508 events. 360/508 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1606 event pairs, 39 based on Foata normal form. 1/307 useless extension candidates. Maximal degree in co-relation 803. Up to 421 conditions per place. [2023-08-24 09:24:10,156 INFO L140 encePairwiseOnDemand]: 271/276 looper letters, 32 selfloop transitions, 4 changer transitions 1/40 dead transitions. [2023-08-24 09:24:10,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 40 transitions, 187 flow [2023-08-24 09:24:10,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 09:24:10,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 09:24:10,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2023-08-24 09:24:10,169 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5060386473429952 [2023-08-24 09:24:10,169 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 419 transitions. [2023-08-24 09:24:10,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 419 transitions. [2023-08-24 09:24:10,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:24:10,173 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 419 transitions. [2023-08-24 09:24:10,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states 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 09:24:10,180 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states 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 09:24:10,181 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states 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 09:24:10,183 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 66 flow. Second operand 3 states and 419 transitions. [2023-08-24 09:24:10,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 40 transitions, 187 flow [2023-08-24 09:24:10,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 40 transitions, 165 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-24 09:24:10,187 INFO L231 Difference]: Finished difference. Result has 27 places, 27 transitions, 80 flow [2023-08-24 09:24:10,189 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=27, PETRI_TRANSITIONS=27} [2023-08-24 09:24:10,192 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2023-08-24 09:24:10,192 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 27 transitions, 80 flow [2023-08-24 09:24:10,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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 09:24:10,192 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:24:10,193 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:24:10,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 09:24:10,193 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 1 more)] === [2023-08-24 09:24:10,193 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:24:10,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1730344383, now seen corresponding path program 1 times [2023-08-24 09:24:10,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:24:10,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337010936] [2023-08-24 09:24:10,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:24:10,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:24:10,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:24:10,298 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 09:24:10,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:24:10,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337010936] [2023-08-24 09:24:10,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337010936] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 09:24:10,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 09:24:10,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 09:24:10,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648455676] [2023-08-24 09:24:10,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 09:24:10,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 09:24:10,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:24:10,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 09:24:10,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 09:24:10,302 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 276 [2023-08-24 09:24:10,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 27 transitions, 80 flow. Second operand has 5 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 0 states have call successors, (0), 0 states 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 09:24:10,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:24:10,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 276 [2023-08-24 09:24:10,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:24:10,438 INFO L124 PetriNetUnfolderBase]: 336/500 cut-off events. [2023-08-24 09:24:10,438 INFO L125 PetriNetUnfolderBase]: For 146/149 co-relation queries the response was YES. [2023-08-24 09:24:10,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1234 conditions, 500 events. 336/500 cut-off events. For 146/149 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 1753 event pairs, 170 based on Foata normal form. 0/468 useless extension candidates. Maximal degree in co-relation 248. Up to 484 conditions per place. [2023-08-24 09:24:10,444 INFO L140 encePairwiseOnDemand]: 273/276 looper letters, 24 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2023-08-24 09:24:10,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 28 transitions, 134 flow [2023-08-24 09:24:10,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 09:24:10,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 09:24:10,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 345 transitions. [2023-08-24 09:24:10,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4166666666666667 [2023-08-24 09:24:10,449 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 345 transitions. [2023-08-24 09:24:10,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 345 transitions. [2023-08-24 09:24:10,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:24:10,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 345 transitions. [2023-08-24 09:24:10,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states 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 09:24:10,453 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states 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 09:24:10,453 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 276.0) internal successors, (1104), 4 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states 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 09:24:10,454 INFO L175 Difference]: Start difference. First operand has 27 places, 27 transitions, 80 flow. Second operand 3 states and 345 transitions. [2023-08-24 09:24:10,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 28 transitions, 134 flow [2023-08-24 09:24:10,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 28 transitions, 130 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 09:24:10,456 INFO L231 Difference]: Finished difference. Result has 29 places, 28 transitions, 88 flow [2023-08-24 09:24:10,456 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=29, PETRI_TRANSITIONS=28} [2023-08-24 09:24:10,457 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -1 predicate places. [2023-08-24 09:24:10,458 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 28 transitions, 88 flow [2023-08-24 09:24:10,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.8) internal successors, (554), 5 states have internal predecessors, (554), 0 states have call successors, (0), 0 states 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 09:24:10,461 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:24:10,465 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:24:10,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 09:24:10,465 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 1 more)] === [2023-08-24 09:24:10,466 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:24:10,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1344716207, now seen corresponding path program 1 times [2023-08-24 09:24:10,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:24:10,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721339196] [2023-08-24 09:24:10,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:24:10,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:24:10,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:24:10,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 09:24:10,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:24:10,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721339196] [2023-08-24 09:24:10,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721339196] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:24:10,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155506286] [2023-08-24 09:24:10,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:24:10,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:24:10,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:24:10,641 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 09:24:10,668 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 09:24:10,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:24:10,742 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-24 09:24:10,746 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:24:10,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 09:24:10,849 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:24:10,914 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 09:24:10,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155506286] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-24 09:24:10,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-24 09:24:10,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2023-08-24 09:24:10,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195101279] [2023-08-24 09:24:10,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 09:24:10,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 09:24:10,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:24:10,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 09:24:10,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-08-24 09:24:10,921 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 276 [2023-08-24 09:24:10,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 28 transitions, 88 flow. Second operand has 7 states, 7 states have (on average 102.0) internal successors, (714), 7 states have internal predecessors, (714), 0 states have call successors, (0), 0 states 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 09:24:10,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:24:10,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 276 [2023-08-24 09:24:10,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:24:11,100 INFO L124 PetriNetUnfolderBase]: 404/586 cut-off events. [2023-08-24 09:24:11,100 INFO L125 PetriNetUnfolderBase]: For 107/107 co-relation queries the response was YES. [2023-08-24 09:24:11,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1402 conditions, 586 events. 404/586 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2016 event pairs, 94 based on Foata normal form. 44/627 useless extension candidates. Maximal degree in co-relation 1389. Up to 261 conditions per place. [2023-08-24 09:24:11,104 INFO L140 encePairwiseOnDemand]: 268/276 looper letters, 46 selfloop transitions, 13 changer transitions 0/60 dead transitions. [2023-08-24 09:24:11,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 60 transitions, 299 flow [2023-08-24 09:24:11,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 09:24:11,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 09:24:11,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 845 transitions. [2023-08-24 09:24:11,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38269927536231885 [2023-08-24 09:24:11,107 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 845 transitions. [2023-08-24 09:24:11,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 845 transitions. [2023-08-24 09:24:11,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:24:11,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 845 transitions. [2023-08-24 09:24:11,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 105.625) internal successors, (845), 8 states have internal predecessors, (845), 0 states have call successors, (0), 0 states 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 09:24:11,112 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 276.0) internal successors, (2484), 9 states have internal predecessors, (2484), 0 states have call successors, (0), 0 states 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 09:24:11,113 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 276.0) internal successors, (2484), 9 states have internal predecessors, (2484), 0 states have call successors, (0), 0 states 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 09:24:11,114 INFO L175 Difference]: Start difference. First operand has 29 places, 28 transitions, 88 flow. Second operand 8 states and 845 transitions. [2023-08-24 09:24:11,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 60 transitions, 299 flow [2023-08-24 09:24:11,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 60 transitions, 293 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-24 09:24:11,116 INFO L231 Difference]: Finished difference. Result has 37 places, 34 transitions, 144 flow [2023-08-24 09:24:11,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=144, PETRI_PLACES=37, PETRI_TRANSITIONS=34} [2023-08-24 09:24:11,117 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 7 predicate places. [2023-08-24 09:24:11,117 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 34 transitions, 144 flow [2023-08-24 09:24:11,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.0) internal successors, (714), 7 states have internal predecessors, (714), 0 states have call successors, (0), 0 states 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 09:24:11,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:24:11,117 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:24:11,126 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 09:24:11,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:24:11,323 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 1 more)] === [2023-08-24 09:24:11,323 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:24:11,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1289498903, now seen corresponding path program 1 times [2023-08-24 09:24:11,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:24:11,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309220733] [2023-08-24 09:24:11,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:24:11,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:24:11,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:24:11,403 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 09:24:11,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:24:11,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309220733] [2023-08-24 09:24:11,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309220733] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:24:11,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354127652] [2023-08-24 09:24:11,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:24:11,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:24:11,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:24:11,407 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 09:24:11,414 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 09:24:11,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:24:11,499 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-24 09:24:11,501 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:24:11,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 09:24:11,531 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:24:11,557 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 09:24:11,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354127652] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-24 09:24:11,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-24 09:24:11,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 8 [2023-08-24 09:24:11,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830683141] [2023-08-24 09:24:11,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 09:24:11,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 09:24:11,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:24:11,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 09:24:11,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-08-24 09:24:11,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 276 [2023-08-24 09:24:11,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 34 transitions, 144 flow. Second operand has 5 states, 5 states have (on average 111.0) internal successors, (555), 5 states have internal predecessors, (555), 0 states have call successors, (0), 0 states 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 09:24:11,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:24:11,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 276 [2023-08-24 09:24:11,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:24:11,651 INFO L124 PetriNetUnfolderBase]: 334/499 cut-off events. [2023-08-24 09:24:11,651 INFO L125 PetriNetUnfolderBase]: For 616/664 co-relation queries the response was YES. [2023-08-24 09:24:11,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1578 conditions, 499 events. 334/499 cut-off events. For 616/664 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1723 event pairs, 101 based on Foata normal form. 62/542 useless extension candidates. Maximal degree in co-relation 1556. Up to 371 conditions per place. [2023-08-24 09:24:11,654 INFO L140 encePairwiseOnDemand]: 271/276 looper letters, 41 selfloop transitions, 5 changer transitions 0/50 dead transitions. [2023-08-24 09:24:11,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 50 transitions, 312 flow [2023-08-24 09:24:11,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 09:24:11,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 09:24:11,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 569 transitions. [2023-08-24 09:24:11,656 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41231884057971013 [2023-08-24 09:24:11,657 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 569 transitions. [2023-08-24 09:24:11,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 569 transitions. [2023-08-24 09:24:11,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:24:11,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 569 transitions. [2023-08-24 09:24:11,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 113.8) internal successors, (569), 5 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 09:24:11,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 276.0) internal successors, (1656), 6 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states 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 09:24:11,661 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 276.0) internal successors, (1656), 6 states have internal predecessors, (1656), 0 states have call successors, (0), 0 states 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 09:24:11,661 INFO L175 Difference]: Start difference. First operand has 37 places, 34 transitions, 144 flow. Second operand 5 states and 569 transitions. [2023-08-24 09:24:11,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 50 transitions, 312 flow [2023-08-24 09:24:11,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 50 transitions, 293 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-24 09:24:11,664 INFO L231 Difference]: Finished difference. Result has 40 places, 35 transitions, 154 flow [2023-08-24 09:24:11,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=154, PETRI_PLACES=40, PETRI_TRANSITIONS=35} [2023-08-24 09:24:11,665 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 10 predicate places. [2023-08-24 09:24:11,665 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 154 flow [2023-08-24 09:24:11,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.0) internal successors, (555), 5 states have internal predecessors, (555), 0 states have call successors, (0), 0 states 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 09:24:11,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:24:11,666 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:24:11,677 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 09:24:11,872 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,SelfDestructingSolverStorable3 [2023-08-24 09:24:11,872 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 1 more)] === [2023-08-24 09:24:11,873 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:24:11,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1033456510, now seen corresponding path program 1 times [2023-08-24 09:24:11,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:24:11,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643858353] [2023-08-24 09:24:11,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:24:11,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:24:11,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:24:13,146 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 09:24:13,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:24:13,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643858353] [2023-08-24 09:24:13,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643858353] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:24:13,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1733086533] [2023-08-24 09:24:13,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:24:13,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:24:13,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:24:13,148 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 09:24:13,152 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 09:24:13,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:24:13,243 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 39 conjunts are in the unsatisfiable core [2023-08-24 09:24:13,246 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:24:13,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 09:24:13,549 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 34 treesize of output 32 [2023-08-24 09:24:13,716 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 09:24:13,719 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:24:13,719 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 64 treesize of output 37 [2023-08-24 09:24:13,828 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 09:24:13,828 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:24:14,194 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse3 (= c_~max1~0 c_~max2~0))) (and (forall ((v_ArrVal_173 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_173) c_~A~0.base) .cse1))) (or (<= .cse0 c_~max3~0) (= c_~max1~0 .cse0) (<= .cse0 c_~max2~0)))) (or (forall ((v_ArrVal_173 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_173) c_~A~0.base) .cse1))) (or (< c_~max2~0 .cse2) (<= .cse2 c_~max3~0)))) .cse3) (or (forall ((v_ArrVal_173 (Array Int Int))) (< c_~max3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_173) c_~A~0.base) .cse1))) (and (or .cse3 (< c_~max2~0 c_~max3~0)) (or (= c_~max1~0 c_~max3~0) (<= c_~max3~0 c_~max2~0)))))) is different from false [2023-08-24 09:24:14,256 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:24:14,256 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 242 treesize of output 178 [2023-08-24 09:24:14,264 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 148 treesize of output 142 [2023-08-24 09:24:14,270 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 142 treesize of output 130 [2023-08-24 09:24:14,277 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 130 treesize of output 112 [2023-08-24 09:24:14,759 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 09:24:14,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1733086533] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:24:14,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:24:14,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 25 [2023-08-24 09:24:14,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210069621] [2023-08-24 09:24:14,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:24:14,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-08-24 09:24:14,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:24:14,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-08-24 09:24:14,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=551, Unknown=1, NotChecked=48, Total=702 [2023-08-24 09:24:14,764 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 276 [2023-08-24 09:24:14,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 154 flow. Second operand has 27 states, 27 states have (on average 75.22222222222223) internal successors, (2031), 27 states have internal predecessors, (2031), 0 states have call successors, (0), 0 states 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 09:24:14,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:24:14,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 276 [2023-08-24 09:24:14,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:24:15,923 INFO L124 PetriNetUnfolderBase]: 801/1187 cut-off events. [2023-08-24 09:24:15,923 INFO L125 PetriNetUnfolderBase]: For 1228/1228 co-relation queries the response was YES. [2023-08-24 09:24:15,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3876 conditions, 1187 events. 801/1187 cut-off events. For 1228/1228 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4510 event pairs, 75 based on Foata normal form. 2/1189 useless extension candidates. Maximal degree in co-relation 3477. Up to 653 conditions per place. [2023-08-24 09:24:15,932 INFO L140 encePairwiseOnDemand]: 265/276 looper letters, 97 selfloop transitions, 41 changer transitions 6/146 dead transitions. [2023-08-24 09:24:15,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 146 transitions, 868 flow [2023-08-24 09:24:15,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-24 09:24:15,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-24 09:24:15,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 999 transitions. [2023-08-24 09:24:15,935 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3016304347826087 [2023-08-24 09:24:15,936 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 999 transitions. [2023-08-24 09:24:15,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 999 transitions. [2023-08-24 09:24:15,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:24:15,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 999 transitions. [2023-08-24 09:24:15,941 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 83.25) internal successors, (999), 12 states have internal predecessors, (999), 0 states have call successors, (0), 0 states 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 09:24:15,945 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 276.0) internal successors, (3588), 13 states have internal predecessors, (3588), 0 states have call successors, (0), 0 states 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 09:24:15,945 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 276.0) internal successors, (3588), 13 states have internal predecessors, (3588), 0 states have call successors, (0), 0 states 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 09:24:15,946 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 154 flow. Second operand 12 states and 999 transitions. [2023-08-24 09:24:15,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 146 transitions, 868 flow [2023-08-24 09:24:15,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 146 transitions, 852 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-24 09:24:15,956 INFO L231 Difference]: Finished difference. Result has 53 places, 70 transitions, 456 flow [2023-08-24 09:24:15,957 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=456, PETRI_PLACES=53, PETRI_TRANSITIONS=70} [2023-08-24 09:24:15,958 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 23 predicate places. [2023-08-24 09:24:15,958 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 70 transitions, 456 flow [2023-08-24 09:24:15,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 75.22222222222223) internal successors, (2031), 27 states have internal predecessors, (2031), 0 states have call successors, (0), 0 states 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 09:24:15,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:24:15,960 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:24:15,966 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 09:24:16,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:24:16,166 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 1 more)] === [2023-08-24 09:24:16,166 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:24:16,166 INFO L85 PathProgramCache]: Analyzing trace with hash 891883112, now seen corresponding path program 2 times [2023-08-24 09:24:16,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:24:16,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603465006] [2023-08-24 09:24:16,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:24:16,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:24:16,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:24:16,861 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 09:24:16,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:24:16,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603465006] [2023-08-24 09:24:16,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603465006] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:24:16,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972809703] [2023-08-24 09:24:16,862 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 09:24:16,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:24:16,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:24:16,863 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 09:24:16,885 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 09:24:16,961 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 09:24:16,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:24:16,963 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 32 conjunts are in the unsatisfiable core [2023-08-24 09:24:16,965 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:24:17,301 INFO L322 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2023-08-24 09:24:17,302 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 73 treesize of output 59 [2023-08-24 09:24:17,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 09:24:17,399 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:24:17,562 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:24:17,562 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 117 treesize of output 69 [2023-08-24 09:24:17,965 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 09:24:17,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972809703] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:24:17,966 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:24:17,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 24 [2023-08-24 09:24:17,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631101260] [2023-08-24 09:24:17,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:24:17,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-24 09:24:17,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:24:17,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-24 09:24:17,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2023-08-24 09:24:17,969 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 276 [2023-08-24 09:24:17,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 70 transitions, 456 flow. Second operand has 26 states, 26 states have (on average 81.42307692307692) internal successors, (2117), 26 states have internal predecessors, (2117), 0 states have call successors, (0), 0 states 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 09:24:17,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:24:17,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 276 [2023-08-24 09:24:17,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:24:18,993 INFO L124 PetriNetUnfolderBase]: 1120/1654 cut-off events. [2023-08-24 09:24:18,994 INFO L125 PetriNetUnfolderBase]: For 2858/2858 co-relation queries the response was YES. [2023-08-24 09:24:18,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6319 conditions, 1654 events. 1120/1654 cut-off events. For 2858/2858 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6489 event pairs, 159 based on Foata normal form. 1/1655 useless extension candidates. Maximal degree in co-relation 6052. Up to 1250 conditions per place. [2023-08-24 09:24:19,003 INFO L140 encePairwiseOnDemand]: 263/276 looper letters, 122 selfloop transitions, 64 changer transitions 1/187 dead transitions. [2023-08-24 09:24:19,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 187 transitions, 1422 flow [2023-08-24 09:24:19,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-24 09:24:19,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-24 09:24:19,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1383 transitions. [2023-08-24 09:24:19,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.313179347826087 [2023-08-24 09:24:19,008 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1383 transitions. [2023-08-24 09:24:19,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1383 transitions. [2023-08-24 09:24:19,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:24:19,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1383 transitions. [2023-08-24 09:24:19,012 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 86.4375) internal successors, (1383), 16 states have internal predecessors, (1383), 0 states have call successors, (0), 0 states 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 09:24:19,017 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 276.0) internal successors, (4692), 17 states have internal predecessors, (4692), 0 states have call successors, (0), 0 states 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 09:24:19,018 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 276.0) internal successors, (4692), 17 states have internal predecessors, (4692), 0 states have call successors, (0), 0 states 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 09:24:19,018 INFO L175 Difference]: Start difference. First operand has 53 places, 70 transitions, 456 flow. Second operand 16 states and 1383 transitions. [2023-08-24 09:24:19,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 187 transitions, 1422 flow [2023-08-24 09:24:19,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 187 transitions, 1360 flow, removed 30 selfloop flow, removed 1 redundant places. [2023-08-24 09:24:19,031 INFO L231 Difference]: Finished difference. Result has 74 places, 118 transitions, 937 flow [2023-08-24 09:24:19,032 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=937, PETRI_PLACES=74, PETRI_TRANSITIONS=118} [2023-08-24 09:24:19,032 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 44 predicate places. [2023-08-24 09:24:19,033 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 118 transitions, 937 flow [2023-08-24 09:24:19,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 81.42307692307692) internal successors, (2117), 26 states have internal predecessors, (2117), 0 states have call successors, (0), 0 states 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 09:24:19,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:24:19,034 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:24:19,043 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 09:24:19,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:24:19,239 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 1 more)] === [2023-08-24 09:24:19,240 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:24:19,240 INFO L85 PathProgramCache]: Analyzing trace with hash -651157508, now seen corresponding path program 3 times [2023-08-24 09:24:19,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:24:19,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451842255] [2023-08-24 09:24:19,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:24:19,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:24:19,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:24:19,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 09:24:19,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:24:19,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451842255] [2023-08-24 09:24:19,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451842255] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:24:19,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482560932] [2023-08-24 09:24:19,910 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 09:24:19,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:24:19,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:24:19,911 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 09:24:19,920 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 09:24:20,017 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-24 09:24:20,017 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:24:20,019 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 31 conjunts are in the unsatisfiable core [2023-08-24 09:24:20,021 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:24:20,375 INFO L322 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2023-08-24 09:24:20,375 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 64 treesize of output 56 [2023-08-24 09:24:20,520 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 09:24:20,520 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:24:20,700 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:24:20,701 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 117 treesize of output 69 [2023-08-24 09:24:21,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 09:24:21,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482560932] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:24:21,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:24:21,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 23 [2023-08-24 09:24:21,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227003450] [2023-08-24 09:24:21,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:24:21,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-24 09:24:21,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:24:21,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-24 09:24:21,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2023-08-24 09:24:21,042 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 276 [2023-08-24 09:24:21,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 118 transitions, 937 flow. Second operand has 25 states, 25 states have (on average 81.76) internal successors, (2044), 25 states have internal predecessors, (2044), 0 states have call successors, (0), 0 states 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 09:24:21,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:24:21,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 276 [2023-08-24 09:24:21,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:24:22,546 INFO L124 PetriNetUnfolderBase]: 1350/2002 cut-off events. [2023-08-24 09:24:22,547 INFO L125 PetriNetUnfolderBase]: For 5781/5781 co-relation queries the response was YES. [2023-08-24 09:24:22,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8834 conditions, 2002 events. 1350/2002 cut-off events. For 5781/5781 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 8241 event pairs, 256 based on Foata normal form. 2/2004 useless extension candidates. Maximal degree in co-relation 8618. Up to 1559 conditions per place. [2023-08-24 09:24:22,561 INFO L140 encePairwiseOnDemand]: 263/276 looper letters, 139 selfloop transitions, 120 changer transitions 4/263 dead transitions. [2023-08-24 09:24:22,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 263 transitions, 2441 flow [2023-08-24 09:24:22,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-08-24 09:24:22,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-08-24 09:24:22,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 2054 transitions. [2023-08-24 09:24:22,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3100845410628019 [2023-08-24 09:24:22,569 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 2054 transitions. [2023-08-24 09:24:22,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 2054 transitions. [2023-08-24 09:24:22,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:24:22,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 2054 transitions. [2023-08-24 09:24:22,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 85.58333333333333) internal successors, (2054), 24 states have internal predecessors, (2054), 0 states have call successors, (0), 0 states 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 09:24:22,585 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 276.0) internal successors, (6900), 25 states have internal predecessors, (6900), 0 states have call successors, (0), 0 states 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 09:24:22,587 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 276.0) internal successors, (6900), 25 states have internal predecessors, (6900), 0 states have call successors, (0), 0 states 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 09:24:22,587 INFO L175 Difference]: Start difference. First operand has 74 places, 118 transitions, 937 flow. Second operand 24 states and 2054 transitions. [2023-08-24 09:24:22,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 263 transitions, 2441 flow [2023-08-24 09:24:22,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 263 transitions, 2287 flow, removed 43 selfloop flow, removed 3 redundant places. [2023-08-24 09:24:22,615 INFO L231 Difference]: Finished difference. Result has 109 places, 202 transitions, 1966 flow [2023-08-24 09:24:22,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=825, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=1966, PETRI_PLACES=109, PETRI_TRANSITIONS=202} [2023-08-24 09:24:22,616 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 79 predicate places. [2023-08-24 09:24:22,616 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 202 transitions, 1966 flow [2023-08-24 09:24:22,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 81.76) internal successors, (2044), 25 states have internal predecessors, (2044), 0 states have call successors, (0), 0 states 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 09:24:22,617 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:24:22,617 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:24:22,626 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 09:24:22,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:24:22,824 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 1 more)] === [2023-08-24 09:24:22,824 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:24:22,824 INFO L85 PathProgramCache]: Analyzing trace with hash -891682482, now seen corresponding path program 4 times [2023-08-24 09:24:22,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:24:22,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418607480] [2023-08-24 09:24:22,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:24:22,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:24:22,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:24:23,452 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 09:24:23,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:24:23,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418607480] [2023-08-24 09:24:23,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418607480] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:24:23,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081705412] [2023-08-24 09:24:23,453 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-24 09:24:23,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:24:23,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:24:23,457 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 09:24:23,479 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 09:24:23,549 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-24 09:24:23,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:24:23,550 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 26 conjunts are in the unsatisfiable core [2023-08-24 09:24:23,552 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:24:23,766 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:24:23,767 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 83 treesize of output 71 [2023-08-24 09:24:24,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 09:24:24,028 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:24:24,258 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:24:24,258 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 117 treesize of output 69 [2023-08-24 09:24:24,596 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 09:24:24,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081705412] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:24:24,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:24:24,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 25 [2023-08-24 09:24:24,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405092336] [2023-08-24 09:24:24,596 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:24:24,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-08-24 09:24:24,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:24:24,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-08-24 09:24:24,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=552, Unknown=0, NotChecked=0, Total=702 [2023-08-24 09:24:24,600 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 276 [2023-08-24 09:24:24,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 202 transitions, 1966 flow. Second operand has 27 states, 27 states have (on average 81.55555555555556) internal successors, (2202), 27 states have internal predecessors, (2202), 0 states have call successors, (0), 0 states 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 09:24:24,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:24:24,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 276 [2023-08-24 09:24:24,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:24:26,370 INFO L124 PetriNetUnfolderBase]: 1588/2409 cut-off events. [2023-08-24 09:24:26,371 INFO L125 PetriNetUnfolderBase]: For 12374/12374 co-relation queries the response was YES. [2023-08-24 09:24:26,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12815 conditions, 2409 events. 1588/2409 cut-off events. For 12374/12374 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 10638 event pairs, 332 based on Foata normal form. 3/2412 useless extension candidates. Maximal degree in co-relation 12582. Up to 1878 conditions per place. [2023-08-24 09:24:26,393 INFO L140 encePairwiseOnDemand]: 263/276 looper letters, 172 selfloop transitions, 196 changer transitions 20/388 dead transitions. [2023-08-24 09:24:26,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 388 transitions, 4151 flow [2023-08-24 09:24:26,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-08-24 09:24:26,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-08-24 09:24:26,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 2549 transitions. [2023-08-24 09:24:26,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.30785024154589374 [2023-08-24 09:24:26,402 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 2549 transitions. [2023-08-24 09:24:26,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 2549 transitions. [2023-08-24 09:24:26,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:24:26,403 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 2549 transitions. [2023-08-24 09:24:26,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 84.96666666666667) internal successors, (2549), 30 states have internal predecessors, (2549), 0 states have call successors, (0), 0 states 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 09:24:26,417 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 276.0) internal successors, (8556), 31 states have internal predecessors, (8556), 0 states have call successors, (0), 0 states 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 09:24:26,418 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 276.0) internal successors, (8556), 31 states have internal predecessors, (8556), 0 states have call successors, (0), 0 states 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 09:24:26,419 INFO L175 Difference]: Start difference. First operand has 109 places, 202 transitions, 1966 flow. Second operand 30 states and 2549 transitions. [2023-08-24 09:24:26,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 388 transitions, 4151 flow [2023-08-24 09:24:26,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 388 transitions, 4033 flow, removed 55 selfloop flow, removed 3 redundant places. [2023-08-24 09:24:26,469 INFO L231 Difference]: Finished difference. Result has 145 places, 303 transitions, 3492 flow [2023-08-24 09:24:26,470 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=1864, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=3492, PETRI_PLACES=145, PETRI_TRANSITIONS=303} [2023-08-24 09:24:26,470 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 115 predicate places. [2023-08-24 09:24:26,470 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 303 transitions, 3492 flow [2023-08-24 09:24:26,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 81.55555555555556) internal successors, (2202), 27 states have internal predecessors, (2202), 0 states have call successors, (0), 0 states 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 09:24:26,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:24:26,471 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:24:26,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-24 09:24:26,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:24:26,678 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 1 more)] === [2023-08-24 09:24:26,678 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:24:26,678 INFO L85 PathProgramCache]: Analyzing trace with hash 856926520, now seen corresponding path program 5 times [2023-08-24 09:24:26,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:24:26,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421490339] [2023-08-24 09:24:26,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:24:26,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:24:26,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:24:27,253 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 09:24:27,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:24:27,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421490339] [2023-08-24 09:24:27,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421490339] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:24:27,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574758486] [2023-08-24 09:24:27,254 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-24 09:24:27,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:24:27,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:24:27,255 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 09:24:27,283 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 09:24:27,357 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-08-24 09:24:27,357 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:24:27,359 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 30 conjunts are in the unsatisfiable core [2023-08-24 09:24:27,360 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:24:27,691 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:24:27,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 77 treesize of output 71 [2023-08-24 09:24:27,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 09:24:27,962 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:24:28,206 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:24:28,207 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 117 treesize of output 69 [2023-08-24 09:24:28,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 09:24:28,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574758486] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:24:28,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:24:28,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 7] total 25 [2023-08-24 09:24:28,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527143898] [2023-08-24 09:24:28,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:24:28,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-08-24 09:24:28,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:24:28,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-08-24 09:24:28,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=570, Unknown=0, NotChecked=0, Total=702 [2023-08-24 09:24:28,528 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 276 [2023-08-24 09:24:28,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 303 transitions, 3492 flow. Second operand has 27 states, 27 states have (on average 81.33333333333333) internal successors, (2196), 27 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states 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 09:24:28,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:24:28,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 276 [2023-08-24 09:24:28,530 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:24:30,708 INFO L124 PetriNetUnfolderBase]: 2127/3168 cut-off events. [2023-08-24 09:24:30,708 INFO L125 PetriNetUnfolderBase]: For 18788/18788 co-relation queries the response was YES. [2023-08-24 09:24:30,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18073 conditions, 3168 events. 2127/3168 cut-off events. For 18788/18788 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 14544 event pairs, 182 based on Foata normal form. 2/3170 useless extension candidates. Maximal degree in co-relation 17961. Up to 2127 conditions per place. [2023-08-24 09:24:30,741 INFO L140 encePairwiseOnDemand]: 262/276 looper letters, 267 selfloop transitions, 305 changer transitions 16/588 dead transitions. [2023-08-24 09:24:30,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 588 transitions, 7182 flow [2023-08-24 09:24:30,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-08-24 09:24:30,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2023-08-24 09:24:30,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 2739 transitions. [2023-08-24 09:24:30,746 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3101222826086957 [2023-08-24 09:24:30,746 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 2739 transitions. [2023-08-24 09:24:30,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 2739 transitions. [2023-08-24 09:24:30,748 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:24:30,748 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 2739 transitions. [2023-08-24 09:24:30,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 85.59375) internal successors, (2739), 32 states have internal predecessors, (2739), 0 states have call successors, (0), 0 states 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 09:24:30,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 276.0) internal successors, (9108), 33 states have internal predecessors, (9108), 0 states have call successors, (0), 0 states 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 09:24:30,762 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 276.0) internal successors, (9108), 33 states have internal predecessors, (9108), 0 states have call successors, (0), 0 states 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 09:24:30,762 INFO L175 Difference]: Start difference. First operand has 145 places, 303 transitions, 3492 flow. Second operand 32 states and 2739 transitions. [2023-08-24 09:24:30,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 588 transitions, 7182 flow [2023-08-24 09:24:30,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 588 transitions, 6671 flow, removed 217 selfloop flow, removed 5 redundant places. [2023-08-24 09:24:30,896 INFO L231 Difference]: Finished difference. Result has 183 places, 482 transitions, 5905 flow [2023-08-24 09:24:30,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=3005, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=159, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=5905, PETRI_PLACES=183, PETRI_TRANSITIONS=482} [2023-08-24 09:24:30,897 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 153 predicate places. [2023-08-24 09:24:30,897 INFO L495 AbstractCegarLoop]: Abstraction has has 183 places, 482 transitions, 5905 flow [2023-08-24 09:24:30,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 81.33333333333333) internal successors, (2196), 27 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states 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 09:24:30,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:24:30,900 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:24:30,911 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 09:24:31,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:24:31,106 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 1 more)] === [2023-08-24 09:24:31,106 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:24:31,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1532870570, now seen corresponding path program 6 times [2023-08-24 09:24:31,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:24:31,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498824392] [2023-08-24 09:24:31,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:24:31,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:24:31,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:24:31,711 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 09:24:31,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:24:31,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498824392] [2023-08-24 09:24:31,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498824392] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:24:31,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618808389] [2023-08-24 09:24:31,712 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-24 09:24:31,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:24:31,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:24:31,713 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 09:24:31,714 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 09:24:31,804 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-08-24 09:24:31,804 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:24:31,805 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 34 conjunts are in the unsatisfiable core [2023-08-24 09:24:31,807 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:24:32,109 INFO L322 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2023-08-24 09:24:32,110 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 73 treesize of output 59 [2023-08-24 09:24:32,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 09:24:32,216 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:24:32,370 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:24:32,370 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 117 treesize of output 69 [2023-08-24 09:24:32,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 09:24:32,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618808389] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:24:32,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:24:32,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 22 [2023-08-24 09:24:32,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516206265] [2023-08-24 09:24:32,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:24:32,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-24 09:24:32,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:24:32,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-24 09:24:32,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2023-08-24 09:24:32,697 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 276 [2023-08-24 09:24:32,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 482 transitions, 5905 flow. Second operand has 24 states, 24 states have (on average 85.75) internal successors, (2058), 24 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states 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 09:24:32,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:24:32,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 276 [2023-08-24 09:24:32,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:24:33,499 INFO L124 PetriNetUnfolderBase]: 2271/3444 cut-off events. [2023-08-24 09:24:33,499 INFO L125 PetriNetUnfolderBase]: For 27143/27175 co-relation queries the response was YES. [2023-08-24 09:24:33,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22131 conditions, 3444 events. 2271/3444 cut-off events. For 27143/27175 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 16925 event pairs, 302 based on Foata normal form. 26/3438 useless extension candidates. Maximal degree in co-relation 22042. Up to 2838 conditions per place. [2023-08-24 09:24:33,538 INFO L140 encePairwiseOnDemand]: 266/276 looper letters, 413 selfloop transitions, 173 changer transitions 6/607 dead transitions. [2023-08-24 09:24:33,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 607 transitions, 8365 flow [2023-08-24 09:24:33,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-24 09:24:33,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-24 09:24:33,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1093 transitions. [2023-08-24 09:24:33,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.330012077294686 [2023-08-24 09:24:33,540 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1093 transitions. [2023-08-24 09:24:33,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1093 transitions. [2023-08-24 09:24:33,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:24:33,541 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1093 transitions. [2023-08-24 09:24:33,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 91.08333333333333) internal successors, (1093), 12 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states 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 09:24:33,545 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 276.0) internal successors, (3588), 13 states have internal predecessors, (3588), 0 states have call successors, (0), 0 states 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 09:24:33,546 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 276.0) internal successors, (3588), 13 states have internal predecessors, (3588), 0 states have call successors, (0), 0 states 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 09:24:33,546 INFO L175 Difference]: Start difference. First operand has 183 places, 482 transitions, 5905 flow. Second operand 12 states and 1093 transitions. [2023-08-24 09:24:33,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 607 transitions, 8365 flow [2023-08-24 09:24:33,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 607 transitions, 7002 flow, removed 641 selfloop flow, removed 5 redundant places. [2023-08-24 09:24:33,733 INFO L231 Difference]: Finished difference. Result has 193 places, 543 transitions, 6006 flow [2023-08-24 09:24:33,734 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=4904, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=482, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=6006, PETRI_PLACES=193, PETRI_TRANSITIONS=543} [2023-08-24 09:24:33,735 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 163 predicate places. [2023-08-24 09:24:33,735 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 543 transitions, 6006 flow [2023-08-24 09:24:33,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 85.75) internal successors, (2058), 24 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states 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 09:24:33,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:24:33,736 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:24:33,747 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 09:24:33,941 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,SelfDestructingSolverStorable9 [2023-08-24 09:24:33,942 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 1 more)] === [2023-08-24 09:24:33,942 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:24:33,942 INFO L85 PathProgramCache]: Analyzing trace with hash -822253440, now seen corresponding path program 7 times [2023-08-24 09:24:33,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:24:33,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282869776] [2023-08-24 09:24:33,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:24:33,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:24:33,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:24:34,770 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 09:24:34,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:24:34,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282869776] [2023-08-24 09:24:34,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282869776] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:24:34,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097680871] [2023-08-24 09:24:34,771 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-24 09:24:34,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:24:34,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:24:34,773 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 09:24:34,796 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 09:24:34,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:24:34,873 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 47 conjunts are in the unsatisfiable core [2023-08-24 09:24:34,875 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:24:34,923 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 09:24:34,987 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 09:24:35,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 09:24:35,122 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 34 treesize of output 32 [2023-08-24 09:24:35,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 09:24:35,263 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 34 treesize of output 32 [2023-08-24 09:24:35,418 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 09:24:35,421 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:24:35,421 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 64 treesize of output 37 [2023-08-24 09:24:35,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 09:24:35,503 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:24:35,756 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (= c_~max1~0 c_~max2~0)) (.cse2 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (or .cse0 (forall ((v_ArrVal_442 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_442) c_~A~0.base) .cse2))) (or (< c_~max2~0 .cse1) (<= .cse1 c_~max3~0))))) (or (and (or .cse0 (< c_~max2~0 c_~max3~0)) (or (= c_~max1~0 c_~max3~0) (<= c_~max3~0 c_~max2~0))) (forall ((v_ArrVal_442 (Array Int Int))) (< c_~max3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_442) c_~A~0.base) .cse2)))) (forall ((v_ArrVal_442 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_442) c_~A~0.base) .cse2))) (or (<= .cse3 c_~max2~0) (<= .cse3 c_~max3~0) (= c_~max1~0 .cse3)))))) is different from false [2023-08-24 09:24:35,885 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse0 (= c_~max1~0 c_~max2~0))) (and (or .cse0 (forall ((v_ArrVal_441 (Array Int Int)) (v_ArrVal_442 (Array Int Int))) (let ((.cse1 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_441) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_442) c_~A~0.base) .cse2))) (or (< c_~max2~0 .cse1) (<= .cse1 c_~max3~0))))) (forall ((v_ArrVal_441 (Array Int Int)) (v_ArrVal_442 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_441) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_442) c_~A~0.base) .cse2))) (or (= c_~max1~0 .cse3) (<= .cse3 c_~max3~0) (<= .cse3 c_~max2~0)))) (or (forall ((v_ArrVal_441 (Array Int Int)) (v_ArrVal_442 (Array Int Int))) (< c_~max3~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_441) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_442) c_~A~0.base) .cse2))) (and (or .cse0 (< c_~max2~0 c_~max3~0)) (or (= c_~max1~0 c_~max3~0) (<= c_~max3~0 c_~max2~0)))))) is different from false [2023-08-24 09:24:45,252 WARN L234 SmtUtils]: Spent 6.36s on a formula simplification that was a NOOP. DAG size: 79 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 09:24:45,320 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:24:45,320 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 109 treesize of output 73 [2023-08-24 09:24:45,332 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:24:45,333 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 637 treesize of output 605 [2023-08-24 09:24:45,357 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:24:45,358 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 159 treesize of output 151 [2023-08-24 09:24:45,369 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 259 treesize of output 235 [2023-08-24 09:24:45,380 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 235 treesize of output 187 [2023-08-24 09:24:45,893 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:24:45,894 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 87 treesize of output 63 [2023-08-24 09:24:45,930 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 09:24:45,931 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 1232 treesize of output 1168 [2023-08-24 09:24:45,961 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 09:24:45,961 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 140 treesize of output 130 [2023-08-24 09:24:45,972 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 259 treesize of output 211 [2023-08-24 09:24:45,980 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 117 treesize of output 93 [2023-08-24 09:24:46,196 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:24:46,196 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 138 treesize of output 90 [2023-08-24 09:24:46,214 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:24:46,215 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 2645 treesize of output 2393 [2023-08-24 09:24:46,237 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 215 treesize of output 179 [2023-08-24 09:24:46,254 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:24:46,255 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 271 treesize of output 251 [2023-08-24 09:24:46,267 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 352 treesize of output 280 [2023-08-24 09:24:46,656 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:24:46,656 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 119 treesize of output 83 [2023-08-24 09:24:46,662 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 09:24:46,663 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 09:24:46,674 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 09:24:46,674 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 109 treesize of output 85 [2023-08-24 09:24:46,689 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 09:24:46,689 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 49 treesize of output 33 [2023-08-24 09:24:46,731 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:24:46,731 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 77 treesize of output 53 [2023-08-24 09:24:46,737 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 09:24:46,738 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 09:24:46,748 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 09:24:46,748 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 72 treesize of output 60 [2023-08-24 09:24:46,763 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 09:24:46,764 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 32 treesize of output 26 [2023-08-24 09:24:46,812 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:24:46,812 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 77 treesize of output 53 [2023-08-24 09:24:46,818 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 09:24:46,819 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 09:24:46,830 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 09:24:46,830 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 72 treesize of output 60 [2023-08-24 09:24:46,857 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 09:24:46,857 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 32 treesize of output 26 [2023-08-24 09:24:46,890 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:24:46,891 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 55 treesize of output 43 [2023-08-24 09:24:46,896 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 09:24:46,897 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 09:24:46,906 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 09:24:46,906 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 51 treesize of output 43 [2023-08-24 09:24:46,919 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 09:24:46,919 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 23 treesize of output 19 [2023-08-24 09:24:47,028 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-24 09:24:47,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097680871] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:24:47,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:24:47,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 29 [2023-08-24 09:24:47,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568905565] [2023-08-24 09:24:47,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:24:47,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-24 09:24:47,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:24:47,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-24 09:24:47,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=697, Unknown=5, NotChecked=110, Total=930 [2023-08-24 09:24:47,031 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 276 [2023-08-24 09:24:47,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 543 transitions, 6006 flow. Second operand has 31 states, 31 states have (on average 71.2258064516129) internal successors, (2208), 31 states have internal predecessors, (2208), 0 states have call successors, (0), 0 states 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 09:24:47,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:24:47,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 276 [2023-08-24 09:24:47,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:24:49,929 INFO L124 PetriNetUnfolderBase]: 3122/4665 cut-off events. [2023-08-24 09:24:49,930 INFO L125 PetriNetUnfolderBase]: For 34424/34424 co-relation queries the response was YES. [2023-08-24 09:24:49,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29308 conditions, 4665 events. 3122/4665 cut-off events. For 34424/34424 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 23320 event pairs, 195 based on Foata normal form. 50/4703 useless extension candidates. Maximal degree in co-relation 29169. Up to 3011 conditions per place. [2023-08-24 09:24:49,970 INFO L140 encePairwiseOnDemand]: 264/276 looper letters, 503 selfloop transitions, 331 changer transitions 7/841 dead transitions. [2023-08-24 09:24:49,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 841 transitions, 10469 flow [2023-08-24 09:24:49,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-24 09:24:49,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-24 09:24:49,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1661 transitions. [2023-08-24 09:24:49,973 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2865769496204279 [2023-08-24 09:24:49,973 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1661 transitions. [2023-08-24 09:24:49,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1661 transitions. [2023-08-24 09:24:49,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:24:49,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1661 transitions. [2023-08-24 09:24:49,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 79.0952380952381) internal successors, (1661), 21 states have internal predecessors, (1661), 0 states have call successors, (0), 0 states 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 09:24:49,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 276.0) internal successors, (6072), 22 states have internal predecessors, (6072), 0 states have call successors, (0), 0 states 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 09:24:49,982 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 276.0) internal successors, (6072), 22 states have internal predecessors, (6072), 0 states have call successors, (0), 0 states 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 09:24:49,982 INFO L175 Difference]: Start difference. First operand has 193 places, 543 transitions, 6006 flow. Second operand 21 states and 1661 transitions. [2023-08-24 09:24:49,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 841 transitions, 10469 flow [2023-08-24 09:24:50,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 841 transitions, 10335 flow, removed 23 selfloop flow, removed 4 redundant places. [2023-08-24 09:24:50,162 INFO L231 Difference]: Finished difference. Result has 218 places, 667 transitions, 8459 flow [2023-08-24 09:24:50,162 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=5867, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=226, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=8459, PETRI_PLACES=218, PETRI_TRANSITIONS=667} [2023-08-24 09:24:50,163 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 188 predicate places. [2023-08-24 09:24:50,163 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 667 transitions, 8459 flow [2023-08-24 09:24:50,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 71.2258064516129) internal successors, (2208), 31 states have internal predecessors, (2208), 0 states have call successors, (0), 0 states 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 09:24:50,163 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:24:50,164 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:24:50,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-24 09:24:50,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:24:50,364 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 1 more)] === [2023-08-24 09:24:50,365 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:24:50,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1554890132, now seen corresponding path program 8 times [2023-08-24 09:24:50,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:24:50,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244893113] [2023-08-24 09:24:50,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:24:50,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:24:50,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:24:50,990 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 09:24:50,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:24:50,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244893113] [2023-08-24 09:24:50,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244893113] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:24:50,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462837150] [2023-08-24 09:24:50,991 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 09:24:50,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:24:50,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:24:50,993 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 09:24:51,021 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 09:24:51,112 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 09:24:51,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:24:51,114 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 34 conjunts are in the unsatisfiable core [2023-08-24 09:24:51,115 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:24:51,503 INFO L322 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2023-08-24 09:24:51,503 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 73 treesize of output 59 [2023-08-24 09:24:51,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 09:24:51,620 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:24:51,822 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:24:51,822 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 101 treesize of output 69 [2023-08-24 09:24:52,128 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 09:24:52,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462837150] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:24:52,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:24:52,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 24 [2023-08-24 09:24:52,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782453761] [2023-08-24 09:24:52,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:24:52,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-24 09:24:52,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:24:52,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-24 09:24:52,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2023-08-24 09:24:52,131 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 276 [2023-08-24 09:24:52,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 667 transitions, 8459 flow. Second operand has 26 states, 26 states have (on average 81.65384615384616) internal successors, (2123), 26 states have internal predecessors, (2123), 0 states have call successors, (0), 0 states 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 09:24:52,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:24:52,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 276 [2023-08-24 09:24:52,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:24:54,083 INFO L124 PetriNetUnfolderBase]: 3510/5256 cut-off events. [2023-08-24 09:24:54,083 INFO L125 PetriNetUnfolderBase]: For 60823/60823 co-relation queries the response was YES. [2023-08-24 09:24:54,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37172 conditions, 5256 events. 3510/5256 cut-off events. For 60823/60823 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 26924 event pairs, 359 based on Foata normal form. 26/5270 useless extension candidates. Maximal degree in co-relation 37017. Up to 4041 conditions per place. [2023-08-24 09:24:54,134 INFO L140 encePairwiseOnDemand]: 263/276 looper letters, 525 selfloop transitions, 281 changer transitions 7/813 dead transitions. [2023-08-24 09:24:54,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 813 transitions, 11553 flow [2023-08-24 09:24:54,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-08-24 09:24:54,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-08-24 09:24:54,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 2419 transitions. [2023-08-24 09:24:54,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3130175983436853 [2023-08-24 09:24:54,138 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 2419 transitions. [2023-08-24 09:24:54,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 2419 transitions. [2023-08-24 09:24:54,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:24:54,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 2419 transitions. [2023-08-24 09:24:54,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 86.39285714285714) internal successors, (2419), 28 states have internal predecessors, (2419), 0 states have call successors, (0), 0 states 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 09:24:54,149 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 276.0) internal successors, (8004), 29 states have internal predecessors, (8004), 0 states have call successors, (0), 0 states 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 09:24:54,150 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 276.0) internal successors, (8004), 29 states have internal predecessors, (8004), 0 states have call successors, (0), 0 states 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 09:24:54,150 INFO L175 Difference]: Start difference. First operand has 218 places, 667 transitions, 8459 flow. Second operand 28 states and 2419 transitions. [2023-08-24 09:24:54,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 813 transitions, 11553 flow [2023-08-24 09:24:54,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 813 transitions, 10900 flow, removed 249 selfloop flow, removed 9 redundant places. [2023-08-24 09:24:54,456 INFO L231 Difference]: Finished difference. Result has 245 places, 700 transitions, 9062 flow [2023-08-24 09:24:54,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=7536, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=647, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=235, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=403, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=9062, PETRI_PLACES=245, PETRI_TRANSITIONS=700} [2023-08-24 09:24:54,458 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 215 predicate places. [2023-08-24 09:24:54,458 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 700 transitions, 9062 flow [2023-08-24 09:24:54,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 81.65384615384616) internal successors, (2123), 26 states have internal predecessors, (2123), 0 states have call successors, (0), 0 states 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 09:24:54,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:24:54,459 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] [2023-08-24 09:24:54,465 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 09:24:54,664 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,SelfDestructingSolverStorable11 [2023-08-24 09:24:54,665 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 1 more)] === [2023-08-24 09:24:54,665 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:24:54,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1973822188, now seen corresponding path program 9 times [2023-08-24 09:24:54,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:24:54,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007740078] [2023-08-24 09:24:54,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:24:54,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:24:54,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:24:54,764 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 09:24:54,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:24:54,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007740078] [2023-08-24 09:24:54,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007740078] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:24:54,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153485003] [2023-08-24 09:24:54,764 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 09:24:54,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:24:54,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:24:54,765 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 09:24:54,768 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 09:24:54,873 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-24 09:24:54,873 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:24:54,874 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-24 09:24:54,875 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:24:54,957 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 09:24:54,957 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:24:55,018 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 09:24:55,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [153485003] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:24:55,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:24:55,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-08-24 09:24:55,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780863050] [2023-08-24 09:24:55,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:24:55,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-24 09:24:55,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:24:55,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-24 09:24:55,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-08-24 09:24:55,021 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 276 [2023-08-24 09:24:55,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 700 transitions, 9062 flow. Second operand has 14 states, 14 states have (on average 110.07142857142857) internal successors, (1541), 14 states have internal predecessors, (1541), 0 states have call successors, (0), 0 states 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 09:24:55,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:24:55,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 276 [2023-08-24 09:24:55,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:24:56,052 INFO L124 PetriNetUnfolderBase]: 3461/5169 cut-off events. [2023-08-24 09:24:56,052 INFO L125 PetriNetUnfolderBase]: For 66767/67048 co-relation queries the response was YES. [2023-08-24 09:24:56,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37907 conditions, 5169 events. 3461/5169 cut-off events. For 66767/67048 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 27599 event pairs, 607 based on Foata normal form. 284/5260 useless extension candidates. Maximal degree in co-relation 37767. Up to 3126 conditions per place. [2023-08-24 09:24:56,105 INFO L140 encePairwiseOnDemand]: 270/276 looper letters, 733 selfloop transitions, 90 changer transitions 2/881 dead transitions. [2023-08-24 09:24:56,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 881 transitions, 12598 flow [2023-08-24 09:24:56,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 09:24:56,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 09:24:56,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 921 transitions. [2023-08-24 09:24:56,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4171195652173913 [2023-08-24 09:24:56,108 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 921 transitions. [2023-08-24 09:24:56,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 921 transitions. [2023-08-24 09:24:56,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:24:56,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 921 transitions. [2023-08-24 09:24:56,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 115.125) internal successors, (921), 8 states have internal predecessors, (921), 0 states have call successors, (0), 0 states 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 09:24:56,111 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 276.0) internal successors, (2484), 9 states have internal predecessors, (2484), 0 states have call successors, (0), 0 states 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 09:24:56,111 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 276.0) internal successors, (2484), 9 states have internal predecessors, (2484), 0 states have call successors, (0), 0 states 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 09:24:56,112 INFO L175 Difference]: Start difference. First operand has 245 places, 700 transitions, 9062 flow. Second operand 8 states and 921 transitions. [2023-08-24 09:24:56,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 881 transitions, 12598 flow [2023-08-24 09:24:56,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 881 transitions, 11809 flow, removed 306 selfloop flow, removed 15 redundant places. [2023-08-24 09:24:56,522 INFO L231 Difference]: Finished difference. Result has 240 places, 696 transitions, 8764 flow [2023-08-24 09:24:56,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=8169, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=682, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=592, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8764, PETRI_PLACES=240, PETRI_TRANSITIONS=696} [2023-08-24 09:24:56,523 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 210 predicate places. [2023-08-24 09:24:56,523 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 696 transitions, 8764 flow [2023-08-24 09:24:56,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 110.07142857142857) internal successors, (1541), 14 states have internal predecessors, (1541), 0 states have call successors, (0), 0 states 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 09:24:56,524 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:24:56,524 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] [2023-08-24 09:24:56,532 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 09:24:56,729 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,SelfDestructingSolverStorable12 [2023-08-24 09:24:56,729 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 1 more)] === [2023-08-24 09:24:56,730 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:24:56,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1080517417, now seen corresponding path program 10 times [2023-08-24 09:24:56,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:24:56,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793097115] [2023-08-24 09:24:56,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:24:56,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:24:56,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:24:56,866 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 09:24:56,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:24:56,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793097115] [2023-08-24 09:24:56,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793097115] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:24:56,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163272343] [2023-08-24 09:24:56,867 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-24 09:24:56,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:24:56,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:24:56,869 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 09:24:56,892 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 09:24:56,958 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-24 09:24:56,958 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:24:56,959 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-24 09:24:56,960 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:24:57,057 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 09:24:57,057 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:24:57,129 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 09:24:57,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163272343] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:24:57,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:24:57,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 19 [2023-08-24 09:24:57,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123466061] [2023-08-24 09:24:57,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:24:57,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-24 09:24:57,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:24:57,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-24 09:24:57,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2023-08-24 09:24:57,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 276 [2023-08-24 09:24:57,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 696 transitions, 8764 flow. Second operand has 19 states, 19 states have (on average 97.73684210526316) internal successors, (1857), 19 states have internal predecessors, (1857), 0 states have call successors, (0), 0 states 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 09:24:57,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:24:57,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 276 [2023-08-24 09:24:57,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:24:58,431 INFO L124 PetriNetUnfolderBase]: 3410/5146 cut-off events. [2023-08-24 09:24:58,432 INFO L125 PetriNetUnfolderBase]: For 67533/67533 co-relation queries the response was YES. [2023-08-24 09:24:58,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38077 conditions, 5146 events. 3410/5146 cut-off events. For 67533/67533 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 26809 event pairs, 412 based on Foata normal form. 337/5477 useless extension candidates. Maximal degree in co-relation 37917. Up to 2319 conditions per place. [2023-08-24 09:24:58,467 INFO L140 encePairwiseOnDemand]: 264/276 looper letters, 704 selfloop transitions, 221 changer transitions 24/949 dead transitions. [2023-08-24 09:24:58,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 949 transitions, 13776 flow [2023-08-24 09:24:58,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-24 09:24:58,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-24 09:24:58,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1977 transitions. [2023-08-24 09:24:58,470 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37700228832951943 [2023-08-24 09:24:58,470 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 1977 transitions. [2023-08-24 09:24:58,471 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 1977 transitions. [2023-08-24 09:24:58,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:24:58,471 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 1977 transitions. [2023-08-24 09:24:58,473 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 104.05263157894737) internal successors, (1977), 19 states have internal predecessors, (1977), 0 states have call successors, (0), 0 states 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 09:24:58,478 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 276.0) internal successors, (5520), 20 states have internal predecessors, (5520), 0 states have call successors, (0), 0 states 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 09:24:58,478 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 276.0) internal successors, (5520), 20 states have internal predecessors, (5520), 0 states have call successors, (0), 0 states 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 09:24:58,478 INFO L175 Difference]: Start difference. First operand has 240 places, 696 transitions, 8764 flow. Second operand 19 states and 1977 transitions. [2023-08-24 09:24:58,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 949 transitions, 13776 flow [2023-08-24 09:24:58,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 949 transitions, 13413 flow, removed 144 selfloop flow, removed 9 redundant places. [2023-08-24 09:24:58,827 INFO L231 Difference]: Finished difference. Result has 261 places, 680 transitions, 9201 flow [2023-08-24 09:24:58,827 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=7582, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=613, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=146, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=434, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=9201, PETRI_PLACES=261, PETRI_TRANSITIONS=680} [2023-08-24 09:24:58,827 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 231 predicate places. [2023-08-24 09:24:58,827 INFO L495 AbstractCegarLoop]: Abstraction has has 261 places, 680 transitions, 9201 flow [2023-08-24 09:24:58,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 97.73684210526316) internal successors, (1857), 19 states have internal predecessors, (1857), 0 states have call successors, (0), 0 states 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 09:24:58,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:24:58,828 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] [2023-08-24 09:24:58,833 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 09:24:59,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-08-24 09:24:59,029 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 1 more)] === [2023-08-24 09:24:59,029 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:24:59,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1959887204, now seen corresponding path program 1 times [2023-08-24 09:24:59,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:24:59,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664034023] [2023-08-24 09:24:59,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:24:59,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:24:59,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:24:59,133 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 09:24:59,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:24:59,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664034023] [2023-08-24 09:24:59,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664034023] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:24:59,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137170824] [2023-08-24 09:24:59,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:24:59,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:24:59,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:24:59,137 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 09:24:59,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-24 09:24:59,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:24:59,242 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-24 09:24:59,243 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:24:59,332 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 09:24:59,332 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:24:59,419 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 09:24:59,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137170824] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:24:59,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:24:59,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2023-08-24 09:24:59,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177729650] [2023-08-24 09:24:59,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:24:59,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-24 09:24:59,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:24:59,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-24 09:24:59,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=236, Unknown=0, NotChecked=0, Total=306 [2023-08-24 09:24:59,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 276 [2023-08-24 09:24:59,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 680 transitions, 9201 flow. Second operand has 18 states, 18 states have (on average 101.27777777777777) internal successors, (1823), 18 states have internal predecessors, (1823), 0 states have call successors, (0), 0 states 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 09:24:59,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:24:59,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 276 [2023-08-24 09:24:59,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:25:00,721 INFO L124 PetriNetUnfolderBase]: 3667/5542 cut-off events. [2023-08-24 09:25:00,721 INFO L125 PetriNetUnfolderBase]: For 97858/97941 co-relation queries the response was YES. [2023-08-24 09:25:00,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44824 conditions, 5542 events. 3667/5542 cut-off events. For 97858/97941 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 29778 event pairs, 772 based on Foata normal form. 160/5681 useless extension candidates. Maximal degree in co-relation 44657. Up to 2675 conditions per place. [2023-08-24 09:25:00,766 INFO L140 encePairwiseOnDemand]: 267/276 looper letters, 663 selfloop transitions, 139 changer transitions 23/844 dead transitions. [2023-08-24 09:25:00,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 844 transitions, 12950 flow [2023-08-24 09:25:00,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-24 09:25:00,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-24 09:25:00,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1400 transitions. [2023-08-24 09:25:00,769 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39018952062430323 [2023-08-24 09:25:00,769 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1400 transitions. [2023-08-24 09:25:00,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1400 transitions. [2023-08-24 09:25:00,769 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:25:00,769 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1400 transitions. [2023-08-24 09:25:00,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 107.6923076923077) internal successors, (1400), 13 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states 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 09:25:00,773 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 276.0) internal successors, (3864), 14 states have internal predecessors, (3864), 0 states have call successors, (0), 0 states 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 09:25:00,774 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 276.0) internal successors, (3864), 14 states have internal predecessors, (3864), 0 states have call successors, (0), 0 states 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 09:25:00,774 INFO L175 Difference]: Start difference. First operand has 261 places, 680 transitions, 9201 flow. Second operand 13 states and 1400 transitions. [2023-08-24 09:25:00,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 844 transitions, 12950 flow [2023-08-24 09:25:01,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 844 transitions, 12360 flow, removed 170 selfloop flow, removed 6 redundant places. [2023-08-24 09:25:01,390 INFO L231 Difference]: Finished difference. Result has 276 places, 708 transitions, 9898 flow [2023-08-24 09:25:01,390 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=8621, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=550, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=9898, PETRI_PLACES=276, PETRI_TRANSITIONS=708} [2023-08-24 09:25:01,391 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 246 predicate places. [2023-08-24 09:25:01,391 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 708 transitions, 9898 flow [2023-08-24 09:25:01,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 101.27777777777777) internal successors, (1823), 18 states have internal predecessors, (1823), 0 states have call successors, (0), 0 states 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 09:25:01,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:25:01,391 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] [2023-08-24 09:25:01,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-24 09:25:01,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-24 09:25:01,600 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 1 more)] === [2023-08-24 09:25:01,600 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:25:01,600 INFO L85 PathProgramCache]: Analyzing trace with hash 315488050, now seen corresponding path program 2 times [2023-08-24 09:25:01,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:25:01,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659761123] [2023-08-24 09:25:01,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:25:01,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:25:01,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:25:01,700 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 09:25:01,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:25:01,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659761123] [2023-08-24 09:25:01,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [659761123] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:25:01,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012037148] [2023-08-24 09:25:01,701 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 09:25:01,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:25:01,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:25:01,705 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 09:25:01,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-24 09:25:01,811 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 09:25:01,811 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:25:01,812 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 12 conjunts are in the unsatisfiable core [2023-08-24 09:25:01,813 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:25:01,887 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 09:25:01,887 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:25:01,937 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 09:25:01,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012037148] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:25:01,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:25:01,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 14 [2023-08-24 09:25:01,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416457165] [2023-08-24 09:25:01,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:25:01,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-24 09:25:01,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:25:01,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-24 09:25:01,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2023-08-24 09:25:01,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 276 [2023-08-24 09:25:01,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 708 transitions, 9898 flow. Second operand has 15 states, 15 states have (on average 102.66666666666667) internal successors, (1540), 15 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states 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 09:25:01,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:25:01,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 276 [2023-08-24 09:25:01,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:25:02,973 INFO L124 PetriNetUnfolderBase]: 3206/4956 cut-off events. [2023-08-24 09:25:02,974 INFO L125 PetriNetUnfolderBase]: For 98109/98179 co-relation queries the response was YES. [2023-08-24 09:25:03,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40594 conditions, 4956 events. 3206/4956 cut-off events. For 98109/98179 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 27110 event pairs, 565 based on Foata normal form. 202/5147 useless extension candidates. Maximal degree in co-relation 40419. Up to 2378 conditions per place. [2023-08-24 09:25:03,018 INFO L140 encePairwiseOnDemand]: 268/276 looper letters, 614 selfloop transitions, 89 changer transitions 19/741 dead transitions. [2023-08-24 09:25:03,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 741 transitions, 11324 flow [2023-08-24 09:25:03,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 09:25:03,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 09:25:03,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 863 transitions. [2023-08-24 09:25:03,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3908514492753623 [2023-08-24 09:25:03,021 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 863 transitions. [2023-08-24 09:25:03,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 863 transitions. [2023-08-24 09:25:03,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:25:03,021 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 863 transitions. [2023-08-24 09:25:03,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 107.875) internal successors, (863), 8 states have internal predecessors, (863), 0 states have call successors, (0), 0 states 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 09:25:03,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 276.0) internal successors, (2484), 9 states have internal predecessors, (2484), 0 states have call successors, (0), 0 states 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 09:25:03,024 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 276.0) internal successors, (2484), 9 states have internal predecessors, (2484), 0 states have call successors, (0), 0 states 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 09:25:03,024 INFO L175 Difference]: Start difference. First operand has 276 places, 708 transitions, 9898 flow. Second operand 8 states and 863 transitions. [2023-08-24 09:25:03,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 741 transitions, 11324 flow [2023-08-24 09:25:03,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 741 transitions, 10888 flow, removed 93 selfloop flow, removed 11 redundant places. [2023-08-24 09:25:03,730 INFO L231 Difference]: Finished difference. Result has 269 places, 659 transitions, 8916 flow [2023-08-24 09:25:03,730 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=8556, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=655, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=571, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=8916, PETRI_PLACES=269, PETRI_TRANSITIONS=659} [2023-08-24 09:25:03,730 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 239 predicate places. [2023-08-24 09:25:03,731 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 659 transitions, 8916 flow [2023-08-24 09:25:03,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 102.66666666666667) internal successors, (1540), 15 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states 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 09:25:03,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:25:03,731 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] [2023-08-24 09:25:03,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-08-24 09:25:03,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:25:03,939 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 1 more)] === [2023-08-24 09:25:03,939 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:25:03,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1454024461, now seen corresponding path program 11 times [2023-08-24 09:25:03,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:25:03,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338395119] [2023-08-24 09:25:03,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:25:03,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:25:03,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:25:04,051 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 09:25:04,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:25:04,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338395119] [2023-08-24 09:25:04,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338395119] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:25:04,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469087593] [2023-08-24 09:25:04,052 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-24 09:25:04,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:25:04,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:25:04,057 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 09:25:04,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-08-24 09:25:04,166 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-08-24 09:25:04,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:25:04,168 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-24 09:25:04,169 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:25:04,292 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 09:25:04,292 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:25:04,417 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 09:25:04,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469087593] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:25:04,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:25:04,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 19 [2023-08-24 09:25:04,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506517593] [2023-08-24 09:25:04,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:25:04,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-24 09:25:04,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:25:04,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-24 09:25:04,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2023-08-24 09:25:04,420 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 276 [2023-08-24 09:25:04,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 659 transitions, 8916 flow. Second operand has 19 states, 19 states have (on average 101.78947368421052) internal successors, (1934), 19 states have internal predecessors, (1934), 0 states have call successors, (0), 0 states 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 09:25:04,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:25:04,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 276 [2023-08-24 09:25:04,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:25:05,739 INFO L124 PetriNetUnfolderBase]: 2998/4696 cut-off events. [2023-08-24 09:25:05,739 INFO L125 PetriNetUnfolderBase]: For 84697/84817 co-relation queries the response was YES. [2023-08-24 09:25:05,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38912 conditions, 4696 events. 2998/4696 cut-off events. For 84697/84817 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 26481 event pairs, 437 based on Foata normal form. 357/5007 useless extension candidates. Maximal degree in co-relation 38774. Up to 2198 conditions per place. [2023-08-24 09:25:05,779 INFO L140 encePairwiseOnDemand]: 267/276 looper letters, 396 selfloop transitions, 150 changer transitions 285/842 dead transitions. [2023-08-24 09:25:05,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 842 transitions, 13528 flow [2023-08-24 09:25:05,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-08-24 09:25:05,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-08-24 09:25:05,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 2532 transitions. [2023-08-24 09:25:05,783 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3822463768115942 [2023-08-24 09:25:05,783 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 2532 transitions. [2023-08-24 09:25:05,783 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 2532 transitions. [2023-08-24 09:25:05,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:25:05,784 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 2532 transitions. [2023-08-24 09:25:05,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 105.5) internal successors, (2532), 24 states have internal predecessors, (2532), 0 states have call successors, (0), 0 states 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 09:25:05,790 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 276.0) internal successors, (6900), 25 states have internal predecessors, (6900), 0 states have call successors, (0), 0 states 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 09:25:05,791 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 276.0) internal successors, (6900), 25 states have internal predecessors, (6900), 0 states have call successors, (0), 0 states 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 09:25:05,791 INFO L175 Difference]: Start difference. First operand has 269 places, 659 transitions, 8916 flow. Second operand 24 states and 2532 transitions. [2023-08-24 09:25:05,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 842 transitions, 13528 flow [2023-08-24 09:25:06,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 842 transitions, 13193 flow, removed 73 selfloop flow, removed 7 redundant places. [2023-08-24 09:25:06,321 INFO L231 Difference]: Finished difference. Result has 290 places, 471 transitions, 6418 flow [2023-08-24 09:25:06,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=8330, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=625, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=512, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=6418, PETRI_PLACES=290, PETRI_TRANSITIONS=471} [2023-08-24 09:25:06,322 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 260 predicate places. [2023-08-24 09:25:06,322 INFO L495 AbstractCegarLoop]: Abstraction has has 290 places, 471 transitions, 6418 flow [2023-08-24 09:25:06,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 101.78947368421052) internal successors, (1934), 19 states have internal predecessors, (1934), 0 states have call successors, (0), 0 states 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 09:25:06,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:25:06,323 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] [2023-08-24 09:25:06,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-08-24 09:25:06,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-24 09:25:06,528 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 1 more)] === [2023-08-24 09:25:06,529 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:25:06,529 INFO L85 PathProgramCache]: Analyzing trace with hash 734929121, now seen corresponding path program 12 times [2023-08-24 09:25:06,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:25:06,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236364113] [2023-08-24 09:25:06,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:25:06,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:25:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:25:06,655 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 09:25:06,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:25:06,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236364113] [2023-08-24 09:25:06,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236364113] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:25:06,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243842934] [2023-08-24 09:25:06,655 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-24 09:25:06,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:25:06,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:25:06,657 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 09:25:06,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-08-24 09:25:06,757 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-08-24 09:25:06,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:25:06,758 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-24 09:25:06,759 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:25:06,848 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 09:25:06,849 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:25:06,944 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 09:25:06,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243842934] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:25:06,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:25:06,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 19 [2023-08-24 09:25:06,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490686396] [2023-08-24 09:25:06,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:25:06,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-24 09:25:06,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:25:06,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-24 09:25:06,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2023-08-24 09:25:06,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 276 [2023-08-24 09:25:06,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 471 transitions, 6418 flow. Second operand has 20 states, 20 states have (on average 100.9) internal successors, (2018), 20 states have internal predecessors, (2018), 0 states have call successors, (0), 0 states 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 09:25:06,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:25:06,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 276 [2023-08-24 09:25:06,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:25:07,970 INFO L124 PetriNetUnfolderBase]: 3010/4380 cut-off events. [2023-08-24 09:25:07,970 INFO L125 PetriNetUnfolderBase]: For 105009/105037 co-relation queries the response was YES. [2023-08-24 09:25:07,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42037 conditions, 4380 events. 3010/4380 cut-off events. For 105009/105037 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 20810 event pairs, 317 based on Foata normal form. 35/4402 useless extension candidates. Maximal degree in co-relation 41941. Up to 2402 conditions per place. [2023-08-24 09:25:08,015 INFO L140 encePairwiseOnDemand]: 267/276 looper letters, 542 selfloop transitions, 272 changer transitions 0/821 dead transitions. [2023-08-24 09:25:08,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 821 transitions, 13298 flow [2023-08-24 09:25:08,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-08-24 09:25:08,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-08-24 09:25:08,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2029 transitions. [2023-08-24 09:25:08,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38691838291380626 [2023-08-24 09:25:08,018 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2029 transitions. [2023-08-24 09:25:08,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2029 transitions. [2023-08-24 09:25:08,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:25:08,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2029 transitions. [2023-08-24 09:25:08,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 106.78947368421052) internal successors, (2029), 19 states have internal predecessors, (2029), 0 states have call successors, (0), 0 states 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 09:25:08,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 276.0) internal successors, (5520), 20 states have internal predecessors, (5520), 0 states have call successors, (0), 0 states 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 09:25:08,024 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 276.0) internal successors, (5520), 20 states have internal predecessors, (5520), 0 states have call successors, (0), 0 states 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 09:25:08,024 INFO L175 Difference]: Start difference. First operand has 290 places, 471 transitions, 6418 flow. Second operand 19 states and 2029 transitions. [2023-08-24 09:25:08,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 821 transitions, 13298 flow [2023-08-24 09:25:08,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 821 transitions, 11235 flow, removed 780 selfloop flow, removed 39 redundant places. [2023-08-24 09:25:08,595 INFO L231 Difference]: Finished difference. Result has 228 places, 568 transitions, 7596 flow [2023-08-24 09:25:08,595 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=5269, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=181, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=7596, PETRI_PLACES=228, PETRI_TRANSITIONS=568} [2023-08-24 09:25:08,596 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 198 predicate places. [2023-08-24 09:25:08,596 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 568 transitions, 7596 flow [2023-08-24 09:25:08,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 100.9) internal successors, (2018), 20 states have internal predecessors, (2018), 0 states have call successors, (0), 0 states 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 09:25:08,596 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:25:08,596 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] [2023-08-24 09:25:08,601 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-08-24 09:25:08,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-24 09:25:08,797 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 09:25:08,797 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:25:08,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1122624719, now seen corresponding path program 13 times [2023-08-24 09:25:08,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:25:08,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737507326] [2023-08-24 09:25:08,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:25:08,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:25:08,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:25:08,909 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 09:25:08,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:25:08,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737507326] [2023-08-24 09:25:08,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737507326] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:25:08,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1562801805] [2023-08-24 09:25:08,910 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-24 09:25:08,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:25:08,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:25:08,913 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 09:25:08,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-08-24 09:25:09,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:25:09,010 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-24 09:25:09,011 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:25:09,107 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 09:25:09,108 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:25:09,182 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 09:25:09,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1562801805] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:25:09,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:25:09,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2023-08-24 09:25:09,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716810248] [2023-08-24 09:25:09,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:25:09,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-24 09:25:09,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:25:09,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-24 09:25:09,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2023-08-24 09:25:09,184 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 276 [2023-08-24 09:25:09,185 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 568 transitions, 7596 flow. Second operand has 18 states, 18 states have (on average 101.22222222222223) internal successors, (1822), 18 states have internal predecessors, (1822), 0 states have call successors, (0), 0 states 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 09:25:09,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:25:09,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 276 [2023-08-24 09:25:09,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:25:10,103 INFO L124 PetriNetUnfolderBase]: 3443/5003 cut-off events. [2023-08-24 09:25:10,103 INFO L125 PetriNetUnfolderBase]: For 92864/92898 co-relation queries the response was YES. [2023-08-24 09:25:10,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44791 conditions, 5003 events. 3443/5003 cut-off events. For 92864/92898 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 24171 event pairs, 421 based on Foata normal form. 64/5058 useless extension candidates. Maximal degree in co-relation 44717. Up to 2926 conditions per place. [2023-08-24 09:25:10,148 INFO L140 encePairwiseOnDemand]: 267/276 looper letters, 546 selfloop transitions, 136 changer transitions 0/688 dead transitions. [2023-08-24 09:25:10,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 688 transitions, 10963 flow [2023-08-24 09:25:10,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-24 09:25:10,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-24 09:25:10,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1058 transitions. [2023-08-24 09:25:10,150 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38333333333333336 [2023-08-24 09:25:10,150 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1058 transitions. [2023-08-24 09:25:10,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1058 transitions. [2023-08-24 09:25:10,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:25:10,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1058 transitions. [2023-08-24 09:25:10,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 105.8) internal successors, (1058), 10 states have internal predecessors, (1058), 0 states have call successors, (0), 0 states 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 09:25:10,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 276.0) internal successors, (3036), 11 states have internal predecessors, (3036), 0 states have call successors, (0), 0 states 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 09:25:10,153 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 276.0) internal successors, (3036), 11 states have internal predecessors, (3036), 0 states have call successors, (0), 0 states 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 09:25:10,153 INFO L175 Difference]: Start difference. First operand has 228 places, 568 transitions, 7596 flow. Second operand 10 states and 1058 transitions. [2023-08-24 09:25:10,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 688 transitions, 10963 flow [2023-08-24 09:25:10,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 688 transitions, 10433 flow, removed 233 selfloop flow, removed 7 redundant places. [2023-08-24 09:25:10,768 INFO L231 Difference]: Finished difference. Result has 225 places, 552 transitions, 7643 flow [2023-08-24 09:25:10,768 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=6934, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7643, PETRI_PLACES=225, PETRI_TRANSITIONS=552} [2023-08-24 09:25:10,768 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 195 predicate places. [2023-08-24 09:25:10,768 INFO L495 AbstractCegarLoop]: Abstraction has has 225 places, 552 transitions, 7643 flow [2023-08-24 09:25:10,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 101.22222222222223) internal successors, (1822), 18 states have internal predecessors, (1822), 0 states have call successors, (0), 0 states 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 09:25:10,769 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:25:10,769 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] [2023-08-24 09:25:10,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-08-24 09:25:10,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:25:10,970 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 09:25:10,970 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:25:10,970 INFO L85 PathProgramCache]: Analyzing trace with hash -537929397, now seen corresponding path program 14 times [2023-08-24 09:25:10,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:25:10,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126704705] [2023-08-24 09:25:10,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:25:10,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:25:10,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:25:11,095 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 09:25:11,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:25:11,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126704705] [2023-08-24 09:25:11,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126704705] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:25:11,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433795514] [2023-08-24 09:25:11,096 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 09:25:11,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:25:11,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:25:11,102 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 09:25:11,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-08-24 09:25:11,237 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 09:25:11,238 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:25:11,239 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-24 09:25:11,240 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:25:11,336 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 09:25:11,336 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:25:11,446 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 09:25:11,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433795514] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:25:11,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:25:11,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2023-08-24 09:25:11,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827573178] [2023-08-24 09:25:11,447 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:25:11,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-24 09:25:11,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:25:11,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-24 09:25:11,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2023-08-24 09:25:11,449 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 276 [2023-08-24 09:25:11,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 552 transitions, 7643 flow. Second operand has 19 states, 19 states have (on average 101.26315789473684) internal successors, (1924), 19 states have internal predecessors, (1924), 0 states have call successors, (0), 0 states 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 09:25:11,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:25:11,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 276 [2023-08-24 09:25:11,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:25:12,518 INFO L124 PetriNetUnfolderBase]: 3503/5106 cut-off events. [2023-08-24 09:25:12,518 INFO L125 PetriNetUnfolderBase]: For 85800/85807 co-relation queries the response was YES. [2023-08-24 09:25:12,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44193 conditions, 5106 events. 3503/5106 cut-off events. For 85800/85807 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 24968 event pairs, 479 based on Foata normal form. 23/5121 useless extension candidates. Maximal degree in co-relation 44117. Up to 2996 conditions per place. [2023-08-24 09:25:12,562 INFO L140 encePairwiseOnDemand]: 267/276 looper letters, 463 selfloop transitions, 223 changer transitions 0/692 dead transitions. [2023-08-24 09:25:12,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 692 transitions, 10757 flow [2023-08-24 09:25:12,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-24 09:25:12,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-24 09:25:12,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1057 transitions. [2023-08-24 09:25:12,566 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3829710144927536 [2023-08-24 09:25:12,566 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1057 transitions. [2023-08-24 09:25:12,566 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1057 transitions. [2023-08-24 09:25:12,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:25:12,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1057 transitions. [2023-08-24 09:25:12,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 105.7) internal successors, (1057), 10 states have internal predecessors, (1057), 0 states have call successors, (0), 0 states 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 09:25:12,569 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 276.0) internal successors, (3036), 11 states have internal predecessors, (3036), 0 states have call successors, (0), 0 states 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 09:25:12,570 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 276.0) internal successors, (3036), 11 states have internal predecessors, (3036), 0 states have call successors, (0), 0 states 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 09:25:12,570 INFO L175 Difference]: Start difference. First operand has 225 places, 552 transitions, 7643 flow. Second operand 10 states and 1057 transitions. [2023-08-24 09:25:12,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 692 transitions, 10757 flow [2023-08-24 09:25:13,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 692 transitions, 10304 flow, removed 158 selfloop flow, removed 7 redundant places. [2023-08-24 09:25:13,094 INFO L231 Difference]: Finished difference. Result has 228 places, 554 transitions, 7811 flow [2023-08-24 09:25:13,095 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=7317, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=552, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=221, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7811, PETRI_PLACES=228, PETRI_TRANSITIONS=554} [2023-08-24 09:25:13,095 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 198 predicate places. [2023-08-24 09:25:13,095 INFO L495 AbstractCegarLoop]: Abstraction has has 228 places, 554 transitions, 7811 flow [2023-08-24 09:25:13,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 101.26315789473684) internal successors, (1924), 19 states have internal predecessors, (1924), 0 states have call successors, (0), 0 states 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 09:25:13,095 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:25:13,095 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] [2023-08-24 09:25:13,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-08-24 09:25:13,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:25:13,296 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 09:25:13,296 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:25:13,296 INFO L85 PathProgramCache]: Analyzing trace with hash -126291829, now seen corresponding path program 15 times [2023-08-24 09:25:13,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:25:13,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122569540] [2023-08-24 09:25:13,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:25:13,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:25:13,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:25:13,409 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 09:25:13,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:25:13,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122569540] [2023-08-24 09:25:13,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122569540] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:25:13,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617024173] [2023-08-24 09:25:13,410 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 09:25:13,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:25:13,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:25:13,413 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 09:25:13,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-08-24 09:25:13,547 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-24 09:25:13,547 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:25:13,548 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-24 09:25:13,549 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:25:13,674 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 09:25:13,674 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:25:13,779 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 09:25:13,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617024173] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:25:13,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:25:13,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2023-08-24 09:25:13,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626181582] [2023-08-24 09:25:13,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:25:13,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-24 09:25:13,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:25:13,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-24 09:25:13,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2023-08-24 09:25:13,782 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 276 [2023-08-24 09:25:13,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 554 transitions, 7811 flow. Second operand has 19 states, 19 states have (on average 101.05263157894737) internal successors, (1920), 19 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states 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 09:25:13,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:25:13,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 276 [2023-08-24 09:25:13,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:25:14,714 INFO L124 PetriNetUnfolderBase]: 3544/5175 cut-off events. [2023-08-24 09:25:14,715 INFO L125 PetriNetUnfolderBase]: For 74920/74943 co-relation queries the response was YES. [2023-08-24 09:25:14,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42163 conditions, 5175 events. 3544/5175 cut-off events. For 74920/74943 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 25295 event pairs, 784 based on Foata normal form. 33/5196 useless extension candidates. Maximal degree in co-relation 42088. Up to 4100 conditions per place. [2023-08-24 09:25:14,758 INFO L140 encePairwiseOnDemand]: 267/276 looper letters, 487 selfloop transitions, 169 changer transitions 0/662 dead transitions. [2023-08-24 09:25:14,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 662 transitions, 10332 flow [2023-08-24 09:25:14,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-24 09:25:14,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-24 09:25:14,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1051 transitions. [2023-08-24 09:25:14,760 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38079710144927537 [2023-08-24 09:25:14,760 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1051 transitions. [2023-08-24 09:25:14,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1051 transitions. [2023-08-24 09:25:14,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:25:14,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1051 transitions. [2023-08-24 09:25:14,761 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 105.1) internal successors, (1051), 10 states have internal predecessors, (1051), 0 states have call successors, (0), 0 states 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 09:25:14,763 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 276.0) internal successors, (3036), 11 states have internal predecessors, (3036), 0 states have call successors, (0), 0 states 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 09:25:14,763 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 276.0) internal successors, (3036), 11 states have internal predecessors, (3036), 0 states have call successors, (0), 0 states 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 09:25:14,763 INFO L175 Difference]: Start difference. First operand has 228 places, 554 transitions, 7811 flow. Second operand 10 states and 1051 transitions. [2023-08-24 09:25:14,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 662 transitions, 10332 flow [2023-08-24 09:25:15,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 662 transitions, 9915 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-08-24 09:25:15,219 INFO L231 Difference]: Finished difference. Result has 231 places, 557 transitions, 7832 flow [2023-08-24 09:25:15,220 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=7400, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=554, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=166, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=385, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=7832, PETRI_PLACES=231, PETRI_TRANSITIONS=557} [2023-08-24 09:25:15,220 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 201 predicate places. [2023-08-24 09:25:15,220 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 557 transitions, 7832 flow [2023-08-24 09:25:15,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 101.05263157894737) internal successors, (1920), 19 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states 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 09:25:15,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:25:15,221 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] [2023-08-24 09:25:15,229 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-08-24 09:25:15,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:25:15,427 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 09:25:15,427 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:25:15,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1384238067, now seen corresponding path program 16 times [2023-08-24 09:25:15,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:25:15,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900315063] [2023-08-24 09:25:15,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:25:15,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:25:15,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:25:15,543 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 09:25:15,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:25:15,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900315063] [2023-08-24 09:25:15,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900315063] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:25:15,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075715758] [2023-08-24 09:25:15,544 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-24 09:25:15,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:25:15,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:25:15,548 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 09:25:15,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-08-24 09:25:15,671 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-24 09:25:15,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:25:15,672 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-24 09:25:15,673 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:25:15,751 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 09:25:15,751 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:25:15,835 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 09:25:15,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075715758] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:25:15,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:25:15,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 19 [2023-08-24 09:25:15,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459943838] [2023-08-24 09:25:15,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:25:15,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-24 09:25:15,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:25:15,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-24 09:25:15,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2023-08-24 09:25:15,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 276 [2023-08-24 09:25:15,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 557 transitions, 7832 flow. Second operand has 19 states, 19 states have (on average 97.42105263157895) internal successors, (1851), 19 states have internal predecessors, (1851), 0 states have call successors, (0), 0 states 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 09:25:15,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:25:15,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 276 [2023-08-24 09:25:15,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:25:17,563 INFO L124 PetriNetUnfolderBase]: 3570/5186 cut-off events. [2023-08-24 09:25:17,563 INFO L125 PetriNetUnfolderBase]: For 68113/68113 co-relation queries the response was YES. [2023-08-24 09:25:17,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42124 conditions, 5186 events. 3570/5186 cut-off events. For 68113/68113 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 25079 event pairs, 147 based on Foata normal form. 16/5202 useless extension candidates. Maximal degree in co-relation 42048. Up to 3012 conditions per place. [2023-08-24 09:25:17,607 INFO L140 encePairwiseOnDemand]: 264/276 looper letters, 439 selfloop transitions, 491 changer transitions 3/933 dead transitions. [2023-08-24 09:25:17,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 933 transitions, 14327 flow [2023-08-24 09:25:17,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2023-08-24 09:25:17,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2023-08-24 09:25:17,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 4161 transitions. [2023-08-24 09:25:17,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36770943796394484 [2023-08-24 09:25:17,611 INFO L72 ComplementDD]: Start complementDD. Operand 41 states and 4161 transitions. [2023-08-24 09:25:17,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 4161 transitions. [2023-08-24 09:25:17,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:25:17,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 41 states and 4161 transitions. [2023-08-24 09:25:17,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 42 states, 41 states have (on average 101.48780487804878) internal successors, (4161), 41 states have internal predecessors, (4161), 0 states have call successors, (0), 0 states 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 09:25:17,624 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 42 states, 42 states have (on average 276.0) internal successors, (11592), 42 states have internal predecessors, (11592), 0 states have call successors, (0), 0 states 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 09:25:17,625 INFO L81 ComplementDD]: Finished complementDD. Result has 42 states, 42 states have (on average 276.0) internal successors, (11592), 42 states have internal predecessors, (11592), 0 states have call successors, (0), 0 states 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 09:25:17,625 INFO L175 Difference]: Start difference. First operand has 231 places, 557 transitions, 7832 flow. Second operand 41 states and 4161 transitions. [2023-08-24 09:25:17,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 933 transitions, 14327 flow [2023-08-24 09:25:18,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 933 transitions, 13945 flow, removed 13 selfloop flow, removed 8 redundant places. [2023-08-24 09:25:18,137 INFO L231 Difference]: Finished difference. Result has 262 places, 690 transitions, 10468 flow [2023-08-24 09:25:18,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=7462, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=555, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=356, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=41, PETRI_FLOW=10468, PETRI_PLACES=262, PETRI_TRANSITIONS=690} [2023-08-24 09:25:18,137 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 232 predicate places. [2023-08-24 09:25:18,138 INFO L495 AbstractCegarLoop]: Abstraction has has 262 places, 690 transitions, 10468 flow [2023-08-24 09:25:18,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 97.42105263157895) internal successors, (1851), 19 states have internal predecessors, (1851), 0 states have call successors, (0), 0 states 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 09:25:18,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:25:18,138 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] [2023-08-24 09:25:18,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-08-24 09:25:18,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-08-24 09:25:18,339 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 09:25:18,339 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:25:18,339 INFO L85 PathProgramCache]: Analyzing trace with hash 53104409, now seen corresponding path program 17 times [2023-08-24 09:25:18,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:25:18,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242199981] [2023-08-24 09:25:18,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:25:18,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:25:18,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:25:18,454 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 09:25:18,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:25:18,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242199981] [2023-08-24 09:25:18,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242199981] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:25:18,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742597313] [2023-08-24 09:25:18,455 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-24 09:25:18,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:25:18,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:25:18,457 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 09:25:18,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-08-24 09:25:18,556 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 09:25:18,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:25:18,557 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-24 09:25:18,558 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:25:18,645 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 09:25:18,646 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:25:18,721 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 09:25:18,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742597313] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:25:18,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:25:18,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 18 [2023-08-24 09:25:18,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639070918] [2023-08-24 09:25:18,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:25:18,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-24 09:25:18,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:25:18,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-24 09:25:18,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2023-08-24 09:25:18,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 276 [2023-08-24 09:25:18,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 690 transitions, 10468 flow. Second operand has 18 states, 18 states have (on average 97.61111111111111) internal successors, (1757), 18 states have internal predecessors, (1757), 0 states have call successors, (0), 0 states 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 09:25:18,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:25:18,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 276 [2023-08-24 09:25:18,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:25:20,433 INFO L124 PetriNetUnfolderBase]: 3660/5344 cut-off events. [2023-08-24 09:25:20,434 INFO L125 PetriNetUnfolderBase]: For 78798/78798 co-relation queries the response was YES. [2023-08-24 09:25:20,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44938 conditions, 5344 events. 3660/5344 cut-off events. For 78798/78798 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 26180 event pairs, 275 based on Foata normal form. 56/5400 useless extension candidates. Maximal degree in co-relation 44862. Up to 3142 conditions per place. [2023-08-24 09:25:20,481 INFO L140 encePairwiseOnDemand]: 264/276 looper letters, 532 selfloop transitions, 470 changer transitions 2/1004 dead transitions. [2023-08-24 09:25:20,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 1004 transitions, 16688 flow [2023-08-24 09:25:20,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-08-24 09:25:20,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2023-08-24 09:25:20,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 3837 transitions. [2023-08-24 09:25:20,485 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36584668192219677 [2023-08-24 09:25:20,485 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 3837 transitions. [2023-08-24 09:25:20,485 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 3837 transitions. [2023-08-24 09:25:20,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:25:20,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 3837 transitions. [2023-08-24 09:25:20,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 100.97368421052632) internal successors, (3837), 38 states have internal predecessors, (3837), 0 states have call successors, (0), 0 states 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 09:25:20,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 276.0) internal successors, (10764), 39 states have internal predecessors, (10764), 0 states have call successors, (0), 0 states 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 09:25:20,497 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 276.0) internal successors, (10764), 39 states have internal predecessors, (10764), 0 states have call successors, (0), 0 states 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 09:25:20,497 INFO L175 Difference]: Start difference. First operand has 262 places, 690 transitions, 10468 flow. Second operand 38 states and 3837 transitions. [2023-08-24 09:25:20,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 1004 transitions, 16688 flow [2023-08-24 09:25:21,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 1004 transitions, 15575 flow, removed 302 selfloop flow, removed 15 redundant places. [2023-08-24 09:25:21,180 INFO L231 Difference]: Finished difference. Result has 291 places, 822 transitions, 13152 flow [2023-08-24 09:25:21,181 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=9412, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=676, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=336, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=13152, PETRI_PLACES=291, PETRI_TRANSITIONS=822} [2023-08-24 09:25:21,181 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 261 predicate places. [2023-08-24 09:25:21,181 INFO L495 AbstractCegarLoop]: Abstraction has has 291 places, 822 transitions, 13152 flow [2023-08-24 09:25:21,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 97.61111111111111) internal successors, (1757), 18 states have internal predecessors, (1757), 0 states have call successors, (0), 0 states 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 09:25:21,181 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:25:21,182 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] [2023-08-24 09:25:21,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-08-24 09:25:21,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-08-24 09:25:21,382 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 09:25:21,383 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:25:21,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1605580587, now seen corresponding path program 18 times [2023-08-24 09:25:21,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:25:21,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479619856] [2023-08-24 09:25:21,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:25:21,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:25:21,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:25:21,495 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 09:25:21,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:25:21,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479619856] [2023-08-24 09:25:21,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479619856] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:25:21,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641116740] [2023-08-24 09:25:21,496 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-24 09:25:21,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:25:21,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:25:21,497 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 09:25:21,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-08-24 09:25:21,621 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-08-24 09:25:21,621 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:25:21,622 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-24 09:25:21,623 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:25:21,732 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 09:25:21,732 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:25:21,850 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 09:25:21,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641116740] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:25:21,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:25:21,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2023-08-24 09:25:21,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595198244] [2023-08-24 09:25:21,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:25:21,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-24 09:25:21,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:25:21,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-24 09:25:21,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2023-08-24 09:25:21,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 276 [2023-08-24 09:25:21,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 822 transitions, 13152 flow. Second operand has 21 states, 21 states have (on average 100.85714285714286) internal successors, (2118), 21 states have internal predecessors, (2118), 0 states have call successors, (0), 0 states 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 09:25:21,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:25:21,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 276 [2023-08-24 09:25:21,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:25:23,104 INFO L124 PetriNetUnfolderBase]: 3549/5178 cut-off events. [2023-08-24 09:25:23,104 INFO L125 PetriNetUnfolderBase]: For 76333/76372 co-relation queries the response was YES. [2023-08-24 09:25:23,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44117 conditions, 5178 events. 3549/5178 cut-off events. For 76333/76372 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 25375 event pairs, 649 based on Foata normal form. 36/5202 useless extension candidates. Maximal degree in co-relation 44033. Up to 3669 conditions per place. [2023-08-24 09:25:23,145 INFO L140 encePairwiseOnDemand]: 267/276 looper letters, 637 selfloop transitions, 236 changer transitions 0/904 dead transitions. [2023-08-24 09:25:23,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 904 transitions, 15649 flow [2023-08-24 09:25:23,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-24 09:25:23,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-24 09:25:23,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1376 transitions. [2023-08-24 09:25:23,147 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3835005574136009 [2023-08-24 09:25:23,147 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1376 transitions. [2023-08-24 09:25:23,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1376 transitions. [2023-08-24 09:25:23,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:25:23,147 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1376 transitions. [2023-08-24 09:25:23,148 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 105.84615384615384) internal successors, (1376), 13 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states 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 09:25:23,150 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 276.0) internal successors, (3864), 14 states have internal predecessors, (3864), 0 states have call successors, (0), 0 states 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 09:25:23,150 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 276.0) internal successors, (3864), 14 states have internal predecessors, (3864), 0 states have call successors, (0), 0 states 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 09:25:23,150 INFO L175 Difference]: Start difference. First operand has 291 places, 822 transitions, 13152 flow. Second operand 13 states and 1376 transitions. [2023-08-24 09:25:23,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 904 transitions, 15649 flow [2023-08-24 09:25:23,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 904 transitions, 14771 flow, removed 291 selfloop flow, removed 6 redundant places. [2023-08-24 09:25:23,849 INFO L231 Difference]: Finished difference. Result has 292 places, 807 transitions, 12485 flow [2023-08-24 09:25:23,850 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=12013, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=807, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=236, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=571, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=12485, PETRI_PLACES=292, PETRI_TRANSITIONS=807} [2023-08-24 09:25:23,850 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 262 predicate places. [2023-08-24 09:25:23,850 INFO L495 AbstractCegarLoop]: Abstraction has has 292 places, 807 transitions, 12485 flow [2023-08-24 09:25:23,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 100.85714285714286) internal successors, (2118), 21 states have internal predecessors, (2118), 0 states have call successors, (0), 0 states 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 09:25:23,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:25:23,851 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] [2023-08-24 09:25:23,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-08-24 09:25:24,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:25:24,056 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 09:25:24,057 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:25:24,057 INFO L85 PathProgramCache]: Analyzing trace with hash 271915285, now seen corresponding path program 19 times [2023-08-24 09:25:24,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:25:24,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538159660] [2023-08-24 09:25:24,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:25:24,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:25:24,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:25:24,163 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 09:25:24,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:25:24,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538159660] [2023-08-24 09:25:24,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538159660] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:25:24,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123721073] [2023-08-24 09:25:24,164 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-24 09:25:24,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:25:24,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:25:24,165 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 09:25:24,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-08-24 09:25:24,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:25:24,271 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-24 09:25:24,271 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:25:24,363 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 09:25:24,363 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:25:24,444 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 09:25:24,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123721073] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:25:24,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:25:24,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2023-08-24 09:25:24,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941937435] [2023-08-24 09:25:24,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:25:24,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-24 09:25:24,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:25:24,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-24 09:25:24,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2023-08-24 09:25:24,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 276 [2023-08-24 09:25:24,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 807 transitions, 12485 flow. Second operand has 19 states, 19 states have (on average 101.05263157894737) internal successors, (1920), 19 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states 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 09:25:24,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:25:24,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 276 [2023-08-24 09:25:24,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:25:25,452 INFO L124 PetriNetUnfolderBase]: 3503/5101 cut-off events. [2023-08-24 09:25:25,452 INFO L125 PetriNetUnfolderBase]: For 68681/68720 co-relation queries the response was YES. [2023-08-24 09:25:25,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42650 conditions, 5101 events. 3503/5101 cut-off events. For 68681/68720 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 24925 event pairs, 699 based on Foata normal form. 48/5131 useless extension candidates. Maximal degree in co-relation 42567. Up to 3929 conditions per place. [2023-08-24 09:25:25,494 INFO L140 encePairwiseOnDemand]: 267/276 looper letters, 666 selfloop transitions, 165 changer transitions 0/861 dead transitions. [2023-08-24 09:25:25,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 861 transitions, 14660 flow [2023-08-24 09:25:25,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-24 09:25:25,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-24 09:25:25,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1052 transitions. [2023-08-24 09:25:25,496 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38115942028985506 [2023-08-24 09:25:25,496 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1052 transitions. [2023-08-24 09:25:25,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1052 transitions. [2023-08-24 09:25:25,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:25:25,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1052 transitions. [2023-08-24 09:25:25,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 105.2) internal successors, (1052), 10 states have internal predecessors, (1052), 0 states have call successors, (0), 0 states 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 09:25:25,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 276.0) internal successors, (3036), 11 states have internal predecessors, (3036), 0 states have call successors, (0), 0 states 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 09:25:25,499 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 276.0) internal successors, (3036), 11 states have internal predecessors, (3036), 0 states have call successors, (0), 0 states 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 09:25:25,499 INFO L175 Difference]: Start difference. First operand has 292 places, 807 transitions, 12485 flow. Second operand 10 states and 1052 transitions. [2023-08-24 09:25:25,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 861 transitions, 14660 flow [2023-08-24 09:25:26,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 861 transitions, 14186 flow, removed 8 selfloop flow, removed 12 redundant places. [2023-08-24 09:25:26,092 INFO L231 Difference]: Finished difference. Result has 285 places, 795 transitions, 12165 flow [2023-08-24 09:25:26,092 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=11835, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=795, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=165, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=630, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=12165, PETRI_PLACES=285, PETRI_TRANSITIONS=795} [2023-08-24 09:25:26,093 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 255 predicate places. [2023-08-24 09:25:26,093 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 795 transitions, 12165 flow [2023-08-24 09:25:26,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 101.05263157894737) internal successors, (1920), 19 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states 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 09:25:26,093 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:25:26,093 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] [2023-08-24 09:25:26,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-08-24 09:25:26,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:25:26,299 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-24 09:25:26,299 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:25:26,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1021518157, now seen corresponding path program 3 times [2023-08-24 09:25:26,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:25:26,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777896641] [2023-08-24 09:25:26,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:25:26,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:25:26,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:25:28,351 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 09:25:28,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:25:28,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777896641] [2023-08-24 09:25:28,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777896641] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:25:28,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44331548] [2023-08-24 09:25:28,351 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 09:25:28,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:25:28,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:25:28,352 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-24 09:25:28,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-08-24 09:25:28,463 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-24 09:25:28,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:25:28,464 INFO L262 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 45 conjunts are in the unsatisfiable core [2023-08-24 09:25:28,466 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:25:28,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 09:25:28,749 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 34 treesize of output 32 [2023-08-24 09:25:28,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 09:25:28,841 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 34 treesize of output 32 [2023-08-24 09:25:29,556 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:25:29,556 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 143 treesize of output 89 [2023-08-24 09:25:30,104 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 09:25:30,105 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:25:32,687 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse21 (+ c_~max2~0 1))) (let ((.cse4 (= c_~max1~0 c_~max3~0)) (.cse43 (<= .cse21 c_~max3~0)) (.cse3 (<= c_~max3~0 c_~max2~0)) (.cse49 (= c_~max1~0 c_~max2~0)) (.cse2 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4)))) (and (or (forall ((v_ArrVal_1144 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_133 Int)) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1144) c_~A~0.base))) (let ((.cse0 (select .cse1 .cse2))) (or (<= .cse0 c_~max1~0) (< c_~max2~0 (select .cse1 c_~A~0.offset)) (< 1 v_thread3Thread1of1ForFork1_~i~2_133) (= .cse0 c_~max3~0) (< (+ v_thread3Thread1of1ForFork1_~i~2_133 1) c_~N~0) (< c_~max3~0 (select .cse1 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_133 4)))))))) .cse3) (or .cse4 (forall ((v_ArrVal_1144 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_133 Int)) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1144) c_~A~0.base))) (let ((.cse5 (select .cse6 c_~A~0.offset))) (or (<= .cse5 c_~max2~0) (< 1 v_thread3Thread1of1ForFork1_~i~2_133) (= c_~max1~0 .cse5) (< (+ v_thread3Thread1of1ForFork1_~i~2_133 1) c_~N~0) (< c_~max3~0 (select .cse6 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_133 4)))) (< c_~max1~0 (select .cse6 .cse2))))))) (or (forall ((v_ArrVal_1144 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_133 Int)) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1144) c_~A~0.base))) (let ((.cse7 (select .cse8 c_~A~0.offset))) (or (<= .cse7 c_~max2~0) (< 1 v_thread3Thread1of1ForFork1_~i~2_133) (< (+ v_thread3Thread1of1ForFork1_~i~2_133 1) c_~N~0) (< c_~max3~0 (select .cse8 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_133 4)))) (< c_~max1~0 (select .cse8 .cse2)) (<= c_~max3~0 .cse7))))) .cse4) (forall ((v_ArrVal_1144 (Array Int Int))) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1144) c_~A~0.base))) (or (< c_~max2~0 (select .cse9 c_~A~0.offset)) (forall ((v_thread3Thread1of1ForFork1_~i~2_133 Int)) (let ((.cse10 (select .cse9 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_133 4))))) (or (<= .cse10 c_~max2~0) (<= .cse10 c_~max3~0) (< 1 v_thread3Thread1of1ForFork1_~i~2_133) (< (+ v_thread3Thread1of1ForFork1_~i~2_133 1) c_~N~0) (= c_~max1~0 .cse10)))) (< c_~max1~0 (select .cse9 .cse2))))) (forall ((v_ArrVal_1144 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1144) c_~A~0.base))) (let ((.cse11 (select .cse12 c_~A~0.offset))) (or (<= .cse11 c_~max2~0) (= c_~max1~0 .cse11) (< c_~max1~0 (select .cse12 .cse2)) (forall ((v_thread3Thread1of1ForFork1_~i~2_133 Int)) (let ((.cse13 (select .cse12 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_133 4))))) (or (<= .cse13 c_~max3~0) (< 1 v_thread3Thread1of1ForFork1_~i~2_133) (< (+ v_thread3Thread1of1ForFork1_~i~2_133 1) c_~N~0) (<= (+ 1 .cse11) .cse13)))))))) (forall ((v_ArrVal_1144 (Array Int Int))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1144) c_~A~0.base))) (let ((.cse15 (select .cse16 .cse2))) (or (forall ((v_thread3Thread1of1ForFork1_~i~2_133 Int)) (let ((.cse14 (select .cse16 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_133 4))))) (or (<= .cse14 c_~max2~0) (<= .cse14 c_~max3~0) (< 1 v_thread3Thread1of1ForFork1_~i~2_133) (= .cse15 .cse14) (< (+ v_thread3Thread1of1ForFork1_~i~2_133 1) c_~N~0)))) (<= .cse15 c_~max1~0) (< c_~max2~0 (select .cse16 c_~A~0.offset)))))) (forall ((v_thread3Thread1of1ForFork1_~i~2_133 Int)) (or (< 1 v_thread3Thread1of1ForFork1_~i~2_133) (< (+ v_thread3Thread1of1ForFork1_~i~2_133 1) c_~N~0) (forall ((v_ArrVal_1144 (Array Int Int))) (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1144) c_~A~0.base))) (let ((.cse18 (select .cse19 .cse2)) (.cse17 (select .cse19 c_~A~0.offset))) (or (<= .cse17 c_~max2~0) (<= .cse18 c_~max1~0) (= .cse18 c_~max3~0) (< c_~max3~0 (select .cse19 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_133 4)))) (<= c_~max3~0 .cse17))))))) (forall ((v_ArrVal_1144 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1144) c_~A~0.base))) (let ((.cse23 (select .cse22 .cse2))) (or (forall ((v_thread3Thread1of1ForFork1_~i~2_133 Int)) (let ((.cse20 (select .cse22 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_133 4))))) (or (<= .cse20 c_~max3~0) (< 1 v_thread3Thread1of1ForFork1_~i~2_133) (<= .cse21 .cse20) (< (+ v_thread3Thread1of1ForFork1_~i~2_133 1) c_~N~0)))) (<= .cse23 c_~max1~0) (< c_~max2~0 (select .cse22 c_~A~0.offset)) (= .cse23 c_~max2~0))))) (forall ((v_thread3Thread1of1ForFork1_~i~2_133 Int)) (or (< 1 v_thread3Thread1of1ForFork1_~i~2_133) (< (+ v_thread3Thread1of1ForFork1_~i~2_133 1) c_~N~0) (forall ((v_ArrVal_1144 (Array Int Int))) (let ((.cse26 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1144) c_~A~0.base))) (let ((.cse25 (select .cse26 .cse2)) (.cse24 (select .cse26 c_~A~0.offset))) (or (<= .cse24 c_~max2~0) (<= .cse25 c_~max1~0) (= .cse25 .cse24) (< c_~max3~0 (select .cse26 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_133 4)))) (<= (+ 1 .cse24) c_~max3~0))))))) (forall ((v_thread3Thread1of1ForFork1_~i~2_133 Int)) (or (forall ((v_ArrVal_1144 (Array Int Int))) (let ((.cse29 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1144) c_~A~0.base))) (let ((.cse27 (select .cse29 c_~A~0.offset)) (.cse28 (select .cse29 .cse2))) (or (<= .cse27 c_~max2~0) (<= .cse28 c_~max1~0) (= .cse28 .cse27) (= .cse28 c_~max3~0) (< c_~max3~0 (select .cse29 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_133 4)))))))) (< 1 v_thread3Thread1of1ForFork1_~i~2_133) (< (+ v_thread3Thread1of1ForFork1_~i~2_133 1) c_~N~0))) (forall ((v_ArrVal_1144 (Array Int Int))) (let ((.cse31 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1144) c_~A~0.base))) (let ((.cse30 (select .cse31 c_~A~0.offset))) (or (<= .cse30 c_~max2~0) (< c_~max1~0 (select .cse31 .cse2)) (forall ((v_thread3Thread1of1ForFork1_~i~2_133 Int)) (let ((.cse32 (select .cse31 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_133 4))))) (or (<= .cse32 c_~max3~0) (<= .cse32 .cse30) (< 1 v_thread3Thread1of1ForFork1_~i~2_133) (< (+ v_thread3Thread1of1ForFork1_~i~2_133 1) c_~N~0) (= c_~max1~0 .cse32)))))))) (forall ((v_ArrVal_1144 (Array Int Int))) (let ((.cse36 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1144) c_~A~0.base))) (let ((.cse34 (select .cse36 .cse2)) (.cse33 (select .cse36 c_~A~0.offset))) (or (<= .cse33 c_~max2~0) (<= .cse34 c_~max1~0) (= .cse34 .cse33) (forall ((v_thread3Thread1of1ForFork1_~i~2_133 Int)) (let ((.cse35 (select .cse36 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_133 4))))) (or (<= .cse35 c_~max3~0) (< 1 v_thread3Thread1of1ForFork1_~i~2_133) (< (+ v_thread3Thread1of1ForFork1_~i~2_133 1) c_~N~0) (<= (+ 1 .cse33) .cse35)))))))) (forall ((v_ArrVal_1144 (Array Int Int))) (let ((.cse40 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1144) c_~A~0.base))) (let ((.cse37 (select .cse40 c_~A~0.offset)) (.cse38 (select .cse40 .cse2))) (or (<= .cse37 c_~max2~0) (<= .cse38 c_~max1~0) (forall ((v_thread3Thread1of1ForFork1_~i~2_133 Int)) (let ((.cse39 (select .cse40 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_133 4))))) (or (<= .cse39 c_~max3~0) (<= .cse39 .cse37) (< 1 v_thread3Thread1of1ForFork1_~i~2_133) (= .cse38 .cse39) (< (+ v_thread3Thread1of1ForFork1_~i~2_133 1) c_~N~0)))))))) (or (forall ((v_ArrVal_1144 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_133 Int)) (let ((.cse42 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1144) c_~A~0.base))) (let ((.cse41 (select .cse42 .cse2))) (or (<= .cse41 c_~max1~0) (< c_~max2~0 (select .cse42 c_~A~0.offset)) (= .cse41 c_~max2~0) (< 1 v_thread3Thread1of1ForFork1_~i~2_133) (< (+ v_thread3Thread1of1ForFork1_~i~2_133 1) c_~N~0) (< c_~max3~0 (select .cse42 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_133 4)))))))) .cse43) (forall ((v_thread3Thread1of1ForFork1_~i~2_133 Int)) (or (< 1 v_thread3Thread1of1ForFork1_~i~2_133) (< (+ v_thread3Thread1of1ForFork1_~i~2_133 1) c_~N~0) (forall ((v_ArrVal_1144 (Array Int Int))) (let ((.cse45 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1144) c_~A~0.base))) (let ((.cse44 (select .cse45 .cse2))) (or (<= .cse44 c_~max1~0) (< c_~max2~0 (select .cse45 c_~A~0.offset)) (= .cse44 c_~max2~0) (= .cse44 c_~max3~0) (< c_~max3~0 (select .cse45 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_133 4)))))))))) (forall ((v_thread3Thread1of1ForFork1_~i~2_133 Int)) (or (< 1 v_thread3Thread1of1ForFork1_~i~2_133) (forall ((v_ArrVal_1144 (Array Int Int))) (let ((.cse47 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1144) c_~A~0.base))) (let ((.cse46 (select .cse47 c_~A~0.offset))) (or (<= .cse46 c_~max2~0) (= c_~max1~0 .cse46) (< c_~max3~0 (select .cse47 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_133 4)))) (< c_~max1~0 (select .cse47 .cse2)) (<= (+ 1 .cse46) c_~max3~0))))) (< (+ v_thread3Thread1of1ForFork1_~i~2_133 1) c_~N~0))) (or (forall ((v_ArrVal_1144 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_133 Int)) (let ((.cse48 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1144) c_~A~0.base))) (or (< c_~max2~0 (select .cse48 c_~A~0.offset)) (< 1 v_thread3Thread1of1ForFork1_~i~2_133) (< (+ v_thread3Thread1of1ForFork1_~i~2_133 1) c_~N~0) (< c_~max3~0 (select .cse48 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_133 4)))) (< c_~max1~0 (select .cse48 .cse2))))) (and .cse4 .cse43) (and .cse49 .cse3)) (or .cse49 (forall ((v_ArrVal_1144 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_133 Int)) (let ((.cse50 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1144) c_~A~0.base))) (let ((.cse51 (select .cse50 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_133 4))))) (or (< c_~max2~0 (select .cse50 c_~A~0.offset)) (<= .cse51 c_~max3~0) (< 1 v_thread3Thread1of1ForFork1_~i~2_133) (<= .cse21 .cse51) (< (+ v_thread3Thread1of1ForFork1_~i~2_133 1) c_~N~0) (< c_~max1~0 (select .cse50 .cse2)))))))))) is different from false [2023-08-24 09:25:33,666 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~max2~0 1))) (let ((.cse3 (= c_~max1~0 c_~max2~0)) (.cse8 (<= .cse4 c_~max3~0)) (.cse9 (<= c_~max3~0 c_~max2~0)) (.cse7 (= c_~max1~0 c_~max3~0)) (.cse2 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4)))) (and (forall ((v_ArrVal_1144 (Array Int Int)) (v_ArrVal_1143 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1143) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1144) c_~A~0.base))) (or (forall ((v_thread3Thread1of1ForFork1_~i~2_133 Int)) (let ((.cse0 (select .cse1 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_133 4))))) (or (= c_~max1~0 .cse0) (< 1 v_thread3Thread1of1ForFork1_~i~2_133) (<= .cse0 c_~max2~0) (< (+ v_thread3Thread1of1ForFork1_~i~2_133 1) c_~N~0) (<= .cse0 c_~max3~0)))) (< c_~max2~0 (select .cse1 c_~A~0.offset)) (< c_~max1~0 (select .cse1 .cse2))))) (or .cse3 (forall ((v_ArrVal_1144 (Array Int Int)) (v_ArrVal_1143 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_133 Int)) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1143) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1144) c_~A~0.base))) (let ((.cse5 (select .cse6 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_133 4))))) (or (<= .cse4 .cse5) (< 1 v_thread3Thread1of1ForFork1_~i~2_133) (< c_~max2~0 (select .cse6 c_~A~0.offset)) (< (+ v_thread3Thread1of1ForFork1_~i~2_133 1) c_~N~0) (<= .cse5 c_~max3~0) (< c_~max1~0 (select .cse6 .cse2))))))) (or (and .cse7 .cse8) (and .cse3 .cse9) (forall ((v_ArrVal_1144 (Array Int Int)) (v_ArrVal_1143 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_133 Int)) (let ((.cse10 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1143) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1144) c_~A~0.base))) (or (< c_~max3~0 (select .cse10 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_133 4)))) (< 1 v_thread3Thread1of1ForFork1_~i~2_133) (< c_~max2~0 (select .cse10 c_~A~0.offset)) (< (+ v_thread3Thread1of1ForFork1_~i~2_133 1) c_~N~0) (< c_~max1~0 (select .cse10 .cse2)))))) (forall ((v_ArrVal_1144 (Array Int Int)) (v_ArrVal_1143 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1143) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1144) c_~A~0.base))) (let ((.cse11 (select .cse13 .cse2))) (or (<= .cse11 c_~max1~0) (forall ((v_thread3Thread1of1ForFork1_~i~2_133 Int)) (let ((.cse12 (select .cse13 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_133 4))))) (or (< 1 v_thread3Thread1of1ForFork1_~i~2_133) (<= .cse12 c_~max2~0) (< (+ v_thread3Thread1of1ForFork1_~i~2_133 1) c_~N~0) (<= .cse12 c_~max3~0) (= .cse11 .cse12)))) (< c_~max2~0 (select .cse13 c_~A~0.offset)))))) (forall ((v_ArrVal_1143 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_133 Int)) (or (< 1 v_thread3Thread1of1ForFork1_~i~2_133) (forall ((v_ArrVal_1144 (Array Int Int))) (let ((.cse14 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1143) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1144) c_~A~0.base))) (let ((.cse16 (select .cse14 c_~A~0.offset)) (.cse15 (select .cse14 .cse2))) (or (< c_~max3~0 (select .cse14 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_133 4)))) (= .cse15 .cse16) (<= .cse15 c_~max1~0) (<= .cse16 c_~max2~0) (= .cse15 c_~max3~0))))) (< (+ v_thread3Thread1of1ForFork1_~i~2_133 1) c_~N~0))) (forall ((v_ArrVal_1143 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_133 Int)) (or (< 1 v_thread3Thread1of1ForFork1_~i~2_133) (forall ((v_ArrVal_1144 (Array Int Int))) (let ((.cse17 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1143) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1144) c_~A~0.base))) (let ((.cse18 (select .cse17 .cse2)) (.cse19 (select .cse17 c_~A~0.offset))) (or (< c_~max3~0 (select .cse17 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_133 4)))) (= .cse18 .cse19) (<= .cse18 c_~max1~0) (<= .cse19 c_~max2~0) (<= (+ .cse19 1) c_~max3~0))))) (< (+ v_thread3Thread1of1ForFork1_~i~2_133 1) c_~N~0))) (forall ((v_ArrVal_1144 (Array Int Int)) (v_ArrVal_1143 (Array Int Int))) (let ((.cse23 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1143) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1144) c_~A~0.base))) (let ((.cse20 (select .cse23 .cse2)) (.cse21 (select .cse23 c_~A~0.offset))) (or (= .cse20 .cse21) (<= .cse20 c_~max1~0) (<= .cse21 c_~max2~0) (forall ((v_thread3Thread1of1ForFork1_~i~2_133 Int)) (let ((.cse22 (select .cse23 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_133 4))))) (or (<= (+ .cse21 1) .cse22) (< 1 v_thread3Thread1of1ForFork1_~i~2_133) (< (+ v_thread3Thread1of1ForFork1_~i~2_133 1) c_~N~0) (<= .cse22 c_~max3~0)))))))) (forall ((v_ArrVal_1143 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_133 Int)) (or (< 1 v_thread3Thread1of1ForFork1_~i~2_133) (< (+ v_thread3Thread1of1ForFork1_~i~2_133 1) c_~N~0) (forall ((v_ArrVal_1144 (Array Int Int))) (let ((.cse24 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1143) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1144) c_~A~0.base))) (let ((.cse25 (select .cse24 c_~A~0.offset))) (or (< c_~max3~0 (select .cse24 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_133 4)))) (<= .cse25 c_~max2~0) (= c_~max1~0 .cse25) (<= (+ .cse25 1) c_~max3~0) (< c_~max1~0 (select .cse24 .cse2)))))))) (or .cse8 (forall ((v_ArrVal_1144 (Array Int Int)) (v_ArrVal_1143 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_133 Int)) (let ((.cse26 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1143) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1144) c_~A~0.base))) (let ((.cse27 (select .cse26 .cse2))) (or (< c_~max3~0 (select .cse26 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_133 4)))) (<= .cse27 c_~max1~0) (< 1 v_thread3Thread1of1ForFork1_~i~2_133) (< c_~max2~0 (select .cse26 c_~A~0.offset)) (= .cse27 c_~max2~0) (< (+ v_thread3Thread1of1ForFork1_~i~2_133 1) c_~N~0)))))) (or .cse9 (forall ((v_ArrVal_1144 (Array Int Int)) (v_ArrVal_1143 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_133 Int)) (let ((.cse28 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1143) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1144) c_~A~0.base))) (let ((.cse29 (select .cse28 .cse2))) (or (< c_~max3~0 (select .cse28 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_133 4)))) (<= .cse29 c_~max1~0) (< 1 v_thread3Thread1of1ForFork1_~i~2_133) (= .cse29 c_~max3~0) (< c_~max2~0 (select .cse28 c_~A~0.offset)) (< (+ v_thread3Thread1of1ForFork1_~i~2_133 1) c_~N~0)))))) (or .cse7 (forall ((v_ArrVal_1144 (Array Int Int)) (v_ArrVal_1143 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_133 Int)) (let ((.cse30 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1143) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1144) c_~A~0.base))) (let ((.cse31 (select .cse30 c_~A~0.offset))) (or (< c_~max3~0 (select .cse30 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_133 4)))) (<= .cse31 c_~max2~0) (< 1 v_thread3Thread1of1ForFork1_~i~2_133) (< (+ v_thread3Thread1of1ForFork1_~i~2_133 1) c_~N~0) (<= c_~max3~0 .cse31) (< c_~max1~0 (select .cse30 .cse2))))))) (forall ((v_ArrVal_1143 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_133 Int)) (or (< 1 v_thread3Thread1of1ForFork1_~i~2_133) (< (+ v_thread3Thread1of1ForFork1_~i~2_133 1) c_~N~0) (forall ((v_ArrVal_1144 (Array Int Int))) (let ((.cse32 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1143) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1144) c_~A~0.base))) (let ((.cse33 (select .cse32 .cse2))) (or (< c_~max3~0 (select .cse32 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_133 4)))) (<= .cse33 c_~max1~0) (= .cse33 c_~max3~0) (< c_~max2~0 (select .cse32 c_~A~0.offset)) (= .cse33 c_~max2~0))))))) (or .cse7 (forall ((v_ArrVal_1144 (Array Int Int)) (v_ArrVal_1143 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_133 Int)) (let ((.cse34 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1143) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1144) c_~A~0.base))) (let ((.cse35 (select .cse34 c_~A~0.offset))) (or (< c_~max3~0 (select .cse34 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_133 4)))) (<= .cse35 c_~max2~0) (= c_~max1~0 .cse35) (< 1 v_thread3Thread1of1ForFork1_~i~2_133) (< (+ v_thread3Thread1of1ForFork1_~i~2_133 1) c_~N~0) (< c_~max1~0 (select .cse34 .cse2))))))) (forall ((v_ArrVal_1144 (Array Int Int)) (v_ArrVal_1143 (Array Int Int))) (let ((.cse39 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1143) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1144) c_~A~0.base))) (let ((.cse37 (select .cse39 c_~A~0.offset)) (.cse36 (select .cse39 .cse2))) (or (<= .cse36 c_~max1~0) (<= .cse37 c_~max2~0) (forall ((v_thread3Thread1of1ForFork1_~i~2_133 Int)) (let ((.cse38 (select .cse39 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_133 4))))) (or (< 1 v_thread3Thread1of1ForFork1_~i~2_133) (< (+ v_thread3Thread1of1ForFork1_~i~2_133 1) c_~N~0) (<= .cse38 c_~max3~0) (<= .cse38 .cse37) (= .cse36 .cse38)))))))) (forall ((v_ArrVal_1144 (Array Int Int)) (v_ArrVal_1143 (Array Int Int))) (let ((.cse42 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1143) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1144) c_~A~0.base))) (let ((.cse40 (select .cse42 c_~A~0.offset))) (or (<= .cse40 c_~max2~0) (forall ((v_thread3Thread1of1ForFork1_~i~2_133 Int)) (let ((.cse41 (select .cse42 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_133 4))))) (or (= c_~max1~0 .cse41) (< 1 v_thread3Thread1of1ForFork1_~i~2_133) (< (+ v_thread3Thread1of1ForFork1_~i~2_133 1) c_~N~0) (<= .cse41 c_~max3~0) (<= .cse41 .cse40)))) (< c_~max1~0 (select .cse42 .cse2)))))) (forall ((v_ArrVal_1144 (Array Int Int)) (v_ArrVal_1143 (Array Int Int))) (let ((.cse45 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1143) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1144) c_~A~0.base))) (let ((.cse43 (select .cse45 c_~A~0.offset))) (or (<= .cse43 c_~max2~0) (= c_~max1~0 .cse43) (forall ((v_thread3Thread1of1ForFork1_~i~2_133 Int)) (let ((.cse44 (select .cse45 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_133 4))))) (or (<= (+ .cse43 1) .cse44) (< 1 v_thread3Thread1of1ForFork1_~i~2_133) (< (+ v_thread3Thread1of1ForFork1_~i~2_133 1) c_~N~0) (<= .cse44 c_~max3~0)))) (< c_~max1~0 (select .cse45 .cse2)))))) (forall ((v_ArrVal_1143 (Array Int Int)) (v_thread3Thread1of1ForFork1_~i~2_133 Int)) (or (< 1 v_thread3Thread1of1ForFork1_~i~2_133) (forall ((v_ArrVal_1144 (Array Int Int))) (let ((.cse46 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1143) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1144) c_~A~0.base))) (let ((.cse47 (select .cse46 .cse2)) (.cse48 (select .cse46 c_~A~0.offset))) (or (< c_~max3~0 (select .cse46 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_133 4)))) (<= .cse47 c_~max1~0) (<= .cse48 c_~max2~0) (= .cse47 c_~max3~0) (<= c_~max3~0 .cse48))))) (< (+ v_thread3Thread1of1ForFork1_~i~2_133 1) c_~N~0))) (forall ((v_ArrVal_1144 (Array Int Int)) (v_ArrVal_1143 (Array Int Int))) (let ((.cse51 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1143) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1144) c_~A~0.base))) (let ((.cse49 (select .cse51 .cse2))) (or (<= .cse49 c_~max1~0) (forall ((v_thread3Thread1of1ForFork1_~i~2_133 Int)) (let ((.cse50 (select .cse51 (+ c_~A~0.offset (* v_thread3Thread1of1ForFork1_~i~2_133 4))))) (or (<= .cse4 .cse50) (< 1 v_thread3Thread1of1ForFork1_~i~2_133) (< (+ v_thread3Thread1of1ForFork1_~i~2_133 1) c_~N~0) (<= .cse50 c_~max3~0)))) (< c_~max2~0 (select .cse51 c_~A~0.offset)) (= .cse49 c_~max2~0)))))))) is different from false [2023-08-24 09:25:40,086 WARN L234 SmtUtils]: Spent 6.12s on a formula simplification that was a NOOP. DAG size: 880 (called from [L 319] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-08-24 09:25:40,086 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:25:40,088 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 21 select indices, 21 select index equivalence classes, 0 disjoint index pairs (out of 210 index pairs), introduced 21 new quantified variables, introduced 210 case distinctions, treesize of input 7093 treesize of output 8010 [2023-08-24 09:25:42,304 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:25:42,305 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 5009 treesize of output 5007 [2023-08-24 09:25:43,360 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:25:43,361 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 4978 treesize of output 4945 [2023-08-24 09:25:44,491 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:25:44,493 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 4916 treesize of output 4895 [2023-08-24 09:25:45,562 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:25:45,564 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 4866 treesize of output 4839 [2023-08-24 09:25:46,684 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:25:46,685 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 4810 treesize of output 4805 [2023-08-24 09:25:47,815 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:25:47,816 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 4776 treesize of output 4781 [2023-08-24 09:25:48,924 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:25:48,925 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 4752 treesize of output 4733 [2023-08-24 09:25:50,163 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:25:50,165 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 4704 treesize of output 4665 [2023-08-24 09:25:51,069 INFO L209 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2023-08-24 09:25:51,287 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:25:51,288 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 4636 treesize of output 4636 [2023-08-24 09:25:52,431 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:25:52,432 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 4607 treesize of output 4584 [2023-08-24 09:25:53,525 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:25:53,526 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 4555 treesize of output 4550 [2023-08-24 09:25:54,646 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:25:54,647 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 4521 treesize of output 4529 [2023-08-24 09:25:55,867 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:25:55,868 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 4500 treesize of output 4465 [2023-08-24 09:25:57,154 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:25:57,155 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 4436 treesize of output 4448 [2023-08-24 09:25:58,365 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:25:58,366 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 4419 treesize of output 4421 [2023-08-24 09:25:59,625 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:25:59,626 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 4392 treesize of output 4367 [2023-08-24 09:26:00,862 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:26:00,863 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 4338 treesize of output 4337 [2023-08-24 09:26:02,129 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:26:02,130 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 4308 treesize of output 4303 [2023-08-24 09:26:03,168 INFO L209 tifierPushTermWalker]: Run 20 iterations without descend maybe there is a nontermination bug. [2023-08-24 09:26:03,429 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:26:03,430 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 4274 treesize of output 4259 [2023-08-24 09:26:04,756 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:26:04,757 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 4230 treesize of output 4237 [2023-08-24 09:26:06,109 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:26:06,110 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 4208 treesize of output 4209 [2023-08-24 09:26:07,463 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:26:07,464 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 4180 treesize of output 4192 [2023-08-24 09:26:08,844 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:26:08,845 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 4163 treesize of output 4148 [2023-08-24 09:26:10,335 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:26:10,336 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 4119 treesize of output 4106 [2023-08-24 09:26:11,677 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:26:11,678 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 4077 treesize of output 4074 [2023-08-24 09:26:13,065 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:26:13,066 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 4045 treesize of output 4045 [2023-08-24 09:26:14,522 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:26:14,523 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 4016 treesize of output 3987 [2023-08-24 09:26:15,908 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:26:15,909 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 3958 treesize of output 3962 [2023-08-24 09:26:17,095 INFO L209 tifierPushTermWalker]: Run 30 iterations without descend maybe there is a nontermination bug. [2023-08-24 09:26:17,380 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:26:17,381 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 3933 treesize of output 3947 [2023-08-24 09:26:18,783 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:26:18,784 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 3918 treesize of output 3875 [2023-08-24 09:26:20,264 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:26:20,265 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 3846 treesize of output 3839 [2023-08-24 09:26:21,731 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:26:21,732 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 3810 treesize of output 3781 [2023-08-24 09:26:23,198 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:26:23,199 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 3752 treesize of output 3755 [2023-08-24 09:26:24,665 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:26:24,666 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 3726 treesize of output 3736 [2023-08-24 09:26:26,125 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:26:26,126 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 3707 treesize of output 3698 [2023-08-24 09:26:27,684 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:26:27,685 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 3669 treesize of output 3676 Received shutdown request... [2023-08-24 09:37:41,013 WARN L266 SmtUtils]: Removed 2 from assertion stack [2023-08-24 09:37:41,015 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-24 09:37:41,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-08-24 09:37:41,040 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 09:37:41,040 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-24 09:37:41,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-08-24 09:37:41,217 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 27 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 23ms.. [2023-08-24 09:37:41,218 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2023-08-24 09:37:41,218 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2023-08-24 09:37:41,219 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2023-08-24 09:37:41,219 INFO L445 BasicCegarLoop]: Path program histogram: [19, 3, 1, 1, 1, 1] [2023-08-24 09:37:41,221 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 09:37:41,221 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 09:37:41,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 09:37:41 BasicIcfg [2023-08-24 09:37:41,223 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 09:37:41,224 INFO L158 Benchmark]: Toolchain (without parser) took 817564.64ms. Allocated memory was 350.2MB in the beginning and 1.5GB in the end (delta: 1.1GB). Free memory was 326.4MB in the beginning and 845.1MB in the end (delta: -518.8MB). Peak memory consumption was 1.0GB. Max. memory is 16.0GB. [2023-08-24 09:37:41,224 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 350.2MB. Free memory was 328.5MB in the beginning and 328.3MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 09:37:41,224 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.06ms. Allocated memory is still 350.2MB. Free memory was 326.4MB in the beginning and 314.7MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-08-24 09:37:41,224 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.14ms. Allocated memory is still 350.2MB. Free memory was 314.7MB in the beginning and 313.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 09:37:41,224 INFO L158 Benchmark]: Boogie Preprocessor took 34.54ms. Allocated memory is still 350.2MB. Free memory was 313.3MB in the beginning and 311.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 09:37:41,225 INFO L158 Benchmark]: RCFGBuilder took 491.51ms. Allocated memory is still 350.2MB. Free memory was 311.3MB in the beginning and 290.3MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-08-24 09:37:41,225 INFO L158 Benchmark]: TraceAbstraction took 816693.41ms. Allocated memory was 350.2MB in the beginning and 1.5GB in the end (delta: 1.1GB). Free memory was 289.6MB in the beginning and 845.1MB in the end (delta: -555.5MB). Peak memory consumption was 1.0GB. Max. memory is 16.0GB. [2023-08-24 09:37:41,226 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.14ms. Allocated memory is still 350.2MB. Free memory was 328.5MB in the beginning and 328.3MB in the end (delta: 157.3kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 285.06ms. Allocated memory is still 350.2MB. Free memory was 326.4MB in the beginning and 314.7MB in the end (delta: 11.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 52.14ms. Allocated memory is still 350.2MB. Free memory was 314.7MB in the beginning and 313.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.0GB. * Boogie Preprocessor took 34.54ms. Allocated memory is still 350.2MB. Free memory was 313.3MB in the beginning and 311.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 491.51ms. Allocated memory is still 350.2MB. Free memory was 311.3MB in the beginning and 290.3MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * TraceAbstraction took 816693.41ms. Allocated memory was 350.2MB in the beginning and 1.5GB in the end (delta: 1.1GB). Free memory was 289.6MB in the beginning and 845.1MB in the end (delta: -555.5MB). Peak memory consumption was 1.0GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.7s, 134 PlacesBefore, 30 PlacesAfterwards, 136 TransitionsBefore, 24 TransitionsAfterwards, 1518 CoEnabledTransitionPairs, 7 FixpointIterations, 69 TrivialSequentialCompositions, 30 ConcurrentSequentialCompositions, 14 TrivialYvCompositions, 6 ConcurrentYvCompositions, 8 ChoiceCompositions, 127 TotalNumberOfCompositions, 1571 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1520, independent: 1503, independent conditional: 0, independent unconditional: 1503, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 808, independent: 802, independent conditional: 0, independent unconditional: 802, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1520, independent: 701, independent conditional: 0, independent unconditional: 701, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 808, unknown conditional: 0, unknown unconditional: 808] , Statistics on independence cache: Total cache size (in pairs): 53, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 27 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 23ms.. - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 27 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 23ms.. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 27 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 23ms.. - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 27 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 4 for 23ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 171 locations, 4 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: 816.6s, OverallIterations: 26, TraceHistogramMax: 2, PathProgramHistogramMax: 19, EmptinessCheckTime: 0.0s, AutomataDifference: 38.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.8s, HoareTripleCheckerStatistics: 15 mSolverCounterUnknown, 2631 SdHoareTripleChecker+Valid, 9.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2631 mSDsluCounter, 892 SdHoareTripleChecker+Invalid, 7.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 522 IncrementalHoareTripleChecker+Unchecked, 776 mSDsCounter, 182 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15089 IncrementalHoareTripleChecker+Invalid, 15808 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 182 mSolverCounterUnsat, 116 mSDtfsCounter, 15089 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1490 GetRequests, 776 SyntacticMatches, 39 SemanticMatches, 675 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 5729 ImplicationChecksByTransitivity, 21.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13152occurred in iteration=23, InterpolantAutomatonStates: 417, 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.2s SatisfiabilityAnalysisTime, 29.9s InterpolantComputationTime, 1137 NumberOfCodeBlocks, 1126 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 1614 ConstructedInterpolants, 20 QuantifiedInterpolants, 19190 SizeOfPredicates, 194 NumberOfNonLiveVariables, 4928 ConjunctsInSsa, 411 ConjunctsInUnsatCore, 71 InterpolantComputations, 4 PerfectInterpolantSequences, 160/322 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