/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/increased_bounds/weaver_popl20-simple-queue.wvr_bound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 09:43:52,031 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 09:43:52,099 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 09:43:52,105 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 09:43:52,105 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 09:43:52,105 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 09:43:52,106 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 09:43:52,137 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 09:43:52,138 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 09:43:52,141 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 09:43:52,141 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 09:43:52,141 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 09:43:52,142 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 09:43:52,143 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 09:43:52,143 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 09:43:52,144 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 09:43:52,144 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 09:43:52,144 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 09:43:52,144 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 09:43:52,144 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 09:43:52,145 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 09:43:52,145 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 09:43:52,145 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 09:43:52,145 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 09:43:52,146 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 09:43:52,147 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 09:43:52,147 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 09:43:52,147 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 09:43:52,148 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 09:43:52,148 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 09:43:52,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 09:43:52,149 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 09:43:52,149 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 09:43:52,149 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 09:43:52,149 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 09:43:52,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 09:43:52,150 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 09:43:52,150 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 09:43:52,150 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 09:43:52,150 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 09:43:52,150 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 09:43:52,150 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 09:43:52,344 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 09:43:52,362 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 09:43:52,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 09:43:52,365 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 09:43:52,365 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 09:43:52,366 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-simple-queue.wvr_bound2.c [2023-08-04 09:43:53,423 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 09:43:53,565 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 09:43:53,565 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-simple-queue.wvr_bound2.c [2023-08-04 09:43:53,572 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3ca29519/1f18f8adac1847008e607f4a1bf1ad85/FLAGc7bb07e31 [2023-08-04 09:43:53,584 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f3ca29519/1f18f8adac1847008e607f4a1bf1ad85 [2023-08-04 09:43:53,588 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 09:43:53,589 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 09:43:53,591 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 09:43:53,591 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 09:43:53,594 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 09:43:53,594 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 09:43:53" (1/1) ... [2023-08-04 09:43:53,595 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@282ae788 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:43:53, skipping insertion in model container [2023-08-04 09:43:53,595 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 09:43:53" (1/1) ... [2023-08-04 09:43:53,615 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 09:43:53,737 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-simple-queue.wvr_bound2.c[2600,2613] [2023-08-04 09:43:53,744 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 09:43:53,751 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 09:43:53,782 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-simple-queue.wvr_bound2.c[2600,2613] [2023-08-04 09:43:53,784 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 09:43:53,789 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 09:43:53,789 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 09:43:53,794 INFO L206 MainTranslator]: Completed translation [2023-08-04 09:43:53,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:43:53 WrapperNode [2023-08-04 09:43:53,796 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 09:43:53,797 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 09:43:53,797 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 09:43:53,797 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 09:43:53,801 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:43:53" (1/1) ... [2023-08-04 09:43:53,813 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:43:53" (1/1) ... [2023-08-04 09:43:53,838 INFO L138 Inliner]: procedures = 24, calls = 33, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 165 [2023-08-04 09:43:53,838 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 09:43:53,839 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 09:43:53,839 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 09:43:53,839 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 09:43:53,846 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:43:53" (1/1) ... [2023-08-04 09:43:53,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:43:53" (1/1) ... [2023-08-04 09:43:53,857 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:43:53" (1/1) ... [2023-08-04 09:43:53,857 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:43:53" (1/1) ... [2023-08-04 09:43:53,862 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:43:53" (1/1) ... [2023-08-04 09:43:53,865 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:43:53" (1/1) ... [2023-08-04 09:43:53,867 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:43:53" (1/1) ... [2023-08-04 09:43:53,868 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:43:53" (1/1) ... [2023-08-04 09:43:53,870 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 09:43:53,870 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 09:43:53,871 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 09:43:53,871 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 09:43:53,871 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:43:53" (1/1) ... [2023-08-04 09:43:53,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 09:43:53,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:43:53,909 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 09:43:53,915 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 09:43:53,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 09:43:53,931 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-04 09:43:53,931 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-04 09:43:53,932 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-04 09:43:53,932 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-04 09:43:53,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 09:43:53,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 09:43:53,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 09:43:53,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 09:43:53,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 09:43:53,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-04 09:43:53,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 09:43:53,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 09:43:53,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-04 09:43:53,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 09:43:53,933 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 09:43:54,011 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 09:43:54,012 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 09:43:54,216 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 09:43:54,276 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 09:43:54,276 INFO L302 CfgBuilder]: Removed 7 assume(true) statements. [2023-08-04 09:43:54,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:43:54 BoogieIcfgContainer [2023-08-04 09:43:54,278 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 09:43:54,280 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 09:43:54,280 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 09:43:54,282 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 09:43:54,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 09:43:53" (1/3) ... [2023-08-04 09:43:54,283 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10b81ccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:43:54, skipping insertion in model container [2023-08-04 09:43:54,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:43:53" (2/3) ... [2023-08-04 09:43:54,283 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10b81ccc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:43:54, skipping insertion in model container [2023-08-04 09:43:54,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:43:54" (3/3) ... [2023-08-04 09:43:54,284 INFO L112 eAbstractionObserver]: Analyzing ICFG weaver_popl20-simple-queue.wvr_bound2.c [2023-08-04 09:43:54,289 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 09:43:54,297 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 09:43:54,297 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-04 09:43:54,297 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 09:43:54,353 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-04 09:43:54,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 145 transitions, 312 flow [2023-08-04 09:43:54,507 INFO L124 PetriNetUnfolderBase]: 36/284 cut-off events. [2023-08-04 09:43:54,508 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 09:43:54,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 284 events. 36/284 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 822 event pairs, 0 based on Foata normal form. 0/238 useless extension candidates. Maximal degree in co-relation 171. Up to 8 conditions per place. [2023-08-04 09:43:54,515 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 145 transitions, 312 flow [2023-08-04 09:43:54,520 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 145 transitions, 312 flow [2023-08-04 09:43:54,522 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 09:43:54,530 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 145 transitions, 312 flow [2023-08-04 09:43:54,533 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 145 transitions, 312 flow [2023-08-04 09:43:54,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 145 transitions, 312 flow [2023-08-04 09:43:54,570 INFO L124 PetriNetUnfolderBase]: 36/284 cut-off events. [2023-08-04 09:43:54,571 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 09:43:54,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 284 events. 36/284 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 822 event pairs, 0 based on Foata normal form. 0/238 useless extension candidates. Maximal degree in co-relation 171. Up to 8 conditions per place. [2023-08-04 09:43:54,574 INFO L119 LiptonReduction]: Number of co-enabled transitions 2142 [2023-08-04 09:43:57,791 INFO L134 LiptonReduction]: Checked pairs total: 2650 [2023-08-04 09:43:57,791 INFO L136 LiptonReduction]: Total number of compositions: 136 [2023-08-04 09:43:57,801 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 09:43:57,804 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;@2d9f82df, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 09:43:57,805 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 09:43:57,808 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 09:43:57,808 INFO L124 PetriNetUnfolderBase]: 3/16 cut-off events. [2023-08-04 09:43:57,808 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 09:43:57,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:43:57,809 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 09:43:57,809 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:43:57,820 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:43:57,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1123550496, now seen corresponding path program 1 times [2023-08-04 09:43:57,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:43:57,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920324831] [2023-08-04 09:43:57,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:43:57,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:43:57,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:43:57,988 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 09:43:57,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:43:57,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920324831] [2023-08-04 09:43:57,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920324831] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:43:57,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 09:43:57,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 09:43:57,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129034004] [2023-08-04 09:43:57,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:43:57,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:43:58,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:43:58,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:43:58,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 09:43:58,061 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 281 [2023-08-04 09:43:58,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 30 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states 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 09:43:58,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:43:58,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 281 [2023-08-04 09:43:58,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:43:58,131 INFO L124 PetriNetUnfolderBase]: 109/205 cut-off events. [2023-08-04 09:43:58,131 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-08-04 09:43:58,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 422 conditions, 205 events. 109/205 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 600 event pairs, 21 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 308. Up to 185 conditions per place. [2023-08-04 09:43:58,136 INFO L140 encePairwiseOnDemand]: 277/281 looper letters, 25 selfloop transitions, 2 changer transitions 3/32 dead transitions. [2023-08-04 09:43:58,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 32 transitions, 142 flow [2023-08-04 09:43:58,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:43:58,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:43:58,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 396 transitions. [2023-08-04 09:43:58,153 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4697508896797153 [2023-08-04 09:43:58,154 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 396 transitions. [2023-08-04 09:43:58,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 396 transitions. [2023-08-04 09:43:58,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:43:58,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 396 transitions. [2023-08-04 09:43:58,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states 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 09:43:58,165 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states 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 09:43:58,166 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states 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 09:43:58,167 INFO L175 Difference]: Start difference. First operand has 28 places, 30 transitions, 82 flow. Second operand 3 states and 396 transitions. [2023-08-04 09:43:58,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 32 transitions, 142 flow [2023-08-04 09:43:58,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 32 transitions, 142 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 09:43:58,171 INFO L231 Difference]: Finished difference. Result has 30 places, 27 transitions, 80 flow [2023-08-04 09:43:58,173 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=30, PETRI_TRANSITIONS=27} [2023-08-04 09:43:58,176 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 2 predicate places. [2023-08-04 09:43:58,176 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 27 transitions, 80 flow [2023-08-04 09:43:58,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states 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 09:43:58,176 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:43:58,176 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:43:58,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 09:43:58,177 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:43:58,179 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:43:58,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1760867039, now seen corresponding path program 1 times [2023-08-04 09:43:58,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:43:58,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550083093] [2023-08-04 09:43:58,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:43:58,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:43:58,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:43:58,277 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 09:43:58,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:43:58,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550083093] [2023-08-04 09:43:58,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550083093] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:43:58,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853091212] [2023-08-04 09:43:58,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:43:58,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:43:58,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:43:58,280 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 09:43:58,289 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 09:43:58,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:43:58,348 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 09:43:58,351 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:43:58,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 09:43:58,369 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 09:43:58,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853091212] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:43:58,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 09:43:58,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-08-04 09:43:58,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628173048] [2023-08-04 09:43:58,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:43:58,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:43:58,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:43:58,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:43:58,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:43:58,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 281 [2023-08-04 09:43:58,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 27 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states 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 09:43:58,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:43:58,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 281 [2023-08-04 09:43:58,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:43:58,439 INFO L124 PetriNetUnfolderBase]: 107/197 cut-off events. [2023-08-04 09:43:58,439 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-08-04 09:43:58,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 415 conditions, 197 events. 107/197 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 450 event pairs, 24 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 302. Up to 170 conditions per place. [2023-08-04 09:43:58,441 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 27 selfloop transitions, 2 changer transitions 1/32 dead transitions. [2023-08-04 09:43:58,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 32 transitions, 150 flow [2023-08-04 09:43:58,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:43:58,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:43:58,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 397 transitions. [2023-08-04 09:43:58,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4709371293001186 [2023-08-04 09:43:58,448 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 397 transitions. [2023-08-04 09:43:58,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 397 transitions. [2023-08-04 09:43:58,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:43:58,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 397 transitions. [2023-08-04 09:43:58,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states 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 09:43:58,451 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states 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 09:43:58,452 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states 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 09:43:58,452 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 80 flow. Second operand 3 states and 397 transitions. [2023-08-04 09:43:58,452 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 32 transitions, 150 flow [2023-08-04 09:43:58,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 32 transitions, 140 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-04 09:43:58,453 INFO L231 Difference]: Finished difference. Result has 27 places, 27 transitions, 78 flow [2023-08-04 09:43:58,453 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=27, PETRI_TRANSITIONS=27} [2023-08-04 09:43:58,454 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, -1 predicate places. [2023-08-04 09:43:58,454 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 27 transitions, 78 flow [2023-08-04 09:43:58,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states 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 09:43:58,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:43:58,454 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:43:58,469 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 09:43:58,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:43:58,670 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:43:58,670 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:43:58,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1563370359, now seen corresponding path program 1 times [2023-08-04 09:43:58,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:43:58,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377295979] [2023-08-04 09:43:58,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:43:58,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:43:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:43:58,748 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 09:43:58,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:43:58,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377295979] [2023-08-04 09:43:58,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377295979] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:43:58,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966346493] [2023-08-04 09:43:58,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:43:58,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:43:58,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:43:58,750 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 09:43:58,763 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 09:43:58,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:43:58,823 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 09:43:58,823 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:43:58,829 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 09:43:58,829 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 09:43:58,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966346493] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:43:58,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 09:43:58,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-08-04 09:43:58,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731678242] [2023-08-04 09:43:58,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:43:58,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:43:58,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:43:58,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:43:58,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:43:58,838 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 281 [2023-08-04 09:43:58,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 27 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states 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 09:43:58,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:43:58,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 281 [2023-08-04 09:43:58,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:43:58,911 INFO L124 PetriNetUnfolderBase]: 75/145 cut-off events. [2023-08-04 09:43:58,912 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-04 09:43:58,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 145 events. 75/145 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 283 event pairs, 24 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 139. Up to 108 conditions per place. [2023-08-04 09:43:58,913 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 31 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2023-08-04 09:43:58,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 35 transitions, 164 flow [2023-08-04 09:43:58,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:43:58,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:43:58,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 400 transitions. [2023-08-04 09:43:58,916 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4744958481613286 [2023-08-04 09:43:58,916 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 400 transitions. [2023-08-04 09:43:58,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 400 transitions. [2023-08-04 09:43:58,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:43:58,917 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 400 transitions. [2023-08-04 09:43:58,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states 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 09:43:58,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states 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 09:43:58,920 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states 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 09:43:58,920 INFO L175 Difference]: Start difference. First operand has 27 places, 27 transitions, 78 flow. Second operand 3 states and 400 transitions. [2023-08-04 09:43:58,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 35 transitions, 164 flow [2023-08-04 09:43:58,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 35 transitions, 160 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 09:43:58,922 INFO L231 Difference]: Finished difference. Result has 28 places, 28 transitions, 86 flow [2023-08-04 09:43:58,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=28, PETRI_TRANSITIONS=28} [2023-08-04 09:43:58,924 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 0 predicate places. [2023-08-04 09:43:58,924 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 28 transitions, 86 flow [2023-08-04 09:43:58,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states 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 09:43:58,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:43:58,924 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:43:58,945 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 09:43:59,134 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,SelfDestructingSolverStorable2 [2023-08-04 09:43:59,135 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:43:59,135 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:43:59,135 INFO L85 PathProgramCache]: Analyzing trace with hash 166009420, now seen corresponding path program 1 times [2023-08-04 09:43:59,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:43:59,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309616225] [2023-08-04 09:43:59,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:43:59,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:43:59,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:43:59,202 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 09:43:59,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:43:59,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309616225] [2023-08-04 09:43:59,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309616225] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:43:59,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185611449] [2023-08-04 09:43:59,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:43:59,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:43:59,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:43:59,204 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 09:43:59,205 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 09:43:59,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:43:59,261 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 09:43:59,262 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:43:59,272 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 09:43:59,273 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 09:43:59,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185611449] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:43:59,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 09:43:59,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2023-08-04 09:43:59,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135970466] [2023-08-04 09:43:59,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:43:59,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:43:59,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:43:59,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:43:59,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:43:59,282 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 281 [2023-08-04 09:43:59,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 28 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states 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 09:43:59,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:43:59,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 281 [2023-08-04 09:43:59,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:43:59,326 INFO L124 PetriNetUnfolderBase]: 70/138 cut-off events. [2023-08-04 09:43:59,326 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-08-04 09:43:59,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 319 conditions, 138 events. 70/138 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 251 event pairs, 29 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 142. Up to 113 conditions per place. [2023-08-04 09:43:59,330 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 27 selfloop transitions, 2 changer transitions 2/33 dead transitions. [2023-08-04 09:43:59,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 33 transitions, 158 flow [2023-08-04 09:43:59,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:43:59,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:43:59,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 397 transitions. [2023-08-04 09:43:59,332 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4709371293001186 [2023-08-04 09:43:59,332 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 397 transitions. [2023-08-04 09:43:59,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 397 transitions. [2023-08-04 09:43:59,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:43:59,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 397 transitions. [2023-08-04 09:43:59,333 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states 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 09:43:59,334 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states 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 09:43:59,334 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states 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 09:43:59,334 INFO L175 Difference]: Start difference. First operand has 28 places, 28 transitions, 86 flow. Second operand 3 states and 397 transitions. [2023-08-04 09:43:59,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 33 transitions, 158 flow [2023-08-04 09:43:59,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 33 transitions, 156 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 09:43:59,337 INFO L231 Difference]: Finished difference. Result has 30 places, 27 transitions, 88 flow [2023-08-04 09:43:59,337 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=30, PETRI_TRANSITIONS=27} [2023-08-04 09:43:59,338 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 2 predicate places. [2023-08-04 09:43:59,338 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 27 transitions, 88 flow [2023-08-04 09:43:59,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states 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 09:43:59,339 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:43:59,339 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:43:59,345 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 09:43:59,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:43:59,544 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:43:59,544 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:43:59,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1355439352, now seen corresponding path program 1 times [2023-08-04 09:43:59,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:43:59,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93449741] [2023-08-04 09:43:59,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:43:59,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:43:59,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:43:59,583 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 09:43:59,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:43:59,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93449741] [2023-08-04 09:43:59,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93449741] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:43:59,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733577295] [2023-08-04 09:43:59,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:43:59,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:43:59,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:43:59,585 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 09:43:59,587 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 09:43:59,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:43:59,640 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 09:43:59,641 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:43:59,662 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 09:43:59,662 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:43:59,699 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 09:43:59,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733577295] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:43:59,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:43:59,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 09:43:59,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122881655] [2023-08-04 09:43:59,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:43:59,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:43:59,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:43:59,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:43:59,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:43:59,713 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 281 [2023-08-04 09:43:59,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 27 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 126.0) internal successors, (630), 5 states have internal predecessors, (630), 0 states have call successors, (0), 0 states 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 09:43:59,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:43:59,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 281 [2023-08-04 09:43:59,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:43:59,732 INFO L124 PetriNetUnfolderBase]: 6/15 cut-off events. [2023-08-04 09:43:59,733 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 09:43:59,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 15 events. 6/15 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 10 event pairs, 0 based on Foata normal form. 2/14 useless extension candidates. Maximal degree in co-relation 33. Up to 8 conditions per place. [2023-08-04 09:43:59,733 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 0 selfloop transitions, 0 changer transitions 11/11 dead transitions. [2023-08-04 09:43:59,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 17 places, 11 transitions, 48 flow [2023-08-04 09:43:59,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 09:43:59,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 09:43:59,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 496 transitions. [2023-08-04 09:43:59,735 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4412811387900356 [2023-08-04 09:43:59,735 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 496 transitions. [2023-08-04 09:43:59,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 496 transitions. [2023-08-04 09:43:59,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:43:59,735 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 496 transitions. [2023-08-04 09:43:59,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 0 states have call successors, (0), 0 states 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 09:43:59,738 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states 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 09:43:59,739 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states 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 09:43:59,739 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 88 flow. Second operand 4 states and 496 transitions. [2023-08-04 09:43:59,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 17 places, 11 transitions, 48 flow [2023-08-04 09:43:59,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 16 places, 11 transitions, 46 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 09:43:59,739 INFO L231 Difference]: Finished difference. Result has 16 places, 0 transitions, 0 flow [2023-08-04 09:43:59,739 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=18, PETRI_DIFFERENCE_MINUEND_PLACES=13, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=8, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=16, PETRI_TRANSITIONS=0} [2023-08-04 09:43:59,740 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, -12 predicate places. [2023-08-04 09:43:59,740 INFO L495 AbstractCegarLoop]: Abstraction has has 16 places, 0 transitions, 0 flow [2023-08-04 09:43:59,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.0) internal successors, (630), 5 states have internal predecessors, (630), 0 states have call successors, (0), 0 states 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 09:43:59,743 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-08-04 09:43:59,758 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 09:43:59,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:43:59,961 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-08-04 09:43:59,963 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE (1/2) [2023-08-04 09:43:59,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 145 transitions, 312 flow [2023-08-04 09:43:59,978 INFO L124 PetriNetUnfolderBase]: 36/284 cut-off events. [2023-08-04 09:43:59,979 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 09:43:59,979 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 284 events. 36/284 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 822 event pairs, 0 based on Foata normal form. 0/238 useless extension candidates. Maximal degree in co-relation 171. Up to 8 conditions per place. [2023-08-04 09:43:59,979 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 145 transitions, 312 flow [2023-08-04 09:43:59,980 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 145 transitions, 312 flow [2023-08-04 09:43:59,980 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 09:43:59,980 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 145 transitions, 312 flow [2023-08-04 09:43:59,980 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 145 transitions, 312 flow [2023-08-04 09:43:59,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 145 transitions, 312 flow [2023-08-04 09:43:59,994 INFO L124 PetriNetUnfolderBase]: 36/284 cut-off events. [2023-08-04 09:43:59,994 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 09:43:59,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 284 events. 36/284 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 822 event pairs, 0 based on Foata normal form. 0/238 useless extension candidates. Maximal degree in co-relation 171. Up to 8 conditions per place. [2023-08-04 09:43:59,996 INFO L119 LiptonReduction]: Number of co-enabled transitions 2142 [2023-08-04 09:44:03,209 INFO L134 LiptonReduction]: Checked pairs total: 2528 [2023-08-04 09:44:03,209 INFO L136 LiptonReduction]: Total number of compositions: 138 [2023-08-04 09:44:03,210 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 09:44:03,211 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;@2d9f82df, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 09:44:03,211 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 09:44:03,213 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 09:44:03,213 INFO L124 PetriNetUnfolderBase]: 3/26 cut-off events. [2023-08-04 09:44:03,213 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 09:44:03,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:44:03,214 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2023-08-04 09:44:03,214 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 09:44:03,214 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:44:03,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1796386249, now seen corresponding path program 1 times [2023-08-04 09:44:03,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:44:03,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666093944] [2023-08-04 09:44:03,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:44:03,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:44:03,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 09:44:03,249 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 09:44:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 09:44:03,272 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 09:44:03,272 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 09:44:03,272 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 09:44:03,273 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 09:44:03,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-04 09:44:03,273 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-04 09:44:03,273 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN (2/2) [2023-08-04 09:44:03,274 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 09:44:03,274 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 09:44:03,285 INFO L144 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2023-08-04 09:44:03,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 169 transitions, 386 flow [2023-08-04 09:44:03,335 INFO L124 PetriNetUnfolderBase]: 137/854 cut-off events. [2023-08-04 09:44:03,335 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-04 09:44:03,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 951 conditions, 854 events. 137/854 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4118 event pairs, 1 based on Foata normal form. 0/714 useless extension candidates. Maximal degree in co-relation 515. Up to 32 conditions per place. [2023-08-04 09:44:03,339 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 169 transitions, 386 flow [2023-08-04 09:44:03,341 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 169 transitions, 386 flow [2023-08-04 09:44:03,341 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 09:44:03,342 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 169 transitions, 386 flow [2023-08-04 09:44:03,342 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 169 transitions, 386 flow [2023-08-04 09:44:03,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 169 transitions, 386 flow [2023-08-04 09:44:03,389 INFO L124 PetriNetUnfolderBase]: 137/854 cut-off events. [2023-08-04 09:44:03,389 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-04 09:44:03,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 951 conditions, 854 events. 137/854 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4118 event pairs, 1 based on Foata normal form. 0/714 useless extension candidates. Maximal degree in co-relation 515. Up to 32 conditions per place. [2023-08-04 09:44:03,400 INFO L119 LiptonReduction]: Number of co-enabled transitions 5292 [2023-08-04 09:44:06,448 INFO L134 LiptonReduction]: Checked pairs total: 7587 [2023-08-04 09:44:06,448 INFO L136 LiptonReduction]: Total number of compositions: 154 [2023-08-04 09:44:06,450 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 09:44:06,451 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;@2d9f82df, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 09:44:06,451 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 09:44:06,452 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 09:44:06,452 INFO L124 PetriNetUnfolderBase]: 3/16 cut-off events. [2023-08-04 09:44:06,452 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 09:44:06,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:44:06,453 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 09:44:06,453 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:44:06,453 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:44:06,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1771484632, now seen corresponding path program 1 times [2023-08-04 09:44:06,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:44:06,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966475050] [2023-08-04 09:44:06,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:44:06,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:44:06,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:44:06,479 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 09:44:06,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:44:06,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966475050] [2023-08-04 09:44:06,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966475050] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:44:06,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 09:44:06,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 09:44:06,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960362571] [2023-08-04 09:44:06,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:44:06,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:44:06,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:44:06,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:44:06,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 09:44:06,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 323 [2023-08-04 09:44:06,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 42 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states 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 09:44:06,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:44:06,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 323 [2023-08-04 09:44:06,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:44:06,658 INFO L124 PetriNetUnfolderBase]: 1951/2778 cut-off events. [2023-08-04 09:44:06,658 INFO L125 PetriNetUnfolderBase]: For 370/370 co-relation queries the response was YES. [2023-08-04 09:44:06,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5711 conditions, 2778 events. 1951/2778 cut-off events. For 370/370 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 10360 event pairs, 641 based on Foata normal form. 0/1663 useless extension candidates. Maximal degree in co-relation 2130. Up to 2623 conditions per place. [2023-08-04 09:44:06,669 INFO L140 encePairwiseOnDemand]: 319/323 looper letters, 37 selfloop transitions, 2 changer transitions 2/45 dead transitions. [2023-08-04 09:44:06,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 45 transitions, 216 flow [2023-08-04 09:44:06,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:44:06,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:44:06,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 449 transitions. [2023-08-04 09:44:06,670 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4633642930856553 [2023-08-04 09:44:06,670 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 449 transitions. [2023-08-04 09:44:06,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 449 transitions. [2023-08-04 09:44:06,671 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:44:06,671 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 449 transitions. [2023-08-04 09:44:06,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states 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 09:44:06,673 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 323.0) internal successors, (1292), 4 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states 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 09:44:06,673 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 323.0) internal successors, (1292), 4 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states 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 09:44:06,673 INFO L175 Difference]: Start difference. First operand has 38 places, 42 transitions, 132 flow. Second operand 3 states and 449 transitions. [2023-08-04 09:44:06,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 45 transitions, 216 flow [2023-08-04 09:44:06,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 45 transitions, 216 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 09:44:06,678 INFO L231 Difference]: Finished difference. Result has 40 places, 40 transitions, 130 flow [2023-08-04 09:44:06,678 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=40, PETRI_TRANSITIONS=40} [2023-08-04 09:44:06,679 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 2 predicate places. [2023-08-04 09:44:06,679 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 40 transitions, 130 flow [2023-08-04 09:44:06,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states 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 09:44:06,679 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:44:06,679 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:44:06,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-04 09:44:06,679 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:44:06,679 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:44:06,680 INFO L85 PathProgramCache]: Analyzing trace with hash -846127205, now seen corresponding path program 1 times [2023-08-04 09:44:06,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:44:06,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596960998] [2023-08-04 09:44:06,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:44:06,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:44:06,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:44:06,718 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 09:44:06,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:44:06,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596960998] [2023-08-04 09:44:06,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596960998] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:44:06,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323183200] [2023-08-04 09:44:06,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:44:06,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:44:06,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:44:06,719 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 09:44:06,721 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 09:44:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:44:06,774 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 09:44:06,775 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:44:06,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 09:44:06,780 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 09:44:06,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323183200] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:44:06,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 09:44:06,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-08-04 09:44:06,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131251123] [2023-08-04 09:44:06,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:44:06,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:44:06,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:44:06,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:44:06,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:44:06,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 323 [2023-08-04 09:44:06,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 40 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states 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 09:44:06,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:44:06,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 323 [2023-08-04 09:44:06,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:44:06,984 INFO L124 PetriNetUnfolderBase]: 1945/2772 cut-off events. [2023-08-04 09:44:06,984 INFO L125 PetriNetUnfolderBase]: For 306/306 co-relation queries the response was YES. [2023-08-04 09:44:06,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5688 conditions, 2772 events. 1945/2772 cut-off events. For 306/306 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 10304 event pairs, 644 based on Foata normal form. 0/1670 useless extension candidates. Maximal degree in co-relation 5654. Up to 2552 conditions per place. [2023-08-04 09:44:06,995 INFO L140 encePairwiseOnDemand]: 320/323 looper letters, 42 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2023-08-04 09:44:06,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 48 transitions, 234 flow [2023-08-04 09:44:06,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:44:06,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:44:06,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 452 transitions. [2023-08-04 09:44:06,997 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4664602683178535 [2023-08-04 09:44:06,997 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 452 transitions. [2023-08-04 09:44:06,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 452 transitions. [2023-08-04 09:44:06,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:44:06,997 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 452 transitions. [2023-08-04 09:44:06,998 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states 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 09:44:06,999 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 323.0) internal successors, (1292), 4 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states 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 09:44:06,999 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 323.0) internal successors, (1292), 4 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states 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 09:44:06,999 INFO L175 Difference]: Start difference. First operand has 40 places, 40 transitions, 130 flow. Second operand 3 states and 452 transitions. [2023-08-04 09:44:06,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 48 transitions, 234 flow [2023-08-04 09:44:07,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 48 transitions, 226 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-04 09:44:07,001 INFO L231 Difference]: Finished difference. Result has 38 places, 41 transitions, 134 flow [2023-08-04 09:44:07,002 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=38, PETRI_TRANSITIONS=41} [2023-08-04 09:44:07,002 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 0 predicate places. [2023-08-04 09:44:07,003 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 41 transitions, 134 flow [2023-08-04 09:44:07,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states 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 09:44:07,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:44:07,003 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:44:07,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-04 09:44:07,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:44:07,211 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:44:07,211 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:44:07,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1824383525, now seen corresponding path program 1 times [2023-08-04 09:44:07,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:44:07,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732923282] [2023-08-04 09:44:07,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:44:07,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:44:07,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:44:07,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 09:44:07,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:44:07,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732923282] [2023-08-04 09:44:07,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732923282] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:44:07,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592558583] [2023-08-04 09:44:07,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:44:07,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:44:07,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:44:07,250 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 09:44:07,252 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 09:44:07,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:44:07,308 INFO L262 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 09:44:07,308 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:44:07,314 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 09:44:07,314 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 09:44:07,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592558583] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:44:07,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 09:44:07,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-08-04 09:44:07,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554239094] [2023-08-04 09:44:07,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:44:07,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:44:07,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:44:07,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:44:07,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:44:07,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 323 [2023-08-04 09:44:07,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 41 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states 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 09:44:07,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:44:07,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 323 [2023-08-04 09:44:07,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:44:07,488 INFO L124 PetriNetUnfolderBase]: 1789/2592 cut-off events. [2023-08-04 09:44:07,488 INFO L125 PetriNetUnfolderBase]: For 223/223 co-relation queries the response was YES. [2023-08-04 09:44:07,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5407 conditions, 2592 events. 1789/2592 cut-off events. For 223/223 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 9698 event pairs, 620 based on Foata normal form. 0/1624 useless extension candidates. Maximal degree in co-relation 2326. Up to 1938 conditions per place. [2023-08-04 09:44:07,498 INFO L140 encePairwiseOnDemand]: 320/323 looper letters, 49 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-08-04 09:44:07,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 55 transitions, 274 flow [2023-08-04 09:44:07,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:44:07,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:44:07,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 458 transitions. [2023-08-04 09:44:07,500 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4726522187822497 [2023-08-04 09:44:07,500 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 458 transitions. [2023-08-04 09:44:07,500 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 458 transitions. [2023-08-04 09:44:07,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:44:07,500 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 458 transitions. [2023-08-04 09:44:07,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states 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 09:44:07,502 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 323.0) internal successors, (1292), 4 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states 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 09:44:07,502 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 323.0) internal successors, (1292), 4 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states 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 09:44:07,502 INFO L175 Difference]: Start difference. First operand has 38 places, 41 transitions, 134 flow. Second operand 3 states and 458 transitions. [2023-08-04 09:44:07,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 55 transitions, 274 flow [2023-08-04 09:44:07,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 55 transitions, 272 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 09:44:07,504 INFO L231 Difference]: Finished difference. Result has 40 places, 42 transitions, 144 flow [2023-08-04 09:44:07,505 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=40, PETRI_TRANSITIONS=42} [2023-08-04 09:44:07,506 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 2 predicate places. [2023-08-04 09:44:07,506 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 42 transitions, 144 flow [2023-08-04 09:44:07,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states 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 09:44:07,507 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:44:07,507 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:44:07,515 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 09:44:07,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:44:07,712 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:44:07,712 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:44:07,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1719294839, now seen corresponding path program 1 times [2023-08-04 09:44:07,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:44:07,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110359876] [2023-08-04 09:44:07,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:44:07,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:44:07,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:44:07,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 09:44:07,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:44:07,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110359876] [2023-08-04 09:44:07,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110359876] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:44:07,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725093308] [2023-08-04 09:44:07,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:44:07,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:44:07,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:44:07,753 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:44:07,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-04 09:44:07,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:44:07,815 INFO L262 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 09:44:07,815 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:44:07,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 09:44:07,825 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 09:44:07,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725093308] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:44:07,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 09:44:07,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2023-08-04 09:44:07,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123475912] [2023-08-04 09:44:07,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:44:07,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:44:07,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:44:07,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:44:07,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:44:07,833 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 323 [2023-08-04 09:44:07,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 42 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states 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 09:44:07,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:44:07,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 323 [2023-08-04 09:44:07,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:44:08,040 INFO L124 PetriNetUnfolderBase]: 1808/2663 cut-off events. [2023-08-04 09:44:08,040 INFO L125 PetriNetUnfolderBase]: For 450/450 co-relation queries the response was YES. [2023-08-04 09:44:08,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5803 conditions, 2663 events. 1808/2663 cut-off events. For 450/450 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 10023 event pairs, 675 based on Foata normal form. 0/1780 useless extension candidates. Maximal degree in co-relation 2643. Up to 1946 conditions per place. [2023-08-04 09:44:08,049 INFO L140 encePairwiseOnDemand]: 320/323 looper letters, 50 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2023-08-04 09:44:08,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 56 transitions, 286 flow [2023-08-04 09:44:08,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:44:08,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:44:08,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 458 transitions. [2023-08-04 09:44:08,051 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4726522187822497 [2023-08-04 09:44:08,051 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 458 transitions. [2023-08-04 09:44:08,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 458 transitions. [2023-08-04 09:44:08,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:44:08,051 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 458 transitions. [2023-08-04 09:44:08,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states 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 09:44:08,053 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 323.0) internal successors, (1292), 4 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states 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 09:44:08,054 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 323.0) internal successors, (1292), 4 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states 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 09:44:08,054 INFO L175 Difference]: Start difference. First operand has 40 places, 42 transitions, 144 flow. Second operand 3 states and 458 transitions. [2023-08-04 09:44:08,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 56 transitions, 286 flow [2023-08-04 09:44:08,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 56 transitions, 284 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 09:44:08,057 INFO L231 Difference]: Finished difference. Result has 42 places, 43 transitions, 154 flow [2023-08-04 09:44:08,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=42, PETRI_TRANSITIONS=43} [2023-08-04 09:44:08,058 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 4 predicate places. [2023-08-04 09:44:08,058 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 43 transitions, 154 flow [2023-08-04 09:44:08,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states 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 09:44:08,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:44:08,058 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:44:08,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-04 09:44:08,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:44:08,264 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:44:08,264 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:44:08,264 INFO L85 PathProgramCache]: Analyzing trace with hash -2007764394, now seen corresponding path program 1 times [2023-08-04 09:44:08,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:44:08,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52458884] [2023-08-04 09:44:08,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:44:08,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:44:08,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:44:08,305 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 09:44:08,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:44:08,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52458884] [2023-08-04 09:44:08,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52458884] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:44:08,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6722040] [2023-08-04 09:44:08,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:44:08,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:44:08,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:44:08,307 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:44:08,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-04 09:44:08,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:44:08,374 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 09:44:08,376 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:44:08,389 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 09:44:08,390 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:44:08,402 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 09:44:08,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6722040] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:44:08,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:44:08,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 09:44:08,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89430813] [2023-08-04 09:44:08,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:44:08,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:44:08,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:44:08,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:44:08,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:44:08,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 323 [2023-08-04 09:44:08,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 43 transitions, 154 flow. Second operand has 5 states, 5 states have (on average 139.8) internal successors, (699), 5 states have internal predecessors, (699), 0 states have call successors, (0), 0 states 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 09:44:08,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:44:08,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 323 [2023-08-04 09:44:08,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:44:08,595 INFO L124 PetriNetUnfolderBase]: 1614/2375 cut-off events. [2023-08-04 09:44:08,595 INFO L125 PetriNetUnfolderBase]: For 402/402 co-relation queries the response was YES. [2023-08-04 09:44:08,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5283 conditions, 2375 events. 1614/2375 cut-off events. For 402/402 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 8772 event pairs, 387 based on Foata normal form. 2/1621 useless extension candidates. Maximal degree in co-relation 3132. Up to 2207 conditions per place. [2023-08-04 09:44:08,606 INFO L140 encePairwiseOnDemand]: 319/323 looper letters, 43 selfloop transitions, 3 changer transitions 1/51 dead transitions. [2023-08-04 09:44:08,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 51 transitions, 264 flow [2023-08-04 09:44:08,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 09:44:08,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 09:44:08,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 585 transitions. [2023-08-04 09:44:08,608 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45278637770897834 [2023-08-04 09:44:08,608 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 585 transitions. [2023-08-04 09:44:08,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 585 transitions. [2023-08-04 09:44:08,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:44:08,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 585 transitions. [2023-08-04 09:44:08,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 146.25) internal successors, (585), 4 states have internal predecessors, (585), 0 states have call successors, (0), 0 states 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 09:44:08,611 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 323.0) internal successors, (1615), 5 states have internal predecessors, (1615), 0 states have call successors, (0), 0 states 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 09:44:08,611 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 323.0) internal successors, (1615), 5 states have internal predecessors, (1615), 0 states have call successors, (0), 0 states 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 09:44:08,611 INFO L175 Difference]: Start difference. First operand has 42 places, 43 transitions, 154 flow. Second operand 4 states and 585 transitions. [2023-08-04 09:44:08,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 51 transitions, 264 flow [2023-08-04 09:44:08,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 51 transitions, 262 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 09:44:08,615 INFO L231 Difference]: Finished difference. Result has 46 places, 43 transitions, 166 flow [2023-08-04 09:44:08,615 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=46, PETRI_TRANSITIONS=43} [2023-08-04 09:44:08,616 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 8 predicate places. [2023-08-04 09:44:08,616 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 43 transitions, 166 flow [2023-08-04 09:44:08,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 139.8) internal successors, (699), 5 states have internal predecessors, (699), 0 states have call successors, (0), 0 states 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 09:44:08,616 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:44:08,616 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:44:08,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-04 09:44:08,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-08-04 09:44:08,821 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:44:08,821 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:44:08,821 INFO L85 PathProgramCache]: Analyzing trace with hash -756338964, now seen corresponding path program 1 times [2023-08-04 09:44:08,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:44:08,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803877811] [2023-08-04 09:44:08,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:44:08,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:44:08,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:44:08,857 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 09:44:08,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:44:08,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803877811] [2023-08-04 09:44:08,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803877811] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:44:08,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650322849] [2023-08-04 09:44:08,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:44:08,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:44:08,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:44:08,858 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:44:08,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-04 09:44:08,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:44:08,926 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 09:44:08,927 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:44:08,937 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 09:44:08,937 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:44:08,947 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 09:44:08,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650322849] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:44:08,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:44:08,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 09:44:08,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730301752] [2023-08-04 09:44:08,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:44:08,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:44:08,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:44:08,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:44:08,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:44:08,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 323 [2023-08-04 09:44:08,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 43 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 140.0) internal successors, (700), 5 states have internal predecessors, (700), 0 states have call successors, (0), 0 states 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 09:44:08,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:44:08,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 323 [2023-08-04 09:44:08,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:44:09,140 INFO L124 PetriNetUnfolderBase]: 1522/2239 cut-off events. [2023-08-04 09:44:09,141 INFO L125 PetriNetUnfolderBase]: For 299/299 co-relation queries the response was YES. [2023-08-04 09:44:09,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4970 conditions, 2239 events. 1522/2239 cut-off events. For 299/299 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 7934 event pairs, 364 based on Foata normal form. 8/1531 useless extension candidates. Maximal degree in co-relation 2911. Up to 1850 conditions per place. [2023-08-04 09:44:09,146 INFO L140 encePairwiseOnDemand]: 319/323 looper letters, 51 selfloop transitions, 3 changer transitions 1/59 dead transitions. [2023-08-04 09:44:09,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 59 transitions, 308 flow [2023-08-04 09:44:09,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 09:44:09,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 09:44:09,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 593 transitions. [2023-08-04 09:44:09,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45897832817337464 [2023-08-04 09:44:09,148 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 593 transitions. [2023-08-04 09:44:09,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 593 transitions. [2023-08-04 09:44:09,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:44:09,148 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 593 transitions. [2023-08-04 09:44:09,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 148.25) internal successors, (593), 4 states have internal predecessors, (593), 0 states have call successors, (0), 0 states 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 09:44:09,150 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 323.0) internal successors, (1615), 5 states have internal predecessors, (1615), 0 states have call successors, (0), 0 states 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 09:44:09,151 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 323.0) internal successors, (1615), 5 states have internal predecessors, (1615), 0 states have call successors, (0), 0 states 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 09:44:09,151 INFO L175 Difference]: Start difference. First operand has 46 places, 43 transitions, 166 flow. Second operand 4 states and 593 transitions. [2023-08-04 09:44:09,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 59 transitions, 308 flow [2023-08-04 09:44:09,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 59 transitions, 299 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 09:44:09,154 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 171 flow [2023-08-04 09:44:09,154 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=171, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2023-08-04 09:44:09,154 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 10 predicate places. [2023-08-04 09:44:09,154 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 171 flow [2023-08-04 09:44:09,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 140.0) internal successors, (700), 5 states have internal predecessors, (700), 0 states have call successors, (0), 0 states 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 09:44:09,154 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:44:09,155 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:44:09,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-08-04 09:44:09,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:44:09,361 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:44:09,361 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:44:09,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1953459215, now seen corresponding path program 1 times [2023-08-04 09:44:09,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:44:09,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045477196] [2023-08-04 09:44:09,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:44:09,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:44:09,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:44:09,396 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 09:44:09,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:44:09,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045477196] [2023-08-04 09:44:09,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045477196] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:44:09,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223856607] [2023-08-04 09:44:09,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:44:09,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:44:09,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:44:09,398 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:44:09,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-04 09:44:09,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:44:09,461 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 09:44:09,462 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:44:09,476 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 09:44:09,476 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:44:09,490 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 09:44:09,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223856607] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:44:09,490 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:44:09,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 09:44:09,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808618206] [2023-08-04 09:44:09,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:44:09,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:44:09,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:44:09,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:44:09,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:44:09,504 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 323 [2023-08-04 09:44:09,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 171 flow. Second operand has 5 states, 5 states have (on average 140.2) internal successors, (701), 5 states have internal predecessors, (701), 0 states have call successors, (0), 0 states 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 09:44:09,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:44:09,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 323 [2023-08-04 09:44:09,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:44:09,663 INFO L124 PetriNetUnfolderBase]: 1018/1519 cut-off events. [2023-08-04 09:44:09,663 INFO L125 PetriNetUnfolderBase]: For 403/403 co-relation queries the response was YES. [2023-08-04 09:44:09,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3402 conditions, 1519 events. 1018/1519 cut-off events. For 403/403 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 4803 event pairs, 215 based on Foata normal form. 32/1063 useless extension candidates. Maximal degree in co-relation 2731. Up to 665 conditions per place. [2023-08-04 09:44:09,668 INFO L140 encePairwiseOnDemand]: 319/323 looper letters, 57 selfloop transitions, 4 changer transitions 0/65 dead transitions. [2023-08-04 09:44:09,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 65 transitions, 346 flow [2023-08-04 09:44:09,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 09:44:09,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 09:44:09,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 599 transitions. [2023-08-04 09:44:09,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46362229102167185 [2023-08-04 09:44:09,669 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 599 transitions. [2023-08-04 09:44:09,669 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 599 transitions. [2023-08-04 09:44:09,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:44:09,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 599 transitions. [2023-08-04 09:44:09,671 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 149.75) internal successors, (599), 4 states have internal predecessors, (599), 0 states have call successors, (0), 0 states 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 09:44:09,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 323.0) internal successors, (1615), 5 states have internal predecessors, (1615), 0 states have call successors, (0), 0 states 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 09:44:09,672 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 323.0) internal successors, (1615), 5 states have internal predecessors, (1615), 0 states have call successors, (0), 0 states 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 09:44:09,672 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 171 flow. Second operand 4 states and 599 transitions. [2023-08-04 09:44:09,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 65 transitions, 346 flow [2023-08-04 09:44:09,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 65 transitions, 336 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 09:44:09,676 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 182 flow [2023-08-04 09:44:09,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=182, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2023-08-04 09:44:09,677 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 12 predicate places. [2023-08-04 09:44:09,677 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 182 flow [2023-08-04 09:44:09,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 140.2) internal successors, (701), 5 states have internal predecessors, (701), 0 states have call successors, (0), 0 states 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 09:44:09,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:44:09,678 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:44:09,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-04 09:44:09,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-08-04 09:44:09,882 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:44:09,883 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:44:09,883 INFO L85 PathProgramCache]: Analyzing trace with hash 921946927, now seen corresponding path program 1 times [2023-08-04 09:44:09,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:44:09,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971428357] [2023-08-04 09:44:09,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:44:09,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:44:09,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:44:09,934 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 09:44:09,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:44:09,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971428357] [2023-08-04 09:44:09,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971428357] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:44:09,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311816045] [2023-08-04 09:44:09,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:44:09,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:44:09,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:44:09,950 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:44:09,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-04 09:44:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:44:10,029 INFO L262 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 09:44:10,030 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:44:10,038 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 09:44:10,038 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:44:10,050 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 09:44:10,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311816045] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:44:10,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:44:10,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 09:44:10,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89797126] [2023-08-04 09:44:10,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:44:10,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:44:10,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:44:10,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:44:10,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:44:10,063 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 323 [2023-08-04 09:44:10,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 182 flow. Second operand has 5 states, 5 states have (on average 140.6) internal successors, (703), 5 states have internal predecessors, (703), 0 states have call successors, (0), 0 states 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 09:44:10,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:44:10,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 323 [2023-08-04 09:44:10,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:44:10,193 INFO L124 PetriNetUnfolderBase]: 1010/1504 cut-off events. [2023-08-04 09:44:10,194 INFO L125 PetriNetUnfolderBase]: For 688/688 co-relation queries the response was YES. [2023-08-04 09:44:10,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3570 conditions, 1504 events. 1010/1504 cut-off events. For 688/688 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 4717 event pairs, 439 based on Foata normal form. 9/1029 useless extension candidates. Maximal degree in co-relation 2912. Up to 1162 conditions per place. [2023-08-04 09:44:10,202 INFO L140 encePairwiseOnDemand]: 319/323 looper letters, 57 selfloop transitions, 3 changer transitions 2/66 dead transitions. [2023-08-04 09:44:10,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 66 transitions, 358 flow [2023-08-04 09:44:10,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 09:44:10,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 09:44:10,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 599 transitions. [2023-08-04 09:44:10,203 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46362229102167185 [2023-08-04 09:44:10,203 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 599 transitions. [2023-08-04 09:44:10,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 599 transitions. [2023-08-04 09:44:10,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:44:10,204 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 599 transitions. [2023-08-04 09:44:10,205 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 149.75) internal successors, (599), 4 states have internal predecessors, (599), 0 states have call successors, (0), 0 states 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 09:44:10,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 323.0) internal successors, (1615), 5 states have internal predecessors, (1615), 0 states have call successors, (0), 0 states 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 09:44:10,206 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 323.0) internal successors, (1615), 5 states have internal predecessors, (1615), 0 states have call successors, (0), 0 states 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 09:44:10,207 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 182 flow. Second operand 4 states and 599 transitions. [2023-08-04 09:44:10,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 66 transitions, 358 flow [2023-08-04 09:44:10,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 66 transitions, 354 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-04 09:44:10,209 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 186 flow [2023-08-04 09:44:10,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2023-08-04 09:44:10,210 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 16 predicate places. [2023-08-04 09:44:10,210 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 186 flow [2023-08-04 09:44:10,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 140.6) internal successors, (703), 5 states have internal predecessors, (703), 0 states have call successors, (0), 0 states 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 09:44:10,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:44:10,210 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:44:10,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-04 09:44:10,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-08-04 09:44:10,416 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:44:10,416 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:44:10,416 INFO L85 PathProgramCache]: Analyzing trace with hash 847038894, now seen corresponding path program 1 times [2023-08-04 09:44:10,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:44:10,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725731698] [2023-08-04 09:44:10,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:44:10,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:44:10,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:44:10,505 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-08-04 09:44:10,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:44:10,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725731698] [2023-08-04 09:44:10,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725731698] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:44:10,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 09:44:10,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 09:44:10,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633010134] [2023-08-04 09:44:10,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:44:10,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:44:10,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:44:10,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:44:10,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 09:44:10,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 323 [2023-08-04 09:44:10,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states 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 09:44:10,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:44:10,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 323 [2023-08-04 09:44:10,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:44:10,710 INFO L124 PetriNetUnfolderBase]: 1758/2494 cut-off events. [2023-08-04 09:44:10,710 INFO L125 PetriNetUnfolderBase]: For 1445/1445 co-relation queries the response was YES. [2023-08-04 09:44:10,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5963 conditions, 2494 events. 1758/2494 cut-off events. For 1445/1445 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 8965 event pairs, 445 based on Foata normal form. 1/1639 useless extension candidates. Maximal degree in co-relation 5737. Up to 1369 conditions per place. [2023-08-04 09:44:10,718 INFO L140 encePairwiseOnDemand]: 319/323 looper letters, 63 selfloop transitions, 3 changer transitions 1/71 dead transitions. [2023-08-04 09:44:10,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 71 transitions, 444 flow [2023-08-04 09:44:10,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:44:10,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:44:10,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 475 transitions. [2023-08-04 09:44:10,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49019607843137253 [2023-08-04 09:44:10,720 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 475 transitions. [2023-08-04 09:44:10,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 475 transitions. [2023-08-04 09:44:10,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:44:10,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 475 transitions. [2023-08-04 09:44:10,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:44:10,722 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 323.0) internal successors, (1292), 4 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states 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 09:44:10,723 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 323.0) internal successors, (1292), 4 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states 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 09:44:10,723 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 186 flow. Second operand 3 states and 475 transitions. [2023-08-04 09:44:10,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 71 transitions, 444 flow [2023-08-04 09:44:10,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 71 transitions, 428 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-04 09:44:10,728 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 197 flow [2023-08-04 09:44:10,728 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=197, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2023-08-04 09:44:10,729 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 16 predicate places. [2023-08-04 09:44:10,729 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 197 flow [2023-08-04 09:44:10,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.66666666666666) internal successors, (440), 3 states have internal predecessors, (440), 0 states have call successors, (0), 0 states 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 09:44:10,729 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:44:10,729 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:44:10,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-04 09:44:10,729 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:44:10,729 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:44:10,730 INFO L85 PathProgramCache]: Analyzing trace with hash 330515616, now seen corresponding path program 1 times [2023-08-04 09:44:10,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:44:10,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341768014] [2023-08-04 09:44:10,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:44:10,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:44:10,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:44:10,875 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 09:44:10,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:44:10,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341768014] [2023-08-04 09:44:10,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341768014] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:44:10,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 09:44:10,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 09:44:10,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409784887] [2023-08-04 09:44:10,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:44:10,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:44:10,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:44:10,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:44:10,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 09:44:10,883 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 323 [2023-08-04 09:44:10,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 197 flow. Second operand has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states 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 09:44:10,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:44:10,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 323 [2023-08-04 09:44:10,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:44:11,111 INFO L124 PetriNetUnfolderBase]: 2453/3649 cut-off events. [2023-08-04 09:44:11,111 INFO L125 PetriNetUnfolderBase]: For 1856/1856 co-relation queries the response was YES. [2023-08-04 09:44:11,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9146 conditions, 3649 events. 2453/3649 cut-off events. For 1856/1856 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 14849 event pairs, 1120 based on Foata normal form. 202/3166 useless extension candidates. Maximal degree in co-relation 8817. Up to 2625 conditions per place. [2023-08-04 09:44:11,124 INFO L140 encePairwiseOnDemand]: 318/323 looper letters, 64 selfloop transitions, 3 changer transitions 6/77 dead transitions. [2023-08-04 09:44:11,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 77 transitions, 489 flow [2023-08-04 09:44:11,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:44:11,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:44:11,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 467 transitions. [2023-08-04 09:44:11,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48194014447884415 [2023-08-04 09:44:11,125 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 467 transitions. [2023-08-04 09:44:11,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 467 transitions. [2023-08-04 09:44:11,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:44:11,126 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 467 transitions. [2023-08-04 09:44:11,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states 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 09:44:11,128 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 323.0) internal successors, (1292), 4 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states 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 09:44:11,128 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 323.0) internal successors, (1292), 4 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states 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 09:44:11,128 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 197 flow. Second operand 3 states and 467 transitions. [2023-08-04 09:44:11,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 77 transitions, 489 flow [2023-08-04 09:44:11,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 77 transitions, 486 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 09:44:11,135 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 215 flow [2023-08-04 09:44:11,136 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=215, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2023-08-04 09:44:11,136 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 18 predicate places. [2023-08-04 09:44:11,136 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 215 flow [2023-08-04 09:44:11,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states 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 09:44:11,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:44:11,136 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:44:11,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-04 09:44:11,137 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:44:11,137 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:44:11,137 INFO L85 PathProgramCache]: Analyzing trace with hash -732386050, now seen corresponding path program 1 times [2023-08-04 09:44:11,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:44:11,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702292454] [2023-08-04 09:44:11,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:44:11,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:44:11,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:44:11,251 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-08-04 09:44:11,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:44:11,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702292454] [2023-08-04 09:44:11,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702292454] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:44:11,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 09:44:11,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 09:44:11,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753872436] [2023-08-04 09:44:11,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:44:11,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 09:44:11,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:44:11,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 09:44:11,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-04 09:44:11,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 323 [2023-08-04 09:44:11,276 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 215 flow. Second operand has 4 states, 4 states have (on average 141.25) internal successors, (565), 4 states have internal predecessors, (565), 0 states have call successors, (0), 0 states 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 09:44:11,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:44:11,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 323 [2023-08-04 09:44:11,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:44:11,651 INFO L124 PetriNetUnfolderBase]: 2916/4525 cut-off events. [2023-08-04 09:44:11,651 INFO L125 PetriNetUnfolderBase]: For 3403/3403 co-relation queries the response was YES. [2023-08-04 09:44:11,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12233 conditions, 4525 events. 2916/4525 cut-off events. For 3403/3403 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 20770 event pairs, 1984 based on Foata normal form. 233/4753 useless extension candidates. Maximal degree in co-relation 11801. Up to 3420 conditions per place. [2023-08-04 09:44:11,670 INFO L140 encePairwiseOnDemand]: 318/323 looper letters, 42 selfloop transitions, 2 changer transitions 32/80 dead transitions. [2023-08-04 09:44:11,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 80 transitions, 521 flow [2023-08-04 09:44:11,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 09:44:11,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 09:44:11,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 602 transitions. [2023-08-04 09:44:11,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46594427244582043 [2023-08-04 09:44:11,672 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 602 transitions. [2023-08-04 09:44:11,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 602 transitions. [2023-08-04 09:44:11,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:44:11,672 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 602 transitions. [2023-08-04 09:44:11,674 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 150.5) internal successors, (602), 4 states have internal predecessors, (602), 0 states have call successors, (0), 0 states 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 09:44:11,675 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 323.0) internal successors, (1615), 5 states have internal predecessors, (1615), 0 states have call successors, (0), 0 states 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 09:44:11,676 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 323.0) internal successors, (1615), 5 states have internal predecessors, (1615), 0 states have call successors, (0), 0 states 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 09:44:11,676 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 215 flow. Second operand 4 states and 602 transitions. [2023-08-04 09:44:11,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 80 transitions, 521 flow [2023-08-04 09:44:11,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 80 transitions, 518 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 09:44:11,691 INFO L231 Difference]: Finished difference. Result has 60 places, 48 transitions, 228 flow [2023-08-04 09:44:11,691 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=228, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2023-08-04 09:44:11,691 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 22 predicate places. [2023-08-04 09:44:11,691 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 228 flow [2023-08-04 09:44:11,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 141.25) internal successors, (565), 4 states have internal predecessors, (565), 0 states have call successors, (0), 0 states 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 09:44:11,692 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:44:11,692 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:44:11,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-04 09:44:11,692 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:44:11,692 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:44:11,692 INFO L85 PathProgramCache]: Analyzing trace with hash -717165387, now seen corresponding path program 1 times [2023-08-04 09:44:11,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:44:11,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723373321] [2023-08-04 09:44:11,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:44:11,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:44:11,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:44:12,206 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 09:44:12,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:44:12,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723373321] [2023-08-04 09:44:12,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723373321] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:44:12,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717511045] [2023-08-04 09:44:12,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:44:12,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:44:12,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:44:12,219 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:44:12,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-04 09:44:12,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:44:12,314 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 37 conjunts are in the unsatisfiable core [2023-08-04 09:44:12,320 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:44:12,393 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-08-04 09:44:12,435 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-04 09:44:12,462 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-04 09:44:12,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 09:44:12,575 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-08-04 09:44:12,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 09:44:12,608 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-08-04 09:44:12,647 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 09:44:12,647 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:44:12,680 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_424 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_424) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))) is different from false [2023-08-04 09:44:12,860 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 09:44:12,860 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 45 [2023-08-04 09:44:12,867 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 09:44:12,868 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 100 treesize of output 92 [2023-08-04 09:44:12,872 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 60 treesize of output 48 [2023-08-04 09:44:12,879 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 09:44:12,879 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 51 treesize of output 47 [2023-08-04 09:44:12,955 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 11 not checked. [2023-08-04 09:44:12,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717511045] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:44:12,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:44:12,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 17 [2023-08-04 09:44:12,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846905631] [2023-08-04 09:44:12,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:44:12,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-04 09:44:12,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:44:12,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-04 09:44:12,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=249, Unknown=2, NotChecked=32, Total=342 [2023-08-04 09:44:12,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 323 [2023-08-04 09:44:12,959 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 228 flow. Second operand has 19 states, 19 states have (on average 105.52631578947368) internal successors, (2005), 19 states have internal predecessors, (2005), 0 states have call successors, (0), 0 states 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 09:44:12,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:44:12,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 323 [2023-08-04 09:44:12,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:44:17,700 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~queue~0.offset (* c_~front~0 4)))) (let ((.cse0 (select |c_#memory_int| c_~queue~0.base)) (.cse2 (forall ((v_ArrVal_424 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_424) c_~queue~0.base) .cse1))))) (and (= (select .cse0 .cse1) 5) .cse2 (or (<= c_~n~0 c_~back~0) (not (= 5 (select .cse0 (+ c_~queue~0.offset (* c_~back~0 4))))) .cse2 (< c_~back~0 0)) (= 5 c_~x~0)))) is different from false [2023-08-04 09:44:20,538 INFO L124 PetriNetUnfolderBase]: 17062/24159 cut-off events. [2023-08-04 09:44:20,538 INFO L125 PetriNetUnfolderBase]: For 21795/21795 co-relation queries the response was YES. [2023-08-04 09:44:20,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67717 conditions, 24159 events. 17062/24159 cut-off events. For 21795/21795 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 132153 event pairs, 1960 based on Foata normal form. 3/24157 useless extension candidates. Maximal degree in co-relation 67691. Up to 6591 conditions per place. [2023-08-04 09:44:20,635 INFO L140 encePairwiseOnDemand]: 291/323 looper letters, 367 selfloop transitions, 138 changer transitions 34/543 dead transitions. [2023-08-04 09:44:20,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 543 transitions, 3628 flow [2023-08-04 09:44:20,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-08-04 09:44:20,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-08-04 09:44:20,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 3030 transitions. [2023-08-04 09:44:20,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3752321981424149 [2023-08-04 09:44:20,642 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 3030 transitions. [2023-08-04 09:44:20,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 3030 transitions. [2023-08-04 09:44:20,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:44:20,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 3030 transitions. [2023-08-04 09:44:20,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 121.2) internal successors, (3030), 25 states have internal predecessors, (3030), 0 states have call successors, (0), 0 states 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 09:44:20,655 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 323.0) internal successors, (8398), 26 states have internal predecessors, (8398), 0 states have call successors, (0), 0 states 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 09:44:20,661 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 323.0) internal successors, (8398), 26 states have internal predecessors, (8398), 0 states have call successors, (0), 0 states 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 09:44:20,661 INFO L175 Difference]: Start difference. First operand has 60 places, 48 transitions, 228 flow. Second operand 25 states and 3030 transitions. [2023-08-04 09:44:20,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 543 transitions, 3628 flow [2023-08-04 09:44:20,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 543 transitions, 3604 flow, removed 11 selfloop flow, removed 2 redundant places. [2023-08-04 09:44:20,751 INFO L231 Difference]: Finished difference. Result has 95 places, 197 transitions, 1619 flow [2023-08-04 09:44:20,751 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1619, PETRI_PLACES=95, PETRI_TRANSITIONS=197} [2023-08-04 09:44:20,751 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 57 predicate places. [2023-08-04 09:44:20,752 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 197 transitions, 1619 flow [2023-08-04 09:44:20,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 105.52631578947368) internal successors, (2005), 19 states have internal predecessors, (2005), 0 states have call successors, (0), 0 states 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 09:44:20,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:44:20,757 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:44:20,762 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-08-04 09:44:20,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-04 09:44:20,962 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:44:20,962 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:44:20,962 INFO L85 PathProgramCache]: Analyzing trace with hash 100985475, now seen corresponding path program 1 times [2023-08-04 09:44:20,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:44:20,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741831830] [2023-08-04 09:44:20,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:44:20,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:44:21,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:44:22,093 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 09:44:22,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:44:22,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741831830] [2023-08-04 09:44:22,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741831830] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:44:22,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190014558] [2023-08-04 09:44:22,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:44:22,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:44:22,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:44:22,095 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:44:22,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-04 09:44:22,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:44:22,217 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 37 conjunts are in the unsatisfiable core [2023-08-04 09:44:22,221 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:44:22,250 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-08-04 09:44:22,308 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-04 09:44:22,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 09:44:22,381 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-08-04 09:44:22,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 09:44:22,440 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-08-04 09:44:22,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 09:44:22,468 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-08-04 09:44:22,584 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-04 09:44:22,584 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:44:22,635 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_468 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_468) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))))) is different from false [2023-08-04 09:44:22,666 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_468 (Array Int Int)) (v_ArrVal_466 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_466) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_468) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4))) 5)) is different from false [2023-08-04 09:44:22,834 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 09:44:22,835 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 45 [2023-08-04 09:44:22,843 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 09:44:22,843 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 100 treesize of output 92 [2023-08-04 09:44:22,849 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 60 treesize of output 48 [2023-08-04 09:44:22,853 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2023-08-04 09:44:22,857 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 24 treesize of output 18 [2023-08-04 09:44:22,944 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 12 not checked. [2023-08-04 09:44:22,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190014558] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:44:22,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:44:22,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 8] total 23 [2023-08-04 09:44:22,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884130989] [2023-08-04 09:44:22,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:44:22,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-04 09:44:22,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:44:22,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-04 09:44:22,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=427, Unknown=4, NotChecked=86, Total=600 [2023-08-04 09:44:22,986 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 323 [2023-08-04 09:44:22,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 197 transitions, 1619 flow. Second operand has 25 states, 25 states have (on average 95.84) internal successors, (2396), 25 states have internal predecessors, (2396), 0 states have call successors, (0), 0 states 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 09:44:22,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:44:22,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 323 [2023-08-04 09:44:22,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:44:23,957 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (= (select (select |c_#memory_int| c_~queue~0.base) .cse0) 5) (forall ((v_ArrVal_468 (Array Int Int)) (v_ArrVal_466 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_466) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_468) c_~queue~0.base) .cse0) 5)) (= 5 c_~x~0))) is different from false [2023-08-04 09:44:24,378 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4)))) (and (= (select (select |c_#memory_int| c_~queue~0.base) .cse0) 5) (forall ((v_ArrVal_468 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_468) c_~queue~0.base) .cse0))))) is different from false [2023-08-04 09:44:29,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 09:44:33,344 INFO L124 PetriNetUnfolderBase]: 33442/47105 cut-off events. [2023-08-04 09:44:33,344 INFO L125 PetriNetUnfolderBase]: For 193483/193650 co-relation queries the response was YES. [2023-08-04 09:44:33,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231262 conditions, 47105 events. 33442/47105 cut-off events. For 193483/193650 co-relation queries the response was YES. Maximal size of possible extension queue 1206. Compared 277123 event pairs, 3600 based on Foata normal form. 113/47214 useless extension candidates. Maximal degree in co-relation 224933. Up to 18545 conditions per place. [2023-08-04 09:44:33,611 INFO L140 encePairwiseOnDemand]: 289/323 looper letters, 602 selfloop transitions, 407 changer transitions 42/1055 dead transitions. [2023-08-04 09:44:33,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 1055 transitions, 11911 flow [2023-08-04 09:44:33,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-08-04 09:44:33,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2023-08-04 09:44:33,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 4562 transitions. [2023-08-04 09:44:33,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33628188117352203 [2023-08-04 09:44:33,619 INFO L72 ComplementDD]: Start complementDD. Operand 42 states and 4562 transitions. [2023-08-04 09:44:33,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 4562 transitions. [2023-08-04 09:44:33,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:44:33,621 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 4562 transitions. [2023-08-04 09:44:33,626 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 43 states, 42 states have (on average 108.61904761904762) internal successors, (4562), 42 states have internal predecessors, (4562), 0 states have call successors, (0), 0 states 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 09:44:33,637 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 43 states, 43 states have (on average 323.0) internal successors, (13889), 43 states have internal predecessors, (13889), 0 states have call successors, (0), 0 states 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 09:44:33,638 INFO L81 ComplementDD]: Finished complementDD. Result has 43 states, 43 states have (on average 323.0) internal successors, (13889), 43 states have internal predecessors, (13889), 0 states have call successors, (0), 0 states 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 09:44:33,638 INFO L175 Difference]: Start difference. First operand has 95 places, 197 transitions, 1619 flow. Second operand 42 states and 4562 transitions. [2023-08-04 09:44:33,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 1055 transitions, 11911 flow [2023-08-04 09:44:35,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 1055 transitions, 11555 flow, removed 176 selfloop flow, removed 2 redundant places. [2023-08-04 09:44:35,594 INFO L231 Difference]: Finished difference. Result has 164 places, 546 transitions, 6549 flow [2023-08-04 09:44:35,595 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=1489, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=6549, PETRI_PLACES=164, PETRI_TRANSITIONS=546} [2023-08-04 09:44:35,595 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 126 predicate places. [2023-08-04 09:44:35,595 INFO L495 AbstractCegarLoop]: Abstraction has has 164 places, 546 transitions, 6549 flow [2023-08-04 09:44:35,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 95.84) internal successors, (2396), 25 states have internal predecessors, (2396), 0 states have call successors, (0), 0 states 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 09:44:35,596 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:44:35,596 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:44:35,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-08-04 09:44:35,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:44:35,801 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:44:35,802 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:44:35,802 INFO L85 PathProgramCache]: Analyzing trace with hash 2020063565, now seen corresponding path program 2 times [2023-08-04 09:44:35,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:44:35,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984817639] [2023-08-04 09:44:35,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:44:35,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:44:35,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:44:35,901 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 09:44:35,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:44:35,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984817639] [2023-08-04 09:44:35,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984817639] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:44:35,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639978255] [2023-08-04 09:44:35,901 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 09:44:35,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:44:35,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:44:35,902 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:44:35,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-04 09:44:36,003 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 09:44:36,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 09:44:36,004 INFO L262 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-04 09:44:36,005 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:44:36,047 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 09:44:36,047 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:44:36,169 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 09:44:36,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639978255] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:44:36,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:44:36,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2023-08-04 09:44:36,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403121880] [2023-08-04 09:44:36,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:44:36,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-04 09:44:36,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:44:36,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-04 09:44:36,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2023-08-04 09:44:36,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 323 [2023-08-04 09:44:36,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 546 transitions, 6549 flow. Second operand has 8 states, 8 states have (on average 144.75) internal successors, (1158), 8 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states 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 09:44:36,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:44:36,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 323 [2023-08-04 09:44:36,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:44:46,770 INFO L124 PetriNetUnfolderBase]: 44206/62928 cut-off events. [2023-08-04 09:44:46,771 INFO L125 PetriNetUnfolderBase]: For 1040589/1041152 co-relation queries the response was YES. [2023-08-04 09:44:47,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 555422 conditions, 62928 events. 44206/62928 cut-off events. For 1040589/1041152 co-relation queries the response was YES. Maximal size of possible extension queue 1578. Compared 397364 event pairs, 9290 based on Foata normal form. 1673/64593 useless extension candidates. Maximal degree in co-relation 540892. Up to 33390 conditions per place. [2023-08-04 09:44:47,355 INFO L140 encePairwiseOnDemand]: 318/323 looper letters, 525 selfloop transitions, 136 changer transitions 4/669 dead transitions. [2023-08-04 09:44:47,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 669 transitions, 9649 flow [2023-08-04 09:44:47,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 09:44:47,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 09:44:47,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 641 transitions. [2023-08-04 09:44:47,356 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49613003095975233 [2023-08-04 09:44:47,356 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 641 transitions. [2023-08-04 09:44:47,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 641 transitions. [2023-08-04 09:44:47,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:44:47,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 641 transitions. [2023-08-04 09:44:47,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 160.25) internal successors, (641), 4 states have internal predecessors, (641), 0 states have call successors, (0), 0 states 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 09:44:47,359 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 323.0) internal successors, (1615), 5 states have internal predecessors, (1615), 0 states have call successors, (0), 0 states 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 09:44:47,359 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 323.0) internal successors, (1615), 5 states have internal predecessors, (1615), 0 states have call successors, (0), 0 states 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 09:44:47,359 INFO L175 Difference]: Start difference. First operand has 164 places, 546 transitions, 6549 flow. Second operand 4 states and 641 transitions. [2023-08-04 09:44:47,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 669 transitions, 9649 flow [2023-08-04 09:44:58,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 669 transitions, 8775 flow, removed 430 selfloop flow, removed 11 redundant places. [2023-08-04 09:44:58,893 INFO L231 Difference]: Finished difference. Result has 150 places, 545 transitions, 6299 flow [2023-08-04 09:44:58,893 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=4987, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=468, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=6299, PETRI_PLACES=150, PETRI_TRANSITIONS=545} [2023-08-04 09:44:58,894 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 112 predicate places. [2023-08-04 09:44:58,894 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 545 transitions, 6299 flow [2023-08-04 09:44:58,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 144.75) internal successors, (1158), 8 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states 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 09:44:58,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:44:58,894 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:44:58,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-08-04 09:44:59,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:44:59,098 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:44:59,098 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:44:59,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1313925673, now seen corresponding path program 2 times [2023-08-04 09:44:59,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:44:59,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066830687] [2023-08-04 09:44:59,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:44:59,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:44:59,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:44:59,711 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-04 09:44:59,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:44:59,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066830687] [2023-08-04 09:44:59,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066830687] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:44:59,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277769609] [2023-08-04 09:44:59,712 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 09:44:59,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:44:59,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:44:59,713 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:44:59,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-08-04 09:44:59,820 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 09:44:59,820 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 09:44:59,821 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-04 09:44:59,826 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:44:59,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 09:44:59,925 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-08-04 09:44:59,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 09:44:59,959 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-08-04 09:45:00,003 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-04 09:45:00,003 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:45:02,142 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 09:45:02,143 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 80 treesize of output 72 [2023-08-04 09:45:02,146 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 60 treesize of output 48 [2023-08-04 09:45:02,148 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2023-08-04 09:45:02,227 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-04 09:45:02,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277769609] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:45:02,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:45:02,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 17 [2023-08-04 09:45:02,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806437927] [2023-08-04 09:45:02,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:45:02,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-04 09:45:02,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:45:02,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-04 09:45:02,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=276, Unknown=11, NotChecked=0, Total=342 [2023-08-04 09:45:02,751 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 323 [2023-08-04 09:45:02,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 545 transitions, 6299 flow. Second operand has 19 states, 19 states have (on average 105.15789473684211) internal successors, (1998), 19 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states 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 09:45:02,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:45:02,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 323 [2023-08-04 09:45:02,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:45:15,400 INFO L124 PetriNetUnfolderBase]: 56496/80616 cut-off events. [2023-08-04 09:45:15,400 INFO L125 PetriNetUnfolderBase]: For 965223/965844 co-relation queries the response was YES. [2023-08-04 09:45:15,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 642907 conditions, 80616 events. 56496/80616 cut-off events. For 965223/965844 co-relation queries the response was YES. Maximal size of possible extension queue 1987. Compared 527577 event pairs, 13314 based on Foata normal form. 122/80715 useless extension candidates. Maximal degree in co-relation 625255. Up to 38718 conditions per place. [2023-08-04 09:45:16,416 INFO L140 encePairwiseOnDemand]: 315/323 looper letters, 641 selfloop transitions, 181 changer transitions 21/847 dead transitions. [2023-08-04 09:45:16,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 847 transitions, 12159 flow [2023-08-04 09:45:16,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-04 09:45:16,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-04 09:45:16,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1329 transitions. [2023-08-04 09:45:16,418 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37405009850830284 [2023-08-04 09:45:16,418 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1329 transitions. [2023-08-04 09:45:16,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1329 transitions. [2023-08-04 09:45:16,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:45:16,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1329 transitions. [2023-08-04 09:45:16,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 120.81818181818181) internal successors, (1329), 11 states have internal predecessors, (1329), 0 states have call successors, (0), 0 states 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 09:45:16,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 323.0) internal successors, (3876), 12 states have internal predecessors, (3876), 0 states have call successors, (0), 0 states 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 09:45:16,423 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 323.0) internal successors, (3876), 12 states have internal predecessors, (3876), 0 states have call successors, (0), 0 states 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 09:45:16,423 INFO L175 Difference]: Start difference. First operand has 150 places, 545 transitions, 6299 flow. Second operand 11 states and 1329 transitions. [2023-08-04 09:45:16,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 847 transitions, 12159 flow [2023-08-04 09:45:27,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 847 transitions, 12119 flow, removed 20 selfloop flow, removed 0 redundant places. [2023-08-04 09:45:27,773 INFO L231 Difference]: Finished difference. Result has 161 places, 575 transitions, 7195 flow [2023-08-04 09:45:27,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=6283, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=151, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=7195, PETRI_PLACES=161, PETRI_TRANSITIONS=575} [2023-08-04 09:45:27,774 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 123 predicate places. [2023-08-04 09:45:27,774 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 575 transitions, 7195 flow [2023-08-04 09:45:27,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 105.15789473684211) internal successors, (1998), 19 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states 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 09:45:27,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:45:27,775 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:45:27,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-08-04 09:45:27,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:45:27,979 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:45:27,979 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:45:27,979 INFO L85 PathProgramCache]: Analyzing trace with hash 305118322, now seen corresponding path program 1 times [2023-08-04 09:45:27,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:45:27,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545378024] [2023-08-04 09:45:27,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:45:27,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:45:27,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:45:28,067 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 09:45:28,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:45:28,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545378024] [2023-08-04 09:45:28,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545378024] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:45:28,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505723528] [2023-08-04 09:45:28,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:45:28,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:45:28,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:45:28,069 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:45:28,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-08-04 09:45:28,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:45:28,171 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-04 09:45:28,172 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:45:28,245 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 09:45:28,245 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:45:28,322 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 09:45:28,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505723528] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:45:28,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:45:28,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-08-04 09:45:28,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095478336] [2023-08-04 09:45:28,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:45:28,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-04 09:45:28,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:45:28,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-04 09:45:28,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-08-04 09:45:28,409 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 323 [2023-08-04 09:45:28,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 575 transitions, 7195 flow. Second operand has 12 states, 12 states have (on average 134.41666666666666) internal successors, (1613), 12 states have internal predecessors, (1613), 0 states have call successors, (0), 0 states 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 09:45:28,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:45:28,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 323 [2023-08-04 09:45:28,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:45:36,210 INFO L124 PetriNetUnfolderBase]: 33200/49300 cut-off events. [2023-08-04 09:45:36,211 INFO L125 PetriNetUnfolderBase]: For 614286/614409 co-relation queries the response was YES. [2023-08-04 09:45:36,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 406365 conditions, 49300 events. 33200/49300 cut-off events. For 614286/614409 co-relation queries the response was YES. Maximal size of possible extension queue 1202. Compared 322390 event pairs, 17401 based on Foata normal form. 1444/50732 useless extension candidates. Maximal degree in co-relation 406267. Up to 39839 conditions per place. [2023-08-04 09:45:36,676 INFO L140 encePairwiseOnDemand]: 318/323 looper letters, 196 selfloop transitions, 3 changer transitions 101/304 dead transitions. [2023-08-04 09:45:36,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 304 transitions, 4640 flow [2023-08-04 09:45:36,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-04 09:45:36,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-04 09:45:36,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 877 transitions. [2023-08-04 09:45:36,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45252837977296184 [2023-08-04 09:45:36,678 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 877 transitions. [2023-08-04 09:45:36,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 877 transitions. [2023-08-04 09:45:36,678 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:45:36,678 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 877 transitions. [2023-08-04 09:45:36,679 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 146.16666666666666) internal successors, (877), 6 states have internal predecessors, (877), 0 states have call successors, (0), 0 states 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 09:45:36,680 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 323.0) internal successors, (2261), 7 states have internal predecessors, (2261), 0 states have call successors, (0), 0 states 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 09:45:36,680 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 323.0) internal successors, (2261), 7 states have internal predecessors, (2261), 0 states have call successors, (0), 0 states 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 09:45:36,681 INFO L175 Difference]: Start difference. First operand has 161 places, 575 transitions, 7195 flow. Second operand 6 states and 877 transitions. [2023-08-04 09:45:36,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 304 transitions, 4640 flow [2023-08-04 09:45:43,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 304 transitions, 4155 flow, removed 185 selfloop flow, removed 17 redundant places. [2023-08-04 09:45:43,875 INFO L231 Difference]: Finished difference. Result has 134 places, 203 transitions, 2253 flow [2023-08-04 09:45:43,875 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=2842, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2253, PETRI_PLACES=134, PETRI_TRANSITIONS=203} [2023-08-04 09:45:43,875 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 96 predicate places. [2023-08-04 09:45:43,875 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 203 transitions, 2253 flow [2023-08-04 09:45:43,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 134.41666666666666) internal successors, (1613), 12 states have internal predecessors, (1613), 0 states have call successors, (0), 0 states 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 09:45:43,876 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:45:43,876 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:45:43,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-08-04 09:45:44,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-08-04 09:45:44,081 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:45:44,081 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:45:44,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1847397668, now seen corresponding path program 3 times [2023-08-04 09:45:44,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:45:44,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120013840] [2023-08-04 09:45:44,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:45:44,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:45:44,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:45:44,889 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 09:45:44,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:45:44,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120013840] [2023-08-04 09:45:44,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120013840] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:45:44,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917014911] [2023-08-04 09:45:44,889 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-04 09:45:44,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:45:44,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:45:44,890 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:45:44,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-08-04 09:45:44,999 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-08-04 09:45:45,000 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 09:45:45,001 INFO L262 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-04 09:45:45,003 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:45:45,058 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-08-04 09:45:45,105 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-04 09:45:45,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 09:45:45,200 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 19 treesize of output 21 [2023-08-04 09:45:45,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 09:45:45,275 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2023-08-04 09:45:45,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 09:45:45,302 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 19 treesize of output 21 [2023-08-04 09:45:45,385 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-04 09:45:45,385 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:45:45,445 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_636 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_636) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4) 4)))) is different from false [2023-08-04 09:45:47,749 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 09:45:47,749 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 47 [2023-08-04 09:45:47,757 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 09:45:47,758 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 106 treesize of output 96 [2023-08-04 09:45:47,763 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 63 treesize of output 49 [2023-08-04 09:45:47,770 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 27 treesize of output 20 [2023-08-04 09:45:47,775 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 25 treesize of output 18 [2023-08-04 09:45:47,936 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 11 trivial. 10 not checked. [2023-08-04 09:45:47,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917014911] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:45:47,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:45:47,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 28 [2023-08-04 09:45:47,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333138344] [2023-08-04 09:45:47,937 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:45:47,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-04 09:45:47,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:45:47,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-04 09:45:47,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=691, Unknown=6, NotChecked=54, Total=870 [2023-08-04 09:45:48,053 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 323 [2023-08-04 09:45:48,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 203 transitions, 2253 flow. Second operand has 30 states, 30 states have (on average 104.6) internal successors, (3138), 30 states have internal predecessors, (3138), 0 states have call successors, (0), 0 states 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 09:45:48,055 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:45:48,055 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 323 [2023-08-04 09:45:48,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:45:49,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 09:45:50,781 WARN L839 $PredicateComparison]: unable to prove that (and (= 5 c_~x~0) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_636 (Array Int Int))) (= 5 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_634) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_636) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4) 4))))) is different from false [2023-08-04 09:45:51,149 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue~0.offset (* c_~front~0 4) 4))) (and (forall ((v_ArrVal_636 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_636) c_~queue~0.base) .cse0))) (forall ((v_ArrVal_634 (Array Int Int)) (v_ArrVal_636 (Array Int Int))) (= 5 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_634) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_636) c_~queue~0.base) .cse0))))) is different from false [2023-08-04 09:45:53,423 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 09:45:55,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 09:45:57,475 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 09:46:00,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 09:46:02,231 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 09:46:04,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 09:46:06,289 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 09:46:18,147 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 09:46:20,153 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 09:46:22,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 09:46:24,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 09:46:26,221 INFO L124 PetriNetUnfolderBase]: 66369/95093 cut-off events. [2023-08-04 09:46:26,221 INFO L125 PetriNetUnfolderBase]: For 806161/806358 co-relation queries the response was YES. [2023-08-04 09:46:26,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 664838 conditions, 95093 events. 66369/95093 cut-off events. For 806161/806358 co-relation queries the response was YES. Maximal size of possible extension queue 2240. Compared 647390 event pairs, 13165 based on Foata normal form. 96/95176 useless extension candidates. Maximal degree in co-relation 664777. Up to 48182 conditions per place. [2023-08-04 09:46:27,091 INFO L140 encePairwiseOnDemand]: 308/323 looper letters, 604 selfloop transitions, 255 changer transitions 27/890 dead transitions. [2023-08-04 09:46:27,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 890 transitions, 12196 flow [2023-08-04 09:46:27,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-08-04 09:46:27,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2023-08-04 09:46:27,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 3843 transitions. [2023-08-04 09:46:27,095 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36054038840416547 [2023-08-04 09:46:27,095 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 3843 transitions. [2023-08-04 09:46:27,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 3843 transitions. [2023-08-04 09:46:27,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:46:27,096 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 3843 transitions. [2023-08-04 09:46:27,103 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 116.45454545454545) internal successors, (3843), 33 states have internal predecessors, (3843), 0 states have call successors, (0), 0 states 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 09:46:27,111 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 323.0) internal successors, (10982), 34 states have internal predecessors, (10982), 0 states have call successors, (0), 0 states 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 09:46:27,112 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 323.0) internal successors, (10982), 34 states have internal predecessors, (10982), 0 states have call successors, (0), 0 states 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 09:46:27,112 INFO L175 Difference]: Start difference. First operand has 134 places, 203 transitions, 2253 flow. Second operand 33 states and 3843 transitions. [2023-08-04 09:46:27,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 890 transitions, 12196 flow [2023-08-04 09:46:34,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 890 transitions, 12020 flow, removed 85 selfloop flow, removed 9 redundant places. [2023-08-04 09:46:34,229 INFO L231 Difference]: Finished difference. Result has 161 places, 424 transitions, 5906 flow [2023-08-04 09:46:34,230 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=2231, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=5906, PETRI_PLACES=161, PETRI_TRANSITIONS=424} [2023-08-04 09:46:34,230 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 123 predicate places. [2023-08-04 09:46:34,230 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 424 transitions, 5906 flow [2023-08-04 09:46:34,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 104.6) internal successors, (3138), 30 states have internal predecessors, (3138), 0 states have call successors, (0), 0 states 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 09:46:34,231 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:46:34,231 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:46:34,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-08-04 09:46:34,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:46:34,436 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:46:34,436 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:46:34,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1967762976, now seen corresponding path program 1 times [2023-08-04 09:46:34,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:46:34,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127276236] [2023-08-04 09:46:34,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:46:34,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:46:34,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:46:34,874 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 09:46:34,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:46:34,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127276236] [2023-08-04 09:46:34,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127276236] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:46:34,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946449154] [2023-08-04 09:46:34,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:46:34,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:46:34,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:46:34,875 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:46:34,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-08-04 09:46:34,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:46:34,985 INFO L262 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 40 conjunts are in the unsatisfiable core [2023-08-04 09:46:34,988 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:46:35,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 09:46:35,207 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-08-04 09:46:35,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 09:46:35,267 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-08-04 09:46:35,388 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 09:46:35,388 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:46:35,497 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 09:46:35,497 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 44 treesize of output 37 [2023-08-04 09:46:35,504 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2023-08-04 09:46:35,690 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 09:46:35,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946449154] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:46:35,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:46:35,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 25 [2023-08-04 09:46:35,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312155308] [2023-08-04 09:46:35,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:46:35,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-08-04 09:46:35,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:46:35,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-08-04 09:46:35,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=601, Unknown=1, NotChecked=0, Total=702 [2023-08-04 09:46:36,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 323 [2023-08-04 09:46:36,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 424 transitions, 5906 flow. Second operand has 27 states, 27 states have (on average 119.62962962962963) internal successors, (3230), 27 states have internal predecessors, (3230), 0 states have call successors, (0), 0 states 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 09:46:36,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:46:36,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 323 [2023-08-04 09:46:36,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:46:36,733 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_680 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_680) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4) 4)))) (= 5 c_~x~0)) is different from false [2023-08-04 09:46:40,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 09:47:14,245 INFO L124 PetriNetUnfolderBase]: 146970/209421 cut-off events. [2023-08-04 09:47:14,246 INFO L125 PetriNetUnfolderBase]: For 2771946/2772370 co-relation queries the response was YES. [2023-08-04 09:47:15,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1672460 conditions, 209421 events. 146970/209421 cut-off events. For 2771946/2772370 co-relation queries the response was YES. Maximal size of possible extension queue 4914. Compared 1551510 event pairs, 25694 based on Foata normal form. 91/209471 useless extension candidates. Maximal degree in co-relation 1623151. Up to 106157 conditions per place. [2023-08-04 09:47:16,783 INFO L140 encePairwiseOnDemand]: 289/323 looper letters, 1158 selfloop transitions, 524 changer transitions 59/1745 dead transitions. [2023-08-04 09:47:16,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 1745 transitions, 27406 flow [2023-08-04 09:47:16,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2023-08-04 09:47:16,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2023-08-04 09:47:16,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 5427 transitions. [2023-08-04 09:47:16,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4308168611574184 [2023-08-04 09:47:16,789 INFO L72 ComplementDD]: Start complementDD. Operand 39 states and 5427 transitions. [2023-08-04 09:47:16,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 5427 transitions. [2023-08-04 09:47:16,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:47:16,790 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 39 states and 5427 transitions. [2023-08-04 09:47:16,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 40 states, 39 states have (on average 139.15384615384616) internal successors, (5427), 39 states have internal predecessors, (5427), 0 states have call successors, (0), 0 states 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 09:47:16,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 40 states, 40 states have (on average 323.0) internal successors, (12920), 40 states have internal predecessors, (12920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:47:16,802 INFO L81 ComplementDD]: Finished complementDD. Result has 40 states, 40 states have (on average 323.0) internal successors, (12920), 40 states have internal predecessors, (12920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:47:16,802 INFO L175 Difference]: Start difference. First operand has 161 places, 424 transitions, 5906 flow. Second operand 39 states and 5427 transitions. [2023-08-04 09:47:16,802 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 1745 transitions, 27406 flow [2023-08-04 09:47:38,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 1745 transitions, 25022 flow, removed 1183 selfloop flow, removed 7 redundant places. [2023-08-04 09:47:38,053 INFO L231 Difference]: Finished difference. Result has 205 places, 804 transitions, 12221 flow [2023-08-04 09:47:38,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=323, PETRI_DIFFERENCE_MINUEND_FLOW=5154, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=223, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=12221, PETRI_PLACES=205, PETRI_TRANSITIONS=804} [2023-08-04 09:47:38,054 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 167 predicate places. [2023-08-04 09:47:38,054 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 804 transitions, 12221 flow [2023-08-04 09:47:38,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 119.62962962962963) internal successors, (3230), 27 states have internal predecessors, (3230), 0 states have call successors, (0), 0 states 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 09:47:38,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:47:38,055 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:47:38,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-08-04 09:47:38,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:47:38,260 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:47:38,260 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:47:38,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1452278934, now seen corresponding path program 4 times [2023-08-04 09:47:38,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:47:38,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544704105] [2023-08-04 09:47:38,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:47:38,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:47:38,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:47:38,838 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-04 09:47:38,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:47:38,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544704105] [2023-08-04 09:47:38,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544704105] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:47:38,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622067349] [2023-08-04 09:47:38,838 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-04 09:47:38,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:47:38,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:47:38,839 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:47:38,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-08-04 09:47:38,958 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-04 09:47:38,959 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 09:47:38,960 INFO L262 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-04 09:47:38,962 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:47:39,022 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-08-04 09:47:39,076 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-04 09:47:39,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 09:47:39,171 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 19 treesize of output 21 [2023-08-04 09:47:39,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 09:47:39,229 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 19 treesize of output 21 [2023-08-04 09:47:39,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 09:47:39,285 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-08-04 09:47:39,344 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-04 09:47:39,344 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:47:39,486 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_728 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_726) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_728) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4) 4)) 5)) is different from false [2023-08-04 09:47:39,733 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 09:47:39,734 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 47 [2023-08-04 09:47:39,741 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 09:47:39,742 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 106 treesize of output 96 [2023-08-04 09:47:39,746 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 34 treesize of output 27 [2023-08-04 09:47:39,751 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 56 treesize of output 42 [2023-08-04 09:47:39,755 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 25 treesize of output 18 [2023-08-04 09:47:39,883 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 4 not checked. [2023-08-04 09:47:39,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1622067349] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:47:39,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:47:39,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 28 [2023-08-04 09:47:39,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151362614] [2023-08-04 09:47:39,884 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:47:39,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-08-04 09:47:39,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:47:39,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-08-04 09:47:39,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=692, Unknown=7, NotChecked=54, Total=870 [2023-08-04 09:47:40,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 323 [2023-08-04 09:47:40,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 804 transitions, 12221 flow. Second operand has 30 states, 30 states have (on average 104.73333333333333) internal successors, (3142), 30 states have internal predecessors, (3142), 0 states have call successors, (0), 0 states 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 09:47:40,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:47:40,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 323 [2023-08-04 09:47:40,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:47:42,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 09:47:44,973 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 09:47:47,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 09:47:47,148 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (* c_~back~0 4))) (let ((.cse4 (+ c_~queue~0.offset .cse5 4)) (.cse1 (<= c_~n~0 (+ c_~back~0 1))) (.cse0 (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_728 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_726) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_728) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4) 4)) 5))) (.cse3 (select |c_#memory_int| c_~queue~0.base)) (.cse2 (< c_~back~0 0))) (and .cse0 (or .cse0 .cse1 .cse2 (not (= 5 (select .cse3 .cse4)))) (= 5 c_~x~0) (or (forall ((v_ArrVal_725 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_725) c_~queue~0.base) .cse4) 5))) .cse0 .cse1 .cse2) (or .cse0 (<= c_~n~0 c_~back~0) (not (= 5 (select .cse3 (+ c_~queue~0.offset .cse5)))) .cse2)))) is different from false [2023-08-04 09:47:51,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 09:47:53,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 09:47:53,515 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_~queue~0.offset (* c_~front~0 4) 4)) (.cse6 (* c_~back~0 4))) (let ((.cse4 (+ c_~queue~0.offset .cse6 4)) (.cse1 (<= c_~n~0 (+ c_~back~0 1))) (.cse0 (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_728 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_726) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_728) c_~queue~0.base) .cse5) 5))) (.cse3 (select |c_#memory_int| c_~queue~0.base)) (.cse2 (< c_~back~0 0))) (and .cse0 (or .cse0 .cse1 .cse2 (not (= 5 (select .cse3 .cse4)))) (= 5 c_~x~0) (forall ((v_ArrVal_728 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_728) c_~queue~0.base) .cse5))) (or (forall ((v_ArrVal_725 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_725) c_~queue~0.base) .cse4) 5))) .cse0 .cse1 .cse2) (or .cse0 (<= c_~n~0 c_~back~0) (not (= 5 (select .cse3 (+ c_~queue~0.offset .cse6)))) .cse2)))) is different from false [2023-08-04 09:47:55,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 09:47:57,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 09:47:59,964 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 09:48:01,993 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 09:48:04,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 09:48:06,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 09:48:06,158 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_728 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_726) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_728) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4) 4)) 5)))) (and .cse0 (or .cse0 (<= c_~n~0 (+ c_~back~0 1)) (< c_~back~0 0) (not (= 5 (select (select |c_#memory_int| c_~queue~0.base) (+ c_~queue~0.offset (* c_~back~0 4) 4))))))) is different from false [2023-08-04 09:48:08,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 09:48:08,224 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~queue~0.offset (* c_~front~0 4) 4))) (let ((.cse0 (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_728 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_726) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_728) c_~queue~0.base) .cse4) 5))) (.cse2 (select |c_#memory_int| c_~queue~0.base)) (.cse3 (* c_~back~0 4)) (.cse1 (< c_~back~0 0))) (and .cse0 (or .cse0 (<= c_~n~0 (+ c_~back~0 1)) .cse1 (not (= 5 (select .cse2 (+ c_~queue~0.offset .cse3 4))))) (forall ((v_ArrVal_728 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_728) c_~queue~0.base) .cse4))) (or .cse0 (<= c_~n~0 c_~back~0) (not (= 5 (select .cse2 (+ c_~queue~0.offset .cse3)))) .cse1)))) is different from false [2023-08-04 09:48:10,346 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 09:48:12,561 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 09:48:14,577 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 09:48:16,596 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 09:48:16,621 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_~queue~0.offset (* c_~front~0 4) 4)) (.cse6 (* c_~back~0 4))) (let ((.cse4 (+ c_~queue~0.offset .cse6 4)) (.cse1 (<= c_~n~0 (+ c_~back~0 1))) (.cse0 (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_728 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_726) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_728) c_~queue~0.base) .cse5) 5))) (.cse3 (select |c_#memory_int| c_~queue~0.base)) (.cse2 (< c_~back~0 0))) (and (or .cse0 .cse1 .cse2 (not (= 5 (select .cse3 .cse4)))) (= 5 c_~x~0) (forall ((v_ArrVal_728 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_728) c_~queue~0.base) .cse5))) (or (forall ((v_ArrVal_725 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_725) c_~queue~0.base) .cse4) 5))) .cse0 .cse1 .cse2) (or .cse0 (<= c_~n~0 c_~back~0) (not (= 5 (select .cse3 (+ c_~queue~0.offset .cse6)))) .cse2)))) is different from false [2023-08-04 09:48:18,726 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 09:48:20,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 09:48:22,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 09:48:24,832 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 09:48:26,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 09:48:28,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 09:48:33,042 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 09:48:33,065 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~queue~0.offset (* c_~front~0 4) 4))) (let ((.cse0 (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_728 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_726) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_728) c_~queue~0.base) .cse4) 5))) (.cse2 (select |c_#memory_int| c_~queue~0.base)) (.cse3 (* c_~back~0 4)) (.cse1 (< c_~back~0 0))) (and (or .cse0 (<= c_~n~0 (+ c_~back~0 1)) .cse1 (not (= 5 (select .cse2 (+ c_~queue~0.offset .cse3 4))))) (forall ((v_ArrVal_728 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_728) c_~queue~0.base) .cse4))) (or .cse0 (<= c_~n~0 c_~back~0) (not (= 5 (select .cse2 (+ c_~queue~0.offset .cse3)))) .cse1)))) is different from false [2023-08-04 09:48:35,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 09:48:35,336 WARN L839 $PredicateComparison]: unable to prove that (and (= 5 c_~x~0) (forall ((v_ArrVal_728 (Array Int Int))) (= 5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_728) c_~queue~0.base) (+ c_~queue~0.offset (* c_~front~0 4) 4))))) is different from false [2023-08-04 09:48:37,969 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 09:48:39,989 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 09:48:42,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 09:48:44,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 09:48:46,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 09:48:48,508 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 09:48:50,533 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 09:48:52,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 09:48:54,753 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 09:48:59,342 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 09:49:01,365 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 09:49:03,719 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 09:49:05,900 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 09:49:08,767 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 09:49:11,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 09:49:18,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 09:49:21,403 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 09:49:23,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 09:49:36,042 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 09:50:15,562 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 09:50:17,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 09:50:19,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 09:50:30,074 INFO L124 PetriNetUnfolderBase]: 215231/304927 cut-off events. [2023-08-04 09:50:30,074 INFO L125 PetriNetUnfolderBase]: For 4598468/4600354 co-relation queries the response was YES. [2023-08-04 09:50:33,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2566314 conditions, 304927 events. 215231/304927 cut-off events. For 4598468/4600354 co-relation queries the response was YES. Maximal size of possible extension queue 6591. Compared 2301401 event pairs, 34101 based on Foata normal form. 129/304968 useless extension candidates. Maximal degree in co-relation 2496317. Up to 193943 conditions per place. [2023-08-04 09:50:34,658 INFO L140 encePairwiseOnDemand]: 289/323 looper letters, 1107 selfloop transitions, 1051 changer transitions 62/2224 dead transitions. [2023-08-04 09:50:34,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 2224 transitions, 36425 flow [2023-08-04 09:50:34,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2023-08-04 09:50:34,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2023-08-04 09:50:34,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 6203 transitions. [2023-08-04 09:50:34,688 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36931412241009764 [2023-08-04 09:50:34,688 INFO L72 ComplementDD]: Start complementDD. Operand 52 states and 6203 transitions. [2023-08-04 09:50:34,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 6203 transitions. [2023-08-04 09:50:34,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:50:34,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 52 states and 6203 transitions. [2023-08-04 09:50:34,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 53 states, 52 states have (on average 119.28846153846153) internal successors, (6203), 52 states have internal predecessors, (6203), 0 states have call successors, (0), 0 states 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 09:50:34,707 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 53 states, 53 states have (on average 323.0) internal successors, (17119), 53 states have internal predecessors, (17119), 0 states have call successors, (0), 0 states 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 09:50:34,708 INFO L81 ComplementDD]: Finished complementDD. Result has 53 states, 53 states have (on average 323.0) internal successors, (17119), 53 states have internal predecessors, (17119), 0 states have call successors, (0), 0 states 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 09:50:34,708 INFO L175 Difference]: Start difference. First operand has 205 places, 804 transitions, 12221 flow. Second operand 52 states and 6203 transitions. [2023-08-04 09:50:34,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 2224 transitions, 36425 flow