/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-two-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 10:18:03,872 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 10:18:03,955 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 10:18:03,963 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 10:18:03,964 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 10:18:03,995 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 10:18:03,996 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 10:18:03,996 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 10:18:03,997 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 10:18:04,000 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 10:18:04,000 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 10:18:04,001 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 10:18:04,001 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 10:18:04,002 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 10:18:04,002 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 10:18:04,002 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 10:18:04,003 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 10:18:04,003 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 10:18:04,003 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 10:18:04,003 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 10:18:04,004 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 10:18:04,004 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 10:18:04,005 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 10:18:04,005 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 10:18:04,005 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 10:18:04,005 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 10:18:04,006 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 10:18:04,006 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 10:18:04,006 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 10:18:04,006 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 10:18:04,007 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 10:18:04,007 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 10:18:04,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 10:18:04,008 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 10:18:04,008 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 10:18:04,008 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 10:18:04,298 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 10:18:04,315 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 10:18:04,317 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 10:18:04,318 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 10:18:04,319 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 10:18:04,320 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2023-08-24 10:18:05,430 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 10:18:05,625 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 10:18:05,625 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-two-queue.wvr.c [2023-08-24 10:18:05,630 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b95d2ec15/fcef32e5f269437586a80f9ba75b644a/FLAGd421b6d8d [2023-08-24 10:18:05,641 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b95d2ec15/fcef32e5f269437586a80f9ba75b644a [2023-08-24 10:18:05,643 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 10:18:05,644 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 10:18:05,645 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 10:18:05,645 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 10:18:05,647 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 10:18:05,648 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 10:18:05" (1/1) ... [2023-08-24 10:18:05,648 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48c6b9fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:18:05, skipping insertion in model container [2023-08-24 10:18:05,649 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 10:18:05" (1/1) ... [2023-08-24 10:18:05,666 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 10:18:05,789 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-two-queue.wvr.c[2987,3000] [2023-08-24 10:18:05,793 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 10:18:05,807 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 10:18:05,828 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-two-queue.wvr.c[2987,3000] [2023-08-24 10:18:05,830 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 10:18:05,837 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 10:18:05,837 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 10:18:05,843 INFO L206 MainTranslator]: Completed translation [2023-08-24 10:18:05,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:18:05 WrapperNode [2023-08-24 10:18:05,843 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 10:18:05,844 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 10:18:05,844 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 10:18:05,844 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 10:18:05,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:18:05" (1/1) ... [2023-08-24 10:18:05,855 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:18:05" (1/1) ... [2023-08-24 10:18:05,882 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 13, calls inlined = 15, statements flattened = 209 [2023-08-24 10:18:05,882 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 10:18:05,883 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 10:18:05,883 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 10:18:05,883 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 10:18:05,895 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:18:05" (1/1) ... [2023-08-24 10:18:05,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:18:05" (1/1) ... [2023-08-24 10:18:05,898 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:18:05" (1/1) ... [2023-08-24 10:18:05,898 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:18:05" (1/1) ... [2023-08-24 10:18:05,903 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:18:05" (1/1) ... [2023-08-24 10:18:05,914 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:18:05" (1/1) ... [2023-08-24 10:18:05,916 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:18:05" (1/1) ... [2023-08-24 10:18:05,917 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:18:05" (1/1) ... [2023-08-24 10:18:05,920 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 10:18:05,920 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 10:18:05,921 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 10:18:05,921 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 10:18:05,921 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:18:05" (1/1) ... [2023-08-24 10:18:05,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 10:18:05,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 10:18:05,954 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 10:18:05,967 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 10:18:05,998 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 10:18:05,999 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-24 10:18:05,999 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-24 10:18:06,000 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-24 10:18:06,000 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-24 10:18:06,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 10:18:06,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 10:18:06,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 10:18:06,000 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 10:18:06,000 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 10:18:06,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-24 10:18:06,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 10:18:06,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 10:18:06,001 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-24 10:18:06,001 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 10:18:06,003 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 10:18:06,086 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 10:18:06,089 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 10:18:06,496 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 10:18:06,590 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 10:18:06,590 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-24 10:18:06,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 10:18:06 BoogieIcfgContainer [2023-08-24 10:18:06,594 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 10:18:06,597 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 10:18:06,597 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 10:18:06,600 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 10:18:06,600 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 10:18:05" (1/3) ... [2023-08-24 10:18:06,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30ccadf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 10:18:06, skipping insertion in model container [2023-08-24 10:18:06,601 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 10:18:05" (2/3) ... [2023-08-24 10:18:06,601 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30ccadf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 10:18:06, skipping insertion in model container [2023-08-24 10:18:06,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 10:18:06" (3/3) ... [2023-08-24 10:18:06,603 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-two-queue.wvr.c [2023-08-24 10:18:06,620 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 10:18:06,620 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-24 10:18:06,620 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 10:18:06,710 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-24 10:18:06,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 172 transitions, 360 flow [2023-08-24 10:18:06,833 INFO L124 PetriNetUnfolderBase]: 13/170 cut-off events. [2023-08-24 10:18:06,834 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-24 10:18:06,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 170 events. 13/170 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 85 event pairs, 0 based on Foata normal form. 0/156 useless extension candidates. Maximal degree in co-relation 137. Up to 2 conditions per place. [2023-08-24 10:18:06,838 INFO L82 GeneralOperation]: Start removeDead. Operand has 166 places, 172 transitions, 360 flow [2023-08-24 10:18:06,845 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 156 places, 162 transitions, 336 flow [2023-08-24 10:18:06,848 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 10:18:06,864 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 156 places, 162 transitions, 336 flow [2023-08-24 10:18:06,867 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 156 places, 162 transitions, 336 flow [2023-08-24 10:18:06,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 162 transitions, 336 flow [2023-08-24 10:18:06,905 INFO L124 PetriNetUnfolderBase]: 13/162 cut-off events. [2023-08-24 10:18:06,905 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-24 10:18:06,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171 conditions, 162 events. 13/162 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 85 event pairs, 0 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 137. Up to 2 conditions per place. [2023-08-24 10:18:06,908 INFO L119 LiptonReduction]: Number of co-enabled transitions 500 [2023-08-24 10:18:13,275 INFO L134 LiptonReduction]: Checked pairs total: 854 [2023-08-24 10:18:13,276 INFO L136 LiptonReduction]: Total number of compositions: 168 [2023-08-24 10:18:13,287 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 10:18:13,293 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;@37b2f183, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 10:18:13,293 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-24 10:18:13,298 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 10:18:13,299 INFO L124 PetriNetUnfolderBase]: 4/18 cut-off events. [2023-08-24 10:18:13,299 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-24 10:18:13,299 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:18:13,299 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 10:18:13,300 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 10:18:13,304 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:18:13,304 INFO L85 PathProgramCache]: Analyzing trace with hash -548603558, now seen corresponding path program 1 times [2023-08-24 10:18:13,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:18:13,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053127174] [2023-08-24 10:18:13,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:18:13,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:18:13,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:18:13,744 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 10:18:13,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:18:13,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053127174] [2023-08-24 10:18:13,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053127174] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 10:18:13,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 10:18:13,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 10:18:13,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088344071] [2023-08-24 10:18:13,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 10:18:13,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 10:18:13,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:18:13,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 10:18:13,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 10:18:13,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 340 [2023-08-24 10:18:13,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 19 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:18:13,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:18:13,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 340 [2023-08-24 10:18:13,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:18:13,879 INFO L124 PetriNetUnfolderBase]: 81/147 cut-off events. [2023-08-24 10:18:13,880 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-08-24 10:18:13,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 147 events. 81/147 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 401 event pairs, 24 based on Foata normal form. 1/114 useless extension candidates. Maximal degree in co-relation 240. Up to 88 conditions per place. [2023-08-24 10:18:13,883 INFO L140 encePairwiseOnDemand]: 336/340 looper letters, 27 selfloop transitions, 3 changer transitions 1/31 dead transitions. [2023-08-24 10:18:13,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 31 transitions, 145 flow [2023-08-24 10:18:13,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 10:18:13,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 10:18:13,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 461 transitions. [2023-08-24 10:18:13,904 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4519607843137255 [2023-08-24 10:18:13,905 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 461 transitions. [2023-08-24 10:18:13,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 461 transitions. [2023-08-24 10:18:13,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:18:13,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 461 transitions. [2023-08-24 10:18:13,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:18:13,926 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 340.0) internal successors, (1360), 4 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:18:13,927 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 340.0) internal successors, (1360), 4 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:18:13,929 INFO L175 Difference]: Start difference. First operand has 22 places, 19 transitions, 50 flow. Second operand 3 states and 461 transitions. [2023-08-24 10:18:13,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 31 transitions, 145 flow [2023-08-24 10:18:13,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 31 transitions, 131 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-24 10:18:13,934 INFO L231 Difference]: Finished difference. Result has 21 places, 21 transitions, 61 flow [2023-08-24 10:18:13,935 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=18, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=61, PETRI_PLACES=21, PETRI_TRANSITIONS=21} [2023-08-24 10:18:13,939 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, -1 predicate places. [2023-08-24 10:18:13,940 INFO L495 AbstractCegarLoop]: Abstraction has has 21 places, 21 transitions, 61 flow [2023-08-24 10:18:13,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.33333333333334) internal successors, (442), 3 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:18:13,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:18:13,941 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 10:18:13,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 10:18:13,942 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 10:18:13,950 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:18:13,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1349241612, now seen corresponding path program 1 times [2023-08-24 10:18:13,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:18:13,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418481866] [2023-08-24 10:18:13,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:18:13,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:18:13,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:18:14,070 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 10:18:14,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:18:14,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418481866] [2023-08-24 10:18:14,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418481866] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 10:18:14,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 10:18:14,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 10:18:14,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718547265] [2023-08-24 10:18:14,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 10:18:14,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 10:18:14,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:18:14,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 10:18:14,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 10:18:14,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 340 [2023-08-24 10:18:14,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 21 transitions, 61 flow. Second operand has 4 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:18:14,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:18:14,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 340 [2023-08-24 10:18:14,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:18:14,166 INFO L124 PetriNetUnfolderBase]: 96/184 cut-off events. [2023-08-24 10:18:14,166 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-08-24 10:18:14,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 438 conditions, 184 events. 96/184 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 600 event pairs, 13 based on Foata normal form. 0/148 useless extension candidates. Maximal degree in co-relation 118. Up to 53 conditions per place. [2023-08-24 10:18:14,167 INFO L140 encePairwiseOnDemand]: 333/340 looper letters, 39 selfloop transitions, 9 changer transitions 1/49 dead transitions. [2023-08-24 10:18:14,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 49 transitions, 228 flow [2023-08-24 10:18:14,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 10:18:14,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 10:18:14,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 755 transitions. [2023-08-24 10:18:14,170 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4441176470588235 [2023-08-24 10:18:14,170 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 755 transitions. [2023-08-24 10:18:14,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 755 transitions. [2023-08-24 10:18:14,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:18:14,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 755 transitions. [2023-08-24 10:18:14,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 151.0) internal successors, (755), 5 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:18:14,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 340.0) internal successors, (2040), 6 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:18:14,176 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 340.0) internal successors, (2040), 6 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:18:14,176 INFO L175 Difference]: Start difference. First operand has 21 places, 21 transitions, 61 flow. Second operand 5 states and 755 transitions. [2023-08-24 10:18:14,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 49 transitions, 228 flow [2023-08-24 10:18:14,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 49 transitions, 225 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 10:18:14,178 INFO L231 Difference]: Finished difference. Result has 28 places, 26 transitions, 118 flow [2023-08-24 10:18:14,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=118, PETRI_PLACES=28, PETRI_TRANSITIONS=26} [2023-08-24 10:18:14,179 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 6 predicate places. [2023-08-24 10:18:14,179 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 26 transitions, 118 flow [2023-08-24 10:18:14,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:18:14,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:18:14,180 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 10:18:14,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 10:18:14,180 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 10:18:14,180 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:18:14,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1770384088, now seen corresponding path program 2 times [2023-08-24 10:18:14,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:18:14,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826181793] [2023-08-24 10:18:14,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:18:14,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:18:14,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:18:14,251 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 10:18:14,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:18:14,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826181793] [2023-08-24 10:18:14,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826181793] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 10:18:14,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 10:18:14,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 10:18:14,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453928201] [2023-08-24 10:18:14,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 10:18:14,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 10:18:14,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:18:14,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 10:18:14,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 10:18:14,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 340 [2023-08-24 10:18:14,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 26 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:18:14,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:18:14,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 340 [2023-08-24 10:18:14,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:18:14,331 INFO L124 PetriNetUnfolderBase]: 90/166 cut-off events. [2023-08-24 10:18:14,332 INFO L125 PetriNetUnfolderBase]: For 173/173 co-relation queries the response was YES. [2023-08-24 10:18:14,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 558 conditions, 166 events. 90/166 cut-off events. For 173/173 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 513 event pairs, 7 based on Foata normal form. 2/166 useless extension candidates. Maximal degree in co-relation 233. Up to 112 conditions per place. [2023-08-24 10:18:14,333 INFO L140 encePairwiseOnDemand]: 334/340 looper letters, 34 selfloop transitions, 5 changer transitions 4/43 dead transitions. [2023-08-24 10:18:14,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 43 transitions, 270 flow [2023-08-24 10:18:14,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 10:18:14,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 10:18:14,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 603 transitions. [2023-08-24 10:18:14,336 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44338235294117645 [2023-08-24 10:18:14,336 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 603 transitions. [2023-08-24 10:18:14,336 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 603 transitions. [2023-08-24 10:18:14,337 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:18:14,337 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 603 transitions. [2023-08-24 10:18:14,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:18:14,340 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 340.0) internal successors, (1700), 5 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:18:14,341 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 340.0) internal successors, (1700), 5 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:18:14,341 INFO L175 Difference]: Start difference. First operand has 28 places, 26 transitions, 118 flow. Second operand 4 states and 603 transitions. [2023-08-24 10:18:14,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 43 transitions, 270 flow [2023-08-24 10:18:14,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 43 transitions, 270 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-24 10:18:14,344 INFO L231 Difference]: Finished difference. Result has 33 places, 28 transitions, 152 flow [2023-08-24 10:18:14,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=33, PETRI_TRANSITIONS=28} [2023-08-24 10:18:14,345 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 11 predicate places. [2023-08-24 10:18:14,345 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 28 transitions, 152 flow [2023-08-24 10:18:14,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:18:14,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:18:14,345 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 10:18:14,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 10:18:14,346 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 10:18:14,346 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:18:14,346 INFO L85 PathProgramCache]: Analyzing trace with hash -338241371, now seen corresponding path program 1 times [2023-08-24 10:18:14,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:18:14,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331459771] [2023-08-24 10:18:14,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:18:14,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:18:14,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:18:14,400 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 10:18:14,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:18:14,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331459771] [2023-08-24 10:18:14,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331459771] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 10:18:14,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 10:18:14,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 10:18:14,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600557676] [2023-08-24 10:18:14,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 10:18:14,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 10:18:14,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:18:14,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 10:18:14,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 10:18:14,403 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 340 [2023-08-24 10:18:14,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 28 transitions, 152 flow. Second operand has 4 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:18:14,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:18:14,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 340 [2023-08-24 10:18:14,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:18:14,492 INFO L124 PetriNetUnfolderBase]: 104/200 cut-off events. [2023-08-24 10:18:14,492 INFO L125 PetriNetUnfolderBase]: For 249/249 co-relation queries the response was YES. [2023-08-24 10:18:14,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 735 conditions, 200 events. 104/200 cut-off events. For 249/249 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 655 event pairs, 12 based on Foata normal form. 8/206 useless extension candidates. Maximal degree in co-relation 235. Up to 82 conditions per place. [2023-08-24 10:18:14,494 INFO L140 encePairwiseOnDemand]: 333/340 looper letters, 43 selfloop transitions, 10 changer transitions 2/55 dead transitions. [2023-08-24 10:18:14,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 55 transitions, 362 flow [2023-08-24 10:18:14,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 10:18:14,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 10:18:14,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 756 transitions. [2023-08-24 10:18:14,496 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4447058823529412 [2023-08-24 10:18:14,496 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 756 transitions. [2023-08-24 10:18:14,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 756 transitions. [2023-08-24 10:18:14,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:18:14,497 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 756 transitions. [2023-08-24 10:18:14,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 151.2) internal successors, (756), 5 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:18:14,501 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 340.0) internal successors, (2040), 6 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:18:14,502 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 340.0) internal successors, (2040), 6 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:18:14,502 INFO L175 Difference]: Start difference. First operand has 33 places, 28 transitions, 152 flow. Second operand 5 states and 756 transitions. [2023-08-24 10:18:14,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 55 transitions, 362 flow [2023-08-24 10:18:14,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 55 transitions, 348 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-24 10:18:14,506 INFO L231 Difference]: Finished difference. Result has 37 places, 31 transitions, 203 flow [2023-08-24 10:18:14,506 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=203, PETRI_PLACES=37, PETRI_TRANSITIONS=31} [2023-08-24 10:18:14,506 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 15 predicate places. [2023-08-24 10:18:14,507 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 31 transitions, 203 flow [2023-08-24 10:18:14,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:18:14,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:18:14,507 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 10:18:14,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 10:18:14,507 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 10:18:14,508 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:18:14,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1547485969, now seen corresponding path program 2 times [2023-08-24 10:18:14,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:18:14,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541384462] [2023-08-24 10:18:14,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:18:14,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:18:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:18:14,560 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 10:18:14,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:18:14,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541384462] [2023-08-24 10:18:14,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541384462] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 10:18:14,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 10:18:14,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 10:18:14,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17575065] [2023-08-24 10:18:14,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 10:18:14,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 10:18:14,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:18:14,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 10:18:14,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 10:18:14,562 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 340 [2023-08-24 10:18:14,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 203 flow. Second operand has 4 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:18:14,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:18:14,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 340 [2023-08-24 10:18:14,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:18:14,638 INFO L124 PetriNetUnfolderBase]: 89/169 cut-off events. [2023-08-24 10:18:14,638 INFO L125 PetriNetUnfolderBase]: For 386/386 co-relation queries the response was YES. [2023-08-24 10:18:14,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 716 conditions, 169 events. 89/169 cut-off events. For 386/386 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 506 event pairs, 11 based on Foata normal form. 4/171 useless extension candidates. Maximal degree in co-relation 245. Up to 97 conditions per place. [2023-08-24 10:18:14,640 INFO L140 encePairwiseOnDemand]: 333/340 looper letters, 34 selfloop transitions, 9 changer transitions 7/50 dead transitions. [2023-08-24 10:18:14,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 50 transitions, 382 flow [2023-08-24 10:18:14,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 10:18:14,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 10:18:14,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 747 transitions. [2023-08-24 10:18:14,643 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43941176470588234 [2023-08-24 10:18:14,643 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 747 transitions. [2023-08-24 10:18:14,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 747 transitions. [2023-08-24 10:18:14,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:18:14,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 747 transitions. [2023-08-24 10:18:14,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 149.4) internal successors, (747), 5 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:18:14,647 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 340.0) internal successors, (2040), 6 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:18:14,648 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 340.0) internal successors, (2040), 6 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:18:14,648 INFO L175 Difference]: Start difference. First operand has 37 places, 31 transitions, 203 flow. Second operand 5 states and 747 transitions. [2023-08-24 10:18:14,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 50 transitions, 382 flow [2023-08-24 10:18:14,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 375 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-24 10:18:14,651 INFO L231 Difference]: Finished difference. Result has 42 places, 33 transitions, 245 flow [2023-08-24 10:18:14,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=245, PETRI_PLACES=42, PETRI_TRANSITIONS=33} [2023-08-24 10:18:14,652 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 20 predicate places. [2023-08-24 10:18:14,652 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 245 flow [2023-08-24 10:18:14,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:18:14,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:18:14,653 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 10:18:14,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 10:18:14,653 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 10:18:14,653 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:18:14,653 INFO L85 PathProgramCache]: Analyzing trace with hash 854332043, now seen corresponding path program 1 times [2023-08-24 10:18:14,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:18:14,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813074790] [2023-08-24 10:18:14,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:18:14,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:18:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:18:14,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:18:14,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:18:14,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813074790] [2023-08-24 10:18:14,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813074790] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 10:18:14,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 10:18:14,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 10:18:14,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809805558] [2023-08-24 10:18:14,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 10:18:14,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 10:18:14,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:18:14,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 10:18:14,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 10:18:14,742 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 340 [2023-08-24 10:18:14,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 245 flow. Second operand has 4 states, 4 states have (on average 131.25) internal successors, (525), 4 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:18:14,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:18:14,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 340 [2023-08-24 10:18:14,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:18:14,810 INFO L124 PetriNetUnfolderBase]: 88/169 cut-off events. [2023-08-24 10:18:14,811 INFO L125 PetriNetUnfolderBase]: For 571/571 co-relation queries the response was YES. [2023-08-24 10:18:14,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 759 conditions, 169 events. 88/169 cut-off events. For 571/571 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 428 event pairs, 46 based on Foata normal form. 8/172 useless extension candidates. Maximal degree in co-relation 529. Up to 153 conditions per place. [2023-08-24 10:18:14,812 INFO L140 encePairwiseOnDemand]: 333/340 looper letters, 32 selfloop transitions, 2 changer transitions 10/44 dead transitions. [2023-08-24 10:18:14,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 44 transitions, 363 flow [2023-08-24 10:18:14,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 10:18:14,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 10:18:14,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 667 transitions. [2023-08-24 10:18:14,814 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39235294117647057 [2023-08-24 10:18:14,814 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 667 transitions. [2023-08-24 10:18:14,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 667 transitions. [2023-08-24 10:18:14,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:18:14,815 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 667 transitions. [2023-08-24 10:18:14,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.4) internal successors, (667), 5 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:18:14,818 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 340.0) internal successors, (2040), 6 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:18:14,819 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 340.0) internal successors, (2040), 6 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:18:14,819 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 245 flow. Second operand 5 states and 667 transitions. [2023-08-24 10:18:14,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 44 transitions, 363 flow [2023-08-24 10:18:14,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 44 transitions, 348 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-24 10:18:14,822 INFO L231 Difference]: Finished difference. Result has 47 places, 34 transitions, 252 flow [2023-08-24 10:18:14,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=252, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2023-08-24 10:18:14,823 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 25 predicate places. [2023-08-24 10:18:14,823 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 252 flow [2023-08-24 10:18:14,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.25) internal successors, (525), 4 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:18:14,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:18:14,824 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 10:18:14,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 10:18:14,824 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 10:18:14,825 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:18:14,825 INFO L85 PathProgramCache]: Analyzing trace with hash 923556379, now seen corresponding path program 1 times [2023-08-24 10:18:14,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:18:14,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105696914] [2023-08-24 10:18:14,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:18:14,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:18:14,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:18:14,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 10:18:14,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:18:14,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105696914] [2023-08-24 10:18:14,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105696914] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 10:18:14,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 10:18:14,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 10:18:14,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83205353] [2023-08-24 10:18:14,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 10:18:14,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 10:18:14,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:18:14,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 10:18:14,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 10:18:14,908 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 340 [2023-08-24 10:18:14,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 252 flow. Second operand has 4 states, 4 states have (on average 131.5) internal successors, (526), 4 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:18:14,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:18:14,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 340 [2023-08-24 10:18:14,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:18:14,975 INFO L124 PetriNetUnfolderBase]: 84/162 cut-off events. [2023-08-24 10:18:14,975 INFO L125 PetriNetUnfolderBase]: For 539/539 co-relation queries the response was YES. [2023-08-24 10:18:14,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 759 conditions, 162 events. 84/162 cut-off events. For 539/539 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 410 event pairs, 44 based on Foata normal form. 8/167 useless extension candidates. Maximal degree in co-relation 730. Up to 154 conditions per place. [2023-08-24 10:18:14,976 INFO L140 encePairwiseOnDemand]: 335/340 looper letters, 33 selfloop transitions, 2 changer transitions 6/41 dead transitions. [2023-08-24 10:18:14,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 41 transitions, 362 flow [2023-08-24 10:18:14,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 10:18:14,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 10:18:14,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 536 transitions. [2023-08-24 10:18:14,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3941176470588235 [2023-08-24 10:18:14,979 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 536 transitions. [2023-08-24 10:18:14,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 536 transitions. [2023-08-24 10:18:14,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:18:14,979 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 536 transitions. [2023-08-24 10:18:14,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:18:14,982 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 340.0) internal successors, (1700), 5 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:18:14,982 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 340.0) internal successors, (1700), 5 states have internal predecessors, (1700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:18:14,982 INFO L175 Difference]: Start difference. First operand has 47 places, 34 transitions, 252 flow. Second operand 4 states and 536 transitions. [2023-08-24 10:18:14,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 41 transitions, 362 flow [2023-08-24 10:18:14,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 41 transitions, 346 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-08-24 10:18:14,986 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 260 flow [2023-08-24 10:18:14,986 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=43, 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=4, PETRI_FLOW=260, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2023-08-24 10:18:14,987 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 26 predicate places. [2023-08-24 10:18:14,987 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 260 flow [2023-08-24 10:18:14,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.5) internal successors, (526), 4 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:18:14,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:18:14,987 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 10:18:14,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-24 10:18:14,988 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 10:18:14,988 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:18:14,988 INFO L85 PathProgramCache]: Analyzing trace with hash -611597168, now seen corresponding path program 1 times [2023-08-24 10:18:14,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:18:14,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494871589] [2023-08-24 10:18:14,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:18:14,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:18:15,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:18:15,085 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 10:18:15,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:18:15,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494871589] [2023-08-24 10:18:15,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494871589] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 10:18:15,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 10:18:15,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 10:18:15,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170912832] [2023-08-24 10:18:15,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 10:18:15,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 10:18:15,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:18:15,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 10:18:15,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 10:18:15,088 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 340 [2023-08-24 10:18:15,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 260 flow. Second operand has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:18:15,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:18:15,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 340 [2023-08-24 10:18:15,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:18:15,129 INFO L124 PetriNetUnfolderBase]: 62/119 cut-off events. [2023-08-24 10:18:15,129 INFO L125 PetriNetUnfolderBase]: For 418/418 co-relation queries the response was YES. [2023-08-24 10:18:15,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 572 conditions, 119 events. 62/119 cut-off events. For 418/418 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 254 event pairs, 5 based on Foata normal form. 4/122 useless extension candidates. Maximal degree in co-relation 537. Up to 102 conditions per place. [2023-08-24 10:18:15,130 INFO L140 encePairwiseOnDemand]: 337/340 looper letters, 33 selfloop transitions, 3 changer transitions 0/36 dead transitions. [2023-08-24 10:18:15,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 36 transitions, 334 flow [2023-08-24 10:18:15,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 10:18:15,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 10:18:15,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2023-08-24 10:18:15,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46372549019607845 [2023-08-24 10:18:15,132 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 473 transitions. [2023-08-24 10:18:15,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 473 transitions. [2023-08-24 10:18:15,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:18:15,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 473 transitions. [2023-08-24 10:18:15,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:18:15,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 340.0) internal successors, (1360), 4 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:18:15,135 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 340.0) internal successors, (1360), 4 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:18:15,136 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 260 flow. Second operand 3 states and 473 transitions. [2023-08-24 10:18:15,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 36 transitions, 334 flow [2023-08-24 10:18:15,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 36 transitions, 324 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-24 10:18:15,139 INFO L231 Difference]: Finished difference. Result has 49 places, 35 transitions, 261 flow [2023-08-24 10:18:15,139 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=261, PETRI_PLACES=49, PETRI_TRANSITIONS=35} [2023-08-24 10:18:15,140 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 27 predicate places. [2023-08-24 10:18:15,140 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 35 transitions, 261 flow [2023-08-24 10:18:15,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:18:15,140 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:18:15,140 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 10:18:15,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 10:18:15,141 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 10:18:15,141 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:18:15,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1156671294, now seen corresponding path program 2 times [2023-08-24 10:18:15,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:18:15,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015485337] [2023-08-24 10:18:15,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:18:15,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:18:15,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:18:17,267 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:18:17,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:18:17,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015485337] [2023-08-24 10:18:17,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015485337] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 10:18:17,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084846255] [2023-08-24 10:18:17,268 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 10:18:17,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:18:17,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 10:18:17,273 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 10:18:17,305 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 10:18:17,391 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 10:18:17,391 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 10:18:17,393 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 42 conjunts are in the unsatisfiable core [2023-08-24 10:18:17,398 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 10:18:17,820 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 10:18:17,820 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 10:18:18,241 INFO L322 Elim1Store]: treesize reduction 22, result has 89.8 percent of original size [2023-08-24 10:18:18,242 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 80 treesize of output 216 [2023-08-24 10:18:19,803 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 10:18:19,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084846255] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 10:18:19,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 10:18:19,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 23 [2023-08-24 10:18:19,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915073728] [2023-08-24 10:18:19,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 10:18:19,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-24 10:18:19,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:18:19,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-24 10:18:19,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2023-08-24 10:18:19,808 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 340 [2023-08-24 10:18:19,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 35 transitions, 261 flow. Second operand has 25 states, 25 states have (on average 85.08) internal successors, (2127), 25 states have internal predecessors, (2127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:18:19,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:18:19,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 340 [2023-08-24 10:18:19,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:18:22,815 INFO L124 PetriNetUnfolderBase]: 394/729 cut-off events. [2023-08-24 10:18:22,816 INFO L125 PetriNetUnfolderBase]: For 2473/2473 co-relation queries the response was YES. [2023-08-24 10:18:22,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3430 conditions, 729 events. 394/729 cut-off events. For 2473/2473 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3336 event pairs, 23 based on Foata normal form. 5/731 useless extension candidates. Maximal degree in co-relation 2781. Up to 209 conditions per place. [2023-08-24 10:18:22,822 INFO L140 encePairwiseOnDemand]: 329/340 looper letters, 142 selfloop transitions, 113 changer transitions 3/258 dead transitions. [2023-08-24 10:18:22,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 258 transitions, 2417 flow [2023-08-24 10:18:22,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-08-24 10:18:22,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2023-08-24 10:18:22,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 3519 transitions. [2023-08-24 10:18:22,836 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.25875 [2023-08-24 10:18:22,836 INFO L72 ComplementDD]: Start complementDD. Operand 40 states and 3519 transitions. [2023-08-24 10:18:22,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 3519 transitions. [2023-08-24 10:18:22,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:18:22,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 40 states and 3519 transitions. [2023-08-24 10:18:22,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 41 states, 40 states have (on average 87.975) internal successors, (3519), 40 states have internal predecessors, (3519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:18:22,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 41 states, 41 states have (on average 340.0) internal successors, (13940), 41 states have internal predecessors, (13940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:18:22,864 INFO L81 ComplementDD]: Finished complementDD. Result has 41 states, 41 states have (on average 340.0) internal successors, (13940), 41 states have internal predecessors, (13940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:18:22,864 INFO L175 Difference]: Start difference. First operand has 49 places, 35 transitions, 261 flow. Second operand 40 states and 3519 transitions. [2023-08-24 10:18:22,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 258 transitions, 2417 flow [2023-08-24 10:18:22,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 258 transitions, 2340 flow, removed 10 selfloop flow, removed 3 redundant places. [2023-08-24 10:18:22,879 INFO L231 Difference]: Finished difference. Result has 95 places, 155 transitions, 1646 flow [2023-08-24 10:18:22,880 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=1646, PETRI_PLACES=95, PETRI_TRANSITIONS=155} [2023-08-24 10:18:22,880 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 73 predicate places. [2023-08-24 10:18:22,880 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 155 transitions, 1646 flow [2023-08-24 10:18:22,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 85.08) internal successors, (2127), 25 states have internal predecessors, (2127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:18:22,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:18:22,882 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 10:18:22,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-24 10:18:23,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:18:23,089 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 10:18:23,089 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:18:23,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1608765606, now seen corresponding path program 3 times [2023-08-24 10:18:23,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:18:23,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295162357] [2023-08-24 10:18:23,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:18:23,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:18:23,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:18:24,262 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:18:24,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:18:24,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295162357] [2023-08-24 10:18:24,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295162357] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 10:18:24,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639335194] [2023-08-24 10:18:24,263 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 10:18:24,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:18:24,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 10:18:24,264 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 10:18:24,269 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 10:18:24,440 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-24 10:18:24,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 10:18:24,442 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 56 conjunts are in the unsatisfiable core [2023-08-24 10:18:24,444 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 10:18:24,542 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 10:18:24,628 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 10:18:24,687 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 10:18:24,914 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 10:18:24,914 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 10:18:25,624 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:18:25,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 99 [2023-08-24 10:18:25,698 INFO L322 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2023-08-24 10:18:25,698 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1257 treesize of output 1177 [2023-08-24 10:18:25,768 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:18:25,769 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 529 treesize of output 543 [2023-08-24 10:18:25,829 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:18:25,830 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 474 treesize of output 422 [2023-08-24 10:18:45,130 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:18:45,130 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 121 treesize of output 85 [2023-08-24 10:18:45,159 INFO L322 Elim1Store]: treesize reduction 69, result has 25.8 percent of original size [2023-08-24 10:18:45,160 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 455 treesize of output 430 [2023-08-24 10:18:45,174 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 10:18:45,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 10:18:45,184 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:18:45,184 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 192 treesize of output 184 [2023-08-24 10:18:45,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 10:18:45,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 10:18:45,215 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:18:45,215 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 206 treesize of output 174 [2023-08-24 10:18:45,597 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 10:18:45,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639335194] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 10:18:45,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 10:18:45,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2023-08-24 10:18:45,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728098505] [2023-08-24 10:18:45,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 10:18:45,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-24 10:18:45,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:18:45,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-24 10:18:45,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=811, Unknown=2, NotChecked=0, Total=930 [2023-08-24 10:18:45,602 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 340 [2023-08-24 10:18:45,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 155 transitions, 1646 flow. Second operand has 31 states, 31 states have (on average 82.6774193548387) internal successors, (2563), 31 states have internal predecessors, (2563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:18:45,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:18:45,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 340 [2023-08-24 10:18:45,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:18:54,605 WARN L234 SmtUtils]: Spent 8.28s on a formula simplification. DAG size of input: 100 DAG size of output: 87 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 10:18:57,390 INFO L124 PetriNetUnfolderBase]: 634/1161 cut-off events. [2023-08-24 10:18:57,390 INFO L125 PetriNetUnfolderBase]: For 4473/4473 co-relation queries the response was YES. [2023-08-24 10:18:57,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6132 conditions, 1161 events. 634/1161 cut-off events. For 4473/4473 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 6079 event pairs, 16 based on Foata normal form. 4/1164 useless extension candidates. Maximal degree in co-relation 5547. Up to 563 conditions per place. [2023-08-24 10:18:57,401 INFO L140 encePairwiseOnDemand]: 327/340 looper letters, 149 selfloop transitions, 187 changer transitions 5/341 dead transitions. [2023-08-24 10:18:57,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 341 transitions, 3769 flow [2023-08-24 10:18:57,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-08-24 10:18:57,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2023-08-24 10:18:57,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 3251 transitions. [2023-08-24 10:18:57,412 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.251625386996904 [2023-08-24 10:18:57,412 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 3251 transitions. [2023-08-24 10:18:57,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 3251 transitions. [2023-08-24 10:18:57,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:18:57,414 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 3251 transitions. [2023-08-24 10:18:57,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 85.55263157894737) internal successors, (3251), 38 states have internal predecessors, (3251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:18:57,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 340.0) internal successors, (13260), 39 states have internal predecessors, (13260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:18:57,437 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 340.0) internal successors, (13260), 39 states have internal predecessors, (13260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:18:57,437 INFO L175 Difference]: Start difference. First operand has 95 places, 155 transitions, 1646 flow. Second operand 38 states and 3251 transitions. [2023-08-24 10:18:57,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 341 transitions, 3769 flow [2023-08-24 10:18:57,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 341 transitions, 3379 flow, removed 185 selfloop flow, removed 4 redundant places. [2023-08-24 10:18:57,468 INFO L231 Difference]: Finished difference. Result has 137 places, 261 transitions, 2983 flow [2023-08-24 10:18:57,469 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=1406, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=2983, PETRI_PLACES=137, PETRI_TRANSITIONS=261} [2023-08-24 10:18:57,470 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 115 predicate places. [2023-08-24 10:18:57,470 INFO L495 AbstractCegarLoop]: Abstraction has has 137 places, 261 transitions, 2983 flow [2023-08-24 10:18:57,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 82.6774193548387) internal successors, (2563), 31 states have internal predecessors, (2563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:18:57,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:18:57,471 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 10:18:57,481 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 10:18:57,676 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,SelfDestructingSolverStorable9 [2023-08-24 10:18:57,677 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 10:18:57,677 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:18:57,677 INFO L85 PathProgramCache]: Analyzing trace with hash 948166696, now seen corresponding path program 4 times [2023-08-24 10:18:57,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:18:57,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380046001] [2023-08-24 10:18:57,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:18:57,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:18:57,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:18:59,166 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:18:59,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:18:59,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380046001] [2023-08-24 10:18:59,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380046001] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 10:18:59,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719035231] [2023-08-24 10:18:59,167 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-24 10:18:59,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:18:59,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 10:18:59,169 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 10:18:59,173 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 10:18:59,268 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-24 10:18:59,268 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 10:18:59,270 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 58 conjunts are in the unsatisfiable core [2023-08-24 10:18:59,272 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 10:18:59,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 10:18:59,544 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 10:18:59,792 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 10:18:59,792 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 10:18:59,802 INFO L322 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2023-08-24 10:18:59,802 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 41 treesize of output 28 [2023-08-24 10:18:59,852 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:18:59,852 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 10:19:00,699 INFO L322 Elim1Store]: treesize reduction 22, result has 92.8 percent of original size [2023-08-24 10:19:00,700 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 215 treesize of output 443 [2023-08-24 10:19:00,745 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:19:00,746 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 155 treesize of output 178 [2023-08-24 10:19:00,786 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:19:00,786 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 137 treesize of output 160 [2023-08-24 10:19:40,555 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:19:40,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719035231] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 10:19:40,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 10:19:40,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2023-08-24 10:19:40,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590890518] [2023-08-24 10:19:40,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 10:19:40,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-08-24 10:19:40,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:19:40,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-08-24 10:19:40,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1138, Unknown=4, NotChecked=0, Total=1260 [2023-08-24 10:19:40,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 340 [2023-08-24 10:19:40,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 261 transitions, 2983 flow. Second operand has 36 states, 36 states have (on average 82.36111111111111) internal successors, (2965), 36 states have internal predecessors, (2965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:19:40,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:19:40,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 340 [2023-08-24 10:19:40,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:19:49,018 INFO L124 PetriNetUnfolderBase]: 973/1814 cut-off events. [2023-08-24 10:19:49,018 INFO L125 PetriNetUnfolderBase]: For 8303/8303 co-relation queries the response was YES. [2023-08-24 10:19:49,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10389 conditions, 1814 events. 973/1814 cut-off events. For 8303/8303 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 10767 event pairs, 42 based on Foata normal form. 3/1817 useless extension candidates. Maximal degree in co-relation 9651. Up to 647 conditions per place. [2023-08-24 10:19:49,040 INFO L140 encePairwiseOnDemand]: 327/340 looper letters, 168 selfloop transitions, 337 changer transitions 14/519 dead transitions. [2023-08-24 10:19:49,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 519 transitions, 6360 flow [2023-08-24 10:19:49,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-08-24 10:19:49,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2023-08-24 10:19:49,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 4259 transitions. [2023-08-24 10:19:49,051 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2505294117647059 [2023-08-24 10:19:49,051 INFO L72 ComplementDD]: Start complementDD. Operand 50 states and 4259 transitions. [2023-08-24 10:19:49,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 4259 transitions. [2023-08-24 10:19:49,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:19:49,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 50 states and 4259 transitions. [2023-08-24 10:19:49,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 51 states, 50 states have (on average 85.18) internal successors, (4259), 50 states have internal predecessors, (4259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:19:49,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 51 states, 51 states have (on average 340.0) internal successors, (17340), 51 states have internal predecessors, (17340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:19:49,078 INFO L81 ComplementDD]: Finished complementDD. Result has 51 states, 51 states have (on average 340.0) internal successors, (17340), 51 states have internal predecessors, (17340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:19:49,078 INFO L175 Difference]: Start difference. First operand has 137 places, 261 transitions, 2983 flow. Second operand 50 states and 4259 transitions. [2023-08-24 10:19:49,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 519 transitions, 6360 flow [2023-08-24 10:19:49,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 519 transitions, 6076 flow, removed 128 selfloop flow, removed 9 redundant places. [2023-08-24 10:19:49,159 INFO L231 Difference]: Finished difference. Result has 197 places, 423 transitions, 5902 flow [2023-08-24 10:19:49,160 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=2784, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=198, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=5902, PETRI_PLACES=197, PETRI_TRANSITIONS=423} [2023-08-24 10:19:49,160 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 175 predicate places. [2023-08-24 10:19:49,160 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 423 transitions, 5902 flow [2023-08-24 10:19:49,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 82.36111111111111) internal successors, (2965), 36 states have internal predecessors, (2965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:19:49,162 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:19:49,162 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 10:19:49,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-24 10:19:49,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:19:49,367 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 10:19:49,367 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:19:49,367 INFO L85 PathProgramCache]: Analyzing trace with hash 539242676, now seen corresponding path program 5 times [2023-08-24 10:19:49,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:19:49,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997688644] [2023-08-24 10:19:49,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:19:49,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:19:49,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:19:49,447 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-24 10:19:49,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:19:49,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997688644] [2023-08-24 10:19:49,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997688644] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 10:19:49,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 10:19:49,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 10:19:49,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942955491] [2023-08-24 10:19:49,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 10:19:49,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 10:19:49,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:19:49,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 10:19:49,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 10:19:49,449 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 340 [2023-08-24 10:19:49,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 423 transitions, 5902 flow. Second operand has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:19:49,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:19:49,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 340 [2023-08-24 10:19:49,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:19:49,773 INFO L124 PetriNetUnfolderBase]: 789/1469 cut-off events. [2023-08-24 10:19:49,773 INFO L125 PetriNetUnfolderBase]: For 10858/10858 co-relation queries the response was YES. [2023-08-24 10:19:49,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9871 conditions, 1469 events. 789/1469 cut-off events. For 10858/10858 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 8142 event pairs, 89 based on Foata normal form. 6/1475 useless extension candidates. Maximal degree in co-relation 9765. Up to 1404 conditions per place. [2023-08-24 10:19:49,792 INFO L140 encePairwiseOnDemand]: 337/340 looper letters, 334 selfloop transitions, 10 changer transitions 0/344 dead transitions. [2023-08-24 10:19:49,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 344 transitions, 5469 flow [2023-08-24 10:19:49,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 10:19:49,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 10:19:49,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 475 transitions. [2023-08-24 10:19:49,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46568627450980393 [2023-08-24 10:19:49,794 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 475 transitions. [2023-08-24 10:19:49,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 475 transitions. [2023-08-24 10:19:49,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:19:49,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 475 transitions. [2023-08-24 10:19:49,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:19:49,796 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 340.0) internal successors, (1360), 4 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:19:49,797 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 340.0) internal successors, (1360), 4 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:19:49,797 INFO L175 Difference]: Start difference. First operand has 197 places, 423 transitions, 5902 flow. Second operand 3 states and 475 transitions. [2023-08-24 10:19:49,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 344 transitions, 5469 flow [2023-08-24 10:19:49,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 344 transitions, 4959 flow, removed 103 selfloop flow, removed 22 redundant places. [2023-08-24 10:19:49,880 INFO L231 Difference]: Finished difference. Result has 164 places, 342 transitions, 4298 flow [2023-08-24 10:19:49,880 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=4266, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=4298, PETRI_PLACES=164, PETRI_TRANSITIONS=342} [2023-08-24 10:19:49,880 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 142 predicate places. [2023-08-24 10:19:49,881 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 342 transitions, 4298 flow [2023-08-24 10:19:49,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:19:49,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:19:49,881 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 10:19:49,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-24 10:19:49,881 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 10:19:49,881 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:19:49,882 INFO L85 PathProgramCache]: Analyzing trace with hash 526711720, now seen corresponding path program 6 times [2023-08-24 10:19:49,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:19:49,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866442577] [2023-08-24 10:19:49,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:19:49,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:19:49,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:19:51,163 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:19:51,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:19:51,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866442577] [2023-08-24 10:19:51,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866442577] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 10:19:51,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619229055] [2023-08-24 10:19:51,163 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-24 10:19:51,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:19:51,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 10:19:51,165 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 10:19:51,169 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 10:19:51,341 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-08-24 10:19:51,341 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 10:19:51,343 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 37 conjunts are in the unsatisfiable core [2023-08-24 10:19:51,344 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 10:19:51,547 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 10:19:51,547 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 10:19:51,815 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:19:51,815 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 91 treesize of output 263 [2023-08-24 10:19:56,108 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 10:19:56,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619229055] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 10:19:56,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 10:19:56,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 22 [2023-08-24 10:19:56,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490168186] [2023-08-24 10:19:56,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 10:19:56,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-24 10:19:56,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:19:56,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-24 10:19:56,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2023-08-24 10:19:56,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 340 [2023-08-24 10:19:56,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 342 transitions, 4298 flow. Second operand has 24 states, 24 states have (on average 81.20833333333333) internal successors, (1949), 24 states have internal predecessors, (1949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:19:56,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:19:56,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 340 [2023-08-24 10:19:56,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:19:57,625 INFO L124 PetriNetUnfolderBase]: 912/1693 cut-off events. [2023-08-24 10:19:57,626 INFO L125 PetriNetUnfolderBase]: For 10075/10075 co-relation queries the response was YES. [2023-08-24 10:19:57,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10744 conditions, 1693 events. 912/1693 cut-off events. For 10075/10075 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 9798 event pairs, 68 based on Foata normal form. 3/1696 useless extension candidates. Maximal degree in co-relation 10519. Up to 1136 conditions per place. [2023-08-24 10:19:57,645 INFO L140 encePairwiseOnDemand]: 327/340 looper letters, 209 selfloop transitions, 219 changer transitions 2/430 dead transitions. [2023-08-24 10:19:57,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 430 transitions, 5994 flow [2023-08-24 10:19:57,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-08-24 10:19:57,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-08-24 10:19:57,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1841 transitions. [2023-08-24 10:19:57,649 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24612299465240642 [2023-08-24 10:19:57,649 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 1841 transitions. [2023-08-24 10:19:57,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 1841 transitions. [2023-08-24 10:19:57,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:19:57,651 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1841 transitions. [2023-08-24 10:19:57,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 83.68181818181819) internal successors, (1841), 22 states have internal predecessors, (1841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:19:57,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 340.0) internal successors, (7820), 23 states have internal predecessors, (7820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:19:57,661 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 340.0) internal successors, (7820), 23 states have internal predecessors, (7820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:19:57,661 INFO L175 Difference]: Start difference. First operand has 164 places, 342 transitions, 4298 flow. Second operand 22 states and 1841 transitions. [2023-08-24 10:19:57,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 430 transitions, 5994 flow [2023-08-24 10:19:57,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 430 transitions, 5957 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-24 10:19:57,739 INFO L231 Difference]: Finished difference. Result has 189 places, 386 transitions, 5567 flow [2023-08-24 10:19:57,739 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=4261, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=176, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=5567, PETRI_PLACES=189, PETRI_TRANSITIONS=386} [2023-08-24 10:19:57,739 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 167 predicate places. [2023-08-24 10:19:57,740 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 386 transitions, 5567 flow [2023-08-24 10:19:57,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 81.20833333333333) internal successors, (1949), 24 states have internal predecessors, (1949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:19:57,740 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:19:57,740 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 10:19:57,749 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 10:19:57,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:19:57,946 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 10:19:57,947 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:19:57,947 INFO L85 PathProgramCache]: Analyzing trace with hash 353330820, now seen corresponding path program 7 times [2023-08-24 10:19:57,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:19:57,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820870130] [2023-08-24 10:19:57,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:19:57,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:19:57,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:19:59,609 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:19:59,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:19:59,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820870130] [2023-08-24 10:19:59,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820870130] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 10:19:59,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195789085] [2023-08-24 10:19:59,609 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-24 10:19:59,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:19:59,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 10:19:59,610 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 10:19:59,612 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 10:19:59,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:19:59,688 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 52 conjunts are in the unsatisfiable core [2023-08-24 10:19:59,690 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 10:20:00,110 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:20:00,110 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 10:20:00,441 INFO L322 Elim1Store]: treesize reduction 22, result has 89.8 percent of original size [2023-08-24 10:20:00,441 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 98 treesize of output 226 [2023-08-24 10:20:03,379 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:20:03,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195789085] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 10:20:03,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 10:20:03,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 30 [2023-08-24 10:20:03,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225350847] [2023-08-24 10:20:03,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 10:20:03,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-24 10:20:03,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:20:03,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-24 10:20:03,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=861, Unknown=0, NotChecked=0, Total=992 [2023-08-24 10:20:03,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 340 [2023-08-24 10:20:03,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 386 transitions, 5567 flow. Second operand has 32 states, 32 states have (on average 79.625) internal successors, (2548), 32 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:20:03,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:20:03,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 340 [2023-08-24 10:20:03,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:20:07,082 INFO L124 PetriNetUnfolderBase]: 1089/2019 cut-off events. [2023-08-24 10:20:07,082 INFO L125 PetriNetUnfolderBase]: For 15734/15734 co-relation queries the response was YES. [2023-08-24 10:20:07,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13778 conditions, 2019 events. 1089/2019 cut-off events. For 15734/15734 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 12267 event pairs, 72 based on Foata normal form. 3/2022 useless extension candidates. Maximal degree in co-relation 13561. Up to 955 conditions per place. [2023-08-24 10:20:07,107 INFO L140 encePairwiseOnDemand]: 328/340 looper letters, 177 selfloop transitions, 358 changer transitions 5/540 dead transitions. [2023-08-24 10:20:07,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 540 transitions, 8264 flow [2023-08-24 10:20:07,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-08-24 10:20:07,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2023-08-24 10:20:07,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 3147 transitions. [2023-08-24 10:20:07,113 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24357585139318885 [2023-08-24 10:20:07,113 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 3147 transitions. [2023-08-24 10:20:07,113 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 3147 transitions. [2023-08-24 10:20:07,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:20:07,114 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 3147 transitions. [2023-08-24 10:20:07,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 82.8157894736842) internal successors, (3147), 38 states have internal predecessors, (3147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:20:07,127 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 340.0) internal successors, (13260), 39 states have internal predecessors, (13260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:20:07,128 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 340.0) internal successors, (13260), 39 states have internal predecessors, (13260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:20:07,128 INFO L175 Difference]: Start difference. First operand has 189 places, 386 transitions, 5567 flow. Second operand 38 states and 3147 transitions. [2023-08-24 10:20:07,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 540 transitions, 8264 flow [2023-08-24 10:20:07,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 540 transitions, 8076 flow, removed 57 selfloop flow, removed 13 redundant places. [2023-08-24 10:20:07,241 INFO L231 Difference]: Finished difference. Result has 222 places, 458 transitions, 7526 flow [2023-08-24 10:20:07,241 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=5387, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=386, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=291, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=7526, PETRI_PLACES=222, PETRI_TRANSITIONS=458} [2023-08-24 10:20:07,242 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 200 predicate places. [2023-08-24 10:20:07,242 INFO L495 AbstractCegarLoop]: Abstraction has has 222 places, 458 transitions, 7526 flow [2023-08-24 10:20:07,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 79.625) internal successors, (2548), 32 states have internal predecessors, (2548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:20:07,242 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:20:07,242 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 10:20:07,248 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 10:20:07,447 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,SelfDestructingSolverStorable13 [2023-08-24 10:20:07,448 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 10:20:07,448 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:20:07,448 INFO L85 PathProgramCache]: Analyzing trace with hash 35664844, now seen corresponding path program 8 times [2023-08-24 10:20:07,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:20:07,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982454771] [2023-08-24 10:20:07,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:20:07,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:20:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:20:08,611 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:20:08,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:20:08,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982454771] [2023-08-24 10:20:08,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982454771] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 10:20:08,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548619842] [2023-08-24 10:20:08,612 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-24 10:20:08,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:20:08,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 10:20:08,613 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 10:20:08,638 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 10:20:08,725 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 10:20:08,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 10:20:08,727 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 58 conjunts are in the unsatisfiable core [2023-08-24 10:20:08,730 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 10:20:08,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 10:20:08,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 10:20:08,757 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-24 10:20:08,758 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2023-08-24 10:20:08,814 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 15 treesize of output 11 [2023-08-24 10:20:08,882 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 10:20:08,882 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 11 treesize of output 11 [2023-08-24 10:20:08,947 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 10:20:08,986 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 10:20:09,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 10:20:09,100 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 18 treesize of output 20 [2023-08-24 10:20:09,287 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 10:20:09,287 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 10:20:14,714 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:20:14,715 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 130 treesize of output 94 [2023-08-24 10:20:14,775 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:20:14,776 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 2019 treesize of output 1999 [2023-08-24 10:20:14,871 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:20:14,872 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 430 treesize of output 462 [2023-08-24 10:20:14,907 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:20:14,908 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 395 treesize of output 363 [2023-08-24 10:20:14,959 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:20:14,959 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 274 treesize of output 330 [2023-08-24 10:21:22,529 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:21:22,529 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 159 treesize of output 111 [2023-08-24 10:21:22,607 INFO L322 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2023-08-24 10:21:22,608 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15061 treesize of output 14069 [2023-08-24 10:21:22,771 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:21:22,772 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 1895 treesize of output 1747 [2023-08-24 10:21:22,871 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:21:22,872 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 1667 treesize of output 1633 [2023-08-24 10:21:22,959 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:21:22,960 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 1530 treesize of output 1138 [2023-08-24 10:22:45,749 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:22:45,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548619842] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 10:22:45,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 10:22:45,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 31 [2023-08-24 10:22:45,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905992629] [2023-08-24 10:22:45,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 10:22:45,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-24 10:22:45,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:22:45,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-24 10:22:45,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=927, Unknown=9, NotChecked=0, Total=1056 [2023-08-24 10:22:45,752 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 340 [2023-08-24 10:22:45,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 458 transitions, 7526 flow. Second operand has 33 states, 33 states have (on average 79.60606060606061) internal successors, (2627), 33 states have internal predecessors, (2627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:22:45,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:22:45,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 340 [2023-08-24 10:22:45,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:22:53,407 WARN L234 SmtUtils]: Spent 7.13s on a formula simplification. DAG size of input: 125 DAG size of output: 122 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 10:22:56,241 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 10:23:05,759 WARN L234 SmtUtils]: Spent 6.72s on a formula simplification that was a NOOP. DAG size: 118 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 10:23:15,676 WARN L234 SmtUtils]: Spent 6.82s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 10:23:17,762 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 10:24:08,550 WARN L234 SmtUtils]: Spent 49.46s on a formula simplification. DAG size of input: 219 DAG size of output: 161 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 10:25:08,367 WARN L234 SmtUtils]: Spent 58.59s on a formula simplification. DAG size of input: 219 DAG size of output: 158 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 10:25:10,443 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 10:26:13,602 WARN L234 SmtUtils]: Spent 1.01m on a formula simplification. DAG size of input: 218 DAG size of output: 159 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 10:26:42,332 WARN L234 SmtUtils]: Spent 26.08s on a formula simplification. DAG size of input: 214 DAG size of output: 166 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 10:27:07,367 WARN L234 SmtUtils]: Spent 20.61s on a formula simplification. DAG size of input: 218 DAG size of output: 172 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 10:27:10,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 10:27:18,945 WARN L234 SmtUtils]: Spent 6.29s on a formula simplification. DAG size of input: 100 DAG size of output: 99 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 10:27:20,970 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 10:27:23,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 10:27:26,644 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 10:27:58,402 WARN L234 SmtUtils]: Spent 26.61s on a formula simplification. DAG size of input: 215 DAG size of output: 168 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 10:28:00,919 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 10:28:22,146 WARN L234 SmtUtils]: Spent 14.13s on a formula simplification. DAG size of input: 223 DAG size of output: 176 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 10:28:49,794 WARN L234 SmtUtils]: Spent 23.95s on a formula simplification. DAG size of input: 225 DAG size of output: 179 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 10:28:49,816 INFO L124 PetriNetUnfolderBase]: 1549/2922 cut-off events. [2023-08-24 10:28:49,816 INFO L125 PetriNetUnfolderBase]: For 28654/28654 co-relation queries the response was YES. [2023-08-24 10:28:49,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21924 conditions, 2922 events. 1549/2922 cut-off events. For 28654/28654 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 19605 event pairs, 60 based on Foata normal form. 23/2945 useless extension candidates. Maximal degree in co-relation 21605. Up to 898 conditions per place. [2023-08-24 10:28:49,842 INFO L140 encePairwiseOnDemand]: 327/340 looper letters, 282 selfloop transitions, 501 changer transitions 25/808 dead transitions. [2023-08-24 10:28:49,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 808 transitions, 13656 flow [2023-08-24 10:28:49,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2023-08-24 10:28:49,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2023-08-24 10:28:49,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 5210 transitions. [2023-08-24 10:28:49,851 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24323062558356676 [2023-08-24 10:28:49,851 INFO L72 ComplementDD]: Start complementDD. Operand 63 states and 5210 transitions. [2023-08-24 10:28:49,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 63 states and 5210 transitions. [2023-08-24 10:28:49,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:28:49,853 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 63 states and 5210 transitions. [2023-08-24 10:28:49,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 64 states, 63 states have (on average 82.6984126984127) internal successors, (5210), 63 states have internal predecessors, (5210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:28:49,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 64 states, 64 states have (on average 340.0) internal successors, (21760), 64 states have internal predecessors, (21760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:28:49,875 INFO L81 ComplementDD]: Finished complementDD. Result has 64 states, 64 states have (on average 340.0) internal successors, (21760), 64 states have internal predecessors, (21760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:28:49,875 INFO L175 Difference]: Start difference. First operand has 222 places, 458 transitions, 7526 flow. Second operand 63 states and 5210 transitions. [2023-08-24 10:28:49,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 808 transitions, 13656 flow [2023-08-24 10:28:50,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 808 transitions, 13301 flow, removed 149 selfloop flow, removed 15 redundant places. [2023-08-24 10:28:50,111 INFO L231 Difference]: Finished difference. Result has 288 places, 647 transitions, 12218 flow [2023-08-24 10:28:50,111 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=7154, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=452, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=330, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=12218, PETRI_PLACES=288, PETRI_TRANSITIONS=647} [2023-08-24 10:28:50,112 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 266 predicate places. [2023-08-24 10:28:50,112 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 647 transitions, 12218 flow [2023-08-24 10:28:50,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 79.60606060606061) internal successors, (2627), 33 states have internal predecessors, (2627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:28:50,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:28:50,113 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 10:28:50,123 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 10:28:50,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-24 10:28:50,323 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 10:28:50,324 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:28:50,324 INFO L85 PathProgramCache]: Analyzing trace with hash -564469912, now seen corresponding path program 9 times [2023-08-24 10:28:50,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:28:50,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705397879] [2023-08-24 10:28:50,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:28:50,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:28:50,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:28:51,612 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:28:51,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:28:51,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705397879] [2023-08-24 10:28:51,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705397879] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 10:28:51,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622181642] [2023-08-24 10:28:51,612 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-24 10:28:51,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:28:51,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 10:28:51,614 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 10:28:51,615 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 10:28:51,702 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-24 10:28:51,702 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 10:28:51,703 INFO L262 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 63 conjunts are in the unsatisfiable core [2023-08-24 10:28:51,706 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 10:28:51,867 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 15 treesize of output 11 [2023-08-24 10:28:51,935 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 10:28:52,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 10:28:52,052 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 18 treesize of output 20 [2023-08-24 10:28:52,288 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:28:52,288 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 10:28:52,552 WARN L839 $PredicateComparison]: unable to prove that (or (<= c_~n1~0 c_~q1_back~0) (< c_~q1_back~0 0) (<= c_~n2~0 c_~q2_front~0) (< c_~q2_front~0 0) (let ((.cse1 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse4 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse2 (+ (* c_~q1_front~0 4) c_~q1~0.offset))) (and (forall ((v_ArrVal_428 (Array Int Int)) (~q1~0.base Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_428))) (let ((.cse0 (select .cse3 ~q1~0.base))) (or (not (= c_~j~0 (select .cse0 .cse1))) (<= (select .cse0 .cse2) (select (select .cse3 c_~q2~0.base) .cse4)))))) (forall ((v_ArrVal_428 (Array Int Int)) (~q1~0.base Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_428))) (let ((.cse5 (select .cse6 ~q1~0.base))) (or (not (= c_~j~0 (select .cse5 .cse1))) (< (select (select .cse6 c_~q2~0.base) .cse4) (+ (select .cse5 .cse2) 1))))))))) is different from false [2023-08-24 10:28:52,597 WARN L839 $PredicateComparison]: unable to prove that (or (<= c_~n1~0 c_~q1_back~0) (< c_~q1_back~0 0) (<= c_~n2~0 c_~q2_front~0) (< c_~q2_front~0 0) (not (= c_~i~0 (select (select |c_#memory_int| c_~q2~0.base) (+ (* c_~q2_back~0 4) c_~q2~0.offset)))) (let ((.cse1 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse4 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse2 (+ (* c_~q1_front~0 4) c_~q1~0.offset))) (and (forall ((v_ArrVal_428 (Array Int Int)) (~q1~0.base Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_428))) (let ((.cse0 (select .cse3 ~q1~0.base))) (or (not (= c_~j~0 (select .cse0 .cse1))) (<= (select .cse0 .cse2) (select (select .cse3 c_~q2~0.base) .cse4)))))) (forall ((v_ArrVal_428 (Array Int Int)) (~q1~0.base Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_428))) (let ((.cse5 (select .cse6 ~q1~0.base))) (or (not (= c_~j~0 (select .cse5 .cse1))) (< (select (select .cse6 c_~q2~0.base) .cse4) (+ (select .cse5 .cse2) 1))))))))) is different from false [2023-08-24 10:28:52,694 WARN L839 $PredicateComparison]: unable to prove that (or (<= c_~n1~0 c_~q1_back~0) (< |c_ULTIMATE.start_create_fresh_int_array_~i~1#1| |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (< c_~q1_back~0 0) (let ((.cse3 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse6 (+ (* c_~q2_front~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse4 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse1 (+ (* c_~q2_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_427 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_427))) (or (not (= (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) c_~i~0)) (forall ((v_ArrVal_428 (Array Int Int)) (~q1~0.base Int)) (let ((.cse5 (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_428))) (let ((.cse2 (select .cse5 ~q1~0.base))) (or (not (= c_~j~0 (select .cse2 .cse3))) (<= (select .cse2 .cse4) (select (select .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse6))))))))) (forall ((v_ArrVal_427 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_427))) (or (forall ((v_ArrVal_428 (Array Int Int)) (~q1~0.base Int)) (let ((.cse8 (store .cse9 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_428))) (let ((.cse7 (select .cse8 ~q1~0.base))) (or (not (= c_~j~0 (select .cse7 .cse3))) (< (select (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse6) (+ (select .cse7 .cse4) 1)))))) (not (= (select (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) c_~i~0))))))) (<= c_~n2~0 c_~q2_front~0) (< c_~q2_front~0 0)) is different from false [2023-08-24 10:28:52,731 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:28:52,732 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 113 treesize of output 77 [2023-08-24 10:28:52,827 INFO L322 Elim1Store]: treesize reduction 4, result has 95.7 percent of original size [2023-08-24 10:28:52,827 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 510 treesize of output 518 [2023-08-24 10:28:52,871 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:28:52,872 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 406 treesize of output 338 [2023-08-24 10:28:52,942 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:28:52,943 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 322 treesize of output 342 [2023-08-24 10:29:12,971 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:29:12,972 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 79 [2023-08-24 10:29:12,975 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 10:29:13,009 INFO L322 Elim1Store]: treesize reduction 69, result has 25.8 percent of original size [2023-08-24 10:29:13,009 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 632 treesize of output 535 [2023-08-24 10:29:13,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 10:29:13,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 10:29:13,034 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:29:13,034 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 258 treesize of output 226 [2023-08-24 10:29:13,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 10:29:13,045 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 101 [2023-08-24 10:29:13,417 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-08-24 10:29:13,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622181642] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 10:29:13,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 10:29:13,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 31 [2023-08-24 10:29:13,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626427132] [2023-08-24 10:29:13,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 10:29:13,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-24 10:29:13,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:29:13,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-24 10:29:13,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=781, Unknown=3, NotChecked=174, Total=1056 [2023-08-24 10:29:13,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 340 [2023-08-24 10:29:13,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 647 transitions, 12218 flow. Second operand has 33 states, 33 states have (on average 82.66666666666667) internal successors, (2728), 33 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:29:13,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:29:13,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 340 [2023-08-24 10:29:13,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:29:15,267 WARN L839 $PredicateComparison]: unable to prove that (and (<= c_~i~0 c_~j~0) (< c_~j~0 (+ c_~i~0 1)) (or (<= c_~n1~0 c_~q1_back~0) (< c_~q1_back~0 0) (<= c_~n2~0 c_~q2_front~0) (< c_~q2_front~0 0) (let ((.cse1 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse4 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse2 (+ (* c_~q1_front~0 4) c_~q1~0.offset))) (and (forall ((v_ArrVal_428 (Array Int Int)) (~q1~0.base Int)) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_428))) (let ((.cse0 (select .cse3 ~q1~0.base))) (or (not (= c_~j~0 (select .cse0 .cse1))) (<= (select .cse0 .cse2) (select (select .cse3 c_~q2~0.base) .cse4)))))) (forall ((v_ArrVal_428 (Array Int Int)) (~q1~0.base Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_428))) (let ((.cse5 (select .cse6 ~q1~0.base))) (or (not (= c_~j~0 (select .cse5 .cse1))) (< (select (select .cse6 c_~q2~0.base) .cse4) (+ (select .cse5 .cse2) 1)))))))))) is different from false [2023-08-24 10:29:18,600 INFO L124 PetriNetUnfolderBase]: 1622/3089 cut-off events. [2023-08-24 10:29:18,601 INFO L125 PetriNetUnfolderBase]: For 44992/44992 co-relation queries the response was YES. [2023-08-24 10:29:18,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25438 conditions, 3089 events. 1622/3089 cut-off events. For 44992/44992 co-relation queries the response was YES. Maximal size of possible extension queue 273. Compared 20741 event pairs, 129 based on Foata normal form. 40/3129 useless extension candidates. Maximal degree in co-relation 25186. Up to 1316 conditions per place. [2023-08-24 10:29:18,632 INFO L140 encePairwiseOnDemand]: 329/340 looper letters, 368 selfloop transitions, 346 changer transitions 25/739 dead transitions. [2023-08-24 10:29:18,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 739 transitions, 14723 flow [2023-08-24 10:29:18,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-08-24 10:29:18,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2023-08-24 10:29:18,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 2843 transitions. [2023-08-24 10:29:18,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2533868092691622 [2023-08-24 10:29:18,636 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 2843 transitions. [2023-08-24 10:29:18,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 2843 transitions. [2023-08-24 10:29:18,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:29:18,637 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 2843 transitions. [2023-08-24 10:29:18,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 86.15151515151516) internal successors, (2843), 33 states have internal predecessors, (2843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:29:18,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 340.0) internal successors, (11560), 34 states have internal predecessors, (11560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:29:18,649 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 340.0) internal successors, (11560), 34 states have internal predecessors, (11560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:29:18,649 INFO L175 Difference]: Start difference. First operand has 288 places, 647 transitions, 12218 flow. Second operand 33 states and 2843 transitions. [2023-08-24 10:29:18,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 739 transitions, 14723 flow [2023-08-24 10:29:19,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 739 transitions, 13960 flow, removed 300 selfloop flow, removed 25 redundant places. [2023-08-24 10:29:19,042 INFO L231 Difference]: Finished difference. Result has 302 places, 637 transitions, 12885 flow [2023-08-24 10:29:19,043 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=9991, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=281, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=12885, PETRI_PLACES=302, PETRI_TRANSITIONS=637} [2023-08-24 10:29:19,043 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 280 predicate places. [2023-08-24 10:29:19,043 INFO L495 AbstractCegarLoop]: Abstraction has has 302 places, 637 transitions, 12885 flow [2023-08-24 10:29:19,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 82.66666666666667) internal successors, (2728), 33 states have internal predecessors, (2728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:29:19,044 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:29:19,044 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 10:29:19,049 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 10:29:19,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:29:19,244 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 10:29:19,245 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:29:19,245 INFO L85 PathProgramCache]: Analyzing trace with hash 603046995, now seen corresponding path program 10 times [2023-08-24 10:29:19,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:29:19,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436791699] [2023-08-24 10:29:19,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:29:19,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:29:19,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:29:21,257 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:29:21,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:29:21,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436791699] [2023-08-24 10:29:21,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436791699] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 10:29:21,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745349724] [2023-08-24 10:29:21,258 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-24 10:29:21,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:29:21,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 10:29:21,259 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 10:29:21,262 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 10:29:21,367 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-24 10:29:21,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 10:29:21,369 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 64 conjunts are in the unsatisfiable core [2023-08-24 10:29:21,372 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 10:29:21,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 10:29:21,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 10:29:21,410 INFO L322 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-24 10:29:21,410 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 20 [2023-08-24 10:29:21,472 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 10:29:21,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-24 10:29:21,582 INFO L322 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-08-24 10:29:21,582 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-08-24 10:29:21,648 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 10:29:21,712 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 10:29:21,725 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 10:29:21,847 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-08-24 10:29:22,123 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 17 [2023-08-24 10:29:22,206 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 10:29:22,206 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 10:29:22,775 WARN L839 $PredicateComparison]: unable to prove that (or (<= c_~n1~0 c_~q1_back~0) (< c_~q1_back~0 0) (let ((.cse10 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse9 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse7 (* c_~q2_front~0 4)) (.cse4 (select |c_#memory_int| c_~q2~0.base)) (.cse5 (* c_~q2_back~0 4))) (and (forall ((v_ArrVal_479 (Array Int Int)) (~q2~0.offset Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_479))) (let ((.cse8 (select .cse6 c_~q1~0.base))) (let ((.cse1 (select .cse8 .cse10)) (.cse2 (select .cse8 .cse9)) (.cse0 (select (select .cse6 c_~q2~0.base) (+ ~q2~0.offset .cse7))) (.cse3 (select .cse4 (+ ~q2~0.offset .cse5)))) (or (< .cse0 .cse1) (< .cse2 (+ .cse1 1)) (< .cse2 (+ .cse3 1)) (< .cse0 .cse3)))))) (forall ((v_ArrVal_479 (Array Int Int)) (~q2~0.offset Int)) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_479))) (let ((.cse15 (select .cse16 c_~q1~0.base))) (let ((.cse12 (select .cse4 (+ ~q2~0.offset .cse5))) (.cse11 (select (select .cse16 c_~q2~0.base) (+ ~q2~0.offset .cse7))) (.cse13 (select .cse15 .cse9)) (.cse14 (select .cse15 .cse10))) (or (< .cse11 (+ .cse12 1)) (< .cse13 .cse12) (< .cse11 (+ .cse14 1)) (< .cse13 .cse14))))))))) is different from false [2023-08-24 10:29:22,855 WARN L839 $PredicateComparison]: unable to prove that (or (<= c_~n1~0 c_~q1_back~0) (< c_~q1_back~0 0) (let ((.cse9 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse7 (* c_~q2_front~0 4)) (.cse5 (* c_~q2_back~0 4)) (.cse10 (+ (* c_~q1_front~0 4) c_~q1~0.offset))) (and (forall ((v_ArrVal_479 (Array Int Int)) (~q2~0.offset Int) (v_ArrVal_478 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_478))) (let ((.cse6 (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_479))) (let ((.cse8 (select .cse6 c_~q1~0.base))) (let ((.cse0 (select .cse8 .cse10)) (.cse3 (select .cse8 .cse9)) (.cse2 (select (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ ~q2~0.offset .cse7))) (.cse1 (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ ~q2~0.offset .cse5)))) (or (< .cse0 .cse1) (< .cse2 (+ .cse3 1)) (< .cse0 .cse3) (< .cse2 (+ .cse1 1)))))))) (forall ((v_ArrVal_479 (Array Int Int)) (~q2~0.offset Int) (v_ArrVal_478 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_478))) (let ((.cse16 (store .cse17 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_479))) (let ((.cse15 (select .cse16 c_~q1~0.base))) (let ((.cse11 (select .cse15 .cse10)) (.cse12 (select (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ ~q2~0.offset .cse5))) (.cse14 (select (select .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ ~q2~0.offset .cse7))) (.cse13 (select .cse15 .cse9))) (or (< .cse11 (+ .cse12 1)) (< .cse11 (+ .cse13 1)) (< .cse14 .cse12) (< .cse14 .cse13)))))))))) is different from false [2023-08-24 10:29:22,903 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse5 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse6 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse8 (* c_~q2_back~0 4)) (.cse10 (* c_~q2_front~0 4))) (and (forall ((v_ArrVal_479 (Array Int Int)) (~q2~0.offset Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_478))) (let ((.cse9 (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_479))) (let ((.cse4 (select .cse9 c_~q1~0.base))) (let ((.cse0 (select (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ ~q2~0.offset .cse10))) (.cse1 (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ ~q2~0.offset .cse8))) (.cse3 (select .cse4 .cse6)) (.cse2 (select .cse4 .cse5))) (or (< .cse0 .cse1) (< .cse0 .cse2) (< .cse3 (+ .cse1 1)) (< .cse3 (+ .cse2 1)))))))) (forall ((v_ArrVal_479 (Array Int Int)) (~q2~0.offset Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse16 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_478))) (let ((.cse17 (store .cse16 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_479))) (let ((.cse15 (select .cse17 c_~q1~0.base))) (let ((.cse13 (select (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ ~q2~0.offset .cse10))) (.cse12 (select (select .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ ~q2~0.offset .cse8))) (.cse11 (select .cse15 .cse6)) (.cse14 (select .cse15 .cse5))) (or (< .cse11 .cse12) (< .cse13 (+ .cse14 1)) (< .cse13 (+ .cse12 1)) (< .cse11 .cse14))))))))) (<= c_~n1~0 c_~q1_back~0) (< c_~q1_back~0 0)) is different from false [2023-08-24 10:29:23,213 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:29:23,214 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 243 treesize of output 159 [2023-08-24 10:29:23,246 INFO L322 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-08-24 10:29:23,247 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 18533 treesize of output 17768 [2023-08-24 10:29:23,318 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 10:29:23,355 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:29:23,355 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 1311 treesize of output 1221 [2023-08-24 10:29:23,382 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 10:29:23,424 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:29:23,424 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 1166 treesize of output 1028 [2023-08-24 10:29:23,452 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-24 10:29:23,473 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:29:23,473 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 1030 treesize of output 762 [2023-08-24 10:29:34,175 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:29:34,175 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 243 treesize of output 159 [2023-08-24 10:29:34,207 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:29:34,207 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19205 treesize of output 18445 [2023-08-24 10:29:34,301 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:29:34,302 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 1339 treesize of output 1257 [2023-08-24 10:29:34,370 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:29:34,371 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 1194 treesize of output 1064 [2023-08-24 10:29:34,429 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:29:34,430 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1062 treesize of output 802 [2023-08-24 10:29:45,799 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 3 not checked. [2023-08-24 10:29:45,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745349724] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 10:29:45,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 10:29:45,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 35 [2023-08-24 10:29:45,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595685948] [2023-08-24 10:29:45,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 10:29:45,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-08-24 10:29:45,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:29:45,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-08-24 10:29:45,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1011, Unknown=7, NotChecked=198, Total=1332 [2023-08-24 10:29:45,802 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 340 [2023-08-24 10:29:45,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 637 transitions, 12885 flow. Second operand has 37 states, 37 states have (on average 79.4054054054054) internal successors, (2938), 37 states have internal predecessors, (2938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:29:45,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:29:45,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 340 [2023-08-24 10:29:45,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:29:46,379 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse18 (<= c_~n1~0 c_~q1_back~0)) (.cse19 (< c_~q1_back~0 0))) (and (or (let ((.cse5 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse6 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse8 (* c_~q2_back~0 4)) (.cse10 (* c_~q2_front~0 4))) (and (forall ((v_ArrVal_479 (Array Int Int)) (~q2~0.offset Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_478))) (let ((.cse9 (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_479))) (let ((.cse4 (select .cse9 c_~q1~0.base))) (let ((.cse0 (select (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ ~q2~0.offset .cse10))) (.cse1 (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ ~q2~0.offset .cse8))) (.cse3 (select .cse4 .cse6)) (.cse2 (select .cse4 .cse5))) (or (< .cse0 .cse1) (< .cse0 .cse2) (< .cse3 (+ .cse1 1)) (< .cse3 (+ .cse2 1)))))))) (forall ((v_ArrVal_479 (Array Int Int)) (~q2~0.offset Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse16 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_478))) (let ((.cse17 (store .cse16 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_479))) (let ((.cse15 (select .cse17 c_~q1~0.base))) (let ((.cse13 (select (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ ~q2~0.offset .cse10))) (.cse12 (select (select .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ ~q2~0.offset .cse8))) (.cse11 (select .cse15 .cse6)) (.cse14 (select .cse15 .cse5))) (or (< .cse11 .cse12) (< .cse13 (+ .cse14 1)) (< .cse13 (+ .cse12 1)) (< .cse11 .cse14))))))))) .cse18 .cse19) (or (let ((.cse20 (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_100| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_100|) 0))))) (and (or .cse20 (= c_~q2_front~0 c_~q2_back~0)) (or .cse20 (= c_~q1_back~0 c_~q1_front~0)) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~#t2~0#1.base|) 0)))) .cse18 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse19) (<= c_~j~0 c_~i~0) (< c_~i~0 (+ c_~j~0 1)))) is different from false [2023-08-24 10:29:46,628 WARN L839 $PredicateComparison]: unable to prove that (and (or (let ((.cse5 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse6 (+ (* c_~q1_front~0 4) c_~q1~0.offset)) (.cse8 (* c_~q2_back~0 4)) (.cse10 (* c_~q2_front~0 4))) (and (forall ((v_ArrVal_479 (Array Int Int)) (~q2~0.offset Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_478))) (let ((.cse9 (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_479))) (let ((.cse4 (select .cse9 c_~q1~0.base))) (let ((.cse0 (select (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ ~q2~0.offset .cse10))) (.cse1 (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ ~q2~0.offset .cse8))) (.cse3 (select .cse4 .cse6)) (.cse2 (select .cse4 .cse5))) (or (< .cse0 .cse1) (< .cse0 .cse2) (< .cse3 (+ .cse1 1)) (< .cse3 (+ .cse2 1)))))))) (forall ((v_ArrVal_479 (Array Int Int)) (~q2~0.offset Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse16 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_478))) (let ((.cse17 (store .cse16 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_479))) (let ((.cse15 (select .cse17 c_~q1~0.base))) (let ((.cse13 (select (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ ~q2~0.offset .cse10))) (.cse12 (select (select .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ ~q2~0.offset .cse8))) (.cse11 (select .cse15 .cse6)) (.cse14 (select .cse15 .cse5))) (or (< .cse11 .cse12) (< .cse13 (+ .cse14 1)) (< .cse13 (+ .cse12 1)) (< .cse11 .cse14))))))))) (<= c_~n1~0 c_~q1_back~0) (< c_~q1_back~0 0)) (<= c_~j~0 c_~i~0) (< c_~i~0 (+ c_~j~0 1))) is different from false [2023-08-24 10:29:46,640 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse18 (<= c_~n1~0 c_~q1_back~0)) (.cse19 (< c_~q1_back~0 0)) (.cse5 (+ (* c_~q1_back~0 4) c_~q1~0.offset)) (.cse10 (* c_~q2_front~0 4)) (.cse8 (* c_~q2_back~0 4)) (.cse6 (+ (* c_~q1_front~0 4) c_~q1~0.offset))) (and (or (and (forall ((v_ArrVal_479 (Array Int Int)) (~q2~0.offset Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_478))) (let ((.cse9 (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_479))) (let ((.cse4 (select .cse9 c_~q1~0.base))) (let ((.cse0 (select (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ ~q2~0.offset .cse10))) (.cse1 (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ ~q2~0.offset .cse8))) (.cse3 (select .cse4 .cse6)) (.cse2 (select .cse4 .cse5))) (or (< .cse0 .cse1) (< .cse0 .cse2) (< .cse3 (+ .cse1 1)) (< .cse3 (+ .cse2 1)))))))) (forall ((v_ArrVal_479 (Array Int Int)) (~q2~0.offset Int) (v_ArrVal_478 (Array Int Int)) (v_ArrVal_477 (Array Int Int))) (let ((.cse16 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_477) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_478))) (let ((.cse17 (store .cse16 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_479))) (let ((.cse15 (select .cse17 c_~q1~0.base))) (let ((.cse13 (select (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ ~q2~0.offset .cse10))) (.cse12 (select (select .cse16 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ ~q2~0.offset .cse8))) (.cse11 (select .cse15 .cse6)) (.cse14 (select .cse15 .cse5))) (or (< .cse11 .cse12) (< .cse13 (+ .cse14 1)) (< .cse13 (+ .cse12 1)) (< .cse11 .cse14)))))))) .cse18 .cse19) (or .cse18 .cse19 (and (forall ((v_ArrVal_479 (Array Int Int)) (~q2~0.offset Int) (v_ArrVal_478 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_478))) (let ((.cse25 (store .cse24 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_479))) (let ((.cse26 (select .cse25 c_~q1~0.base))) (let ((.cse20 (select .cse26 .cse6)) (.cse23 (select .cse26 .cse5)) (.cse22 (select (select .cse25 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ ~q2~0.offset .cse10))) (.cse21 (select (select .cse24 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ ~q2~0.offset .cse8)))) (or (< .cse20 .cse21) (< .cse22 (+ .cse23 1)) (< .cse20 .cse23) (< .cse22 (+ .cse21 1)))))))) (forall ((v_ArrVal_479 (Array Int Int)) (~q2~0.offset Int) (v_ArrVal_478 (Array Int Int))) (let ((.cse33 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_478))) (let ((.cse32 (store .cse33 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_479))) (let ((.cse31 (select .cse32 c_~q1~0.base))) (let ((.cse27 (select .cse31 .cse6)) (.cse28 (select (select .cse33 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ ~q2~0.offset .cse8))) (.cse30 (select (select .cse32 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ ~q2~0.offset .cse10))) (.cse29 (select .cse31 .cse5))) (or (< .cse27 (+ .cse28 1)) (< .cse27 (+ .cse29 1)) (< .cse30 .cse28) (< .cse30 .cse29))))))))))) is different from false [2023-08-24 10:29:52,363 INFO L124 PetriNetUnfolderBase]: 1838/3470 cut-off events. [2023-08-24 10:29:52,363 INFO L125 PetriNetUnfolderBase]: For 58891/58891 co-relation queries the response was YES. [2023-08-24 10:29:52,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30104 conditions, 3470 events. 1838/3470 cut-off events. For 58891/58891 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 23666 event pairs, 236 based on Foata normal form. 3/3473 useless extension candidates. Maximal degree in co-relation 29941. Up to 1611 conditions per place. [2023-08-24 10:29:52,397 INFO L140 encePairwiseOnDemand]: 327/340 looper letters, 230 selfloop transitions, 606 changer transitions 13/849 dead transitions. [2023-08-24 10:29:52,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 849 transitions, 17793 flow [2023-08-24 10:29:52,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-08-24 10:29:52,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2023-08-24 10:29:52,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 4262 transitions. [2023-08-24 10:29:52,403 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2410633484162896 [2023-08-24 10:29:52,403 INFO L72 ComplementDD]: Start complementDD. Operand 52 states and 4262 transitions. [2023-08-24 10:29:52,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 4262 transitions. [2023-08-24 10:29:52,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:29:52,405 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 52 states and 4262 transitions. [2023-08-24 10:29:52,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 53 states, 52 states have (on average 81.96153846153847) internal successors, (4262), 52 states have internal predecessors, (4262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:29:52,420 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 53 states, 53 states have (on average 340.0) internal successors, (18020), 53 states have internal predecessors, (18020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:29:52,421 INFO L81 ComplementDD]: Finished complementDD. Result has 53 states, 53 states have (on average 340.0) internal successors, (18020), 53 states have internal predecessors, (18020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:29:52,421 INFO L175 Difference]: Start difference. First operand has 302 places, 637 transitions, 12885 flow. Second operand 52 states and 4262 transitions. [2023-08-24 10:29:52,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 349 places, 849 transitions, 17793 flow [2023-08-24 10:29:52,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 849 transitions, 17538 flow, removed 101 selfloop flow, removed 15 redundant places. [2023-08-24 10:29:52,864 INFO L231 Difference]: Finished difference. Result has 346 places, 754 transitions, 16971 flow [2023-08-24 10:29:52,864 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=12637, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=636, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=493, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=52, PETRI_FLOW=16971, PETRI_PLACES=346, PETRI_TRANSITIONS=754} [2023-08-24 10:29:52,864 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 324 predicate places. [2023-08-24 10:29:52,864 INFO L495 AbstractCegarLoop]: Abstraction has has 346 places, 754 transitions, 16971 flow [2023-08-24 10:29:52,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 79.4054054054054) internal successors, (2938), 37 states have internal predecessors, (2938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:29:52,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:29:52,865 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 10:29:52,871 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 10:29:53,070 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,SelfDestructingSolverStorable16 [2023-08-24 10:29:53,070 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 10:29:53,070 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:29:53,070 INFO L85 PathProgramCache]: Analyzing trace with hash -930814097, now seen corresponding path program 11 times [2023-08-24 10:29:53,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:29:53,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823258743] [2023-08-24 10:29:53,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:29:53,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:29:53,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:29:55,277 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:29:55,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:29:55,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823258743] [2023-08-24 10:29:55,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823258743] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 10:29:55,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878669584] [2023-08-24 10:29:55,277 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-24 10:29:55,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:29:55,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 10:29:55,278 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 10:29:55,280 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 10:29:55,379 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-24 10:29:55,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 10:29:55,381 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 50 conjunts are in the unsatisfiable core [2023-08-24 10:29:55,385 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 10:29:55,414 INFO L322 Elim1Store]: treesize reduction 37, result has 32.7 percent of original size [2023-08-24 10:29:55,414 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 12 treesize of output 23 [2023-08-24 10:29:55,514 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 10:29:55,514 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 11 treesize of output 11 [2023-08-24 10:29:55,688 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 29 treesize of output 29 [2023-08-24 10:29:55,827 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:29:55,827 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 60 treesize of output 40 [2023-08-24 10:29:55,920 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-24 10:29:55,920 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 10:29:56,226 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_~q1_back~0 4)) (.cse4 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse1 (* c_~q1_front~0 4))) (and (forall ((v_ArrVal_529 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_529))) (or (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse0 (select .cse3 ~q1~0.base))) (or (< (+ (select .cse0 (+ .cse1 ~q1~0.offset)) 1) c_~N~0) (not (= (select .cse0 (+ .cse2 ~q1~0.offset)) c_~j~0))))) (< (select (select .cse3 c_~q2~0.base) .cse4) c_~N~0)))) (forall ((~q1~0.offset Int) (~q1~0.base Int) (v_ArrVal_529 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_529))) (let ((.cse6 (select .cse7 ~q1~0.base))) (let ((.cse5 (select .cse6 (+ .cse1 ~q1~0.offset)))) (or (< (+ .cse5 1) c_~N~0) (not (= (select .cse6 (+ .cse2 ~q1~0.offset)) c_~j~0)) (< .cse5 (+ (select (select .cse7 c_~q2~0.base) .cse4) 1))))))))) is different from false [2023-08-24 10:29:56,342 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:29:56,342 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 280 treesize of output 436 [2023-08-24 10:29:56,381 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:29:56,381 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 195 treesize of output 200 [2023-08-24 10:29:56,418 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:29:56,418 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 159 treesize of output 182 [2023-08-24 10:30:07,824 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-24 10:30:07,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878669584] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 10:30:07,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 10:30:07,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 9] total 33 [2023-08-24 10:30:07,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621701908] [2023-08-24 10:30:07,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 10:30:07,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-24 10:30:07,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:30:07,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-24 10:30:07,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1015, Unknown=1, NotChecked=64, Total=1190 [2023-08-24 10:30:07,827 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 340 [2023-08-24 10:30:07,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 754 transitions, 16971 flow. Second operand has 35 states, 35 states have (on average 79.62857142857143) internal successors, (2787), 35 states have internal predecessors, (2787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:30:07,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:30:07,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 340 [2023-08-24 10:30:07,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:30:15,950 WARN L234 SmtUtils]: Spent 7.01s on a formula simplification. DAG size of input: 99 DAG size of output: 70 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-24 10:30:18,106 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 10:30:20,793 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 10:30:22,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-24 10:30:34,433 INFO L124 PetriNetUnfolderBase]: 2268/4233 cut-off events. [2023-08-24 10:30:34,434 INFO L125 PetriNetUnfolderBase]: For 87955/87955 co-relation queries the response was YES. [2023-08-24 10:30:34,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40778 conditions, 4233 events. 2268/4233 cut-off events. For 87955/87955 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 29661 event pairs, 182 based on Foata normal form. 3/4236 useless extension candidates. Maximal degree in co-relation 40519. Up to 2488 conditions per place. [2023-08-24 10:30:34,480 INFO L140 encePairwiseOnDemand]: 325/340 looper letters, 386 selfloop transitions, 646 changer transitions 8/1040 dead transitions. [2023-08-24 10:30:34,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 1040 transitions, 24862 flow [2023-08-24 10:30:34,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-08-24 10:30:34,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2023-08-24 10:30:34,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 3029 transitions. [2023-08-24 10:30:34,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.24077901430842608 [2023-08-24 10:30:34,486 INFO L72 ComplementDD]: Start complementDD. Operand 37 states and 3029 transitions. [2023-08-24 10:30:34,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 3029 transitions. [2023-08-24 10:30:34,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:30:34,487 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 37 states and 3029 transitions. [2023-08-24 10:30:34,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 38 states, 37 states have (on average 81.86486486486487) internal successors, (3029), 37 states have internal predecessors, (3029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:30:34,498 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 38 states, 38 states have (on average 340.0) internal successors, (12920), 38 states have internal predecessors, (12920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:30:34,499 INFO L81 ComplementDD]: Finished complementDD. Result has 38 states, 38 states have (on average 340.0) internal successors, (12920), 38 states have internal predecessors, (12920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:30:34,499 INFO L175 Difference]: Start difference. First operand has 346 places, 754 transitions, 16971 flow. Second operand 37 states and 3029 transitions. [2023-08-24 10:30:34,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 1040 transitions, 24862 flow [2023-08-24 10:30:35,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 1040 transitions, 24537 flow, removed 117 selfloop flow, removed 12 redundant places. [2023-08-24 10:30:35,410 INFO L231 Difference]: Finished difference. Result has 381 places, 964 transitions, 23983 flow [2023-08-24 10:30:35,410 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=16711, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=754, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=457, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=23983, PETRI_PLACES=381, PETRI_TRANSITIONS=964} [2023-08-24 10:30:35,411 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 359 predicate places. [2023-08-24 10:30:35,411 INFO L495 AbstractCegarLoop]: Abstraction has has 381 places, 964 transitions, 23983 flow [2023-08-24 10:30:35,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 79.62857142857143) internal successors, (2787), 35 states have internal predecessors, (2787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:30:35,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:30:35,411 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 10:30:35,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-24 10:30:35,611 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,SelfDestructingSolverStorable17 [2023-08-24 10:30:35,614 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 10:30:35,614 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:30:35,614 INFO L85 PathProgramCache]: Analyzing trace with hash -551138004, now seen corresponding path program 12 times [2023-08-24 10:30:35,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:30:35,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55043052] [2023-08-24 10:30:35,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:30:35,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:30:35,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:30:35,719 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 10:30:35,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:30:35,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55043052] [2023-08-24 10:30:35,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55043052] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 10:30:35,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781437415] [2023-08-24 10:30:35,720 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-24 10:30:35,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:30:35,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 10:30:35,721 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 10:30:35,741 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 10:30:36,008 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-08-24 10:30:36,009 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-24 10:30:36,010 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-24 10:30:36,011 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 10:30:36,065 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 10:30:36,065 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 10:30:36,118 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-24 10:30:36,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781437415] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-24 10:30:36,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-24 10:30:36,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-08-24 10:30:36,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809931657] [2023-08-24 10:30:36,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-24 10:30:36,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-24 10:30:36,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 10:30:36,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-24 10:30:36,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-08-24 10:30:36,121 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 340 [2023-08-24 10:30:36,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 964 transitions, 23983 flow. Second operand has 12 states, 12 states have (on average 127.91666666666667) internal successors, (1535), 12 states have internal predecessors, (1535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:30:36,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 10:30:36,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 340 [2023-08-24 10:30:36,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 10:30:37,352 INFO L124 PetriNetUnfolderBase]: 1899/3654 cut-off events. [2023-08-24 10:30:37,352 INFO L125 PetriNetUnfolderBase]: For 95533/95533 co-relation queries the response was YES. [2023-08-24 10:30:37,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37710 conditions, 3654 events. 1899/3654 cut-off events. For 95533/95533 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 25652 event pairs, 651 based on Foata normal form. 156/3810 useless extension candidates. Maximal degree in co-relation 37606. Up to 2270 conditions per place. [2023-08-24 10:30:37,388 INFO L140 encePairwiseOnDemand]: 336/340 looper letters, 753 selfloop transitions, 25 changer transitions 40/818 dead transitions. [2023-08-24 10:30:37,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 818 transitions, 21642 flow [2023-08-24 10:30:37,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 10:30:37,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 10:30:37,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 791 transitions. [2023-08-24 10:30:37,390 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3877450980392157 [2023-08-24 10:30:37,390 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 791 transitions. [2023-08-24 10:30:37,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 791 transitions. [2023-08-24 10:30:37,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 10:30:37,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 791 transitions. [2023-08-24 10:30:37,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 131.83333333333334) internal successors, (791), 6 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:30:37,393 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 340.0) internal successors, (2380), 7 states have internal predecessors, (2380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:30:37,393 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 340.0) internal successors, (2380), 7 states have internal predecessors, (2380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:30:37,393 INFO L175 Difference]: Start difference. First operand has 381 places, 964 transitions, 23983 flow. Second operand 6 states and 791 transitions. [2023-08-24 10:30:37,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 818 transitions, 21642 flow [2023-08-24 10:30:38,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 818 transitions, 20578 flow, removed 245 selfloop flow, removed 19 redundant places. [2023-08-24 10:30:38,159 INFO L231 Difference]: Finished difference. Result has 348 places, 690 transitions, 16467 flow [2023-08-24 10:30:38,159 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=16858, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=721, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=696, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=16467, PETRI_PLACES=348, PETRI_TRANSITIONS=690} [2023-08-24 10:30:38,160 INFO L281 CegarLoopForPetriNet]: 22 programPoint places, 326 predicate places. [2023-08-24 10:30:38,160 INFO L495 AbstractCegarLoop]: Abstraction has has 348 places, 690 transitions, 16467 flow [2023-08-24 10:30:38,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 127.91666666666667) internal successors, (1535), 12 states have internal predecessors, (1535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 10:30:38,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 10:30:38,160 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 10:30:38,165 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 10:30:38,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:30:38,361 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-24 10:30:38,361 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 10:30:38,361 INFO L85 PathProgramCache]: Analyzing trace with hash 738616515, now seen corresponding path program 13 times [2023-08-24 10:30:38,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 10:30:38,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621571260] [2023-08-24 10:30:38,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 10:30:38,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 10:30:38,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:30:40,684 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 10:30:40,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 10:30:40,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621571260] [2023-08-24 10:30:40,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621571260] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-24 10:30:40,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282494615] [2023-08-24 10:30:40,685 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-24 10:30:40,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:30:40,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 10:30:40,686 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 10:30:40,687 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 10:30:40,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 10:30:40,781 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 50 conjunts are in the unsatisfiable core [2023-08-24 10:30:40,789 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-24 10:30:40,829 INFO L322 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2023-08-24 10:30:40,829 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 12 treesize of output 16 [2023-08-24 10:30:40,939 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-24 10:30:40,940 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 11 treesize of output 11 [2023-08-24 10:30:41,088 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 29 treesize of output 29 [2023-08-24 10:30:41,308 INFO L322 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2023-08-24 10:30:41,308 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 60 treesize of output 20 [2023-08-24 10:30:41,399 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 10:30:41,399 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-24 10:30:41,768 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse1 (* c_~q1_back~0 4)) (.cse2 (* c_~q1_front~0 4))) (and (forall ((v_ArrVal_619 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_619))) (or (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse0 (select .cse3 ~q1~0.base))) (or (not (= (select .cse0 (+ .cse1 ~q1~0.offset)) c_~j~0)) (< (select .cse0 (+ .cse2 ~q1~0.offset)) c_~N~0)))) (< (+ (select (select .cse3 c_~q2~0.base) .cse4) 1) c_~N~0)))) (forall ((v_ArrVal_619 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_619))) (or (< (select (select .cse5 c_~q2~0.base) .cse4) c_~N~0) (forall ((~q1~0.offset Int) (~q1~0.base Int)) (let ((.cse6 (select .cse5 ~q1~0.base))) (or (not (= (select .cse6 (+ .cse1 ~q1~0.offset)) c_~j~0)) (< (+ (select .cse6 (+ .cse2 ~q1~0.offset)) 1) c_~N~0))))))))) is different from false [2023-08-24 10:30:41,934 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:30:41,935 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 204 treesize of output 384 [2023-08-24 10:30:41,990 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:30:41,990 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 143 treesize of output 166 [2023-08-24 10:30:42,044 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-24 10:30:42,044 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 148 Received shutdown request... [2023-08-24 10:31:44,060 WARN L266 SmtUtils]: Removed 2 from assertion stack [2023-08-24 10:31:44,061 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-24 10:31:44,066 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 10:31:44,071 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 10:31:44,072 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-24 10:31:44,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-24 10:31:44,262 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 22 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 14ms.. [2023-08-24 10:31:44,264 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-24 10:31:44,264 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-24 10:31:44,264 INFO L445 BasicCegarLoop]: Path program histogram: [13, 2, 2, 1, 1, 1] [2023-08-24 10:31:44,267 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 10:31:44,267 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 10:31:44,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 10:31:44 BasicIcfg [2023-08-24 10:31:44,269 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 10:31:44,269 INFO L158 Benchmark]: Toolchain (without parser) took 818625.21ms. Allocated memory was 362.8MB in the beginning and 1.3GB in the end (delta: 918.6MB). Free memory was 339.1MB in the beginning and 1.0GB in the end (delta: -707.0MB). Peak memory consumption was 808.7MB. Max. memory is 16.0GB. [2023-08-24 10:31:44,269 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 362.8MB. Free memory was 339.7MB in the beginning and 339.6MB in the end (delta: 83.7kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 10:31:44,269 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.65ms. Allocated memory is still 362.8MB. Free memory was 339.1MB in the beginning and 327.3MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-08-24 10:31:44,269 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.25ms. Allocated memory is still 362.8MB. Free memory was 327.3MB in the beginning and 325.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 10:31:44,270 INFO L158 Benchmark]: Boogie Preprocessor took 37.12ms. Allocated memory is still 362.8MB. Free memory was 325.2MB in the beginning and 323.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 10:31:44,270 INFO L158 Benchmark]: RCFGBuilder took 673.84ms. Allocated memory is still 362.8MB. Free memory was 323.6MB in the beginning and 294.3MB in the end (delta: 29.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-24 10:31:44,270 INFO L158 Benchmark]: TraceAbstraction took 817671.98ms. Allocated memory was 362.8MB in the beginning and 1.3GB in the end (delta: 918.6MB). Free memory was 293.5MB in the beginning and 1.0GB in the end (delta: -752.7MB). Peak memory consumption was 762.5MB. Max. memory is 16.0GB. [2023-08-24 10:31:44,271 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 362.8MB. Free memory was 339.7MB in the beginning and 339.6MB in the end (delta: 83.7kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 198.65ms. Allocated memory is still 362.8MB. Free memory was 339.1MB in the beginning and 327.3MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 38.25ms. Allocated memory is still 362.8MB. Free memory was 327.3MB in the beginning and 325.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 37.12ms. Allocated memory is still 362.8MB. Free memory was 325.2MB in the beginning and 323.6MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 673.84ms. Allocated memory is still 362.8MB. Free memory was 323.6MB in the beginning and 294.3MB in the end (delta: 29.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * TraceAbstraction took 817671.98ms. Allocated memory was 362.8MB in the beginning and 1.3GB in the end (delta: 918.6MB). Free memory was 293.5MB in the beginning and 1.0GB in the end (delta: -752.7MB). Peak memory consumption was 762.5MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.4s, 156 PlacesBefore, 22 PlacesAfterwards, 162 TransitionsBefore, 19 TransitionsAfterwards, 500 CoEnabledTransitionPairs, 8 FixpointIterations, 117 TrivialSequentialCompositions, 17 ConcurrentSequentialCompositions, 21 TrivialYvCompositions, 4 ConcurrentYvCompositions, 9 ChoiceCompositions, 168 TotalNumberOfCompositions, 854 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 727, independent: 681, independent conditional: 0, independent unconditional: 681, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 274, independent: 263, independent conditional: 0, independent unconditional: 263, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 727, independent: 418, independent conditional: 0, independent unconditional: 418, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 274, unknown conditional: 0, unknown unconditional: 274] , Statistics on independence cache: Total cache size (in pairs): 26, Positive cache size: 23, Positive conditional cache size: 0, Positive unconditional cache size: 23, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 102]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 22 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 14ms.. - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 22 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 14ms.. - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 22 with TraceHistMax 2,while TraceCheckSpWp was constructing backward predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 3 for 14ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 180 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 817.5s, OverallIterations: 20, TraceHistogramMax: 2, PathProgramHistogramMax: 13, EmptinessCheckTime: 0.0s, AutomataDifference: 436.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.5s, HoareTripleCheckerStatistics: 132 mSolverCounterUnknown, 2073 SdHoareTripleChecker+Valid, 39.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2073 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 38.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1461 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 629 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11508 IncrementalHoareTripleChecker+Invalid, 13730 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 629 mSolverCounterUnsat, 0 mSDtfsCounter, 11508 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 809 GetRequests, 201 SyntacticMatches, 15 SemanticMatches, 593 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 8410 ImplicationChecksByTransitivity, 401.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23983occurred in iteration=18, InterpolantAutomatonStates: 416, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 303.8s InterpolantComputationTime, 536 NumberOfCodeBlocks, 536 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 692 ConstructedInterpolants, 60 QuantifiedInterpolants, 21822 SizeOfPredicates, 242 NumberOfNonLiveVariables, 2455 ConjunctsInSsa, 491 ConjunctsInUnsatCore, 39 InterpolantComputations, 9 PerfectInterpolantSequences, 52/164 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown