/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/pthread-ext_26_stack_cas_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 04:23:05,913 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 04:23:05,987 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 04:23:05,995 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 04:23:05,995 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 04:23:05,996 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 04:23:05,996 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 04:23:06,026 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 04:23:06,026 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 04:23:06,030 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 04:23:06,030 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 04:23:06,030 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 04:23:06,031 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 04:23:06,032 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 04:23:06,032 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 04:23:06,033 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 04:23:06,033 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 04:23:06,033 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 04:23:06,033 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 04:23:06,033 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 04:23:06,034 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 04:23:06,034 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 04:23:06,034 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 04:23:06,034 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 04:23:06,035 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 04:23:06,036 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 04:23:06,036 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 04:23:06,036 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 04:23:06,037 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 04:23:06,037 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 04:23:06,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 04:23:06,038 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 04:23:06,038 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 04:23:06,038 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 04:23:06,038 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 04:23:06,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 04:23:06,039 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 04:23:06,039 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 04:23:06,039 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 04:23:06,039 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 04:23:06,039 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 04:23:06,039 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> PROGRAM_FIRST [2023-08-04 04:23:06,264 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 04:23:06,283 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 04:23:06,285 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 04:23:06,286 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 04:23:06,288 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 04:23:06,289 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/pthread-ext_26_stack_cas_bound2.i [2023-08-04 04:23:07,377 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 04:23:07,640 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 04:23:07,641 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/pthread-ext_26_stack_cas_bound2.i [2023-08-04 04:23:07,651 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9745b069/be45052d584949e1a28015b7df4befcb/FLAG6298dd563 [2023-08-04 04:23:07,662 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9745b069/be45052d584949e1a28015b7df4befcb [2023-08-04 04:23:07,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 04:23:07,665 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 04:23:07,668 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 04:23:07,668 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 04:23:07,670 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 04:23:07,671 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 04:23:07" (1/1) ... [2023-08-04 04:23:07,672 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20132bb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:23:07, skipping insertion in model container [2023-08-04 04:23:07,672 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 04:23:07" (1/1) ... [2023-08-04 04:23:07,721 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 04:23:08,012 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/pthread-ext_26_stack_cas_bound2.i[31152,31165] [2023-08-04 04:23:08,019 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 04:23:08,032 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 04:23:08,061 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [254] [2023-08-04 04:23:08,063 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [254] [2023-08-04 04:23:08,092 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/added_bound_to_unbounded/pthread-ext_26_stack_cas_bound2.i[31152,31165] [2023-08-04 04:23:08,100 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 04:23:08,133 INFO L206 MainTranslator]: Completed translation [2023-08-04 04:23:08,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:23:08 WrapperNode [2023-08-04 04:23:08,133 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 04:23:08,134 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 04:23:08,135 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 04:23:08,135 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 04:23:08,140 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:23:08" (1/1) ... [2023-08-04 04:23:08,168 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:23:08" (1/1) ... [2023-08-04 04:23:08,199 INFO L138 Inliner]: procedures = 177, calls = 47, calls flagged for inlining = 16, calls inlined = 19, statements flattened = 192 [2023-08-04 04:23:08,200 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 04:23:08,200 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 04:23:08,200 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 04:23:08,200 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 04:23:08,208 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:23:08" (1/1) ... [2023-08-04 04:23:08,208 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:23:08" (1/1) ... [2023-08-04 04:23:08,225 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:23:08" (1/1) ... [2023-08-04 04:23:08,226 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:23:08" (1/1) ... [2023-08-04 04:23:08,231 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:23:08" (1/1) ... [2023-08-04 04:23:08,260 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:23:08" (1/1) ... [2023-08-04 04:23:08,263 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:23:08" (1/1) ... [2023-08-04 04:23:08,264 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:23:08" (1/1) ... [2023-08-04 04:23:08,267 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 04:23:08,268 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 04:23:08,268 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 04:23:08,268 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 04:23:08,269 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:23:08" (1/1) ... [2023-08-04 04:23:08,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 04:23:08,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:23:08,293 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-04 04:23:08,319 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-04 04:23:08,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-04 04:23:08,333 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-08-04 04:23:08,333 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-08-04 04:23:08,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 04:23:08,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 04:23:08,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 04:23:08,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 04:23:08,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 04:23:08,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 04:23:08,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 04:23:08,336 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-04 04:23:08,464 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 04:23:08,465 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 04:23:08,689 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 04:23:08,842 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 04:23:08,842 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-04 04:23:08,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 04:23:08 BoogieIcfgContainer [2023-08-04 04:23:08,845 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 04:23:08,846 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 04:23:08,847 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 04:23:08,849 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 04:23:08,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 04:23:07" (1/3) ... [2023-08-04 04:23:08,850 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14121f40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 04:23:08, skipping insertion in model container [2023-08-04 04:23:08,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 04:23:08" (2/3) ... [2023-08-04 04:23:08,850 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14121f40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 04:23:08, skipping insertion in model container [2023-08-04 04:23:08,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 04:23:08" (3/3) ... [2023-08-04 04:23:08,852 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-ext_26_stack_cas_bound2.i [2023-08-04 04:23:08,859 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 04:23:08,867 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 04:23:08,867 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-04 04:23:08,868 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 04:23:08,949 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 04:23:08,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 118 transitions, 241 flow [2023-08-04 04:23:09,047 INFO L124 PetriNetUnfolderBase]: 11/128 cut-off events. [2023-08-04 04:23:09,048 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 04:23:09,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 128 events. 11/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 126 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 93. Up to 4 conditions per place. [2023-08-04 04:23:09,054 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 118 transitions, 241 flow [2023-08-04 04:23:09,057 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 118 transitions, 241 flow [2023-08-04 04:23:09,065 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 04:23:09,076 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 118 transitions, 241 flow [2023-08-04 04:23:09,081 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 118 transitions, 241 flow [2023-08-04 04:23:09,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 118 transitions, 241 flow [2023-08-04 04:23:09,113 INFO L124 PetriNetUnfolderBase]: 11/128 cut-off events. [2023-08-04 04:23:09,114 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 04:23:09,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 128 events. 11/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 126 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 93. Up to 4 conditions per place. [2023-08-04 04:23:09,117 INFO L119 LiptonReduction]: Number of co-enabled transitions 2496 [2023-08-04 04:23:13,043 INFO L134 LiptonReduction]: Checked pairs total: 2969 [2023-08-04 04:23:13,044 INFO L136 LiptonReduction]: Total number of compositions: 108 [2023-08-04 04:23:13,055 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 04:23:13,061 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=true, 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;@35ed62b7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 04:23:13,061 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 04:23:13,068 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 04:23:13,068 INFO L124 PetriNetUnfolderBase]: 5/25 cut-off events. [2023-08-04 04:23:13,069 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 04:23:13,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:23:13,069 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:23:13,070 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 04:23:13,074 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:23:13,074 INFO L85 PathProgramCache]: Analyzing trace with hash -938850934, now seen corresponding path program 1 times [2023-08-04 04:23:13,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:23:13,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276976613] [2023-08-04 04:23:13,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:23:13,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:23:13,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:23:13,310 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-04 04:23:13,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:23:13,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276976613] [2023-08-04 04:23:13,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276976613] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:23:13,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 04:23:13,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 04:23:13,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911964204] [2023-08-04 04:23:13,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:23:13,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 04:23:13,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:23:13,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 04:23:13,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 04:23:13,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 226 [2023-08-04 04:23:13,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 28 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:13,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:23:13,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 226 [2023-08-04 04:23:13,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:23:13,460 INFO L124 PetriNetUnfolderBase]: 61/130 cut-off events. [2023-08-04 04:23:13,461 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 04:23:13,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 130 events. 61/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 321 event pairs, 3 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 248. Up to 115 conditions per place. [2023-08-04 04:23:13,463 INFO L140 encePairwiseOnDemand]: 221/226 looper letters, 24 selfloop transitions, 2 changer transitions 1/28 dead transitions. [2023-08-04 04:23:13,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 28 transitions, 115 flow [2023-08-04 04:23:13,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 04:23:13,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 04:23:13,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2023-08-04 04:23:13,482 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49557522123893805 [2023-08-04 04:23:13,483 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 336 transitions. [2023-08-04 04:23:13,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 336 transitions. [2023-08-04 04:23:13,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:23:13,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 336 transitions. [2023-08-04 04:23:13,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:13,497 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:13,497 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:13,499 INFO L175 Difference]: Start difference. First operand has 24 places, 28 transitions, 61 flow. Second operand 3 states and 336 transitions. [2023-08-04 04:23:13,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 28 transitions, 115 flow [2023-08-04 04:23:13,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 28 transitions, 115 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 04:23:13,503 INFO L231 Difference]: Finished difference. Result has 26 places, 24 transitions, 57 flow [2023-08-04 04:23:13,504 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=55, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=57, PETRI_PLACES=26, PETRI_TRANSITIONS=24} [2023-08-04 04:23:13,508 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 2 predicate places. [2023-08-04 04:23:13,508 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 24 transitions, 57 flow [2023-08-04 04:23:13,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:13,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:23:13,509 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:23:13,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 04:23:13,509 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 04:23:13,510 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:23:13,510 INFO L85 PathProgramCache]: Analyzing trace with hash -491700112, now seen corresponding path program 1 times [2023-08-04 04:23:13,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:23:13,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342649229] [2023-08-04 04:23:13,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:23:13,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:23:13,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:23:13,667 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-04 04:23:13,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:23:13,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342649229] [2023-08-04 04:23:13,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342649229] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:23:13,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 04:23:13,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 04:23:13,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592505030] [2023-08-04 04:23:13,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:23:13,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 04:23:13,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:23:13,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 04:23:13,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 04:23:13,681 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 226 [2023-08-04 04:23:13,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 24 transitions, 57 flow. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:13,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:23:13,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 226 [2023-08-04 04:23:13,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:23:13,751 INFO L124 PetriNetUnfolderBase]: 73/158 cut-off events. [2023-08-04 04:23:13,752 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-04 04:23:13,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 327 conditions, 158 events. 73/158 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 425 event pairs, 21 based on Foata normal form. 4/121 useless extension candidates. Maximal degree in co-relation 308. Up to 101 conditions per place. [2023-08-04 04:23:13,758 INFO L140 encePairwiseOnDemand]: 223/226 looper letters, 28 selfloop transitions, 2 changer transitions 1/32 dead transitions. [2023-08-04 04:23:13,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 32 transitions, 135 flow [2023-08-04 04:23:13,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 04:23:13,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 04:23:13,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 335 transitions. [2023-08-04 04:23:13,761 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4941002949852507 [2023-08-04 04:23:13,761 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 335 transitions. [2023-08-04 04:23:13,761 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 335 transitions. [2023-08-04 04:23:13,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:23:13,762 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 335 transitions. [2023-08-04 04:23:13,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:13,766 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:13,767 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:13,767 INFO L175 Difference]: Start difference. First operand has 26 places, 24 transitions, 57 flow. Second operand 3 states and 335 transitions. [2023-08-04 04:23:13,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 32 transitions, 135 flow [2023-08-04 04:23:13,768 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 32 transitions, 131 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 04:23:13,769 INFO L231 Difference]: Finished difference. Result has 26 places, 25 transitions, 65 flow [2023-08-04 04:23:13,769 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=53, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=26, PETRI_TRANSITIONS=25} [2023-08-04 04:23:13,770 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 2 predicate places. [2023-08-04 04:23:13,771 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 25 transitions, 65 flow [2023-08-04 04:23:13,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:13,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:23:13,780 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:23:13,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-04 04:23:13,780 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 04:23:13,783 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:23:13,783 INFO L85 PathProgramCache]: Analyzing trace with hash -488589355, now seen corresponding path program 1 times [2023-08-04 04:23:13,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:23:13,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442591267] [2023-08-04 04:23:13,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:23:13,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:23:13,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:23:13,930 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-04 04:23:13,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:23:13,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442591267] [2023-08-04 04:23:13,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442591267] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:23:13,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 04:23:13,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-04 04:23:13,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638708361] [2023-08-04 04:23:13,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:23:13,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 04:23:13,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:23:13,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 04:23:13,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-04 04:23:13,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 226 [2023-08-04 04:23:13,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 25 transitions, 65 flow. Second operand has 5 states, 5 states have (on average 96.4) internal successors, (482), 5 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:13,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:23:13,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 226 [2023-08-04 04:23:13,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:23:14,089 INFO L124 PetriNetUnfolderBase]: 104/225 cut-off events. [2023-08-04 04:23:14,089 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 04:23:14,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 474 conditions, 225 events. 104/225 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 569 event pairs, 18 based on Foata normal form. 0/167 useless extension candidates. Maximal degree in co-relation 454. Up to 101 conditions per place. [2023-08-04 04:23:14,091 INFO L140 encePairwiseOnDemand]: 220/226 looper letters, 44 selfloop transitions, 5 changer transitions 1/51 dead transitions. [2023-08-04 04:23:14,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 51 transitions, 217 flow [2023-08-04 04:23:14,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-04 04:23:14,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-04 04:23:14,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 615 transitions. [2023-08-04 04:23:14,093 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45353982300884954 [2023-08-04 04:23:14,093 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 615 transitions. [2023-08-04 04:23:14,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 615 transitions. [2023-08-04 04:23:14,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:23:14,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 615 transitions. [2023-08-04 04:23:14,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 102.5) internal successors, (615), 6 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:14,097 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 226.0) internal successors, (1582), 7 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:14,098 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 226.0) internal successors, (1582), 7 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:14,098 INFO L175 Difference]: Start difference. First operand has 26 places, 25 transitions, 65 flow. Second operand 6 states and 615 transitions. [2023-08-04 04:23:14,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 51 transitions, 217 flow [2023-08-04 04:23:14,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 51 transitions, 215 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 04:23:14,100 INFO L231 Difference]: Finished difference. Result has 33 places, 28 transitions, 93 flow [2023-08-04 04:23:14,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=93, PETRI_PLACES=33, PETRI_TRANSITIONS=28} [2023-08-04 04:23:14,101 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 9 predicate places. [2023-08-04 04:23:14,101 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 28 transitions, 93 flow [2023-08-04 04:23:14,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.4) internal successors, (482), 5 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:14,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:23:14,101 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:23:14,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-04 04:23:14,102 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 04:23:14,102 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:23:14,102 INFO L85 PathProgramCache]: Analyzing trace with hash 2032773347, now seen corresponding path program 1 times [2023-08-04 04:23:14,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:23:14,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777803565] [2023-08-04 04:23:14,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:23:14,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:23:14,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:23:14,482 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-04 04:23:14,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:23:14,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777803565] [2023-08-04 04:23:14,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777803565] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:23:14,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 04:23:14,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-04 04:23:14,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299073507] [2023-08-04 04:23:14,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:23:14,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-04 04:23:14,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:23:14,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-04 04:23:14,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-08-04 04:23:14,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 226 [2023-08-04 04:23:14,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 28 transitions, 93 flow. Second operand has 10 states, 10 states have (on average 80.6) internal successors, (806), 10 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:14,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:23:14,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 226 [2023-08-04 04:23:14,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:23:15,259 INFO L124 PetriNetUnfolderBase]: 121/268 cut-off events. [2023-08-04 04:23:15,260 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-04 04:23:15,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 622 conditions, 268 events. 121/268 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 760 event pairs, 9 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 592. Up to 116 conditions per place. [2023-08-04 04:23:15,263 INFO L140 encePairwiseOnDemand]: 215/226 looper letters, 57 selfloop transitions, 17 changer transitions 1/76 dead transitions. [2023-08-04 04:23:15,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 76 transitions, 350 flow [2023-08-04 04:23:15,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-04 04:23:15,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-04 04:23:15,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 944 transitions. [2023-08-04 04:23:15,267 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3797264682220434 [2023-08-04 04:23:15,267 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 944 transitions. [2023-08-04 04:23:15,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 944 transitions. [2023-08-04 04:23:15,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:23:15,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 944 transitions. [2023-08-04 04:23:15,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 85.81818181818181) internal successors, (944), 11 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:15,274 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 226.0) internal successors, (2712), 12 states have internal predecessors, (2712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:15,275 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 226.0) internal successors, (2712), 12 states have internal predecessors, (2712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:15,275 INFO L175 Difference]: Start difference. First operand has 33 places, 28 transitions, 93 flow. Second operand 11 states and 944 transitions. [2023-08-04 04:23:15,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 76 transitions, 350 flow [2023-08-04 04:23:15,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 76 transitions, 345 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 04:23:15,278 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 194 flow [2023-08-04 04:23:15,279 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=194, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2023-08-04 04:23:15,280 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 22 predicate places. [2023-08-04 04:23:15,281 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 194 flow [2023-08-04 04:23:15,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 80.6) internal successors, (806), 10 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:15,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:23:15,281 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:23:15,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-04 04:23:15,282 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 04:23:15,282 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:23:15,282 INFO L85 PathProgramCache]: Analyzing trace with hash -23212586, now seen corresponding path program 1 times [2023-08-04 04:23:15,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:23:15,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989415138] [2023-08-04 04:23:15,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:23:15,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:23:15,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:23:15,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 04:23:15,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:23:15,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989415138] [2023-08-04 04:23:15,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989415138] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:23:15,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093801135] [2023-08-04 04:23:15,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:23:15,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:23:15,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:23:15,871 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-04 04:23:15,881 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-04 04:23:16,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:23:16,054 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 55 conjunts are in the unsatisfiable core [2023-08-04 04:23:16,060 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:23:16,110 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 04:23:16,111 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-04 04:23:16,361 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-04 04:23:16,361 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 1 case distinctions, treesize of input 27 treesize of output 15 [2023-08-04 04:23:16,419 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:23:16,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 04:23:16,446 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:23:16,626 INFO L322 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2023-08-04 04:23:16,627 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 2 case distinctions, treesize of input 35 treesize of output 38 [2023-08-04 04:23:16,637 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 04:23:16,637 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 50 [2023-08-04 04:23:16,646 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-08-04 04:23:16,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 04:23:16,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093801135] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:23:16,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:23:16,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 22 [2023-08-04 04:23:16,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383832137] [2023-08-04 04:23:16,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:23:16,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-04 04:23:16,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:23:16,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-04 04:23:16,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=470, Unknown=9, NotChecked=0, Total=552 [2023-08-04 04:23:17,866 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 226 [2023-08-04 04:23:17,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 194 flow. Second operand has 24 states, 24 states have (on average 75.16666666666667) internal successors, (1804), 24 states have internal predecessors, (1804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:17,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:23:17,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 226 [2023-08-04 04:23:17,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:23:19,902 INFO L124 PetriNetUnfolderBase]: 359/783 cut-off events. [2023-08-04 04:23:19,902 INFO L125 PetriNetUnfolderBase]: For 863/863 co-relation queries the response was YES. [2023-08-04 04:23:19,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2438 conditions, 783 events. 359/783 cut-off events. For 863/863 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2981 event pairs, 10 based on Foata normal form. 19/755 useless extension candidates. Maximal degree in co-relation 2387. Up to 162 conditions per place. [2023-08-04 04:23:19,908 INFO L140 encePairwiseOnDemand]: 211/226 looper letters, 175 selfloop transitions, 111 changer transitions 1/288 dead transitions. [2023-08-04 04:23:19,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 288 transitions, 1821 flow [2023-08-04 04:23:19,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-08-04 04:23:19,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2023-08-04 04:23:19,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 3632 transitions. [2023-08-04 04:23:19,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34936514043863026 [2023-08-04 04:23:19,918 INFO L72 ComplementDD]: Start complementDD. Operand 46 states and 3632 transitions. [2023-08-04 04:23:19,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 3632 transitions. [2023-08-04 04:23:19,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:23:19,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 46 states and 3632 transitions. [2023-08-04 04:23:19,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 47 states, 46 states have (on average 78.95652173913044) internal successors, (3632), 46 states have internal predecessors, (3632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:19,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 47 states, 47 states have (on average 226.0) internal successors, (10622), 47 states have internal predecessors, (10622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:19,940 INFO L81 ComplementDD]: Finished complementDD. Result has 47 states, 47 states have (on average 226.0) internal successors, (10622), 47 states have internal predecessors, (10622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:19,941 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 194 flow. Second operand 46 states and 3632 transitions. [2023-08-04 04:23:19,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 288 transitions, 1821 flow [2023-08-04 04:23:19,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 288 transitions, 1798 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-08-04 04:23:19,949 INFO L231 Difference]: Finished difference. Result has 114 places, 155 transitions, 1098 flow [2023-08-04 04:23:19,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=1098, PETRI_PLACES=114, PETRI_TRANSITIONS=155} [2023-08-04 04:23:19,950 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 90 predicate places. [2023-08-04 04:23:19,950 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 155 transitions, 1098 flow [2023-08-04 04:23:19,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 75.16666666666667) internal successors, (1804), 24 states have internal predecessors, (1804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:19,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:23:19,951 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:23:19,962 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-04 04:23:20,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:23:20,157 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 04:23:20,157 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:23:20,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1349838642, now seen corresponding path program 1 times [2023-08-04 04:23:20,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:23:20,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080140720] [2023-08-04 04:23:20,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:23:20,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:23:20,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:23:20,219 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 04:23:20,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:23:20,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080140720] [2023-08-04 04:23:20,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080140720] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:23:20,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100584424] [2023-08-04 04:23:20,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:23:20,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:23:20,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:23:20,221 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-04 04:23:20,223 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-04 04:23:20,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:23:20,346 INFO L262 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 04:23:20,349 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:23:20,377 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 04:23:20,377 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:23:20,413 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 04:23:20,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100584424] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:23:20,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:23:20,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-04 04:23:20,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070642199] [2023-08-04 04:23:20,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:23:20,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-04 04:23:20,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:23:20,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-04 04:23:20,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-04 04:23:20,427 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 226 [2023-08-04 04:23:20,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 155 transitions, 1098 flow. Second operand has 7 states, 7 states have (on average 107.42857142857143) internal successors, (752), 7 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:20,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:23:20,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 226 [2023-08-04 04:23:20,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:23:20,651 INFO L124 PetriNetUnfolderBase]: 402/865 cut-off events. [2023-08-04 04:23:20,652 INFO L125 PetriNetUnfolderBase]: For 2943/2943 co-relation queries the response was YES. [2023-08-04 04:23:20,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3749 conditions, 865 events. 402/865 cut-off events. For 2943/2943 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2760 event pairs, 39 based on Foata normal form. 19/850 useless extension candidates. Maximal degree in co-relation 3670. Up to 367 conditions per place. [2023-08-04 04:23:20,660 INFO L140 encePairwiseOnDemand]: 222/226 looper letters, 178 selfloop transitions, 19 changer transitions 4/202 dead transitions. [2023-08-04 04:23:20,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 202 transitions, 1780 flow [2023-08-04 04:23:20,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-04 04:23:20,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-04 04:23:20,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 682 transitions. [2023-08-04 04:23:20,663 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5029498525073747 [2023-08-04 04:23:20,663 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 682 transitions. [2023-08-04 04:23:20,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 682 transitions. [2023-08-04 04:23:20,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:23:20,664 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 682 transitions. [2023-08-04 04:23:20,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 113.66666666666667) internal successors, (682), 6 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:20,667 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 226.0) internal successors, (1582), 7 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:20,668 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 226.0) internal successors, (1582), 7 states have internal predecessors, (1582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:20,668 INFO L175 Difference]: Start difference. First operand has 114 places, 155 transitions, 1098 flow. Second operand 6 states and 682 transitions. [2023-08-04 04:23:20,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 202 transitions, 1780 flow [2023-08-04 04:23:20,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 202 transitions, 1636 flow, removed 72 selfloop flow, removed 7 redundant places. [2023-08-04 04:23:20,687 INFO L231 Difference]: Finished difference. Result has 101 places, 128 transitions, 896 flow [2023-08-04 04:23:20,688 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=896, PETRI_PLACES=101, PETRI_TRANSITIONS=128} [2023-08-04 04:23:20,690 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 77 predicate places. [2023-08-04 04:23:20,690 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 128 transitions, 896 flow [2023-08-04 04:23:20,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 107.42857142857143) internal successors, (752), 7 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:20,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:23:20,690 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:23:20,699 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-04 04:23:20,897 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,SelfDestructingSolverStorable5 [2023-08-04 04:23:20,897 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 04:23:20,898 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:23:20,898 INFO L85 PathProgramCache]: Analyzing trace with hash 640227928, now seen corresponding path program 1 times [2023-08-04 04:23:20,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:23:20,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114347964] [2023-08-04 04:23:20,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:23:20,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:23:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:23:21,000 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 04:23:21,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:23:21,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114347964] [2023-08-04 04:23:21,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114347964] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:23:21,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647674] [2023-08-04 04:23:21,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:23:21,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:23:21,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:23:21,005 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-04 04:23:21,030 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-04 04:23:21,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:23:21,134 INFO L262 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 04:23:21,135 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:23:21,145 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 04:23:21,145 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:23:21,156 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 04:23:21,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647674] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:23:21,156 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:23:21,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 04:23:21,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982097881] [2023-08-04 04:23:21,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:23:21,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 04:23:21,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:23:21,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 04:23:21,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 04:23:21,164 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 226 [2023-08-04 04:23:21,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 128 transitions, 896 flow. Second operand has 5 states, 5 states have (on average 103.8) internal successors, (519), 5 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:21,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:23:21,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 226 [2023-08-04 04:23:21,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:23:21,303 INFO L124 PetriNetUnfolderBase]: 276/738 cut-off events. [2023-08-04 04:23:21,304 INFO L125 PetriNetUnfolderBase]: For 2039/2039 co-relation queries the response was YES. [2023-08-04 04:23:21,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2978 conditions, 738 events. 276/738 cut-off events. For 2039/2039 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2887 event pairs, 0 based on Foata normal form. 114/826 useless extension candidates. Maximal degree in co-relation 2841. Up to 502 conditions per place. [2023-08-04 04:23:21,310 INFO L140 encePairwiseOnDemand]: 223/226 looper letters, 145 selfloop transitions, 3 changer transitions 0/149 dead transitions. [2023-08-04 04:23:21,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 149 transitions, 1405 flow [2023-08-04 04:23:21,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 04:23:21,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 04:23:21,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 439 transitions. [2023-08-04 04:23:21,312 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4856194690265487 [2023-08-04 04:23:21,312 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 439 transitions. [2023-08-04 04:23:21,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 439 transitions. [2023-08-04 04:23:21,312 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:23:21,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 439 transitions. [2023-08-04 04:23:21,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:21,315 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 226.0) internal successors, (1130), 5 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:21,315 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 226.0) internal successors, (1130), 5 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:21,315 INFO L175 Difference]: Start difference. First operand has 101 places, 128 transitions, 896 flow. Second operand 4 states and 439 transitions. [2023-08-04 04:23:21,315 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 149 transitions, 1405 flow [2023-08-04 04:23:21,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 149 transitions, 1326 flow, removed 14 selfloop flow, removed 15 redundant places. [2023-08-04 04:23:21,325 INFO L231 Difference]: Finished difference. Result has 86 places, 84 transitions, 587 flow [2023-08-04 04:23:21,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=587, PETRI_PLACES=86, PETRI_TRANSITIONS=84} [2023-08-04 04:23:21,326 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 62 predicate places. [2023-08-04 04:23:21,326 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 84 transitions, 587 flow [2023-08-04 04:23:21,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.8) internal successors, (519), 5 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:21,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:23:21,327 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:23:21,333 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-04 04:23:21,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:23:21,535 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 04:23:21,535 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:23:21,535 INFO L85 PathProgramCache]: Analyzing trace with hash -941622567, now seen corresponding path program 1 times [2023-08-04 04:23:21,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:23:21,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168783676] [2023-08-04 04:23:21,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:23:21,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:23:21,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:23:21,634 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-08-04 04:23:21,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:23:21,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168783676] [2023-08-04 04:23:21,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168783676] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:23:21,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 04:23:21,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 04:23:21,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239062216] [2023-08-04 04:23:21,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:23:21,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 04:23:21,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:23:21,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 04:23:21,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 04:23:21,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 226 [2023-08-04 04:23:21,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 84 transitions, 587 flow. Second operand has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:21,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:23:21,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 226 [2023-08-04 04:23:21,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:23:21,784 INFO L124 PetriNetUnfolderBase]: 340/777 cut-off events. [2023-08-04 04:23:21,784 INFO L125 PetriNetUnfolderBase]: For 2773/2773 co-relation queries the response was YES. [2023-08-04 04:23:21,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3375 conditions, 777 events. 340/777 cut-off events. For 2773/2773 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2477 event pairs, 182 based on Foata normal form. 9/751 useless extension candidates. Maximal degree in co-relation 3309. Up to 563 conditions per place. [2023-08-04 04:23:21,791 INFO L140 encePairwiseOnDemand]: 223/226 looper letters, 106 selfloop transitions, 4 changer transitions 0/111 dead transitions. [2023-08-04 04:23:21,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 111 transitions, 983 flow [2023-08-04 04:23:21,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 04:23:21,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 04:23:21,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2023-08-04 04:23:21,792 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.504424778761062 [2023-08-04 04:23:21,792 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 342 transitions. [2023-08-04 04:23:21,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 342 transitions. [2023-08-04 04:23:21,793 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:23:21,793 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 342 transitions. [2023-08-04 04:23:21,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:21,794 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:21,795 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 226.0) internal successors, (904), 4 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:21,795 INFO L175 Difference]: Start difference. First operand has 86 places, 84 transitions, 587 flow. Second operand 3 states and 342 transitions. [2023-08-04 04:23:21,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 111 transitions, 983 flow [2023-08-04 04:23:21,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 111 transitions, 978 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 04:23:21,803 INFO L231 Difference]: Finished difference. Result has 88 places, 87 transitions, 624 flow [2023-08-04 04:23:21,804 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=624, PETRI_PLACES=88, PETRI_TRANSITIONS=87} [2023-08-04 04:23:21,806 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 64 predicate places. [2023-08-04 04:23:21,806 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 87 transitions, 624 flow [2023-08-04 04:23:21,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:21,806 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:23:21,807 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:23:21,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-04 04:23:21,807 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 04:23:21,807 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:23:21,807 INFO L85 PathProgramCache]: Analyzing trace with hash -824117989, now seen corresponding path program 2 times [2023-08-04 04:23:21,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:23:21,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308460140] [2023-08-04 04:23:21,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:23:21,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:23:21,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:23:21,983 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 36 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:23:21,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:23:21,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308460140] [2023-08-04 04:23:21,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308460140] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:23:21,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1469427283] [2023-08-04 04:23:21,984 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 04:23:21,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:23:21,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:23:21,985 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-04 04:23:21,987 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-04 04:23:22,123 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-04 04:23:22,123 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 04:23:22,125 INFO L262 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 46 conjunts are in the unsatisfiable core [2023-08-04 04:23:22,128 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:23:22,330 INFO L322 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2023-08-04 04:23:22,330 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2023-08-04 04:23:22,362 INFO L322 Elim1Store]: treesize reduction 26, result has 50.9 percent of original size [2023-08-04 04:23:22,362 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 85 [2023-08-04 04:23:22,372 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 0 case distinctions, treesize of input 8 treesize of output 7 [2023-08-04 04:23:22,404 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 8 treesize of output 7 [2023-08-04 04:23:22,416 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 9 [2023-08-04 04:23:22,431 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 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 28 treesize of output 39 [2023-08-04 04:23:22,523 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-08-04 04:23:22,523 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 04:23:22,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1469427283] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:23:22,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 04:23:22,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 11 [2023-08-04 04:23:22,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826763172] [2023-08-04 04:23:22,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:23:22,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-04 04:23:22,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:23:22,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-04 04:23:22,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-08-04 04:23:22,596 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 226 [2023-08-04 04:23:22,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 87 transitions, 624 flow. Second operand has 7 states, 7 states have (on average 92.85714285714286) internal successors, (650), 7 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:22,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:23:22,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 226 [2023-08-04 04:23:22,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:23:22,865 INFO L124 PetriNetUnfolderBase]: 358/937 cut-off events. [2023-08-04 04:23:22,866 INFO L125 PetriNetUnfolderBase]: For 2759/2759 co-relation queries the response was YES. [2023-08-04 04:23:22,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3984 conditions, 937 events. 358/937 cut-off events. For 2759/2759 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3601 event pairs, 18 based on Foata normal form. 3/896 useless extension candidates. Maximal degree in co-relation 3814. Up to 342 conditions per place. [2023-08-04 04:23:22,871 INFO L140 encePairwiseOnDemand]: 216/226 looper letters, 45 selfloop transitions, 51 changer transitions 42/139 dead transitions. [2023-08-04 04:23:22,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 139 transitions, 1297 flow [2023-08-04 04:23:22,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-04 04:23:22,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-04 04:23:22,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 758 transitions. [2023-08-04 04:23:22,874 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4192477876106195 [2023-08-04 04:23:22,874 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 758 transitions. [2023-08-04 04:23:22,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 758 transitions. [2023-08-04 04:23:22,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:23:22,874 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 758 transitions. [2023-08-04 04:23:22,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 94.75) internal successors, (758), 8 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:22,878 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 226.0) internal successors, (2034), 9 states have internal predecessors, (2034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:22,879 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 226.0) internal successors, (2034), 9 states have internal predecessors, (2034), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:22,879 INFO L175 Difference]: Start difference. First operand has 88 places, 87 transitions, 624 flow. Second operand 8 states and 758 transitions. [2023-08-04 04:23:22,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 139 transitions, 1297 flow [2023-08-04 04:23:22,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 139 transitions, 1287 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 04:23:22,887 INFO L231 Difference]: Finished difference. Result has 95 places, 86 transitions, 783 flow [2023-08-04 04:23:22,888 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=783, PETRI_PLACES=95, PETRI_TRANSITIONS=86} [2023-08-04 04:23:22,889 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 71 predicate places. [2023-08-04 04:23:22,889 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 86 transitions, 783 flow [2023-08-04 04:23:22,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.85714285714286) internal successors, (650), 7 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:22,889 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:23:22,889 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:23:22,899 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-04 04:23:23,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:23:23,095 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 04:23:23,096 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:23:23,096 INFO L85 PathProgramCache]: Analyzing trace with hash 110865780, now seen corresponding path program 1 times [2023-08-04 04:23:23,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:23:23,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926079192] [2023-08-04 04:23:23,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:23:23,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:23:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:23:23,259 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 37 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:23:23,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:23:23,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926079192] [2023-08-04 04:23:23,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926079192] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:23:23,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674756647] [2023-08-04 04:23:23,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:23:23,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:23:23,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:23:23,261 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-04 04:23:23,263 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-04 04:23:23,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:23:23,448 INFO L262 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-04 04:23:23,450 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:23:23,489 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 44 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:23:23,489 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:23:23,554 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 44 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 04:23:23,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674756647] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:23:23,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:23:23,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2023-08-04 04:23:23,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965623582] [2023-08-04 04:23:23,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:23:23,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-04 04:23:23,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:23:23,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-04 04:23:23,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-08-04 04:23:23,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 226 [2023-08-04 04:23:23,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 86 transitions, 783 flow. Second operand has 12 states, 12 states have (on average 101.08333333333333) internal successors, (1213), 12 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:23,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:23:23,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 226 [2023-08-04 04:23:23,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:23:23,908 INFO L124 PetriNetUnfolderBase]: 199/619 cut-off events. [2023-08-04 04:23:23,908 INFO L125 PetriNetUnfolderBase]: For 2242/2242 co-relation queries the response was YES. [2023-08-04 04:23:23,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2947 conditions, 619 events. 199/619 cut-off events. For 2242/2242 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2194 event pairs, 27 based on Foata normal form. 6/591 useless extension candidates. Maximal degree in co-relation 2831. Up to 220 conditions per place. [2023-08-04 04:23:23,910 INFO L140 encePairwiseOnDemand]: 220/226 looper letters, 0 selfloop transitions, 0 changer transitions 119/119 dead transitions. [2023-08-04 04:23:23,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 119 transitions, 1234 flow [2023-08-04 04:23:23,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-04 04:23:23,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-04 04:23:23,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1197 transitions. [2023-08-04 04:23:23,914 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4413716814159292 [2023-08-04 04:23:23,914 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1197 transitions. [2023-08-04 04:23:23,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1197 transitions. [2023-08-04 04:23:23,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:23:23,915 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1197 transitions. [2023-08-04 04:23:23,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 99.75) internal successors, (1197), 12 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:23,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 226.0) internal successors, (2938), 13 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-04 04:23:23,921 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 226.0) internal successors, (2938), 13 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-04 04:23:23,921 INFO L175 Difference]: Start difference. First operand has 95 places, 86 transitions, 783 flow. Second operand 12 states and 1197 transitions. [2023-08-04 04:23:23,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 119 transitions, 1234 flow [2023-08-04 04:23:23,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 119 transitions, 1012 flow, removed 62 selfloop flow, removed 13 redundant places. [2023-08-04 04:23:23,930 INFO L231 Difference]: Finished difference. Result has 92 places, 0 transitions, 0 flow [2023-08-04 04:23:23,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=226, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=0, PETRI_PLACES=92, PETRI_TRANSITIONS=0} [2023-08-04 04:23:23,931 INFO L281 CegarLoopForPetriNet]: 24 programPoint places, 68 predicate places. [2023-08-04 04:23:23,931 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 0 transitions, 0 flow [2023-08-04 04:23:23,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 101.08333333333333) internal successors, (1213), 12 states have internal predecessors, (1213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:23,933 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2023-08-04 04:23:23,934 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thr1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2023-08-04 04:23:23,940 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-04 04:23:24,140 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,SelfDestructingSolverStorable9 [2023-08-04 04:23:24,141 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:23:24,143 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE (1/2) [2023-08-04 04:23:24,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 118 transitions, 241 flow [2023-08-04 04:23:24,157 INFO L124 PetriNetUnfolderBase]: 11/128 cut-off events. [2023-08-04 04:23:24,158 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 04:23:24,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 128 events. 11/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 126 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 93. Up to 4 conditions per place. [2023-08-04 04:23:24,158 INFO L82 GeneralOperation]: Start removeDead. Operand has 111 places, 118 transitions, 241 flow [2023-08-04 04:23:24,159 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 118 transitions, 241 flow [2023-08-04 04:23:24,159 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 04:23:24,159 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 118 transitions, 241 flow [2023-08-04 04:23:24,159 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 118 transitions, 241 flow [2023-08-04 04:23:24,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 118 transitions, 241 flow [2023-08-04 04:23:24,166 INFO L124 PetriNetUnfolderBase]: 11/128 cut-off events. [2023-08-04 04:23:24,166 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 04:23:24,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 128 events. 11/128 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 126 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 93. Up to 4 conditions per place. [2023-08-04 04:23:24,168 INFO L119 LiptonReduction]: Number of co-enabled transitions 2496 [2023-08-04 04:23:27,809 INFO L134 LiptonReduction]: Checked pairs total: 3056 [2023-08-04 04:23:27,809 INFO L136 LiptonReduction]: Total number of compositions: 108 [2023-08-04 04:23:27,813 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 04:23:27,814 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=true, 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;@35ed62b7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 04:23:27,814 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 04:23:27,816 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 04:23:27,816 INFO L124 PetriNetUnfolderBase]: 2/13 cut-off events. [2023-08-04 04:23:27,816 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 04:23:27,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:23:27,817 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 04:23:27,817 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 04:23:27,817 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:23:27,818 INFO L85 PathProgramCache]: Analyzing trace with hash -548958516, now seen corresponding path program 1 times [2023-08-04 04:23:27,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:23:27,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348581840] [2023-08-04 04:23:27,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:23:27,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:23:27,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 04:23:27,832 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 04:23:27,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 04:23:27,855 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 04:23:27,855 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 04:23:27,855 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining) [2023-08-04 04:23:27,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-04 04:23:27,856 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-04 04:23:27,856 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2023-08-04 04:23:27,857 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 04:23:27,857 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 04:23:27,914 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 04:23:27,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 183 places, 197 transitions, 406 flow [2023-08-04 04:23:27,938 INFO L124 PetriNetUnfolderBase]: 21/222 cut-off events. [2023-08-04 04:23:27,938 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-04 04:23:27,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 222 events. 21/222 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 404 event pairs, 0 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 171. Up to 6 conditions per place. [2023-08-04 04:23:27,939 INFO L82 GeneralOperation]: Start removeDead. Operand has 183 places, 197 transitions, 406 flow [2023-08-04 04:23:27,941 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 183 places, 197 transitions, 406 flow [2023-08-04 04:23:27,941 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 04:23:27,941 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 183 places, 197 transitions, 406 flow [2023-08-04 04:23:27,941 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 183 places, 197 transitions, 406 flow [2023-08-04 04:23:27,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 183 places, 197 transitions, 406 flow [2023-08-04 04:23:27,962 INFO L124 PetriNetUnfolderBase]: 21/222 cut-off events. [2023-08-04 04:23:27,962 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-04 04:23:27,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 222 events. 21/222 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 404 event pairs, 0 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 171. Up to 6 conditions per place. [2023-08-04 04:23:27,970 INFO L119 LiptonReduction]: Number of co-enabled transitions 17316 [2023-08-04 04:23:32,241 INFO L134 LiptonReduction]: Checked pairs total: 35420 [2023-08-04 04:23:32,242 INFO L136 LiptonReduction]: Total number of compositions: 159 [2023-08-04 04:23:32,243 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 04:23:32,243 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=true, 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;@35ed62b7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 04:23:32,243 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 04:23:32,247 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 04:23:32,247 INFO L124 PetriNetUnfolderBase]: 7/49 cut-off events. [2023-08-04 04:23:32,247 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-04 04:23:32,247 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:23:32,247 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:23:32,247 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 04:23:32,248 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:23:32,248 INFO L85 PathProgramCache]: Analyzing trace with hash -2054394583, now seen corresponding path program 1 times [2023-08-04 04:23:32,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:23:32,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589231696] [2023-08-04 04:23:32,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:23:32,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:23:32,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:23:32,279 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-04 04:23:32,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:23:32,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589231696] [2023-08-04 04:23:32,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589231696] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:23:32,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 04:23:32,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 04:23:32,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178709933] [2023-08-04 04:23:32,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:23:32,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 04:23:32,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:23:32,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 04:23:32,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-04 04:23:32,294 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 356 [2023-08-04 04:23:32,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 66 transitions, 144 flow. Second operand has 4 states, 4 states have (on average 164.25) internal successors, (657), 4 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:32,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:23:32,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 356 [2023-08-04 04:23:32,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:23:32,716 INFO L124 PetriNetUnfolderBase]: 2758/4630 cut-off events. [2023-08-04 04:23:32,716 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-08-04 04:23:32,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8741 conditions, 4630 events. 2758/4630 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 26474 event pairs, 743 based on Foata normal form. 0/3522 useless extension candidates. Maximal degree in co-relation 7963. Up to 3042 conditions per place. [2023-08-04 04:23:32,737 INFO L140 encePairwiseOnDemand]: 342/356 looper letters, 93 selfloop transitions, 8 changer transitions 0/116 dead transitions. [2023-08-04 04:23:32,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 116 transitions, 456 flow [2023-08-04 04:23:32,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 04:23:32,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 04:23:32,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 920 transitions. [2023-08-04 04:23:32,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5168539325842697 [2023-08-04 04:23:32,740 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 920 transitions. [2023-08-04 04:23:32,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 920 transitions. [2023-08-04 04:23:32,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:23:32,740 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 920 transitions. [2023-08-04 04:23:32,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 184.0) internal successors, (920), 5 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:32,744 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 356.0) internal successors, (2136), 6 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:32,745 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 356.0) internal successors, (2136), 6 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:32,745 INFO L175 Difference]: Start difference. First operand has 57 places, 66 transitions, 144 flow. Second operand 5 states and 920 transitions. [2023-08-04 04:23:32,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 116 transitions, 456 flow [2023-08-04 04:23:32,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 116 transitions, 454 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-04 04:23:32,748 INFO L231 Difference]: Finished difference. Result has 65 places, 69 transitions, 204 flow [2023-08-04 04:23:32,748 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=204, PETRI_PLACES=65, PETRI_TRANSITIONS=69} [2023-08-04 04:23:32,749 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 8 predicate places. [2023-08-04 04:23:32,749 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 69 transitions, 204 flow [2023-08-04 04:23:32,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 164.25) internal successors, (657), 4 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:32,749 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:23:32,749 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:23:32,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-04 04:23:32,750 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 04:23:32,750 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:23:32,750 INFO L85 PathProgramCache]: Analyzing trace with hash -301997448, now seen corresponding path program 1 times [2023-08-04 04:23:32,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:23:32,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942794317] [2023-08-04 04:23:32,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:23:32,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:23:32,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:23:32,784 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-04 04:23:32,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:23:32,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942794317] [2023-08-04 04:23:32,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942794317] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:23:32,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 04:23:32,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 04:23:32,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910985607] [2023-08-04 04:23:32,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:23:32,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 04:23:32,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:23:32,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 04:23:32,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 04:23:32,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 356 [2023-08-04 04:23:32,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 69 transitions, 204 flow. Second operand has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:32,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:23:32,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 356 [2023-08-04 04:23:32,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:23:33,345 INFO L124 PetriNetUnfolderBase]: 3515/5831 cut-off events. [2023-08-04 04:23:33,345 INFO L125 PetriNetUnfolderBase]: For 1526/1548 co-relation queries the response was YES. [2023-08-04 04:23:33,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12377 conditions, 5831 events. 3515/5831 cut-off events. For 1526/1548 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 34887 event pairs, 781 based on Foata normal form. 110/4904 useless extension candidates. Maximal degree in co-relation 7401. Up to 4339 conditions per place. [2023-08-04 04:23:33,386 INFO L140 encePairwiseOnDemand]: 351/356 looper letters, 72 selfloop transitions, 3 changer transitions 0/93 dead transitions. [2023-08-04 04:23:33,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 93 transitions, 435 flow [2023-08-04 04:23:33,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 04:23:33,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 04:23:33,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 567 transitions. [2023-08-04 04:23:33,388 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5308988764044944 [2023-08-04 04:23:33,388 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 567 transitions. [2023-08-04 04:23:33,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 567 transitions. [2023-08-04 04:23:33,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:23:33,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 567 transitions. [2023-08-04 04:23:33,389 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:33,391 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 356.0) internal successors, (1424), 4 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:33,391 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 356.0) internal successors, (1424), 4 states have internal predecessors, (1424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:33,391 INFO L175 Difference]: Start difference. First operand has 65 places, 69 transitions, 204 flow. Second operand 3 states and 567 transitions. [2023-08-04 04:23:33,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 93 transitions, 435 flow [2023-08-04 04:23:33,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 93 transitions, 435 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 04:23:33,394 INFO L231 Difference]: Finished difference. Result has 68 places, 71 transitions, 225 flow [2023-08-04 04:23:33,394 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=225, PETRI_PLACES=68, PETRI_TRANSITIONS=71} [2023-08-04 04:23:33,394 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 11 predicate places. [2023-08-04 04:23:33,394 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 71 transitions, 225 flow [2023-08-04 04:23:33,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:33,395 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:23:33,395 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-04 04:23:33,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-04 04:23:33,395 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 04:23:33,395 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:23:33,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1685742521, now seen corresponding path program 1 times [2023-08-04 04:23:33,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:23:33,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007407477] [2023-08-04 04:23:33,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:23:33,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:23:33,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:23:33,454 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-04 04:23:33,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:23:33,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007407477] [2023-08-04 04:23:33,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007407477] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:23:33,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 04:23:33,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-04 04:23:33,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103195040] [2023-08-04 04:23:33,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:23:33,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 04:23:33,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:23:33,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 04:23:33,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-04 04:23:33,484 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 356 [2023-08-04 04:23:33,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 71 transitions, 225 flow. Second operand has 5 states, 5 states have (on average 160.8) internal successors, (804), 5 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:33,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:23:33,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 356 [2023-08-04 04:23:33,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:23:34,334 INFO L124 PetriNetUnfolderBase]: 5363/8687 cut-off events. [2023-08-04 04:23:34,334 INFO L125 PetriNetUnfolderBase]: For 2174/2208 co-relation queries the response was YES. [2023-08-04 04:23:34,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18940 conditions, 8687 events. 5363/8687 cut-off events. For 2174/2208 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 52820 event pairs, 1277 based on Foata normal form. 22/7080 useless extension candidates. Maximal degree in co-relation 13490. Up to 4600 conditions per place. [2023-08-04 04:23:34,378 INFO L140 encePairwiseOnDemand]: 348/356 looper letters, 144 selfloop transitions, 8 changer transitions 0/169 dead transitions. [2023-08-04 04:23:34,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 169 transitions, 810 flow [2023-08-04 04:23:34,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-04 04:23:34,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-04 04:23:34,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1096 transitions. [2023-08-04 04:23:34,380 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5131086142322098 [2023-08-04 04:23:34,380 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1096 transitions. [2023-08-04 04:23:34,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1096 transitions. [2023-08-04 04:23:34,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:23:34,381 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1096 transitions. [2023-08-04 04:23:34,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 182.66666666666666) internal successors, (1096), 6 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:34,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 356.0) internal successors, (2492), 7 states have internal predecessors, (2492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:34,386 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 356.0) internal successors, (2492), 7 states have internal predecessors, (2492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:34,386 INFO L175 Difference]: Start difference. First operand has 68 places, 71 transitions, 225 flow. Second operand 6 states and 1096 transitions. [2023-08-04 04:23:34,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 169 transitions, 810 flow [2023-08-04 04:23:34,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 169 transitions, 806 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 04:23:34,389 INFO L231 Difference]: Finished difference. Result has 75 places, 76 transitions, 270 flow [2023-08-04 04:23:34,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=270, PETRI_PLACES=75, PETRI_TRANSITIONS=76} [2023-08-04 04:23:34,390 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 18 predicate places. [2023-08-04 04:23:34,390 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 76 transitions, 270 flow [2023-08-04 04:23:34,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 160.8) internal successors, (804), 5 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:34,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:23:34,402 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:23:34,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-04 04:23:34,402 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 04:23:34,403 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:23:34,403 INFO L85 PathProgramCache]: Analyzing trace with hash -374543834, now seen corresponding path program 1 times [2023-08-04 04:23:34,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:23:34,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120809799] [2023-08-04 04:23:34,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:23:34,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:23:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:23:34,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 04:23:34,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:23:34,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120809799] [2023-08-04 04:23:34,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120809799] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:23:34,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 04:23:34,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-04 04:23:34,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276468706] [2023-08-04 04:23:34,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:23:34,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 04:23:34,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:23:34,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 04:23:34,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-04 04:23:34,508 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 356 [2023-08-04 04:23:34,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 76 transitions, 270 flow. Second operand has 5 states, 5 states have (on average 161.2) internal successors, (806), 5 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:34,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:23:34,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 356 [2023-08-04 04:23:34,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:23:35,499 INFO L124 PetriNetUnfolderBase]: 8093/12957 cut-off events. [2023-08-04 04:23:35,499 INFO L125 PetriNetUnfolderBase]: For 3736/3766 co-relation queries the response was YES. [2023-08-04 04:23:35,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29482 conditions, 12957 events. 8093/12957 cut-off events. For 3736/3766 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 81396 event pairs, 1917 based on Foata normal form. 22/10538 useless extension candidates. Maximal degree in co-relation 21584. Up to 7261 conditions per place. [2023-08-04 04:23:35,559 INFO L140 encePairwiseOnDemand]: 348/356 looper letters, 156 selfloop transitions, 9 changer transitions 0/183 dead transitions. [2023-08-04 04:23:35,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 183 transitions, 964 flow [2023-08-04 04:23:35,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-04 04:23:35,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-04 04:23:35,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1093 transitions. [2023-08-04 04:23:35,561 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5117041198501873 [2023-08-04 04:23:35,561 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1093 transitions. [2023-08-04 04:23:35,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1093 transitions. [2023-08-04 04:23:35,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:23:35,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1093 transitions. [2023-08-04 04:23:35,563 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 182.16666666666666) internal successors, (1093), 6 states have internal predecessors, (1093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:35,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 356.0) internal successors, (2492), 7 states have internal predecessors, (2492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:35,565 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 356.0) internal successors, (2492), 7 states have internal predecessors, (2492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:35,565 INFO L175 Difference]: Start difference. First operand has 75 places, 76 transitions, 270 flow. Second operand 6 states and 1093 transitions. [2023-08-04 04:23:35,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 183 transitions, 964 flow [2023-08-04 04:23:35,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 183 transitions, 954 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 04:23:35,574 INFO L231 Difference]: Finished difference. Result has 81 places, 81 transitions, 316 flow [2023-08-04 04:23:35,574 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=316, PETRI_PLACES=81, PETRI_TRANSITIONS=81} [2023-08-04 04:23:35,574 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 24 predicate places. [2023-08-04 04:23:35,574 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 81 transitions, 316 flow [2023-08-04 04:23:35,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 161.2) internal successors, (806), 5 states have internal predecessors, (806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:35,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:23:35,575 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:23:35,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-04 04:23:35,575 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 04:23:35,575 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:23:35,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1284036845, now seen corresponding path program 1 times [2023-08-04 04:23:35,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:23:35,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004698995] [2023-08-04 04:23:35,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:23:35,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:23:35,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:23:35,888 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-04 04:23:35,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:23:35,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004698995] [2023-08-04 04:23:35,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004698995] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:23:35,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 04:23:35,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-04 04:23:35,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135481660] [2023-08-04 04:23:35,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:23:35,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-04 04:23:35,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:23:35,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-04 04:23:35,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-08-04 04:23:36,224 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 356 [2023-08-04 04:23:36,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 81 transitions, 316 flow. Second operand has 10 states, 10 states have (on average 143.8) internal successors, (1438), 10 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:36,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:23:36,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 356 [2023-08-04 04:23:36,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:23:38,752 INFO L124 PetriNetUnfolderBase]: 15364/24562 cut-off events. [2023-08-04 04:23:38,752 INFO L125 PetriNetUnfolderBase]: For 6462/6488 co-relation queries the response was YES. [2023-08-04 04:23:38,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56784 conditions, 24562 events. 15364/24562 cut-off events. For 6462/6488 co-relation queries the response was YES. Maximal size of possible extension queue 705. Compared 171752 event pairs, 1952 based on Foata normal form. 26/20277 useless extension candidates. Maximal degree in co-relation 47014. Up to 10090 conditions per place. [2023-08-04 04:23:38,875 INFO L140 encePairwiseOnDemand]: 334/356 looper letters, 342 selfloop transitions, 71 changer transitions 0/430 dead transitions. [2023-08-04 04:23:38,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 430 transitions, 2249 flow [2023-08-04 04:23:38,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-04 04:23:38,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-04 04:23:38,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2508 transitions. [2023-08-04 04:23:38,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4696629213483146 [2023-08-04 04:23:38,880 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2508 transitions. [2023-08-04 04:23:38,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2508 transitions. [2023-08-04 04:23:38,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:23:38,883 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2508 transitions. [2023-08-04 04:23:38,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 167.2) internal successors, (2508), 15 states have internal predecessors, (2508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:38,892 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 356.0) internal successors, (5696), 16 states have internal predecessors, (5696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:38,893 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 356.0) internal successors, (5696), 16 states have internal predecessors, (5696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:38,893 INFO L175 Difference]: Start difference. First operand has 81 places, 81 transitions, 316 flow. Second operand 15 states and 2508 transitions. [2023-08-04 04:23:38,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 430 transitions, 2249 flow [2023-08-04 04:23:38,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 430 transitions, 2236 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 04:23:38,920 INFO L231 Difference]: Finished difference. Result has 103 places, 158 transitions, 866 flow [2023-08-04 04:23:38,920 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=866, PETRI_PLACES=103, PETRI_TRANSITIONS=158} [2023-08-04 04:23:38,921 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 46 predicate places. [2023-08-04 04:23:38,921 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 158 transitions, 866 flow [2023-08-04 04:23:38,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 143.8) internal successors, (1438), 10 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:38,921 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:23:38,922 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:23:38,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-04 04:23:38,922 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 04:23:38,922 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:23:38,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1316323474, now seen corresponding path program 1 times [2023-08-04 04:23:38,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:23:38,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439606437] [2023-08-04 04:23:38,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:23:38,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:23:38,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:23:39,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 04:23:39,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:23:39,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439606437] [2023-08-04 04:23:39,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439606437] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 04:23:39,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664889357] [2023-08-04 04:23:39,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:23:39,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 04:23:39,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 04:23:39,529 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-04 04:23:39,531 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-04 04:23:39,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:23:39,743 INFO L262 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 52 conjunts are in the unsatisfiable core [2023-08-04 04:23:39,749 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 04:23:39,756 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 04:23:39,756 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-04 04:23:40,050 INFO L322 Elim1Store]: treesize reduction 13, result has 58.1 percent of original size [2023-08-04 04:23:40,050 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 54 [2023-08-04 04:23:40,079 INFO L322 Elim1Store]: treesize reduction 30, result has 43.4 percent of original size [2023-08-04 04:23:40,080 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 81 [2023-08-04 04:23:40,090 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 0 case distinctions, treesize of input 8 treesize of output 7 [2023-08-04 04:23:40,117 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 0 case distinctions, treesize of input 8 treesize of output 7 [2023-08-04 04:23:40,127 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 0 case distinctions, treesize of input 8 treesize of output 7 [2023-08-04 04:23:40,167 INFO L322 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-08-04 04:23:40,168 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 22 [2023-08-04 04:23:40,175 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 16 [2023-08-04 04:23:40,217 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 04:23:40,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 04:23:40,237 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 04:23:40,256 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_779 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t~0#1.base| v_ArrVal_779) |c_~#top~0.base|) |c_~#top~0.offset|) 0))) is different from false [2023-08-04 04:23:40,655 INFO L322 Elim1Store]: treesize reduction 13, result has 69.0 percent of original size [2023-08-04 04:23:40,655 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 62 treesize of output 73 [2023-08-04 04:23:40,667 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 04:23:40,668 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 218 treesize of output 216 [2023-08-04 04:23:40,676 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2023-08-04 04:23:40,680 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2023-08-04 04:23:42,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-04 04:23:42,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664889357] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 04:23:42,879 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 04:23:42,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 25 [2023-08-04 04:23:42,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684797899] [2023-08-04 04:23:42,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 04:23:42,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-08-04 04:23:42,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:23:42,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-08-04 04:23:42,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=557, Unknown=16, NotChecked=48, Total=702 [2023-08-04 04:23:43,054 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 356 [2023-08-04 04:23:43,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 158 transitions, 866 flow. Second operand has 27 states, 27 states have (on average 111.44444444444444) internal successors, (3009), 27 states have internal predecessors, (3009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:23:43,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:23:43,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 356 [2023-08-04 04:23:43,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:23:58,037 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:24:00,045 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-04 04:24:02,052 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-04 04:24:04,056 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-04 04:24:19,779 WARN L233 SmtUtils]: Spent 8.42s on a formula simplification. DAG size of input: 39 DAG size of output: 34 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 04:24:22,252 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-04 04:24:24,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:24:26,263 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-04 04:24:28,269 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-04 04:24:30,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:24:32,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:24:34,295 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-04 04:24:36,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:24:38,752 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-04 04:24:40,760 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-04 04:24:42,767 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-04 04:24:44,773 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-04 04:24:46,783 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-04 04:24:48,998 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-04 04:24:51,008 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-04 04:24:53,016 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-04 04:25:03,435 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-04 04:25:05,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-04 04:25:07,653 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-04 04:25:09,658 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-04 04:25:11,662 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-04 04:25:13,673 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-04 04:25:15,677 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-04 04:25:17,681 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-04 04:25:19,720 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-04 04:25:21,733 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-04 04:25:23,742 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-04 04:25:26,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:25:28,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:25:30,054 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-04 04:25:32,064 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-04 04:25:34,073 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-04 04:25:36,079 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-04 04:25:38,087 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-04 04:25:40,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:25:42,097 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-04 04:25:44,663 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-04 04:25:46,668 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-04 04:25:48,677 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-04 04:25:50,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:25:52,693 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-04 04:25:54,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:25:56,713 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-04 04:26:14,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:26:16,823 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-04 04:26:18,828 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-04 04:26:20,835 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-04 04:26:22,845 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-04 04:26:24,852 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-04 04:26:26,859 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-04 04:26:28,866 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-04 04:26:30,873 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-04 04:26:32,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:26:34,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:26:37,432 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-04 04:26:39,440 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-04 04:26:41,448 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-04 04:26:43,454 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-04 04:26:45,462 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-04 04:26:47,471 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-04 04:26:49,482 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-04 04:26:51,618 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-04 04:26:53,625 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-04 04:26:55,632 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-04 04:26:57,636 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-04 04:26:59,683 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-04 04:27:01,688 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-04 04:27:03,695 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-04 04:27:05,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:27:07,387 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-04 04:27:09,396 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-04 04:27:11,403 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-04 04:27:13,410 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-04 04:27:15,418 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-04 04:27:17,429 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-04 04:27:24,105 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-04 04:27:26,109 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-04 04:27:28,115 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-04 04:27:30,119 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-04 04:27:32,127 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-04 04:27:34,132 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-04 04:27:36,139 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-04 04:27:38,143 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-04 04:27:40,154 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-04 04:27:42,164 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-04 04:27:44,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:27:46,179 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-04 04:27:48,189 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-04 04:27:50,197 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-04 04:27:52,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:27:54,210 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-04 04:27:56,214 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-04 04:27:58,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:28:19,142 WARN L233 SmtUtils]: Spent 12.08s on a formula simplification. DAG size of input: 42 DAG size of output: 37 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 04:28:27,917 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-04 04:28:29,921 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-04 04:28:31,927 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-04 04:28:33,936 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-04 04:28:35,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:28:37,948 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-04 04:28:39,972 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-04 04:28:41,991 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-04 04:28:44,002 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-04 04:28:46,009 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-04 04:28:48,020 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-04 04:28:50,028 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-04 04:28:52,035 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-04 04:28:54,039 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-04 04:28:56,047 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-04 04:28:58,499 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-04 04:29:00,508 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-04 04:29:02,517 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-04 04:29:04,521 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-04 04:29:06,532 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-04 04:29:09,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:29:12,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:29:24,154 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-04 04:29:26,162 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-04 04:29:28,167 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-04 04:29:30,178 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-04 04:29:32,182 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-04 04:29:34,186 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-04 04:29:36,191 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-04 04:29:38,197 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-04 04:29:40,690 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-04 04:29:42,719 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-04 04:29:44,728 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-04 04:29:46,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 04:29:48,747 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-04 04:29:50,757 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-04 04:29:52,957 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-04 04:29:54,966 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-04 04:29:56,975 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-04 04:29:58,986 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-04 04:30:00,990 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-04 04:30:02,993 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-04 04:30:04,997 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-04 04:30:07,004 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-04 04:30:07,469 INFO L124 PetriNetUnfolderBase]: 63877/97315 cut-off events. [2023-08-04 04:30:07,469 INFO L125 PetriNetUnfolderBase]: For 230797/230829 co-relation queries the response was YES. [2023-08-04 04:30:07,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306851 conditions, 97315 events. 63877/97315 cut-off events. For 230797/230829 co-relation queries the response was YES. Maximal size of possible extension queue 2186. Compared 744675 event pairs, 4197 based on Foata normal form. 1430/92564 useless extension candidates. Maximal degree in co-relation 279529. Up to 19175 conditions per place. [2023-08-04 04:30:08,156 INFO L140 encePairwiseOnDemand]: 312/356 looper letters, 1987 selfloop transitions, 1132 changer transitions 0/3131 dead transitions. [2023-08-04 04:30:08,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 3131 transitions, 20181 flow [2023-08-04 04:30:08,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2023-08-04 04:30:08,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2023-08-04 04:30:08,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 13212 transitions. [2023-08-04 04:30:08,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38260164485115256 [2023-08-04 04:30:08,177 INFO L72 ComplementDD]: Start complementDD. Operand 97 states and 13212 transitions. [2023-08-04 04:30:08,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 13212 transitions. [2023-08-04 04:30:08,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:30:08,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 97 states and 13212 transitions. [2023-08-04 04:30:08,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 98 states, 97 states have (on average 136.20618556701032) internal successors, (13212), 97 states have internal predecessors, (13212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:30:08,240 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 98 states, 98 states have (on average 356.0) internal successors, (34888), 98 states have internal predecessors, (34888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:30:08,248 INFO L81 ComplementDD]: Finished complementDD. Result has 98 states, 98 states have (on average 356.0) internal successors, (34888), 98 states have internal predecessors, (34888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:30:08,249 INFO L175 Difference]: Start difference. First operand has 103 places, 158 transitions, 866 flow. Second operand 97 states and 13212 transitions. [2023-08-04 04:30:08,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 3131 transitions, 20181 flow [2023-08-04 04:30:09,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 3131 transitions, 20159 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-04 04:30:09,103 INFO L231 Difference]: Finished difference. Result has 285 places, 1441 transitions, 12835 flow [2023-08-04 04:30:09,104 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=856, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=97, PETRI_FLOW=12835, PETRI_PLACES=285, PETRI_TRANSITIONS=1441} [2023-08-04 04:30:09,104 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 228 predicate places. [2023-08-04 04:30:09,104 INFO L495 AbstractCegarLoop]: Abstraction has has 285 places, 1441 transitions, 12835 flow [2023-08-04 04:30:09,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 111.44444444444444) internal successors, (3009), 27 states have internal predecessors, (3009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:30:09,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:30:09,105 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:30:09,114 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-04 04:30:09,311 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,SelfDestructingSolverStorable16 [2023-08-04 04:30:09,311 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 04:30:09,311 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:30:09,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1203665611, now seen corresponding path program 1 times [2023-08-04 04:30:09,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:30:09,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849371437] [2023-08-04 04:30:09,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:30:09,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:30:09,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:30:09,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 04:30:09,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:30:09,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849371437] [2023-08-04 04:30:09,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849371437] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:30:09,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 04:30:09,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-04 04:30:09,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174342278] [2023-08-04 04:30:09,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:30:09,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-04 04:30:09,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:30:09,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-04 04:30:09,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-08-04 04:30:10,017 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 356 [2023-08-04 04:30:10,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 1441 transitions, 12835 flow. Second operand has 10 states, 10 states have (on average 144.1) internal successors, (1441), 10 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:30:10,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:30:10,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 356 [2023-08-04 04:30:10,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:30:50,758 INFO L124 PetriNetUnfolderBase]: 79593/125693 cut-off events. [2023-08-04 04:30:50,759 INFO L125 PetriNetUnfolderBase]: For 4971047/4994345 co-relation queries the response was YES. [2023-08-04 04:30:52,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1124815 conditions, 125693 events. 79593/125693 cut-off events. For 4971047/4994345 co-relation queries the response was YES. Maximal size of possible extension queue 3148. Compared 1069512 event pairs, 9987 based on Foata normal form. 927/121649 useless extension candidates. Maximal degree in co-relation 1050522. Up to 66732 conditions per place. [2023-08-04 04:30:53,901 INFO L140 encePairwiseOnDemand]: 334/356 looper letters, 3374 selfloop transitions, 770 changer transitions 0/4178 dead transitions. [2023-08-04 04:30:53,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 4178 transitions, 43495 flow [2023-08-04 04:30:53,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-04 04:30:53,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-04 04:30:53,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2492 transitions. [2023-08-04 04:30:53,910 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2023-08-04 04:30:53,910 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2492 transitions. [2023-08-04 04:30:53,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2492 transitions. [2023-08-04 04:30:53,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:30:53,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2492 transitions. [2023-08-04 04:30:53,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 166.13333333333333) internal successors, (2492), 15 states have internal predecessors, (2492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:30:53,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 356.0) internal successors, (5696), 16 states have internal predecessors, (5696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:30:53,920 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 356.0) internal successors, (5696), 16 states have internal predecessors, (5696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:30:53,920 INFO L175 Difference]: Start difference. First operand has 285 places, 1441 transitions, 12835 flow. Second operand 15 states and 2492 transitions. [2023-08-04 04:30:53,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 299 places, 4178 transitions, 43495 flow [2023-08-04 04:31:35,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 4178 transitions, 40603 flow, removed 1446 selfloop flow, removed 0 redundant places. [2023-08-04 04:31:35,873 INFO L231 Difference]: Finished difference. Result has 309 places, 2227 transitions, 21440 flow [2023-08-04 04:31:35,874 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=11853, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1441, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=189, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1023, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=21440, PETRI_PLACES=309, PETRI_TRANSITIONS=2227} [2023-08-04 04:31:35,874 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 252 predicate places. [2023-08-04 04:31:35,874 INFO L495 AbstractCegarLoop]: Abstraction has has 309 places, 2227 transitions, 21440 flow [2023-08-04 04:31:35,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 144.1) internal successors, (1441), 10 states have internal predecessors, (1441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:31:35,874 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:31:35,874 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:31:35,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-04 04:31:35,875 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 04:31:35,875 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:31:35,875 INFO L85 PathProgramCache]: Analyzing trace with hash -790921459, now seen corresponding path program 1 times [2023-08-04 04:31:35,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:31:35,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279513179] [2023-08-04 04:31:35,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:31:35,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:31:35,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:31:36,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 04:31:36,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:31:36,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279513179] [2023-08-04 04:31:36,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279513179] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:31:36,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 04:31:36,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-04 04:31:36,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154339641] [2023-08-04 04:31:36,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:31:36,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-04 04:31:36,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:31:36,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-04 04:31:36,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-08-04 04:31:36,795 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 356 [2023-08-04 04:31:36,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 2227 transitions, 21440 flow. Second operand has 11 states, 11 states have (on average 143.9090909090909) internal successors, (1583), 11 states have internal predecessors, (1583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:31:36,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:31:36,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 356 [2023-08-04 04:31:36,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 04:32:28,583 INFO L124 PetriNetUnfolderBase]: 82817/130048 cut-off events. [2023-08-04 04:32:28,584 INFO L125 PetriNetUnfolderBase]: For 5436566/5462955 co-relation queries the response was YES. [2023-08-04 04:32:31,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1249828 conditions, 130048 events. 82817/130048 cut-off events. For 5436566/5462955 co-relation queries the response was YES. Maximal size of possible extension queue 3168. Compared 1101442 event pairs, 10049 based on Foata normal form. 345/126253 useless extension candidates. Maximal degree in co-relation 1170588. Up to 74978 conditions per place. [2023-08-04 04:32:32,046 INFO L140 encePairwiseOnDemand]: 336/356 looper letters, 2183 selfloop transitions, 680 changer transitions 0/2902 dead transitions. [2023-08-04 04:32:32,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 2902 transitions, 39063 flow [2023-08-04 04:32:32,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-04 04:32:32,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-04 04:32:32,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2503 transitions. [2023-08-04 04:32:32,051 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4687265917602996 [2023-08-04 04:32:32,051 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 2503 transitions. [2023-08-04 04:32:32,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 2503 transitions. [2023-08-04 04:32:32,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 04:32:32,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2503 transitions. [2023-08-04 04:32:32,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 166.86666666666667) internal successors, (2503), 15 states have internal predecessors, (2503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:32:32,059 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 356.0) internal successors, (5696), 16 states have internal predecessors, (5696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:32:32,060 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 356.0) internal successors, (5696), 16 states have internal predecessors, (5696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:32:32,060 INFO L175 Difference]: Start difference. First operand has 309 places, 2227 transitions, 21440 flow. Second operand 15 states and 2503 transitions. [2023-08-04 04:32:32,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 2902 transitions, 39063 flow [2023-08-04 04:33:25,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 2902 transitions, 38529 flow, removed 200 selfloop flow, removed 3 redundant places. [2023-08-04 04:33:25,581 INFO L231 Difference]: Finished difference. Result has 324 places, 2318 transitions, 24192 flow [2023-08-04 04:33:25,583 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=356, PETRI_DIFFERENCE_MINUEND_FLOW=21107, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=597, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1581, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=24192, PETRI_PLACES=324, PETRI_TRANSITIONS=2318} [2023-08-04 04:33:25,583 INFO L281 CegarLoopForPetriNet]: 57 programPoint places, 267 predicate places. [2023-08-04 04:33:25,583 INFO L495 AbstractCegarLoop]: Abstraction has has 324 places, 2318 transitions, 24192 flow [2023-08-04 04:33:25,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 143.9090909090909) internal successors, (1583), 11 states have internal predecessors, (1583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:33:25,584 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 04:33:25,584 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 04:33:25,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-04 04:33:25,584 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err0ASSERT_VIOLATIONERROR_FUNCTION === [thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION, thr1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 04:33:25,584 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 04:33:25,584 INFO L85 PathProgramCache]: Analyzing trace with hash 272896366, now seen corresponding path program 1 times [2023-08-04 04:33:25,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 04:33:25,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621721784] [2023-08-04 04:33:25,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 04:33:25,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 04:33:25,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 04:33:25,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 04:33:25,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 04:33:25,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621721784] [2023-08-04 04:33:25,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621721784] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 04:33:25,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 04:33:25,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-04 04:33:25,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415984859] [2023-08-04 04:33:25,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 04:33:25,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-04 04:33:25,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 04:33:25,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-04 04:33:25,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-08-04 04:33:26,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 356 [2023-08-04 04:33:26,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 2318 transitions, 24192 flow. Second operand has 11 states, 11 states have (on average 144.0) internal successors, (1584), 11 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 04:33:26,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 04:33:26,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 356 [2023-08-04 04:33:26,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand