/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-min-max-dec.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 08:59:06,494 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 08:59:06,568 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 08:59:06,572 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 08:59:06,573 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 08:59:06,611 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 08:59:06,612 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 08:59:06,615 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 08:59:06,615 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 08:59:06,616 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 08:59:06,616 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 08:59:06,616 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 08:59:06,617 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 08:59:06,617 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 08:59:06,617 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 08:59:06,618 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 08:59:06,618 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 08:59:06,618 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 08:59:06,619 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 08:59:06,619 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 08:59:06,619 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 08:59:06,625 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 08:59:06,625 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 08:59:06,626 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 08:59:06,629 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 08:59:06,629 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 08:59:06,629 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 08:59:06,629 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 08:59:06,630 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 08:59:06,630 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 08:59:06,630 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 08:59:06,631 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 08:59:06,631 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 08:59:06,631 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 08:59:06,631 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 08:59:06,631 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 08:59:06,968 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 08:59:06,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 08:59:06,994 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 08:59:06,995 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 08:59:06,997 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 08:59:06,998 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c [2023-08-24 08:59:08,201 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 08:59:08,423 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 08:59:08,424 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c [2023-08-24 08:59:08,432 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec9c853a5/94990a258c3d438bbe506ee270c2adcb/FLAGcf4b6d22c [2023-08-24 08:59:08,448 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec9c853a5/94990a258c3d438bbe506ee270c2adcb [2023-08-24 08:59:08,452 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 08:59:08,454 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 08:59:08,457 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 08:59:08,457 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 08:59:08,460 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 08:59:08,461 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 08:59:08" (1/1) ... [2023-08-24 08:59:08,462 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@615723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:59:08, skipping insertion in model container [2023-08-24 08:59:08,462 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 08:59:08" (1/1) ... [2023-08-24 08:59:08,490 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 08:59:08,675 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c[3019,3032] [2023-08-24 08:59:08,686 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 08:59:08,701 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 08:59:08,742 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c[3019,3032] [2023-08-24 08:59:08,745 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 08:59:08,751 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 08:59:08,751 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 08:59:08,759 INFO L206 MainTranslator]: Completed translation [2023-08-24 08:59:08,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:59:08 WrapperNode [2023-08-24 08:59:08,760 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 08:59:08,761 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 08:59:08,761 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 08:59:08,761 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 08:59:08,766 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:59:08" (1/1) ... [2023-08-24 08:59:08,785 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:59:08" (1/1) ... [2023-08-24 08:59:08,816 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 141 [2023-08-24 08:59:08,816 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 08:59:08,817 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 08:59:08,817 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 08:59:08,818 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 08:59:08,825 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:59:08" (1/1) ... [2023-08-24 08:59:08,825 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:59:08" (1/1) ... [2023-08-24 08:59:08,838 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:59:08" (1/1) ... [2023-08-24 08:59:08,839 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:59:08" (1/1) ... [2023-08-24 08:59:08,844 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:59:08" (1/1) ... [2023-08-24 08:59:08,847 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:59:08" (1/1) ... [2023-08-24 08:59:08,860 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:59:08" (1/1) ... [2023-08-24 08:59:08,861 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:59:08" (1/1) ... [2023-08-24 08:59:08,863 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 08:59:08,864 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 08:59:08,864 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 08:59:08,864 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 08:59:08,865 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:59:08" (1/1) ... [2023-08-24 08:59:08,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 08:59:08,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 08:59:08,896 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 08:59:08,899 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 08:59:08,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 08:59:08,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 08:59:08,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 08:59:08,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-24 08:59:08,930 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-24 08:59:08,930 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-24 08:59:08,930 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-24 08:59:08,930 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-24 08:59:08,931 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-24 08:59:08,931 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-24 08:59:08,931 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-08-24 08:59:08,931 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-08-24 08:59:08,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 08:59:08,931 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 08:59:08,931 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 08:59:08,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-24 08:59:08,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 08:59:08,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 08:59:08,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 08:59:08,934 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 08:59:09,019 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 08:59:09,021 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 08:59:09,376 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 08:59:09,463 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 08:59:09,464 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-24 08:59:09,465 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 08:59:09 BoogieIcfgContainer [2023-08-24 08:59:09,466 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 08:59:09,468 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 08:59:09,468 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 08:59:09,471 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 08:59:09,471 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 08:59:08" (1/3) ... [2023-08-24 08:59:09,472 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@183de53c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 08:59:09, skipping insertion in model container [2023-08-24 08:59:09,472 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 08:59:08" (2/3) ... [2023-08-24 08:59:09,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@183de53c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 08:59:09, skipping insertion in model container [2023-08-24 08:59:09,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 08:59:09" (3/3) ... [2023-08-24 08:59:09,474 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-min-max-dec.wvr.c [2023-08-24 08:59:09,491 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 08:59:09,491 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-24 08:59:09,491 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 08:59:09,562 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-24 08:59:09,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 167 places, 166 transitions, 364 flow [2023-08-24 08:59:09,715 INFO L124 PetriNetUnfolderBase]: 12/162 cut-off events. [2023-08-24 08:59:09,716 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-24 08:59:09,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 162 events. 12/162 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 132 event pairs, 0 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 130. Up to 2 conditions per place. [2023-08-24 08:59:09,721 INFO L82 GeneralOperation]: Start removeDead. Operand has 167 places, 166 transitions, 364 flow [2023-08-24 08:59:09,728 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 150 transitions, 324 flow [2023-08-24 08:59:09,733 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 08:59:09,745 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 150 transitions, 324 flow [2023-08-24 08:59:09,749 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 150 transitions, 324 flow [2023-08-24 08:59:09,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 150 transitions, 324 flow [2023-08-24 08:59:09,800 INFO L124 PetriNetUnfolderBase]: 12/150 cut-off events. [2023-08-24 08:59:09,800 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-24 08:59:09,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 150 events. 12/150 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 131 event pairs, 0 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 130. Up to 2 conditions per place. [2023-08-24 08:59:09,804 INFO L119 LiptonReduction]: Number of co-enabled transitions 2548 [2023-08-24 08:59:15,498 INFO L134 LiptonReduction]: Checked pairs total: 3658 [2023-08-24 08:59:15,498 INFO L136 LiptonReduction]: Total number of compositions: 137 [2023-08-24 08:59:15,510 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 08:59:15,515 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;@11da2d22, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 08:59:15,516 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-24 08:59:15,521 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 08:59:15,521 INFO L124 PetriNetUnfolderBase]: 4/30 cut-off events. [2023-08-24 08:59:15,521 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-24 08:59:15,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:59:15,522 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:59:15,522 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:59:15,528 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:59:15,528 INFO L85 PathProgramCache]: Analyzing trace with hash -924532907, now seen corresponding path program 1 times [2023-08-24 08:59:15,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:59:15,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468778501] [2023-08-24 08:59:15,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:59:15,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:59:15,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:59:15,949 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 08:59:15,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:59:15,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468778501] [2023-08-24 08:59:15,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468778501] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:59:15,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:59:15,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 08:59:15,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529886097] [2023-08-24 08:59:15,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:59:15,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 08:59:15,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:59:15,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 08:59:15,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 08:59:15,987 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 303 [2023-08-24 08:59:15,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 136.5) internal successors, (546), 4 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:59:15,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:59:15,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 303 [2023-08-24 08:59:15,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:59:16,301 INFO L124 PetriNetUnfolderBase]: 1410/1888 cut-off events. [2023-08-24 08:59:16,302 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2023-08-24 08:59:16,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3978 conditions, 1888 events. 1410/1888 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 7213 event pairs, 760 based on Foata normal form. 0/1422 useless extension candidates. Maximal degree in co-relation 3477. Up to 1542 conditions per place. [2023-08-24 08:59:16,316 INFO L140 encePairwiseOnDemand]: 299/303 looper letters, 42 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2023-08-24 08:59:16,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 46 transitions, 215 flow [2023-08-24 08:59:16,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 08:59:16,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 08:59:16,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 566 transitions. [2023-08-24 08:59:16,336 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.466996699669967 [2023-08-24 08:59:16,337 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 566 transitions. [2023-08-24 08:59:16,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 566 transitions. [2023-08-24 08:59:16,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:59:16,342 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 566 transitions. [2023-08-24 08:59:16,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 141.5) internal successors, (566), 4 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:59:16,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:59:16,353 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:59:16,354 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 86 flow. Second operand 4 states and 566 transitions. [2023-08-24 08:59:16,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 46 transitions, 215 flow [2023-08-24 08:59:16,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 193 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-08-24 08:59:16,364 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 84 flow [2023-08-24 08:59:16,366 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=36, PETRI_TRANSITIONS=32} [2023-08-24 08:59:16,369 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2023-08-24 08:59:16,369 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 84 flow [2023-08-24 08:59:16,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 136.5) internal successors, (546), 4 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:59:16,370 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:59:16,370 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:59:16,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 08:59:16,371 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:59:16,379 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:59:16,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1308158109, now seen corresponding path program 1 times [2023-08-24 08:59:16,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:59:16,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424352195] [2023-08-24 08:59:16,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:59:16,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:59:16,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:59:16,572 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 08:59:16,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:59:16,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424352195] [2023-08-24 08:59:16,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424352195] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:59:16,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:59:16,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 08:59:16,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510122515] [2023-08-24 08:59:16,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:59:16,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 08:59:16,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:59:16,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 08:59:16,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 08:59:16,577 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 303 [2023-08-24 08:59:16,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:59:16,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:59:16,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 303 [2023-08-24 08:59:16,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:59:16,816 INFO L124 PetriNetUnfolderBase]: 1718/2336 cut-off events. [2023-08-24 08:59:16,817 INFO L125 PetriNetUnfolderBase]: For 527/527 co-relation queries the response was YES. [2023-08-24 08:59:16,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5313 conditions, 2336 events. 1718/2336 cut-off events. For 527/527 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 8122 event pairs, 977 based on Foata normal form. 0/1943 useless extension candidates. Maximal degree in co-relation 1800. Up to 1790 conditions per place. [2023-08-24 08:59:16,832 INFO L140 encePairwiseOnDemand]: 299/303 looper letters, 47 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2023-08-24 08:59:16,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 50 transitions, 233 flow [2023-08-24 08:59:16,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 08:59:16,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 08:59:16,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 569 transitions. [2023-08-24 08:59:16,834 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46947194719471946 [2023-08-24 08:59:16,834 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 569 transitions. [2023-08-24 08:59:16,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 569 transitions. [2023-08-24 08:59:16,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:59:16,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 569 transitions. [2023-08-24 08:59:16,836 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.25) internal successors, (569), 4 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:59:16,838 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:59:16,839 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:59:16,839 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 84 flow. Second operand 4 states and 569 transitions. [2023-08-24 08:59:16,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 50 transitions, 233 flow [2023-08-24 08:59:16,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 50 transitions, 223 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-24 08:59:16,842 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 92 flow [2023-08-24 08:59:16,842 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2023-08-24 08:59:16,843 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2023-08-24 08:59:16,843 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 92 flow [2023-08-24 08:59:16,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:59:16,843 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:59:16,844 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:59:16,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 08:59:16,844 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:59:16,844 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:59:16,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1319455662, now seen corresponding path program 1 times [2023-08-24 08:59:16,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:59:16,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839691339] [2023-08-24 08:59:16,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:59:16,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:59:16,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:59:16,926 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 08:59:16,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:59:16,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839691339] [2023-08-24 08:59:16,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839691339] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:59:16,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:59:16,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 08:59:16,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616407196] [2023-08-24 08:59:16,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:59:16,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 08:59:16,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:59:16,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 08:59:16,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 08:59:16,929 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 303 [2023-08-24 08:59:16,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:59:16,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:59:16,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 303 [2023-08-24 08:59:16,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:59:17,177 INFO L124 PetriNetUnfolderBase]: 1632/2234 cut-off events. [2023-08-24 08:59:17,177 INFO L125 PetriNetUnfolderBase]: For 531/686 co-relation queries the response was YES. [2023-08-24 08:59:17,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5582 conditions, 2234 events. 1632/2234 cut-off events. For 531/686 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 8451 event pairs, 977 based on Foata normal form. 155/1997 useless extension candidates. Maximal degree in co-relation 1676. Up to 1790 conditions per place. [2023-08-24 08:59:17,190 INFO L140 encePairwiseOnDemand]: 299/303 looper letters, 46 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2023-08-24 08:59:17,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 50 transitions, 240 flow [2023-08-24 08:59:17,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 08:59:17,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 08:59:17,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 566 transitions. [2023-08-24 08:59:17,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.466996699669967 [2023-08-24 08:59:17,193 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 566 transitions. [2023-08-24 08:59:17,193 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 566 transitions. [2023-08-24 08:59:17,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:59:17,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 566 transitions. [2023-08-24 08:59:17,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 141.5) internal successors, (566), 4 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:59:17,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:59:17,198 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 303.0) internal successors, (1515), 5 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:59:17,198 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 92 flow. Second operand 4 states and 566 transitions. [2023-08-24 08:59:17,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 50 transitions, 240 flow [2023-08-24 08:59:17,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 50 transitions, 231 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-24 08:59:17,201 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 100 flow [2023-08-24 08:59:17,201 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2023-08-24 08:59:17,202 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2023-08-24 08:59:17,202 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 100 flow [2023-08-24 08:59:17,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:59:17,204 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:59:17,204 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:59:17,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 08:59:17,204 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:59:17,205 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:59:17,205 INFO L85 PathProgramCache]: Analyzing trace with hash 409706382, now seen corresponding path program 1 times [2023-08-24 08:59:17,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:59:17,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447553059] [2023-08-24 08:59:17,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:59:17,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:59:17,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:59:17,368 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 08:59:17,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:59:17,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447553059] [2023-08-24 08:59:17,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447553059] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:59:17,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:59:17,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 08:59:17,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503116078] [2023-08-24 08:59:17,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:59:17,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 08:59:17,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:59:17,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 08:59:17,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 08:59:17,373 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 303 [2023-08-24 08:59:17,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:59:17,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:59:17,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 303 [2023-08-24 08:59:17,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:59:17,574 INFO L124 PetriNetUnfolderBase]: 1632/2235 cut-off events. [2023-08-24 08:59:17,574 INFO L125 PetriNetUnfolderBase]: For 884/1039 co-relation queries the response was YES. [2023-08-24 08:59:17,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5797 conditions, 2235 events. 1632/2235 cut-off events. For 884/1039 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 8181 event pairs, 1243 based on Foata normal form. 155/1994 useless extension candidates. Maximal degree in co-relation 1879. Up to 2223 conditions per place. [2023-08-24 08:59:17,588 INFO L140 encePairwiseOnDemand]: 300/303 looper letters, 32 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2023-08-24 08:59:17,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 35 transitions, 170 flow [2023-08-24 08:59:17,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 08:59:17,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 08:59:17,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 398 transitions. [2023-08-24 08:59:17,591 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43784378437843785 [2023-08-24 08:59:17,591 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 398 transitions. [2023-08-24 08:59:17,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 398 transitions. [2023-08-24 08:59:17,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:59:17,591 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 398 transitions. [2023-08-24 08:59:17,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:59:17,594 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 303.0) internal successors, (1212), 4 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:59:17,594 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 303.0) internal successors, (1212), 4 states have internal predecessors, (1212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:59:17,595 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 100 flow. Second operand 3 states and 398 transitions. [2023-08-24 08:59:17,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 35 transitions, 170 flow [2023-08-24 08:59:17,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 35 transitions, 164 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-24 08:59:17,598 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 106 flow [2023-08-24 08:59:17,598 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=41, PETRI_TRANSITIONS=35} [2023-08-24 08:59:17,599 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2023-08-24 08:59:17,599 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 106 flow [2023-08-24 08:59:17,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:59:17,600 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:59:17,600 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:59:17,600 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 08:59:17,600 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:59:17,600 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:59:17,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1402270999, now seen corresponding path program 1 times [2023-08-24 08:59:17,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:59:17,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429107530] [2023-08-24 08:59:17,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:59:17,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:59:17,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:59:18,215 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 08:59:18,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:59:18,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429107530] [2023-08-24 08:59:18,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429107530] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 08:59:18,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1246646504] [2023-08-24 08:59:18,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:59:18,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 08:59:18,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 08:59:18,221 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 08:59:18,230 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 08:59:18,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:59:18,370 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 37 conjunts are in the unsatisfiable core [2023-08-24 08:59:18,376 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 08:59:18,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 08:59:18,593 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2023-08-24 08:59:18,716 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-08-24 08:59:18,769 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2023-08-24 08:59:18,814 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 08:59:18,815 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 08:59:21,566 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 08:59:21,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1246646504] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 08:59:21,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 08:59:21,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 12, 10] total 25 [2023-08-24 08:59:21,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354307534] [2023-08-24 08:59:21,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 08:59:21,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-08-24 08:59:21,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:59:21,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-08-24 08:59:21,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=498, Unknown=2, NotChecked=0, Total=650 [2023-08-24 08:59:21,572 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 303 [2023-08-24 08:59:21,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 106 flow. Second operand has 26 states, 26 states have (on average 104.23076923076923) internal successors, (2710), 26 states have internal predecessors, (2710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:59:21,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:59:21,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 303 [2023-08-24 08:59:21,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:59:27,753 INFO L124 PetriNetUnfolderBase]: 19766/27044 cut-off events. [2023-08-24 08:59:27,753 INFO L125 PetriNetUnfolderBase]: For 7499/7499 co-relation queries the response was YES. [2023-08-24 08:59:27,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69987 conditions, 27044 events. 19766/27044 cut-off events. For 7499/7499 co-relation queries the response was YES. Maximal size of possible extension queue 978. Compared 149115 event pairs, 1040 based on Foata normal form. 14/21400 useless extension candidates. Maximal degree in co-relation 69973. Up to 5638 conditions per place. [2023-08-24 08:59:27,846 INFO L140 encePairwiseOnDemand]: 289/303 looper letters, 345 selfloop transitions, 129 changer transitions 473/947 dead transitions. [2023-08-24 08:59:27,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 947 transitions, 4714 flow [2023-08-24 08:59:27,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-08-24 08:59:27,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2023-08-24 08:59:27,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 6724 transitions. [2023-08-24 08:59:27,865 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38261067486058953 [2023-08-24 08:59:27,865 INFO L72 ComplementDD]: Start complementDD. Operand 58 states and 6724 transitions. [2023-08-24 08:59:27,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 58 states and 6724 transitions. [2023-08-24 08:59:27,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:59:27,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 58 states and 6724 transitions. [2023-08-24 08:59:27,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 59 states, 58 states have (on average 115.93103448275862) internal successors, (6724), 58 states have internal predecessors, (6724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:59:27,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 59 states, 59 states have (on average 303.0) internal successors, (17877), 59 states have internal predecessors, (17877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:59:27,914 INFO L81 ComplementDD]: Finished complementDD. Result has 59 states, 59 states have (on average 303.0) internal successors, (17877), 59 states have internal predecessors, (17877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:59:27,915 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 106 flow. Second operand 58 states and 6724 transitions. [2023-08-24 08:59:27,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 947 transitions, 4714 flow [2023-08-24 08:59:28,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 947 transitions, 4710 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-24 08:59:28,094 INFO L231 Difference]: Finished difference. Result has 141 places, 196 transitions, 1280 flow [2023-08-24 08:59:28,094 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=58, PETRI_FLOW=1280, PETRI_PLACES=141, PETRI_TRANSITIONS=196} [2023-08-24 08:59:28,095 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 101 predicate places. [2023-08-24 08:59:28,095 INFO L495 AbstractCegarLoop]: Abstraction has has 141 places, 196 transitions, 1280 flow [2023-08-24 08:59:28,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 104.23076923076923) internal successors, (2710), 26 states have internal predecessors, (2710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:59:28,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:59:28,096 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:59:28,104 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 08:59:28,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 08:59:28,302 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:59:28,302 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:59:28,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1959356175, now seen corresponding path program 2 times [2023-08-24 08:59:28,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:59:28,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577318966] [2023-08-24 08:59:28,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:59:28,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:59:28,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:59:28,606 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-24 08:59:28,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:59:28,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577318966] [2023-08-24 08:59:28,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577318966] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 08:59:28,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 08:59:28,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 08:59:28,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146078143] [2023-08-24 08:59:28,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 08:59:28,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 08:59:28,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:59:28,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 08:59:28,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 08:59:28,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 303 [2023-08-24 08:59:28,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 196 transitions, 1280 flow. Second operand has 4 states, 4 states have (on average 146.5) internal successors, (586), 4 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:59:28,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:59:28,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 303 [2023-08-24 08:59:28,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:59:30,985 INFO L124 PetriNetUnfolderBase]: 13138/18484 cut-off events. [2023-08-24 08:59:30,986 INFO L125 PetriNetUnfolderBase]: For 312079/313917 co-relation queries the response was YES. [2023-08-24 08:59:31,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101377 conditions, 18484 events. 13138/18484 cut-off events. For 312079/313917 co-relation queries the response was YES. Maximal size of possible extension queue 791. Compared 105044 event pairs, 1579 based on Foata normal form. 1515/19664 useless extension candidates. Maximal degree in co-relation 101314. Up to 10991 conditions per place. [2023-08-24 08:59:31,122 INFO L140 encePairwiseOnDemand]: 299/303 looper letters, 157 selfloop transitions, 4 changer transitions 338/500 dead transitions. [2023-08-24 08:59:31,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 500 transitions, 4304 flow [2023-08-24 08:59:31,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 08:59:31,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 08:59:31,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 767 transitions. [2023-08-24 08:59:31,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5062706270627063 [2023-08-24 08:59:31,125 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 767 transitions. [2023-08-24 08:59:31,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 767 transitions. [2023-08-24 08:59:31,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:59:31,126 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 767 transitions. [2023-08-24 08:59:31,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 153.4) internal successors, (767), 5 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:59:31,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:59:31,130 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:59:31,130 INFO L175 Difference]: Start difference. First operand has 141 places, 196 transitions, 1280 flow. Second operand 5 states and 767 transitions. [2023-08-24 08:59:31,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 500 transitions, 4304 flow [2023-08-24 08:59:31,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 500 transitions, 4175 flow, removed 64 selfloop flow, removed 20 redundant places. [2023-08-24 08:59:31,690 INFO L231 Difference]: Finished difference. Result has 99 places, 122 transitions, 725 flow [2023-08-24 08:59:31,691 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=1213, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=725, PETRI_PLACES=99, PETRI_TRANSITIONS=122} [2023-08-24 08:59:31,691 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 59 predicate places. [2023-08-24 08:59:31,692 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 122 transitions, 725 flow [2023-08-24 08:59:31,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 146.5) internal successors, (586), 4 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:59:31,692 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:59:31,692 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:59:31,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 08:59:31,692 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:59:31,693 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:59:31,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1437768239, now seen corresponding path program 3 times [2023-08-24 08:59:31,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:59:31,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256586418] [2023-08-24 08:59:31,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:59:31,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:59:31,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 08:59:32,344 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 08:59:32,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 08:59:32,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256586418] [2023-08-24 08:59:32,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256586418] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 08:59:32,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852648879] [2023-08-24 08:59:32,345 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 08:59:32,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 08:59:32,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 08:59:32,346 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 08:59:32,378 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 08:59:32,529 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-24 08:59:32,530 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 08:59:32,534 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 37 conjunts are in the unsatisfiable core [2023-08-24 08:59:32,537 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 08:59:32,624 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 08:59:32,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 08:59:32,692 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 08:59:32,787 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-08-24 08:59:32,823 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 08:59:32,823 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 08:59:47,460 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 08:59:47,460 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 45 [2023-08-24 08:59:47,465 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 72 [2023-08-24 08:59:47,471 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2023-08-24 08:59:47,475 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2023-08-24 08:59:47,517 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 08:59:47,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852648879] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 08:59:47,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 08:59:47,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 11] total 27 [2023-08-24 08:59:47,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965121507] [2023-08-24 08:59:47,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 08:59:47,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-24 08:59:47,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 08:59:47,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-24 08:59:47,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=649, Unknown=16, NotChecked=0, Total=812 [2023-08-24 08:59:47,521 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 303 [2023-08-24 08:59:47,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 122 transitions, 725 flow. Second operand has 29 states, 29 states have (on average 104.0) internal successors, (3016), 29 states have internal predecessors, (3016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:59:47,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 08:59:47,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 303 [2023-08-24 08:59:47,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 08:59:56,796 INFO L124 PetriNetUnfolderBase]: 31337/42953 cut-off events. [2023-08-24 08:59:56,796 INFO L125 PetriNetUnfolderBase]: For 643247/643247 co-relation queries the response was YES. [2023-08-24 08:59:57,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228210 conditions, 42953 events. 31337/42953 cut-off events. For 643247/643247 co-relation queries the response was YES. Maximal size of possible extension queue 1527. Compared 251344 event pairs, 1614 based on Foata normal form. 23/42125 useless extension candidates. Maximal degree in co-relation 228163. Up to 9103 conditions per place. [2023-08-24 08:59:57,295 INFO L140 encePairwiseOnDemand]: 290/303 looper letters, 530 selfloop transitions, 229 changer transitions 1226/1985 dead transitions. [2023-08-24 08:59:57,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 1985 transitions, 17215 flow [2023-08-24 08:59:57,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2023-08-24 08:59:57,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2023-08-24 08:59:57,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 10007 transitions. [2023-08-24 08:59:57,315 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3753000300030003 [2023-08-24 08:59:57,316 INFO L72 ComplementDD]: Start complementDD. Operand 88 states and 10007 transitions. [2023-08-24 08:59:57,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 88 states and 10007 transitions. [2023-08-24 08:59:57,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 08:59:57,322 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 88 states and 10007 transitions. [2023-08-24 08:59:57,343 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 89 states, 88 states have (on average 113.7159090909091) internal successors, (10007), 88 states have internal predecessors, (10007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:59:57,375 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 89 states, 89 states have (on average 303.0) internal successors, (26967), 89 states have internal predecessors, (26967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:59:57,383 INFO L81 ComplementDD]: Finished complementDD. Result has 89 states, 89 states have (on average 303.0) internal successors, (26967), 89 states have internal predecessors, (26967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:59:57,384 INFO L175 Difference]: Start difference. First operand has 99 places, 122 transitions, 725 flow. Second operand 88 states and 10007 transitions. [2023-08-24 08:59:57,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 1985 transitions, 17215 flow [2023-08-24 08:59:59,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 1985 transitions, 15275 flow, removed 930 selfloop flow, removed 12 redundant places. [2023-08-24 08:59:59,147 INFO L231 Difference]: Finished difference. Result has 233 places, 315 transitions, 3184 flow [2023-08-24 08:59:59,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=88, PETRI_FLOW=3184, PETRI_PLACES=233, PETRI_TRANSITIONS=315} [2023-08-24 08:59:59,148 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 193 predicate places. [2023-08-24 08:59:59,148 INFO L495 AbstractCegarLoop]: Abstraction has has 233 places, 315 transitions, 3184 flow [2023-08-24 08:59:59,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 104.0) internal successors, (3016), 29 states have internal predecessors, (3016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 08:59:59,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 08:59:59,150 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 08:59:59,157 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 08:59:59,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2023-08-24 08:59:59,358 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 08:59:59,358 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 08:59:59,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1175093357, now seen corresponding path program 4 times [2023-08-24 08:59:59,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 08:59:59,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033276622] [2023-08-24 08:59:59,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 08:59:59,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 08:59:59,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:00:00,031 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 09:00:00,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:00:00,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033276622] [2023-08-24 09:00:00,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033276622] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:00:00,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1224377151] [2023-08-24 09:00:00,032 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-24 09:00:00,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:00:00,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:00:00,033 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:00:00,034 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:00:00,161 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-24 09:00:00,161 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:00:00,163 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 45 conjunts are in the unsatisfiable core [2023-08-24 09:00:00,167 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:00:00,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 09:00:00,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 09:00:00,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 09:00:00,180 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-08-24 09:00:00,215 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-24 09:00:00,261 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-24 09:00:00,297 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:00:00,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 09:00:00,405 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 09:00:00,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 09:00:00,444 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 09:00:00,498 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:00:00,499 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 36 [2023-08-24 09:00:00,567 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 09:00:00,567 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:00:00,803 WARN L839 $PredicateComparison]: unable to prove that (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_357 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse0 (select .cse1 (+ c_~A~0.offset (* thread2Thread1of1ForFork0_~i~1 4))))) (or (<= 2147483647 .cse0) (<= c_~min~0 (+ .cse0 1)) (< .cse0 (select .cse1 c_~A~0.offset)))))) is different from false [2023-08-24 09:00:00,826 WARN L839 $PredicateComparison]: unable to prove that (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse0 (select .cse1 (+ c_~A~0.offset (* thread2Thread1of1ForFork0_~i~1 4))))) (or (< .cse0 (select .cse1 c_~A~0.offset)) (<= 2147483647 .cse0) (<= c_~min~0 (+ .cse0 1)))))) is different from false [2023-08-24 09:00:01,110 WARN L839 $PredicateComparison]: unable to prove that (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse0 (select .cse1 (+ c_~A~0.offset (* thread2Thread1of1ForFork0_~i~1 4))))) (or (<= (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) (+ .cse0 1)) (< .cse0 (select .cse1 c_~A~0.offset)) (<= 2147483647 .cse0))))) is different from false [2023-08-24 09:00:01,138 WARN L839 $PredicateComparison]: unable to prove that (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_355 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_355))) (let ((.cse2 (select (store (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_357) c_~A~0.base))) (let ((.cse1 (select .cse2 (+ c_~A~0.offset (* thread2Thread1of1ForFork0_~i~1 4))))) (or (<= (select (select .cse0 c_~A~0.base) c_~A~0.offset) (+ .cse1 1)) (< .cse1 (select .cse2 c_~A~0.offset)) (<= 2147483647 .cse1)))))) is different from false [2023-08-24 09:00:01,169 WARN L839 $PredicateComparison]: unable to prove that (forall ((thread2Thread1of1ForFork0_~i~1 Int) (v_ArrVal_355 (Array Int Int)) (v_ArrVal_354 (Array Int Int)) (v_ArrVal_357 (Array Int Int)) (v_ArrVal_356 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_354) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_355))) (let ((.cse1 (select (store (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_356) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_357) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse0 (select .cse1 (+ (* thread2Thread1of1ForFork0_~i~1 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (<= 2147483647 .cse0) (< .cse0 (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (<= (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (+ .cse0 1))))))) is different from false [2023-08-24 09:00:01,180 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:00:01,181 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 110 [2023-08-24 09:00:01,215 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:00:01,216 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58688 treesize of output 55304 [2023-08-24 09:00:01,304 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:00:01,304 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 462 treesize of output 442 [2023-08-24 09:00:01,330 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:00:01,331 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 920 treesize of output 848 [2023-08-24 09:00:01,359 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:00:01,359 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 840 treesize of output 688 [2023-08-24 09:00:01,390 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:00:01,390 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 367 treesize of output 319 [2023-08-24 09:00:02,848 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2023-08-24 09:00:02,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1224377151] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:00:02,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:00:02,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 12] total 31 [2023-08-24 09:00:02,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893339621] [2023-08-24 09:00:02,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:00:02,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-24 09:00:02,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:00:02,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-24 09:00:02,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=635, Unknown=9, NotChecked=280, Total=1056 [2023-08-24 09:00:02,852 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 303 [2023-08-24 09:00:02,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 315 transitions, 3184 flow. Second operand has 33 states, 33 states have (on average 90.78787878787878) internal successors, (2996), 33 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:00:02,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:00:02,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 303 [2023-08-24 09:00:02,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:00:15,404 INFO L124 PetriNetUnfolderBase]: 30369/41996 cut-off events. [2023-08-24 09:00:15,404 INFO L125 PetriNetUnfolderBase]: For 3100385/3100385 co-relation queries the response was YES. [2023-08-24 09:00:16,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 400878 conditions, 41996 events. 30369/41996 cut-off events. For 3100385/3100385 co-relation queries the response was YES. Maximal size of possible extension queue 1515. Compared 249602 event pairs, 2711 based on Foata normal form. 15/42010 useless extension candidates. Maximal degree in co-relation 400767. Up to 10312 conditions per place. [2023-08-24 09:00:16,585 INFO L140 encePairwiseOnDemand]: 292/303 looper letters, 266 selfloop transitions, 184 changer transitions 956/1406 dead transitions. [2023-08-24 09:00:16,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 1406 transitions, 21500 flow [2023-08-24 09:00:16,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-08-24 09:00:16,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2023-08-24 09:00:16,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 4604 transitions. [2023-08-24 09:00:16,593 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3303199885205912 [2023-08-24 09:00:16,594 INFO L72 ComplementDD]: Start complementDD. Operand 46 states and 4604 transitions. [2023-08-24 09:00:16,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 4604 transitions. [2023-08-24 09:00:16,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:00:16,595 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 46 states and 4604 transitions. [2023-08-24 09:00:16,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 47 states, 46 states have (on average 100.08695652173913) internal successors, (4604), 46 states have internal predecessors, (4604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:00:16,619 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 47 states, 47 states have (on average 303.0) internal successors, (14241), 47 states have internal predecessors, (14241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:00:16,621 INFO L81 ComplementDD]: Finished complementDD. Result has 47 states, 47 states have (on average 303.0) internal successors, (14241), 47 states have internal predecessors, (14241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:00:16,622 INFO L175 Difference]: Start difference. First operand has 233 places, 315 transitions, 3184 flow. Second operand 46 states and 4604 transitions. [2023-08-24 09:00:16,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 1406 transitions, 21500 flow [2023-08-24 09:00:27,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 1406 transitions, 16508 flow, removed 2358 selfloop flow, removed 45 redundant places. [2023-08-24 09:00:27,264 INFO L231 Difference]: Finished difference. Result has 216 places, 329 transitions, 4013 flow [2023-08-24 09:00:27,265 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=2809, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=163, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=4013, PETRI_PLACES=216, PETRI_TRANSITIONS=329} [2023-08-24 09:00:27,265 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 176 predicate places. [2023-08-24 09:00:27,266 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 329 transitions, 4013 flow [2023-08-24 09:00:27,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 90.78787878787878) internal successors, (2996), 33 states have internal predecessors, (2996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:00:27,266 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:00:27,266 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:00:27,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-24 09:00:27,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:00:27,468 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 09:00:27,468 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:00:27,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1649871177, now seen corresponding path program 5 times [2023-08-24 09:00:27,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:00:27,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727110776] [2023-08-24 09:00:27,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:00:27,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:00:27,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:00:27,728 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-24 09:00:27,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:00:27,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727110776] [2023-08-24 09:00:27,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727110776] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 09:00:27,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 09:00:27,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 09:00:27,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147945694] [2023-08-24 09:00:27,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 09:00:27,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 09:00:27,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:00:27,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 09:00:27,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 09:00:27,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 303 [2023-08-24 09:00:27,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 329 transitions, 4013 flow. Second operand has 4 states, 4 states have (on average 146.5) internal successors, (586), 4 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:00:27,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:00:27,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 303 [2023-08-24 09:00:27,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:00:32,399 INFO L124 PetriNetUnfolderBase]: 18760/26408 cut-off events. [2023-08-24 09:00:32,400 INFO L125 PetriNetUnfolderBase]: For 1609780/1613359 co-relation queries the response was YES. [2023-08-24 09:00:32,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233472 conditions, 26408 events. 18760/26408 cut-off events. For 1609780/1613359 co-relation queries the response was YES. Maximal size of possible extension queue 1049. Compared 153714 event pairs, 3869 based on Foata normal form. 1098/27223 useless extension candidates. Maximal degree in co-relation 233365. Up to 19626 conditions per place. [2023-08-24 09:00:32,978 INFO L140 encePairwiseOnDemand]: 299/303 looper letters, 327 selfloop transitions, 21 changer transitions 243/606 dead transitions. [2023-08-24 09:00:32,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 606 transitions, 8777 flow [2023-08-24 09:00:32,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 09:00:32,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 09:00:32,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 761 transitions. [2023-08-24 09:00:32,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5023102310231023 [2023-08-24 09:00:32,982 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 761 transitions. [2023-08-24 09:00:32,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 761 transitions. [2023-08-24 09:00:32,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:00:32,983 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 761 transitions. [2023-08-24 09:00:32,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 152.2) internal successors, (761), 5 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:00:32,986 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:00:32,986 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 303.0) internal successors, (1818), 6 states have internal predecessors, (1818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:00:32,986 INFO L175 Difference]: Start difference. First operand has 216 places, 329 transitions, 4013 flow. Second operand 5 states and 761 transitions. [2023-08-24 09:00:32,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 606 transitions, 8777 flow [2023-08-24 09:00:38,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 606 transitions, 8047 flow, removed 343 selfloop flow, removed 38 redundant places. [2023-08-24 09:00:38,674 INFO L231 Difference]: Finished difference. Result has 149 places, 317 transitions, 3535 flow [2023-08-24 09:00:38,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=3621, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3535, PETRI_PLACES=149, PETRI_TRANSITIONS=317} [2023-08-24 09:00:38,675 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 109 predicate places. [2023-08-24 09:00:38,675 INFO L495 AbstractCegarLoop]: Abstraction has has 149 places, 317 transitions, 3535 flow [2023-08-24 09:00:38,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 146.5) internal successors, (586), 4 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:00:38,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:00:38,676 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:00:38,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 09:00:38,676 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 09:00:38,676 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:00:38,677 INFO L85 PathProgramCache]: Analyzing trace with hash -577294129, now seen corresponding path program 6 times [2023-08-24 09:00:38,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:00:38,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077926012] [2023-08-24 09:00:38,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:00:38,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:00:38,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:00:39,138 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 09:00:39,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:00:39,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077926012] [2023-08-24 09:00:39,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077926012] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:00:39,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000431035] [2023-08-24 09:00:39,141 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-24 09:00:39,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:00:39,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:00:39,142 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:00:39,144 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:00:39,365 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-08-24 09:00:39,365 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:00:39,367 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-24 09:00:39,372 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:00:39,524 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-08-24 09:00:39,558 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 09:00:39,558 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:00:39,844 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:00:39,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000431035] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:00:39,845 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:00:39,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 7] total 20 [2023-08-24 09:00:39,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412148278] [2023-08-24 09:00:39,845 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:00:39,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-24 09:00:39,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:00:39,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-24 09:00:39,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=324, Unknown=0, NotChecked=0, Total=420 [2023-08-24 09:00:39,847 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 303 [2023-08-24 09:00:39,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 317 transitions, 3535 flow. Second operand has 21 states, 21 states have (on average 114.80952380952381) internal successors, (2411), 21 states have internal predecessors, (2411), 0 states have call successors, (0), 0 states have 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:00:39,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:00:39,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 303 [2023-08-24 09:00:39,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:00:53,879 INFO L124 PetriNetUnfolderBase]: 59338/82632 cut-off events. [2023-08-24 09:00:53,879 INFO L125 PetriNetUnfolderBase]: For 2441065/2443737 co-relation queries the response was YES. [2023-08-24 09:00:54,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 596684 conditions, 82632 events. 59338/82632 cut-off events. For 2441065/2443737 co-relation queries the response was YES. Maximal size of possible extension queue 3275. Compared 548613 event pairs, 5797 based on Foata normal form. 2122/84594 useless extension candidates. Maximal degree in co-relation 596610. Up to 20935 conditions per place. [2023-08-24 09:00:55,028 INFO L140 encePairwiseOnDemand]: 291/303 looper letters, 486 selfloop transitions, 162 changer transitions 1689/2350 dead transitions. [2023-08-24 09:00:55,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 2350 transitions, 31609 flow [2023-08-24 09:00:55,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-08-24 09:00:55,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2023-08-24 09:00:55,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 6247 transitions. [2023-08-24 09:00:55,038 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41234323432343234 [2023-08-24 09:00:55,038 INFO L72 ComplementDD]: Start complementDD. Operand 50 states and 6247 transitions. [2023-08-24 09:00:55,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 6247 transitions. [2023-08-24 09:00:55,040 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:00:55,041 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 50 states and 6247 transitions. [2023-08-24 09:00:55,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 51 states, 50 states have (on average 124.94) internal successors, (6247), 50 states have internal predecessors, (6247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:00:55,064 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 51 states, 51 states have (on average 303.0) internal successors, (15453), 51 states have internal predecessors, (15453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:00:55,067 INFO L81 ComplementDD]: Finished complementDD. Result has 51 states, 51 states have (on average 303.0) internal successors, (15453), 51 states have internal predecessors, (15453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:00:55,067 INFO L175 Difference]: Start difference. First operand has 149 places, 317 transitions, 3535 flow. Second operand 50 states and 6247 transitions. [2023-08-24 09:00:55,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 2350 transitions, 31609 flow [2023-08-24 09:01:13,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 2350 transitions, 31377 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-08-24 09:01:13,448 INFO L231 Difference]: Finished difference. Result has 240 places, 401 transitions, 6139 flow [2023-08-24 09:01:13,449 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=3489, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=6139, PETRI_PLACES=240, PETRI_TRANSITIONS=401} [2023-08-24 09:01:13,450 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 200 predicate places. [2023-08-24 09:01:13,450 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 401 transitions, 6139 flow [2023-08-24 09:01:13,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 114.80952380952381) internal successors, (2411), 21 states have internal predecessors, (2411), 0 states have call successors, (0), 0 states have 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:01:13,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:01:13,451 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:01:13,463 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:01:13,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:01:13,657 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 09:01:13,657 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:01:13,657 INFO L85 PathProgramCache]: Analyzing trace with hash 2060274039, now seen corresponding path program 7 times [2023-08-24 09:01:13,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:01:13,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463354317] [2023-08-24 09:01:13,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:01:13,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:01:13,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:01:14,208 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 09:01:14,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:01:14,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463354317] [2023-08-24 09:01:14,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463354317] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:01:14,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2092924613] [2023-08-24 09:01:14,208 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-24 09:01:14,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:01:14,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:01:14,210 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:01:14,213 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:01:14,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:01:14,342 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 26 conjunts are in the unsatisfiable core [2023-08-24 09:01:14,345 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:01:14,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 09:01:14,468 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 09:01:14,509 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-08-24 09:01:14,535 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 09:01:14,535 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:01:14,880 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:01:14,881 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 113 treesize of output 85 [2023-08-24 09:01:14,887 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2023-08-24 09:01:14,892 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2023-08-24 09:01:14,961 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 09:01:14,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2092924613] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-24 09:01:14,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-24 09:01:14,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [7, 8] total 21 [2023-08-24 09:01:14,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859016046] [2023-08-24 09:01:14,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 09:01:14,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-24 09:01:14,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:01:14,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-24 09:01:14,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=408, Unknown=3, NotChecked=0, Total=506 [2023-08-24 09:01:14,963 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 303 [2023-08-24 09:01:14,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 401 transitions, 6139 flow. Second operand has 11 states, 11 states have (on average 115.72727272727273) internal successors, (1273), 11 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:01:14,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:01:14,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 303 [2023-08-24 09:01:14,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:01:25,877 INFO L124 PetriNetUnfolderBase]: 35539/50056 cut-off events. [2023-08-24 09:01:25,877 INFO L125 PetriNetUnfolderBase]: For 4447356/4449066 co-relation queries the response was YES. [2023-08-24 09:01:26,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 537930 conditions, 50056 events. 35539/50056 cut-off events. For 4447356/4449066 co-relation queries the response was YES. Maximal size of possible extension queue 1976. Compared 316945 event pairs, 9949 based on Foata normal form. 1221/51214 useless extension candidates. Maximal degree in co-relation 537809. Up to 24568 conditions per place. [2023-08-24 09:01:26,946 INFO L140 encePairwiseOnDemand]: 295/303 looper letters, 453 selfloop transitions, 26 changer transitions 265/757 dead transitions. [2023-08-24 09:01:26,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 757 transitions, 13922 flow [2023-08-24 09:01:26,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 09:01:26,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 09:01:26,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1012 transitions. [2023-08-24 09:01:26,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4174917491749175 [2023-08-24 09:01:26,948 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1012 transitions. [2023-08-24 09:01:26,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1012 transitions. [2023-08-24 09:01:26,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:01:26,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1012 transitions. [2023-08-24 09:01:26,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 126.5) internal successors, (1012), 8 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:01:26,951 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 303.0) internal successors, (2727), 9 states have internal predecessors, (2727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:01:26,951 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 303.0) internal successors, (2727), 9 states have internal predecessors, (2727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:01:26,951 INFO L175 Difference]: Start difference. First operand has 240 places, 401 transitions, 6139 flow. Second operand 8 states and 1012 transitions. [2023-08-24 09:01:26,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 757 transitions, 13922 flow [2023-08-24 09:01:41,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 757 transitions, 12936 flow, removed 466 selfloop flow, removed 27 redundant places. [2023-08-24 09:01:41,879 INFO L231 Difference]: Finished difference. Result has 189 places, 407 transitions, 5904 flow [2023-08-24 09:01:41,879 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=5663, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=375, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5904, PETRI_PLACES=189, PETRI_TRANSITIONS=407} [2023-08-24 09:01:41,879 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 149 predicate places. [2023-08-24 09:01:41,880 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 407 transitions, 5904 flow [2023-08-24 09:01:41,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 115.72727272727273) internal successors, (1273), 11 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:01:41,880 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:01:41,880 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:01:41,884 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:01:42,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-08-24 09:01:42,081 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 09:01:42,081 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:01:42,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1302181585, now seen corresponding path program 8 times [2023-08-24 09:01:42,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:01:42,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700803811] [2023-08-24 09:01:42,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:01:42,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:01:42,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:01:42,479 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 09:01:42,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:01:42,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700803811] [2023-08-24 09:01:42,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700803811] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:01:42,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633495001] [2023-08-24 09:01:42,480 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 09:01:42,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:01:42,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:01:42,481 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:01:42,485 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:01:42,651 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 09:01:42,651 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:01:42,653 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 33 conjunts are in the unsatisfiable core [2023-08-24 09:01:42,655 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:01:42,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 09:01:42,746 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 09:01:42,795 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-08-24 09:01:42,829 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 09:01:42,829 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:01:43,273 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2023-08-24 09:01:43,301 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 09:01:43,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633495001] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-24 09:01:43,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-24 09:01:43,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [7, 9] total 25 [2023-08-24 09:01:43,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417885256] [2023-08-24 09:01:43,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 09:01:43,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-24 09:01:43,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:01:43,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-24 09:01:43,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=566, Unknown=4, NotChecked=0, Total=702 [2023-08-24 09:01:43,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 303 [2023-08-24 09:01:43,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 407 transitions, 5904 flow. Second operand has 12 states, 12 states have (on average 109.5) internal successors, (1314), 12 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:01:43,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:01:43,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 303 [2023-08-24 09:01:43,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:01:52,847 INFO L124 PetriNetUnfolderBase]: 33059/46506 cut-off events. [2023-08-24 09:01:52,847 INFO L125 PetriNetUnfolderBase]: For 3045647/3046658 co-relation queries the response was YES. [2023-08-24 09:01:53,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 459192 conditions, 46506 events. 33059/46506 cut-off events. For 3045647/3046658 co-relation queries the response was YES. Maximal size of possible extension queue 1838. Compared 291433 event pairs, 6115 based on Foata normal form. 705/47171 useless extension candidates. Maximal degree in co-relation 459092. Up to 13165 conditions per place. [2023-08-24 09:01:53,579 INFO L140 encePairwiseOnDemand]: 292/303 looper letters, 366 selfloop transitions, 95 changer transitions 512/986 dead transitions. [2023-08-24 09:01:53,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 986 transitions, 17447 flow [2023-08-24 09:01:53,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-24 09:01:53,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-24 09:01:53,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1453 transitions. [2023-08-24 09:01:53,581 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3996149614961496 [2023-08-24 09:01:53,581 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1453 transitions. [2023-08-24 09:01:53,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1453 transitions. [2023-08-24 09:01:53,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:01:53,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1453 transitions. [2023-08-24 09:01:53,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 121.08333333333333) internal successors, (1453), 12 states have internal predecessors, (1453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:01:53,586 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 303.0) internal successors, (3939), 13 states have internal predecessors, (3939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:01:53,586 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 303.0) internal successors, (3939), 13 states have internal predecessors, (3939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:01:53,586 INFO L175 Difference]: Start difference. First operand has 189 places, 407 transitions, 5904 flow. Second operand 12 states and 1453 transitions. [2023-08-24 09:01:53,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 986 transitions, 17447 flow [2023-08-24 09:02:05,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 986 transitions, 16703 flow, removed 356 selfloop flow, removed 11 redundant places. [2023-08-24 09:02:05,690 INFO L231 Difference]: Finished difference. Result has 198 places, 351 transitions, 5472 flow [2023-08-24 09:02:05,691 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=5708, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=5472, PETRI_PLACES=198, PETRI_TRANSITIONS=351} [2023-08-24 09:02:05,691 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 158 predicate places. [2023-08-24 09:02:05,691 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 351 transitions, 5472 flow [2023-08-24 09:02:05,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 109.5) internal successors, (1314), 12 states have internal predecessors, (1314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:02:05,692 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:02:05,692 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:02:05,699 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:02:05,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:02:05,893 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 09:02:05,893 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:02:05,893 INFO L85 PathProgramCache]: Analyzing trace with hash -685630469, now seen corresponding path program 9 times [2023-08-24 09:02:05,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:02:05,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953529445] [2023-08-24 09:02:05,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:02:05,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:02:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:02:06,339 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 09:02:06,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:02:06,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953529445] [2023-08-24 09:02:06,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953529445] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:02:06,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802153147] [2023-08-24 09:02:06,339 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 09:02:06,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:02:06,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:02:06,341 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:02:06,343 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:02:06,503 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-24 09:02:06,503 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:02:06,505 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 37 conjunts are in the unsatisfiable core [2023-08-24 09:02:06,674 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:02:06,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 09:02:06,804 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 09:02:06,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 09:02:06,837 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-24 09:02:06,928 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:02:06,928 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 26 treesize of output 20 [2023-08-24 09:02:06,966 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 09:02:06,966 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:02:07,613 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:02:07,613 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 144 treesize of output 128 [2023-08-24 09:02:07,630 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:02:07,630 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 65 treesize of output 65 [2023-08-24 09:02:07,640 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:02:07,643 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 105 treesize of output 97 [2023-08-24 09:02:07,756 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:02:07,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802153147] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:02:07,756 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:02:07,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 12] total 27 [2023-08-24 09:02:07,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86483346] [2023-08-24 09:02:07,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:02:07,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-08-24 09:02:07,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:02:07,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-08-24 09:02:07,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=647, Unknown=15, NotChecked=0, Total=812 [2023-08-24 09:02:07,761 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 303 [2023-08-24 09:02:07,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 351 transitions, 5472 flow. Second operand has 29 states, 29 states have (on average 106.89655172413794) internal successors, (3100), 29 states have internal predecessors, (3100), 0 states have call successors, (0), 0 states have 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:02:07,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:02:07,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 303 [2023-08-24 09:02:07,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:02:17,531 INFO L124 PetriNetUnfolderBase]: 31926/45377 cut-off events. [2023-08-24 09:02:17,531 INFO L125 PetriNetUnfolderBase]: For 2653448/2654272 co-relation queries the response was YES. [2023-08-24 09:02:18,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 428494 conditions, 45377 events. 31926/45377 cut-off events. For 2653448/2654272 co-relation queries the response was YES. Maximal size of possible extension queue 1868. Compared 289271 event pairs, 1981 based on Foata normal form. 633/45987 useless extension candidates. Maximal degree in co-relation 428393. Up to 12074 conditions per place. [2023-08-24 09:02:18,265 INFO L140 encePairwiseOnDemand]: 293/303 looper letters, 290 selfloop transitions, 118 changer transitions 625/1040 dead transitions. [2023-08-24 09:02:18,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 1040 transitions, 18873 flow [2023-08-24 09:02:18,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-08-24 09:02:18,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2023-08-24 09:02:18,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 3466 transitions. [2023-08-24 09:02:18,270 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3812981298129813 [2023-08-24 09:02:18,270 INFO L72 ComplementDD]: Start complementDD. Operand 30 states and 3466 transitions. [2023-08-24 09:02:18,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 3466 transitions. [2023-08-24 09:02:18,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:02:18,271 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 3466 transitions. [2023-08-24 09:02:18,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 31 states, 30 states have (on average 115.53333333333333) internal successors, (3466), 30 states have internal predecessors, (3466), 0 states have call successors, (0), 0 states have 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:02:18,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 31 states, 31 states have (on average 303.0) internal successors, (9393), 31 states have internal predecessors, (9393), 0 states have call successors, (0), 0 states have 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:02:18,281 INFO L81 ComplementDD]: Finished complementDD. Result has 31 states, 31 states have (on average 303.0) internal successors, (9393), 31 states have internal predecessors, (9393), 0 states have call successors, (0), 0 states have 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:02:18,281 INFO L175 Difference]: Start difference. First operand has 198 places, 351 transitions, 5472 flow. Second operand 30 states and 3466 transitions. [2023-08-24 09:02:18,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 1040 transitions, 18873 flow [2023-08-24 09:02:23,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 1040 transitions, 18090 flow, removed 300 selfloop flow, removed 16 redundant places. [2023-08-24 09:02:23,985 INFO L231 Difference]: Finished difference. Result has 230 places, 285 transitions, 5203 flow [2023-08-24 09:02:23,985 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=5295, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=5203, PETRI_PLACES=230, PETRI_TRANSITIONS=285} [2023-08-24 09:02:23,986 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 190 predicate places. [2023-08-24 09:02:23,986 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 285 transitions, 5203 flow [2023-08-24 09:02:23,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 106.89655172413794) internal successors, (3100), 29 states have internal predecessors, (3100), 0 states have call successors, (0), 0 states have 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:02:23,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:02:23,986 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:02:23,991 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:02:24,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:02:24,187 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 09:02:24,188 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:02:24,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1315853358, now seen corresponding path program 10 times [2023-08-24 09:02:24,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:02:24,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623888447] [2023-08-24 09:02:24,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:02:24,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:02:24,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:02:24,317 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 09:02:24,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:02:24,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623888447] [2023-08-24 09:02:24,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623888447] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:02:24,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468425687] [2023-08-24 09:02:24,318 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-24 09:02:24,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:02:24,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:02:24,319 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:02:24,321 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:02:24,456 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-24 09:02:24,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:02:24,458 INFO L262 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-24 09:02:24,461 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:02:24,518 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 09:02:24,519 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:02:24,570 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 09:02:24,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468425687] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:02:24,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:02:24,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 15 [2023-08-24 09:02:24,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134946610] [2023-08-24 09:02:24,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:02:24,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-24 09:02:24,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:02:24,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-24 09:02:24,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2023-08-24 09:02:24,573 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 303 [2023-08-24 09:02:24,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 285 transitions, 5203 flow. Second operand has 15 states, 15 states have (on average 117.6) internal successors, (1764), 15 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:02:24,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:02:24,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 303 [2023-08-24 09:02:24,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:02:35,140 INFO L124 PetriNetUnfolderBase]: 32312/45716 cut-off events. [2023-08-24 09:02:35,140 INFO L125 PetriNetUnfolderBase]: For 3619292/3619292 co-relation queries the response was YES. [2023-08-24 09:02:35,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 490480 conditions, 45716 events. 32312/45716 cut-off events. For 3619292/3619292 co-relation queries the response was YES. Maximal size of possible extension queue 1852. Compared 287565 event pairs, 7856 based on Foata normal form. 929/46643 useless extension candidates. Maximal degree in co-relation 489989. Up to 19543 conditions per place. [2023-08-24 09:02:35,961 INFO L140 encePairwiseOnDemand]: 294/303 looper letters, 650 selfloop transitions, 170 changer transitions 221/1041 dead transitions. [2023-08-24 09:02:35,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 1041 transitions, 21278 flow [2023-08-24 09:02:35,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-08-24 09:02:35,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2023-08-24 09:02:35,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 3948 transitions. [2023-08-24 09:02:35,965 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40717821782178215 [2023-08-24 09:02:35,965 INFO L72 ComplementDD]: Start complementDD. Operand 32 states and 3948 transitions. [2023-08-24 09:02:35,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 3948 transitions. [2023-08-24 09:02:35,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:02:35,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 3948 transitions. [2023-08-24 09:02:35,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 33 states, 32 states have (on average 123.375) internal successors, (3948), 32 states have internal predecessors, (3948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:02:35,976 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 33 states, 33 states have (on average 303.0) internal successors, (9999), 33 states have internal predecessors, (9999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:02:35,977 INFO L81 ComplementDD]: Finished complementDD. Result has 33 states, 33 states have (on average 303.0) internal successors, (9999), 33 states have internal predecessors, (9999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:02:35,977 INFO L175 Difference]: Start difference. First operand has 230 places, 285 transitions, 5203 flow. Second operand 32 states and 3948 transitions. [2023-08-24 09:02:35,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 1041 transitions, 21278 flow [2023-08-24 09:02:42,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 1041 transitions, 18575 flow, removed 1117 selfloop flow, removed 34 redundant places. [2023-08-24 09:02:42,340 INFO L231 Difference]: Finished difference. Result has 216 places, 376 transitions, 6726 flow [2023-08-24 09:02:42,340 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=4549, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=6726, PETRI_PLACES=216, PETRI_TRANSITIONS=376} [2023-08-24 09:02:42,340 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 176 predicate places. [2023-08-24 09:02:42,340 INFO L495 AbstractCegarLoop]: Abstraction has has 216 places, 376 transitions, 6726 flow [2023-08-24 09:02:42,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 117.6) internal successors, (1764), 15 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:02:42,341 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:02:42,341 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:02:42,346 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:02:42,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-08-24 09:02:42,542 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 09:02:42,542 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:02:42,542 INFO L85 PathProgramCache]: Analyzing trace with hash -248644329, now seen corresponding path program 11 times [2023-08-24 09:02:42,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:02:42,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736182024] [2023-08-24 09:02:42,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:02:42,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:02:42,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:02:42,867 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-24 09:02:42,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:02:42,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736182024] [2023-08-24 09:02:42,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736182024] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:02:42,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872023970] [2023-08-24 09:02:42,868 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-24 09:02:42,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:02:42,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:02:42,869 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:02:42,872 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:02:43,048 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 09:02:43,049 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:02:43,050 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-24 09:02:43,055 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:02:43,125 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-24 09:02:43,126 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:02:43,177 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-24 09:02:43,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872023970] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:02:43,177 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:02:43,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2023-08-24 09:02:43,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035895201] [2023-08-24 09:02:43,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:02:43,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-24 09:02:43,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:02:43,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-24 09:02:43,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-08-24 09:02:43,179 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 303 [2023-08-24 09:02:43,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 376 transitions, 6726 flow. Second operand has 16 states, 16 states have (on average 117.5) internal successors, (1880), 16 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:02:43,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:02:43,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 303 [2023-08-24 09:02:43,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:02:49,779 INFO L124 PetriNetUnfolderBase]: 24569/34201 cut-off events. [2023-08-24 09:02:49,779 INFO L125 PetriNetUnfolderBase]: For 1649117/1649117 co-relation queries the response was YES. [2023-08-24 09:02:50,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 352383 conditions, 34201 events. 24569/34201 cut-off events. For 1649117/1649117 co-relation queries the response was YES. Maximal size of possible extension queue 1450. Compared 200141 event pairs, 7665 based on Foata normal form. 1701/35901 useless extension candidates. Maximal degree in co-relation 352270. Up to 22248 conditions per place. [2023-08-24 09:02:50,366 INFO L140 encePairwiseOnDemand]: 295/303 looper letters, 444 selfloop transitions, 112 changer transitions 0/556 dead transitions. [2023-08-24 09:02:50,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 556 transitions, 11686 flow [2023-08-24 09:02:50,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-24 09:02:50,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-24 09:02:50,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1229 transitions. [2023-08-24 09:02:50,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4056105610561056 [2023-08-24 09:02:50,367 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1229 transitions. [2023-08-24 09:02:50,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1229 transitions. [2023-08-24 09:02:50,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:02:50,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1229 transitions. [2023-08-24 09:02:50,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 122.9) internal successors, (1229), 10 states have internal predecessors, (1229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:02:50,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 303.0) internal successors, (3333), 11 states have internal predecessors, (3333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:02:50,371 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 303.0) internal successors, (3333), 11 states have internal predecessors, (3333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:02:50,371 INFO L175 Difference]: Start difference. First operand has 216 places, 376 transitions, 6726 flow. Second operand 10 states and 1229 transitions. [2023-08-24 09:02:50,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 556 transitions, 11686 flow [2023-08-24 09:02:54,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 556 transitions, 10649 flow, removed 479 selfloop flow, removed 18 redundant places. [2023-08-24 09:02:54,828 INFO L231 Difference]: Finished difference. Result has 194 places, 370 transitions, 6137 flow [2023-08-24 09:02:54,829 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=5913, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=112, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6137, PETRI_PLACES=194, PETRI_TRANSITIONS=370} [2023-08-24 09:02:54,829 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 154 predicate places. [2023-08-24 09:02:54,829 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 370 transitions, 6137 flow [2023-08-24 09:02:54,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 117.5) internal successors, (1880), 16 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:02:54,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:02:54,830 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:02:54,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-08-24 09:02:55,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-24 09:02:55,030 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 09:02:55,031 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:02:55,031 INFO L85 PathProgramCache]: Analyzing trace with hash 909702135, now seen corresponding path program 12 times [2023-08-24 09:02:55,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:02:55,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015339373] [2023-08-24 09:02:55,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:02:55,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:02:55,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:02:55,175 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 09:02:55,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:02:55,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015339373] [2023-08-24 09:02:55,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015339373] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:02:55,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762536426] [2023-08-24 09:02:55,175 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-24 09:02:55,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:02:55,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:02:55,177 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:02:55,184 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:02:55,576 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2023-08-24 09:02:55,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:02:55,578 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-24 09:02:55,579 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:02:55,662 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 09:02:55,662 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:02:55,741 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 09:02:55,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762536426] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:02:55,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:02:55,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2023-08-24 09:02:55,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695775853] [2023-08-24 09:02:55,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:02:55,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-24 09:02:55,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:02:55,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-24 09:02:55,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2023-08-24 09:02:55,743 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 303 [2023-08-24 09:02:55,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 370 transitions, 6137 flow. Second operand has 15 states, 15 states have (on average 120.86666666666666) internal successors, (1813), 15 states have internal predecessors, (1813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:02:55,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:02:55,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 303 [2023-08-24 09:02:55,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:03:01,850 INFO L124 PetriNetUnfolderBase]: 24885/34494 cut-off events. [2023-08-24 09:03:01,851 INFO L125 PetriNetUnfolderBase]: For 1207586/1207774 co-relation queries the response was YES. [2023-08-24 09:03:02,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 337525 conditions, 34494 events. 24885/34494 cut-off events. For 1207586/1207774 co-relation queries the response was YES. Maximal size of possible extension queue 1389. Compared 200296 event pairs, 5766 based on Foata normal form. 2659/37135 useless extension candidates. Maximal degree in co-relation 337426. Up to 20365 conditions per place. [2023-08-24 09:03:02,344 INFO L140 encePairwiseOnDemand]: 297/303 looper letters, 459 selfloop transitions, 48 changer transitions 9/527 dead transitions. [2023-08-24 09:03:02,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 527 transitions, 10023 flow [2023-08-24 09:03:02,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 09:03:02,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 09:03:02,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1001 transitions. [2023-08-24 09:03:02,345 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41295379537953797 [2023-08-24 09:03:02,345 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1001 transitions. [2023-08-24 09:03:02,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1001 transitions. [2023-08-24 09:03:02,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:03:02,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1001 transitions. [2023-08-24 09:03:02,347 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 125.125) internal successors, (1001), 8 states have internal predecessors, (1001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:03:02,348 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 303.0) internal successors, (2727), 9 states have internal predecessors, (2727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:03:02,348 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 303.0) internal successors, (2727), 9 states have internal predecessors, (2727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:03:02,348 INFO L175 Difference]: Start difference. First operand has 194 places, 370 transitions, 6137 flow. Second operand 8 states and 1001 transitions. [2023-08-24 09:03:02,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 527 transitions, 10023 flow [2023-08-24 09:03:05,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 527 transitions, 9681 flow, removed 6 selfloop flow, removed 8 redundant places. [2023-08-24 09:03:05,068 INFO L231 Difference]: Finished difference. Result has 194 places, 371 transitions, 6065 flow [2023-08-24 09:03:05,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=5903, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=6065, PETRI_PLACES=194, PETRI_TRANSITIONS=371} [2023-08-24 09:03:05,069 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 154 predicate places. [2023-08-24 09:03:05,069 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 371 transitions, 6065 flow [2023-08-24 09:03:05,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 120.86666666666666) internal successors, (1813), 15 states have internal predecessors, (1813), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 09:03:05,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:03:05,069 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:03:05,083 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:03:05,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-08-24 09:03:05,284 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 09:03:05,284 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:03:05,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1217669233, now seen corresponding path program 13 times [2023-08-24 09:03:05,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:03:05,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399414022] [2023-08-24 09:03:05,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:03:05,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:03:05,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:03:06,040 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-24 09:03:06,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:03:06,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399414022] [2023-08-24 09:03:06,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399414022] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:03:06,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626787828] [2023-08-24 09:03:06,040 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-24 09:03:06,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:03:06,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:03:06,041 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:03:06,044 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:03:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:03:06,192 INFO L262 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 32 conjunts are in the unsatisfiable core [2023-08-24 09:03:06,194 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:03:06,393 INFO L322 Elim1Store]: treesize reduction 14, result has 61.1 percent of original size [2023-08-24 09:03:06,393 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 40 [2023-08-24 09:03:06,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 09:03:06,429 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-08-24 09:03:06,451 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-08-24 09:03:06,475 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 09:03:06,476 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:03:27,282 WARN L234 SmtUtils]: Spent 16.09s on a formula simplification. DAG size of input: 71 DAG size of output: 60 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 09:03:27,323 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 3 refuted. 1 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 09:03:27,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1626787828] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:03:27,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:03:27,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 9] total 31 [2023-08-24 09:03:27,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020482162] [2023-08-24 09:03:27,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:03:27,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-24 09:03:27,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:03:27,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-24 09:03:27,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=845, Unknown=2, NotChecked=0, Total=992 [2023-08-24 09:03:27,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 303 [2023-08-24 09:03:27,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 371 transitions, 6065 flow. Second operand has 32 states, 32 states have (on average 98.09375) internal successors, (3139), 32 states have internal predecessors, (3139), 0 states have call successors, (0), 0 states have 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:03:27,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:03:27,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 303 [2023-08-24 09:03:27,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:03:29,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:03:31,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:03:35,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:03:37,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:03:40,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:03:42,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:03:47,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:03:49,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:03:51,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:03:55,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:03:57,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:04:06,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:04:08,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:04:11,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:04:17,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:04:19,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:04:23,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:04:29,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:04:31,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:04:33,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:04:35,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:04:37,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:04:41,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:04:44,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:04:46,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:04:48,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:04:50,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:04:52,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:04:55,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:04:57,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:04:59,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:05:05,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:05:08,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:05:10,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:05:12,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:05:14,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:05:16,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:05:18,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:05:20,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:05:22,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:05:24,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:05:26,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:05:30,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:05:32,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:05:34,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:05:39,631 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:05:44,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:06:00,891 INFO L124 PetriNetUnfolderBase]: 89446/123180 cut-off events. [2023-08-24 09:06:00,891 INFO L125 PetriNetUnfolderBase]: For 4536837/4536837 co-relation queries the response was YES. [2023-08-24 09:06:02,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1240321 conditions, 123180 events. 89446/123180 cut-off events. For 4536837/4536837 co-relation queries the response was YES. Maximal size of possible extension queue 4625. Compared 829493 event pairs, 13042 based on Foata normal form. 54/123234 useless extension candidates. Maximal degree in co-relation 1240220. Up to 42241 conditions per place. [2023-08-24 09:06:03,100 INFO L140 encePairwiseOnDemand]: 288/303 looper letters, 692 selfloop transitions, 609 changer transitions 1723/3024 dead transitions. [2023-08-24 09:06:03,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 3024 transitions, 58192 flow [2023-08-24 09:06:03,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2023-08-24 09:06:03,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2023-08-24 09:06:03,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 10275 transitions. [2023-08-24 09:06:03,112 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3495968153516383 [2023-08-24 09:06:03,112 INFO L72 ComplementDD]: Start complementDD. Operand 97 states and 10275 transitions. [2023-08-24 09:06:03,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 10275 transitions. [2023-08-24 09:06:03,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 09:06:03,116 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 97 states and 10275 transitions. [2023-08-24 09:06:03,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 98 states, 97 states have (on average 105.9278350515464) internal successors, (10275), 97 states have internal predecessors, (10275), 0 states have call successors, (0), 0 states have 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:06:03,154 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 98 states, 98 states have (on average 303.0) internal successors, (29694), 98 states have internal predecessors, (29694), 0 states have call successors, (0), 0 states have 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:06:03,159 INFO L81 ComplementDD]: Finished complementDD. Result has 98 states, 98 states have (on average 303.0) internal successors, (29694), 98 states have internal predecessors, (29694), 0 states have call successors, (0), 0 states have 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:06:03,159 INFO L175 Difference]: Start difference. First operand has 194 places, 371 transitions, 6065 flow. Second operand 97 states and 10275 transitions. [2023-08-24 09:06:03,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 290 places, 3024 transitions, 58192 flow [2023-08-24 09:06:44,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 3024 transitions, 57497 flow, removed 209 selfloop flow, removed 5 redundant places. [2023-08-24 09:06:44,824 INFO L231 Difference]: Finished difference. Result has 356 places, 864 transitions, 17059 flow [2023-08-24 09:06:44,825 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=6022, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=205, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=97, PETRI_FLOW=17059, PETRI_PLACES=356, PETRI_TRANSITIONS=864} [2023-08-24 09:06:44,825 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 316 predicate places. [2023-08-24 09:06:44,825 INFO L495 AbstractCegarLoop]: Abstraction has has 356 places, 864 transitions, 17059 flow [2023-08-24 09:06:44,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 98.09375) internal successors, (3139), 32 states have internal predecessors, (3139), 0 states have call successors, (0), 0 states have 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:06:44,826 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 09:06:44,826 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 09:06:44,832 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:06:45,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-24 09:06:45,032 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 09:06:45,032 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 09:06:45,032 INFO L85 PathProgramCache]: Analyzing trace with hash 418727089, now seen corresponding path program 14 times [2023-08-24 09:06:45,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 09:06:45,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892834615] [2023-08-24 09:06:45,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 09:06:45,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 09:06:45,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 09:06:46,018 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-24 09:06:46,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 09:06:46,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892834615] [2023-08-24 09:06:46,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892834615] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 09:06:46,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010528886] [2023-08-24 09:06:46,019 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 09:06:46,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 09:06:46,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 09:06:46,021 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:06:46,051 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:06:46,221 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 09:06:46,222 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 09:06:46,224 INFO L262 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 54 conjunts are in the unsatisfiable core [2023-08-24 09:06:46,227 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 09:06:46,655 INFO L322 Elim1Store]: treesize reduction 14, result has 61.1 percent of original size [2023-08-24 09:06:46,656 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 40 [2023-08-24 09:06:46,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 09:06:46,697 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-24 09:06:46,760 INFO L322 Elim1Store]: treesize reduction 12, result has 62.5 percent of original size [2023-08-24 09:06:46,760 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 39 [2023-08-24 09:06:46,998 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:06:46,998 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 45 [2023-08-24 09:06:47,063 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 09:06:47,064 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 09:06:58,205 WARN L839 $PredicateComparison]: unable to prove that (or (= (mod c_~b1~0 256) 0) (forall ((|thread3Thread1of1ForFork1_~i~2#1| Int) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1014 Int) (v_subst_3 Int)) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1012) c_~A~0.base)) (.cse2 (+ c_~A~0.offset (* 4 |thread3Thread1of1ForFork1_~i~2#1|)))) (let ((.cse3 (store .cse1 .cse2 v_ArrVal_1014))) (let ((.cse0 (select .cse3 (+ c_~A~0.offset (* 4 v_subst_3))))) (or (<= 2147483647 .cse0) (<= c_~min~0 (+ .cse0 1)) (<= (+ (select .cse1 .cse2) 2147483648) 0) (< (+ |thread3Thread1of1ForFork1_~i~2#1| 1) c_~N~0) (< .cse0 (select .cse3 c_~A~0.offset)))))))) is different from false [2023-08-24 09:06:58,244 WARN L839 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1011 Int) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1014 Int) (v_subst_3 Int) (|v_thread3Thread1of1ForFork1_~i~2#1_77| Int)) (let ((.cse2 (select |c_#memory_int| c_~A~0.base)) (.cse3 (+ c_~A~0.offset (* |c_thread3Thread1of1ForFork1_~i~2#1| 4)))) (let ((.cse4 (select (store (store |c_#memory_int| c_~A~0.base (store .cse2 .cse3 v_ArrVal_1011)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1012) c_~A~0.base)) (.cse5 (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork1_~i~2#1_77| 4)))) (let ((.cse1 (store .cse4 .cse5 v_ArrVal_1014))) (let ((.cse0 (select .cse1 (+ c_~A~0.offset (* 4 v_subst_3))))) (or (< .cse0 (select .cse1 c_~A~0.offset)) (< (+ v_ArrVal_1011 1) (select .cse2 .cse3)) (< (+ |v_thread3Thread1of1ForFork1_~i~2#1_77| 1) c_~N~0) (<= (+ (select .cse4 .cse5) 2147483648) 0) (<= c_~min~0 (+ .cse0 1)) (<= 2147483647 .cse0))))))) (= (mod c_~b1~0 256) 0)) is different from false [2023-08-24 09:06:58,274 WARN L839 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_1011 Int) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1014 Int) (v_subst_3 Int) (|v_thread3Thread1of1ForFork1_~i~2#1_77| Int)) (let ((.cse4 (select |c_#memory_int| c_~A~0.base))) (let ((.cse0 (select (store (store |c_#memory_int| c_~A~0.base (store .cse4 c_~A~0.offset v_ArrVal_1011)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1012) c_~A~0.base)) (.cse1 (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork1_~i~2#1_77| 4)))) (let ((.cse3 (store .cse0 .cse1 v_ArrVal_1014))) (let ((.cse2 (select .cse3 (+ c_~A~0.offset (* 4 v_subst_3))))) (or (<= (+ (select .cse0 .cse1) 2147483648) 0) (< (+ |v_thread3Thread1of1ForFork1_~i~2#1_77| 1) c_~N~0) (<= 2147483647 .cse2) (<= c_~min~0 (+ .cse2 1)) (< .cse2 (select .cse3 c_~A~0.offset)) (< (+ v_ArrVal_1011 1) (select .cse4 c_~A~0.offset)))))))) (= (mod c_~b1~0 256) 0)) is different from false [2023-08-24 09:07:05,142 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse5 (select |c_#memory_int| c_~A~0.base))) (let ((.cse7 (select .cse5 c_~A~0.offset)) (.cse2 (select .cse5 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))))) (and (or (and (forall ((|v_thread3Thread1of1ForFork1_~i~2#1_77| Int)) (or (< (+ |v_thread3Thread1of1ForFork1_~i~2#1_77| 1) c_~N~0) (forall ((v_ArrVal_1011 Int)) (or (forall ((v_ArrVal_1012 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| c_~A~0.base (store .cse5 c_~A~0.offset v_ArrVal_1011)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1012) c_~A~0.base)) (.cse1 (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork1_~i~2#1_77| 4)))) (or (<= (+ (select .cse0 .cse1) 2147483648) 0) (forall ((v_ArrVal_1014 Int) (v_subst_3 Int)) (let ((.cse6 (store .cse0 .cse1 v_ArrVal_1014))) (let ((.cse4 (select .cse6 (+ c_~A~0.offset (* 4 v_subst_3))))) (or (forall ((v_subst_5 Int)) (let ((.cse3 (select .cse5 (+ c_~A~0.offset (* 4 v_subst_5))))) (or (< .cse2 .cse3) (<= .cse3 (+ .cse4 1))))) (<= 2147483647 .cse4) (< .cse4 (select .cse6 c_~A~0.offset))))))))) (< (+ v_ArrVal_1011 1) .cse7))))) (or (forall ((v_ArrVal_1011 Int) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1014 Int) (v_subst_3 Int) (|v_thread3Thread1of1ForFork1_~i~2#1_77| Int)) (let ((.cse8 (select (store (store |c_#memory_int| c_~A~0.base (store .cse5 c_~A~0.offset v_ArrVal_1011)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1012) c_~A~0.base)) (.cse9 (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork1_~i~2#1_77| 4)))) (let ((.cse11 (store .cse8 .cse9 v_ArrVal_1014))) (let ((.cse10 (select .cse11 (+ c_~A~0.offset (* 4 v_subst_3))))) (or (<= (+ (select .cse8 .cse9) 2147483648) 0) (< (+ |v_thread3Thread1of1ForFork1_~i~2#1_77| 1) c_~N~0) (<= 2147483647 .cse10) (< .cse10 (select .cse11 c_~A~0.offset)) (<= .cse2 (+ .cse10 1)) (< (+ v_ArrVal_1011 1) .cse7)))))) (forall ((v_subst_6 Int)) (<= (select .cse5 (+ c_~A~0.offset (* 4 v_subst_6))) .cse2)))) (< c_~min~0 .cse2)) (or (and (forall ((|v_thread3Thread1of1ForFork1_~i~2#1_77| Int)) (or (< (+ |v_thread3Thread1of1ForFork1_~i~2#1_77| 1) c_~N~0) (forall ((v_ArrVal_1011 Int)) (or (forall ((v_ArrVal_1012 (Array Int Int))) (let ((.cse12 (select (store (store |c_#memory_int| c_~A~0.base (store .cse5 c_~A~0.offset v_ArrVal_1011)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1012) c_~A~0.base)) (.cse13 (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork1_~i~2#1_77| 4)))) (or (<= (+ (select .cse12 .cse13) 2147483648) 0) (forall ((v_ArrVal_1014 Int) (v_subst_3 Int)) (let ((.cse15 (store .cse12 .cse13 v_ArrVal_1014))) (let ((.cse14 (select .cse15 (+ c_~A~0.offset (* 4 v_subst_3))))) (or (<= 2147483647 .cse14) (< .cse14 (select .cse15 c_~A~0.offset)) (forall ((thread1Thread1of1ForFork2_~i~0 Int)) (let ((.cse16 (select .cse5 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4))))) (or (< c_~min~0 .cse16) (<= .cse16 (+ .cse14 1)))))))))))) (< (+ v_ArrVal_1011 1) .cse7))))) (or (forall ((v_ArrVal_1011 Int) (v_ArrVal_1012 (Array Int Int)) (v_ArrVal_1014 Int) (v_subst_3 Int) (|v_thread3Thread1of1ForFork1_~i~2#1_77| Int)) (let ((.cse17 (select (store (store |c_#memory_int| c_~A~0.base (store .cse5 c_~A~0.offset v_ArrVal_1011)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1012) c_~A~0.base)) (.cse18 (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork1_~i~2#1_77| 4)))) (let ((.cse20 (store .cse17 .cse18 v_ArrVal_1014))) (let ((.cse19 (select .cse20 (+ c_~A~0.offset (* 4 v_subst_3))))) (or (<= (+ (select .cse17 .cse18) 2147483648) 0) (< (+ |v_thread3Thread1of1ForFork1_~i~2#1_77| 1) c_~N~0) (<= 2147483647 .cse19) (<= c_~min~0 (+ .cse19 1)) (< .cse19 (select .cse20 c_~A~0.offset)) (< (+ v_ArrVal_1011 1) .cse7)))))) (forall ((thread1Thread1of1ForFork2_~i~0 Int)) (<= (select .cse5 (+ c_~A~0.offset (* thread1Thread1of1ForFork2_~i~0 4))) c_~min~0)))) (<= .cse2 c_~min~0))))) (= (mod c_~b1~0 256) 0)) is different from false [2023-08-24 09:07:33,355 WARN L234 SmtUtils]: Spent 18.24s on a formula simplification. DAG size of input: 94 DAG size of output: 91 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 09:07:33,407 INFO L322 Elim1Store]: treesize reduction 16, result has 68.0 percent of original size [2023-08-24 09:07:33,408 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 168 treesize of output 137 [2023-08-24 09:07:33,415 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 213 treesize of output 199 [2023-08-24 09:07:33,449 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:07:33,449 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 125 treesize of output 115 [2023-08-24 09:07:33,484 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 09:07:33,485 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 151 treesize of output 157 [2023-08-24 09:07:34,012 INFO L322 Elim1Store]: treesize reduction 49, result has 2.0 percent of original size [2023-08-24 09:07:34,013 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 164 treesize of output 1 [2023-08-24 09:07:34,138 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-08-24 09:07:34,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010528886] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 09:07:34,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 09:07:34,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 18, 18] total 48 [2023-08-24 09:07:34,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898000024] [2023-08-24 09:07:34,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 09:07:34,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-08-24 09:07:34,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 09:07:34,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-08-24 09:07:34,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=1740, Unknown=21, NotChecked=364, Total=2450 [2023-08-24 09:07:34,142 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 303 [2023-08-24 09:07:34,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 864 transitions, 17059 flow. Second operand has 50 states, 50 states have (on average 84.98) internal successors, (4249), 50 states have internal predecessors, (4249), 0 states have call successors, (0), 0 states have 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:07:34,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 09:07:34,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 303 [2023-08-24 09:07:34,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 09:07:56,267 WARN L234 SmtUtils]: Spent 21.57s on a formula simplification. DAG size of input: 111 DAG size of output: 107 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 09:08:24,637 WARN L234 SmtUtils]: Spent 16.96s on a formula simplification. DAG size of input: 112 DAG size of output: 96 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 09:08:28,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:08:30,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:08:32,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:08:34,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:08:53,200 WARN L234 SmtUtils]: Spent 8.16s on a formula simplification. DAG size of input: 83 DAG size of output: 80 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 09:08:55,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:08:57,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:08:59,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:09:01,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:09:03,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:09:05,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:09:07,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:09:09,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:09:29,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:09:31,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:09:34,234 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:09:36,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:09:38,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:09:40,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:09:42,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:09:44,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:09:45,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:09:47,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:09:58,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:10:00,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:10:02,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:10:04,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:10:06,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:10:08,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:10:10,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:10:12,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:10:14,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:10:16,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:10:18,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:10:20,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:10:22,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:10:24,671 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:10:26,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:10:28,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:10:30,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:10:32,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:11:11,448 WARN L234 SmtUtils]: Spent 23.72s on a formula simplification. DAG size of input: 128 DAG size of output: 98 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 09:11:13,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:11:15,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:11:17,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:11:19,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:11:21,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:11:23,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:11:25,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:11:27,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:11:29,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:11:31,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:11:33,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:11:35,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:11:37,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:11:40,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:11:42,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:11:44,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:11:46,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:12:18,042 WARN L234 SmtUtils]: Spent 25.06s on a formula simplification. DAG size of input: 116 DAG size of output: 96 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 09:12:20,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:12:22,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:12:24,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:12:26,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 09:12:28,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2023-08-24 09:12:42,978 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:12:42,978 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-24 09:12:43,988 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:12:44,179 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-08-24 09:12:44,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-08-24 09:12:44,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-24 09:12:44,247 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Not enough levels on assertion stack at de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:138) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.pop(UndoableWrapperScript.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.restore(UndoableWrapperScript.java:87) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:167) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:376) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.NestedWordAutomataUtils.getSuccessorState(NestedWordAutomataUtils.java:482) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getOrConstructTransition(DifferencePetriNet.java:279) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePetriNet$DifferenceSuccessorTransitionProvider.getTransitions(DifferencePetriNet.java:261) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.addFullyInstantiatedCandidate(PossibleExtensions.java:168) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:195) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.evolveCandidate(PossibleExtensions.java:210) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PossibleExtensions.update(PossibleExtensions.java:135) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolderBase.computeUnfoldingHelper(PetriNetUnfolderBase.java:226) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolderBase.computeUnfolding(PetriNetUnfolderBase.java:183) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolderBase.(PetriNetUnfolderBase.java:123) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.PetriNetUnfolder.(PetriNetUnfolder.java:72) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:76) at de.uni_freiburg.informatik.ultimate.automata.petrinet.unfolding.FinitePrefix.(FinitePrefix.java:64) at de.uni_freiburg.informatik.ultimate.automata.petrinet.operations.DifferencePairwiseOnDemand.(DifferencePairwiseOnDemand.java:128) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.enhanceAnddeterminizeInterpolantAutomaton(CegarLoopForPetriNet.java:481) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.refineAbstraction(CegarLoopForPetriNet.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-08-24 09:12:44,251 INFO L158 Benchmark]: Toolchain (without parser) took 815796.88ms. Allocated memory was 352.3MB in the beginning and 14.6GB in the end (delta: 14.2GB). Free memory was 328.9MB in the beginning and 9.7GB in the end (delta: -9.4GB). Peak memory consumption was 4.9GB. Max. memory is 16.0GB. [2023-08-24 09:12:44,251 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 352.3MB. Free memory is still 329.2MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 09:12:44,251 INFO L158 Benchmark]: CACSL2BoogieTranslator took 303.39ms. Allocated memory is still 352.3MB. Free memory was 328.9MB in the beginning and 316.6MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-08-24 09:12:44,251 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.45ms. Allocated memory is still 352.3MB. Free memory was 316.6MB in the beginning and 314.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 09:12:44,251 INFO L158 Benchmark]: Boogie Preprocessor took 45.71ms. Allocated memory is still 352.3MB. Free memory was 314.5MB in the beginning and 312.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 09:12:44,252 INFO L158 Benchmark]: RCFGBuilder took 601.90ms. Allocated memory is still 352.3MB. Free memory was 312.9MB in the beginning and 288.3MB in the end (delta: 24.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-24 09:12:44,252 INFO L158 Benchmark]: TraceAbstraction took 814782.25ms. Allocated memory was 352.3MB in the beginning and 14.6GB in the end (delta: 14.2GB). Free memory was 287.7MB in the beginning and 9.7GB in the end (delta: -9.4GB). Peak memory consumption was 4.8GB. Max. memory is 16.0GB. [2023-08-24 09:12:44,253 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### [2023-08-24 09:12:44,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 352.3MB. Free memory is still 329.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 303.39ms. Allocated memory is still 352.3MB. Free memory was 328.9MB in the beginning and 316.6MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 55.45ms. Allocated memory is still 352.3MB. Free memory was 316.6MB in the beginning and 314.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 45.71ms. Allocated memory is still 352.3MB. Free memory was 314.5MB in the beginning and 312.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 601.90ms. Allocated memory is still 352.3MB. Free memory was 312.9MB in the beginning and 288.3MB in the end (delta: 24.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * TraceAbstraction took 814782.25ms. Allocated memory was 352.3MB in the beginning and 14.6GB in the end (delta: 14.2GB). Free memory was 287.7MB in the beginning and 9.7GB in the end (delta: -9.4GB). Peak memory consumption was 4.8GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.7s, 151 PlacesBefore, 40 PlacesAfterwards, 150 TransitionsBefore, 31 TransitionsAfterwards, 2548 CoEnabledTransitionPairs, 7 FixpointIterations, 68 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 16 TrivialYvCompositions, 6 ConcurrentYvCompositions, 8 ChoiceCompositions, 137 TotalNumberOfCompositions, 3658 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2741, independent: 2655, independent conditional: 0, independent unconditional: 2655, dependent: 86, dependent conditional: 0, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1361, independent: 1329, independent conditional: 0, independent unconditional: 1329, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2741, independent: 1326, independent conditional: 0, independent unconditional: 1326, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 1361, unknown conditional: 0, unknown unconditional: 1361] , Statistics on independence cache: Total cache size (in pairs): 108, Positive cache size: 98, Positive conditional cache size: 0, Positive unconditional cache size: 98, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - ExceptionOrErrorResult: SMTLIBException: Not enough levels on assertion stack de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Not enough levels on assertion stack: de.uni_freiburg.informatik.ultimate.logic.NoopScript.pop(NoopScript.java:272) RESULT: Ultimate could not prove your program: Toolchain returned no result. Completed graceful shutdown