/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 INSUFFICIENT_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-bad-counter-queue2.wvr_bound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 02:46:37,577 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 02:46:37,651 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 02:46:37,660 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 02:46:37,661 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 02:46:37,661 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 02:46:37,661 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 02:46:37,697 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 02:46:37,698 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 02:46:37,702 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 02:46:37,702 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 02:46:37,703 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 02:46:37,703 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 02:46:37,705 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 02:46:37,705 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 02:46:37,705 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 02:46:37,705 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 02:46:37,705 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 02:46:37,706 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 02:46:37,706 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 02:46:37,706 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 02:46:37,706 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 02:46:37,707 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 02:46:37,707 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 02:46:37,707 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 02:46:37,707 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 02:46:37,707 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 02:46:37,708 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 02:46:37,708 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 02:46:37,708 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 02:46:37,709 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 02:46:37,709 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 02:46:37,710 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 02:46:37,710 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 02:46:37,710 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 02:46:37,710 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 02:46:37,710 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 02:46:37,710 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 02:46:37,710 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 02:46:37,711 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 02:46:37,711 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 02:46:37,711 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 -> INSUFFICIENT_FIRST [2023-08-04 02:46:37,944 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 02:46:37,969 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 02:46:37,971 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 02:46:37,972 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 02:46:37,972 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 02:46:37,974 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-bad-counter-queue2.wvr_bound2.c [2023-08-04 02:46:39,081 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 02:46:39,274 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 02:46:39,274 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-bad-counter-queue2.wvr_bound2.c [2023-08-04 02:46:39,283 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ce48d8e1/511725d64e7444a1b15f6e8a8ba442d3/FLAGe365e7246 [2023-08-04 02:46:39,301 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ce48d8e1/511725d64e7444a1b15f6e8a8ba442d3 [2023-08-04 02:46:39,307 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 02:46:39,309 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 02:46:39,312 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 02:46:39,312 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 02:46:39,316 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 02:46:39,317 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 02:46:39" (1/1) ... [2023-08-04 02:46:39,318 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@459f491b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:46:39, skipping insertion in model container [2023-08-04 02:46:39,318 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 02:46:39" (1/1) ... [2023-08-04 02:46:39,344 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 02:46:39,472 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-bad-counter-queue2.wvr_bound2.c[2433,2446] [2023-08-04 02:46:39,480 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 02:46:39,488 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 02:46:39,507 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-bad-counter-queue2.wvr_bound2.c[2433,2446] [2023-08-04 02:46:39,511 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 02:46:39,518 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 02:46:39,518 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 02:46:39,524 INFO L206 MainTranslator]: Completed translation [2023-08-04 02:46:39,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:46:39 WrapperNode [2023-08-04 02:46:39,525 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 02:46:39,526 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 02:46:39,526 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 02:46:39,526 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 02:46:39,532 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:46:39" (1/1) ... [2023-08-04 02:46:39,539 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:46:39" (1/1) ... [2023-08-04 02:46:39,560 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 172 [2023-08-04 02:46:39,560 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 02:46:39,561 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 02:46:39,561 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 02:46:39,561 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 02:46:39,569 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:46:39" (1/1) ... [2023-08-04 02:46:39,569 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:46:39" (1/1) ... [2023-08-04 02:46:39,582 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:46:39" (1/1) ... [2023-08-04 02:46:39,582 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:46:39" (1/1) ... [2023-08-04 02:46:39,588 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:46:39" (1/1) ... [2023-08-04 02:46:39,592 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:46:39" (1/1) ... [2023-08-04 02:46:39,594 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:46:39" (1/1) ... [2023-08-04 02:46:39,595 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:46:39" (1/1) ... [2023-08-04 02:46:39,598 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 02:46:39,599 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 02:46:39,599 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 02:46:39,599 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 02:46:39,600 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:46:39" (1/1) ... [2023-08-04 02:46:39,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 02:46:39,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:46:39,638 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 02:46:39,663 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 02:46:39,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 02:46:39,674 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 02:46:39,674 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 02:46:39,674 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-04 02:46:39,674 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-04 02:46:39,675 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-04 02:46:39,675 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-04 02:46:39,675 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-04 02:46:39,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 02:46:39,675 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 02:46:39,675 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 02:46:39,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-04 02:46:39,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 02:46:39,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 02:46:39,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 02:46:39,678 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 02:46:39,803 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 02:46:39,805 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 02:46:40,124 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 02:46:40,272 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 02:46:40,272 INFO L302 CfgBuilder]: Removed 7 assume(true) statements. [2023-08-04 02:46:40,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 02:46:40 BoogieIcfgContainer [2023-08-04 02:46:40,275 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 02:46:40,277 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 02:46:40,277 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 02:46:40,280 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 02:46:40,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 02:46:39" (1/3) ... [2023-08-04 02:46:40,281 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77ab2db8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 02:46:40, skipping insertion in model container [2023-08-04 02:46:40,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 02:46:39" (2/3) ... [2023-08-04 02:46:40,281 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77ab2db8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 02:46:40, skipping insertion in model container [2023-08-04 02:46:40,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 02:46:40" (3/3) ... [2023-08-04 02:46:40,282 INFO L112 eAbstractionObserver]: Analyzing ICFG weaver_popl20-bad-counter-queue2.wvr_bound2.c [2023-08-04 02:46:40,291 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 02:46:40,299 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 02:46:40,300 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-04 02:46:40,300 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 02:46:40,376 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-04 02:46:40,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 139 transitions, 300 flow [2023-08-04 02:46:40,487 INFO L124 PetriNetUnfolderBase]: 36/279 cut-off events. [2023-08-04 02:46:40,487 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 02:46:40,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 299 conditions, 279 events. 36/279 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 864 event pairs, 0 based on Foata normal form. 0/233 useless extension candidates. Maximal degree in co-relation 157. Up to 8 conditions per place. [2023-08-04 02:46:40,501 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 139 transitions, 300 flow [2023-08-04 02:46:40,505 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 139 transitions, 300 flow [2023-08-04 02:46:40,510 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 02:46:40,520 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 139 transitions, 300 flow [2023-08-04 02:46:40,523 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 139 transitions, 300 flow [2023-08-04 02:46:40,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 139 transitions, 300 flow [2023-08-04 02:46:40,570 INFO L124 PetriNetUnfolderBase]: 36/279 cut-off events. [2023-08-04 02:46:40,570 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 02:46:40,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 299 conditions, 279 events. 36/279 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 864 event pairs, 0 based on Foata normal form. 0/233 useless extension candidates. Maximal degree in co-relation 157. Up to 8 conditions per place. [2023-08-04 02:46:40,575 INFO L119 LiptonReduction]: Number of co-enabled transitions 2400 [2023-08-04 02:46:44,703 INFO L134 LiptonReduction]: Checked pairs total: 3118 [2023-08-04 02:46:44,703 INFO L136 LiptonReduction]: Total number of compositions: 127 [2023-08-04 02:46:44,725 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 02:46:44,732 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;@20b31381, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 02:46:44,732 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 02:46:44,748 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 02:46:44,748 INFO L124 PetriNetUnfolderBase]: 3/28 cut-off events. [2023-08-04 02:46:44,748 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 02:46:44,749 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:46:44,749 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2023-08-04 02:46:44,750 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 02:46:44,756 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:46:44,756 INFO L85 PathProgramCache]: Analyzing trace with hash 21179411, now seen corresponding path program 1 times [2023-08-04 02:46:44,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:46:44,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280415721] [2023-08-04 02:46:44,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:46:44,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:46:44,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 02:46:44,895 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 02:46:44,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 02:46:44,969 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 02:46:44,971 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 02:46:44,972 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 02:46:44,974 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 02:46:44,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 02:46:44,974 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-04 02:46:44,979 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN (1/2) [2023-08-04 02:46:44,980 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 02:46:44,980 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 02:46:45,022 INFO L144 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2023-08-04 02:46:45,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 165 transitions, 378 flow [2023-08-04 02:46:45,144 INFO L124 PetriNetUnfolderBase]: 137/854 cut-off events. [2023-08-04 02:46:45,145 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-04 02:46:45,152 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 4277 event pairs, 1 based on Foata normal form. 0/714 useless extension candidates. Maximal degree in co-relation 512. Up to 32 conditions per place. [2023-08-04 02:46:45,152 INFO L82 GeneralOperation]: Start removeDead. Operand has 149 places, 165 transitions, 378 flow [2023-08-04 02:46:45,158 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 165 transitions, 378 flow [2023-08-04 02:46:45,158 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 02:46:45,159 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 165 transitions, 378 flow [2023-08-04 02:46:45,159 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 165 transitions, 378 flow [2023-08-04 02:46:45,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 165 transitions, 378 flow [2023-08-04 02:46:45,245 INFO L124 PetriNetUnfolderBase]: 137/854 cut-off events. [2023-08-04 02:46:45,246 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-04 02:46:45,253 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 4277 event pairs, 1 based on Foata normal form. 0/714 useless extension candidates. Maximal degree in co-relation 512. Up to 32 conditions per place. [2023-08-04 02:46:45,269 INFO L119 LiptonReduction]: Number of co-enabled transitions 6000 [2023-08-04 02:46:49,116 INFO L134 LiptonReduction]: Checked pairs total: 8948 [2023-08-04 02:46:49,117 INFO L136 LiptonReduction]: Total number of compositions: 143 [2023-08-04 02:46:49,119 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 02:46:49,120 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;@20b31381, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 02:46:49,120 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 02:46:49,126 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 02:46:49,126 INFO L124 PetriNetUnfolderBase]: 8/69 cut-off events. [2023-08-04 02:46:49,126 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-08-04 02:46:49,126 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:46:49,126 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2023-08-04 02:46:49,127 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 02:46:49,127 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:46:49,127 INFO L85 PathProgramCache]: Analyzing trace with hash 561084598, now seen corresponding path program 1 times [2023-08-04 02:46:49,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:46:49,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362840569] [2023-08-04 02:46:49,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:46:49,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:46:49,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:46:49,250 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 02:46:49,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:46:49,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362840569] [2023-08-04 02:46:49,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362840569] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:46:49,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410599463] [2023-08-04 02:46:49,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:46:49,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:46:49,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:46:49,261 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 02:46:49,279 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 02:46:49,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:46:49,353 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 02:46:49,354 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:46:49,404 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 02:46:49,404 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 02:46:49,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410599463] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:46:49,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 02:46:49,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2023-08-04 02:46:49,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466105560] [2023-08-04 02:46:49,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:46:49,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:46:49,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:46:49,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:46:49,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-04 02:46:49,453 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 308 [2023-08-04 02:46:49,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 46 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 132.8) internal successors, (664), 5 states have internal predecessors, (664), 0 states have call successors, (0), 0 states 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 02:46:49,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:46:49,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 308 [2023-08-04 02:46:49,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:46:50,621 INFO L124 PetriNetUnfolderBase]: 8554/11153 cut-off events. [2023-08-04 02:46:50,621 INFO L125 PetriNetUnfolderBase]: For 973/973 co-relation queries the response was YES. [2023-08-04 02:46:50,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22555 conditions, 11153 events. 8554/11153 cut-off events. For 973/973 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 50064 event pairs, 2448 based on Foata normal form. 0/6347 useless extension candidates. Maximal degree in co-relation 6846. Up to 10615 conditions per place. [2023-08-04 02:46:50,653 INFO L140 encePairwiseOnDemand]: 303/308 looper letters, 25 selfloop transitions, 5 changer transitions 17/54 dead transitions. [2023-08-04 02:46:50,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 54 transitions, 242 flow [2023-08-04 02:46:50,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 02:46:50,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 02:46:50,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 702 transitions. [2023-08-04 02:46:50,671 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45584415584415583 [2023-08-04 02:46:50,672 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 702 transitions. [2023-08-04 02:46:50,673 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 702 transitions. [2023-08-04 02:46:50,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:46:50,678 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 702 transitions. [2023-08-04 02:46:50,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 140.4) internal successors, (702), 5 states have internal predecessors, (702), 0 states have call successors, (0), 0 states 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 02:46:50,694 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 308.0) internal successors, (1848), 6 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states 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 02:46:50,695 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 308.0) internal successors, (1848), 6 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states 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 02:46:50,700 INFO L175 Difference]: Start difference. First operand has 42 places, 46 transitions, 140 flow. Second operand 5 states and 702 transitions. [2023-08-04 02:46:50,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 54 transitions, 242 flow [2023-08-04 02:46:50,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 54 transitions, 236 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 02:46:50,709 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 95 flow [2023-08-04 02:46:50,710 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=38, 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=5, PETRI_FLOW=95, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2023-08-04 02:46:50,715 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 1 predicate places. [2023-08-04 02:46:50,715 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 95 flow [2023-08-04 02:46:50,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.8) internal successors, (664), 5 states have internal predecessors, (664), 0 states have call successors, (0), 0 states 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 02:46:50,716 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:46:50,716 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1] [2023-08-04 02:46:50,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-04 02:46:50,921 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 02:46:50,922 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 02:46:50,922 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:46:50,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1836859869, now seen corresponding path program 1 times [2023-08-04 02:46:50,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:46:50,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657970468] [2023-08-04 02:46:50,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:46:50,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:46:50,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:46:51,003 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 02:46:51,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:46:51,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657970468] [2023-08-04 02:46:51,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657970468] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:46:51,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:46:51,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 02:46:51,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918020308] [2023-08-04 02:46:51,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:46:51,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 02:46:51,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:46:51,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 02:46:51,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 02:46:51,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 308 [2023-08-04 02:46:51,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 95 flow. Second operand has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states 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 02:46:51,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:46:51,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 308 [2023-08-04 02:46:51,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:46:51,254 INFO L124 PetriNetUnfolderBase]: 1761/2335 cut-off events. [2023-08-04 02:46:51,254 INFO L125 PetriNetUnfolderBase]: For 150/150 co-relation queries the response was YES. [2023-08-04 02:46:51,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4774 conditions, 2335 events. 1761/2335 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8281 event pairs, 685 based on Foata normal form. 1/1404 useless extension candidates. Maximal degree in co-relation 1396. Up to 2191 conditions per place. [2023-08-04 02:46:51,269 INFO L140 encePairwiseOnDemand]: 305/308 looper letters, 23 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2023-08-04 02:46:51,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 32 transitions, 148 flow [2023-08-04 02:46:51,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 02:46:51,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 02:46:51,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2023-08-04 02:46:51,271 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4556277056277056 [2023-08-04 02:46:51,271 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 421 transitions. [2023-08-04 02:46:51,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 421 transitions. [2023-08-04 02:46:51,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:46:51,272 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 421 transitions. [2023-08-04 02:46:51,273 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states 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 02:46:51,275 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states 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 02:46:51,276 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 308.0) internal successors, (1232), 4 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states 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 02:46:51,276 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 95 flow. Second operand 3 states and 421 transitions. [2023-08-04 02:46:51,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 32 transitions, 148 flow [2023-08-04 02:46:51,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 32 transitions, 145 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-04 02:46:51,280 INFO L231 Difference]: Finished difference. Result has 35 places, 29 transitions, 91 flow [2023-08-04 02:46:51,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=33, 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=91, PETRI_PLACES=35, PETRI_TRANSITIONS=29} [2023-08-04 02:46:51,280 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -7 predicate places. [2023-08-04 02:46:51,281 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 29 transitions, 91 flow [2023-08-04 02:46:51,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states 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 02:46:51,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:46:51,282 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:46:51,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-04 02:46:51,283 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 02:46:51,283 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:46:51,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1355745063, now seen corresponding path program 1 times [2023-08-04 02:46:51,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:46:51,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932697724] [2023-08-04 02:46:51,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:46:51,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:46:51,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:46:51,372 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 02:46:51,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:46:51,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932697724] [2023-08-04 02:46:51,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932697724] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:46:51,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317913045] [2023-08-04 02:46:51,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:46:51,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:46:51,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:46:51,374 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 02:46:51,377 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 02:46:51,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:46:51,448 INFO L262 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 02:46:51,449 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:46:51,468 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 02:46:51,469 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:46:51,494 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 02:46:51,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317913045] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:46:51,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:46:51,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 02:46:51,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139098563] [2023-08-04 02:46:51,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:46:51,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:46:51,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:46:51,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:46:51,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:46:51,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 308 [2023-08-04 02:46:51,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 91 flow. Second operand has 5 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 0 states have call successors, (0), 0 states 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 02:46:51,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:46:51,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 308 [2023-08-04 02:46:51,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:46:51,717 INFO L124 PetriNetUnfolderBase]: 1433/1872 cut-off events. [2023-08-04 02:46:51,718 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2023-08-04 02:46:51,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3803 conditions, 1872 events. 1433/1872 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 6151 event pairs, 357 based on Foata normal form. 3/1119 useless extension candidates. Maximal degree in co-relation 2803. Up to 1731 conditions per place. [2023-08-04 02:46:51,728 INFO L140 encePairwiseOnDemand]: 305/308 looper letters, 25 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2023-08-04 02:46:51,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 35 transitions, 158 flow [2023-08-04 02:46:51,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 02:46:51,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 02:46:51,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 553 transitions. [2023-08-04 02:46:51,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44886363636363635 [2023-08-04 02:46:51,731 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 553 transitions. [2023-08-04 02:46:51,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 553 transitions. [2023-08-04 02:46:51,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:46:51,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 553 transitions. [2023-08-04 02:46:51,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.25) internal successors, (553), 4 states have internal predecessors, (553), 0 states have call successors, (0), 0 states 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 02:46:51,734 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 308.0) internal successors, (1540), 5 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:46:51,735 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 308.0) internal successors, (1540), 5 states have internal predecessors, (1540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:46:51,735 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 91 flow. Second operand 4 states and 553 transitions. [2023-08-04 02:46:51,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 35 transitions, 158 flow [2023-08-04 02:46:51,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 35 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 02:46:51,738 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 88 flow [2023-08-04 02:46:51,738 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=88, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2023-08-04 02:46:51,740 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -6 predicate places. [2023-08-04 02:46:51,740 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 88 flow [2023-08-04 02:46:51,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 0 states have call successors, (0), 0 states 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 02:46:51,743 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:46:51,744 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:46:51,751 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 02:46:51,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-08-04 02:46:51,951 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 02:46:51,951 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:46:51,951 INFO L85 PathProgramCache]: Analyzing trace with hash -346580108, now seen corresponding path program 1 times [2023-08-04 02:46:51,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:46:51,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46016280] [2023-08-04 02:46:51,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:46:51,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:46:51,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:46:52,045 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 02:46:52,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:46:52,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46016280] [2023-08-04 02:46:52,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46016280] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:46:52,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089858327] [2023-08-04 02:46:52,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:46:52,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:46:52,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:46:52,048 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 02:46:52,051 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 02:46:52,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:46:52,136 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 02:46:52,137 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:46:52,158 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 02:46:52,159 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 02:46:52,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089858327] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:46:52,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 02:46:52,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2023-08-04 02:46:52,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394027964] [2023-08-04 02:46:52,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:46:52,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:46:52,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:46:52,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:46:52,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-04 02:46:52,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 308 [2023-08-04 02:46:52,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 0 states have call successors, (0), 0 states 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 02:46:52,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:46:52,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 308 [2023-08-04 02:46:52,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:46:52,337 INFO L124 PetriNetUnfolderBase]: 1001/1332 cut-off events. [2023-08-04 02:46:52,337 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-08-04 02:46:52,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2729 conditions, 1332 events. 1001/1332 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 4418 event pairs, 43 based on Foata normal form. 81/873 useless extension candidates. Maximal degree in co-relation 1021. Up to 558 conditions per place. [2023-08-04 02:46:52,341 INFO L140 encePairwiseOnDemand]: 305/308 looper letters, 0 selfloop transitions, 0 changer transitions 47/47 dead transitions. [2023-08-04 02:46:52,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 47 transitions, 206 flow [2023-08-04 02:46:52,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 02:46:52,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 02:46:52,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 696 transitions. [2023-08-04 02:46:52,343 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45194805194805193 [2023-08-04 02:46:52,343 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 696 transitions. [2023-08-04 02:46:52,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 696 transitions. [2023-08-04 02:46:52,344 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:46:52,344 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 696 transitions. [2023-08-04 02:46:52,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.2) internal successors, (696), 5 states have internal predecessors, (696), 0 states have call successors, (0), 0 states 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 02:46:52,348 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 308.0) internal successors, (1848), 6 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states 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 02:46:52,348 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 308.0) internal successors, (1848), 6 states have internal predecessors, (1848), 0 states have call successors, (0), 0 states 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 02:46:52,349 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 88 flow. Second operand 5 states and 696 transitions. [2023-08-04 02:46:52,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 47 transitions, 206 flow [2023-08-04 02:46:52,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 47 transitions, 199 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-04 02:46:52,353 INFO L231 Difference]: Finished difference. Result has 35 places, 0 transitions, 0 flow [2023-08-04 02:46:52,353 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=308, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=35, PETRI_TRANSITIONS=0} [2023-08-04 02:46:52,354 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -7 predicate places. [2023-08-04 02:46:52,354 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 0 transitions, 0 flow [2023-08-04 02:46:52,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 0 states have call successors, (0), 0 states 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 02:46:52,355 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 02:46:52,355 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 02:46:52,367 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 02:46:52,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:46:52,561 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-08-04 02:46:52,562 INFO L307 ceAbstractionStarter]: Result for error location InUseError was SAFE,SAFE (1/2) [2023-08-04 02:46:52,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 165 transitions, 378 flow [2023-08-04 02:46:52,627 INFO L124 PetriNetUnfolderBase]: 137/854 cut-off events. [2023-08-04 02:46:52,627 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-04 02:46:52,631 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 4277 event pairs, 1 based on Foata normal form. 0/714 useless extension candidates. Maximal degree in co-relation 512. Up to 32 conditions per place. [2023-08-04 02:46:52,631 INFO L82 GeneralOperation]: Start removeDead. Operand has 149 places, 165 transitions, 378 flow [2023-08-04 02:46:52,635 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 165 transitions, 378 flow [2023-08-04 02:46:52,635 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 02:46:52,635 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 165 transitions, 378 flow [2023-08-04 02:46:52,636 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 165 transitions, 378 flow [2023-08-04 02:46:52,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 165 transitions, 378 flow [2023-08-04 02:46:52,697 INFO L124 PetriNetUnfolderBase]: 137/854 cut-off events. [2023-08-04 02:46:52,697 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-04 02:46:52,701 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 4277 event pairs, 1 based on Foata normal form. 0/714 useless extension candidates. Maximal degree in co-relation 512. Up to 32 conditions per place. [2023-08-04 02:46:52,715 INFO L119 LiptonReduction]: Number of co-enabled transitions 6000 [2023-08-04 02:46:56,564 INFO L134 LiptonReduction]: Checked pairs total: 9127 [2023-08-04 02:46:56,565 INFO L136 LiptonReduction]: Total number of compositions: 141 [2023-08-04 02:46:56,566 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 02:46:56,567 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;@20b31381, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 02:46:56,567 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 02:46:56,569 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 02:46:56,569 INFO L124 PetriNetUnfolderBase]: 2/16 cut-off events. [2023-08-04 02:46:56,569 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 02:46:56,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:46:56,569 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 02:46:56,570 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:46:56,570 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:46:56,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1387393350, now seen corresponding path program 1 times [2023-08-04 02:46:56,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:46:56,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28474144] [2023-08-04 02:46:56,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:46:56,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:46:56,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:46:56,609 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 02:46:56,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:46:56,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28474144] [2023-08-04 02:46:56,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28474144] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:46:56,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:46:56,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 02:46:56,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649176991] [2023-08-04 02:46:56,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:46:56,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 02:46:56,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:46:56,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 02:46:56,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 02:46:56,623 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 306 [2023-08-04 02:46:56,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 46 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states 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 02:46:56,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:46:56,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 306 [2023-08-04 02:46:56,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:46:57,483 INFO L124 PetriNetUnfolderBase]: 8527/11039 cut-off events. [2023-08-04 02:46:57,483 INFO L125 PetriNetUnfolderBase]: For 1040/1040 co-relation queries the response was YES. [2023-08-04 02:46:57,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22384 conditions, 11039 events. 8527/11039 cut-off events. For 1040/1040 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 47319 event pairs, 3472 based on Foata normal form. 0/6249 useless extension candidates. Maximal degree in co-relation 6836. Up to 10602 conditions per place. [2023-08-04 02:46:57,544 INFO L140 encePairwiseOnDemand]: 302/306 looper letters, 37 selfloop transitions, 2 changer transitions 2/49 dead transitions. [2023-08-04 02:46:57,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 49 transitions, 224 flow [2023-08-04 02:46:57,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 02:46:57,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 02:46:57,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 437 transitions. [2023-08-04 02:46:57,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4760348583877996 [2023-08-04 02:46:57,546 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 437 transitions. [2023-08-04 02:46:57,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 437 transitions. [2023-08-04 02:46:57,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:46:57,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 437 transitions. [2023-08-04 02:46:57,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states 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 02:46:57,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states 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 02:46:57,550 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states 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 02:46:57,550 INFO L175 Difference]: Start difference. First operand has 42 places, 46 transitions, 140 flow. Second operand 3 states and 437 transitions. [2023-08-04 02:46:57,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 49 transitions, 224 flow [2023-08-04 02:46:57,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 49 transitions, 224 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 02:46:57,553 INFO L231 Difference]: Finished difference. Result has 44 places, 44 transitions, 138 flow [2023-08-04 02:46:57,553 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=44, PETRI_TRANSITIONS=44} [2023-08-04 02:46:57,554 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2023-08-04 02:46:57,555 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 44 transitions, 138 flow [2023-08-04 02:46:57,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states 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 02:46:57,555 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:46:57,555 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:46:57,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-04 02:46:57,555 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:46:57,555 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:46:57,555 INFO L85 PathProgramCache]: Analyzing trace with hash 104521444, now seen corresponding path program 1 times [2023-08-04 02:46:57,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:46:57,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607792690] [2023-08-04 02:46:57,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:46:57,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:46:57,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:46:57,596 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 02:46:57,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:46:57,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607792690] [2023-08-04 02:46:57,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607792690] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:46:57,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1552296529] [2023-08-04 02:46:57,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:46:57,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:46:57,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:46:57,602 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 02:46:57,603 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 02:46:57,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:46:57,672 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 02:46:57,673 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:46:57,682 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 02:46:57,682 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 02:46:57,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1552296529] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:46:57,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 02:46:57,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-08-04 02:46:57,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109880588] [2023-08-04 02:46:57,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:46:57,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 02:46:57,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:46:57,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 02:46:57,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:46:57,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 306 [2023-08-04 02:46:57,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 44 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states 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 02:46:57,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:46:57,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 306 [2023-08-04 02:46:57,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:46:58,600 INFO L124 PetriNetUnfolderBase]: 8489/11016 cut-off events. [2023-08-04 02:46:58,600 INFO L125 PetriNetUnfolderBase]: For 833/833 co-relation queries the response was YES. [2023-08-04 02:46:58,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22264 conditions, 11016 events. 8489/11016 cut-off events. For 833/833 co-relation queries the response was YES. Maximal size of possible extension queue 391. Compared 49165 event pairs, 3438 based on Foata normal form. 0/6264 useless extension candidates. Maximal degree in co-relation 13423. Up to 10391 conditions per place. [2023-08-04 02:46:58,657 INFO L140 encePairwiseOnDemand]: 303/306 looper letters, 42 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-08-04 02:46:58,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 52 transitions, 242 flow [2023-08-04 02:46:58,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 02:46:58,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 02:46:58,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 440 transitions. [2023-08-04 02:46:58,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4793028322440087 [2023-08-04 02:46:58,660 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 440 transitions. [2023-08-04 02:46:58,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 440 transitions. [2023-08-04 02:46:58,660 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:46:58,660 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 440 transitions. [2023-08-04 02:46:58,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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 02:46:58,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states 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 02:46:58,663 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states 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 02:46:58,663 INFO L175 Difference]: Start difference. First operand has 44 places, 44 transitions, 138 flow. Second operand 3 states and 440 transitions. [2023-08-04 02:46:58,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 52 transitions, 242 flow [2023-08-04 02:46:58,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 52 transitions, 234 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-04 02:46:58,669 INFO L231 Difference]: Finished difference. Result has 42 places, 45 transitions, 142 flow [2023-08-04 02:46:58,669 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=42, PETRI_TRANSITIONS=45} [2023-08-04 02:46:58,670 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2023-08-04 02:46:58,670 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 45 transitions, 142 flow [2023-08-04 02:46:58,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states 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 02:46:58,671 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:46:58,671 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:46:58,683 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 02:46:58,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:46:58,877 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:46:58,877 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:46:58,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1859095620, now seen corresponding path program 1 times [2023-08-04 02:46:58,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:46:58,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91365070] [2023-08-04 02:46:58,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:46:58,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:46:58,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:46:58,921 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 02:46:58,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:46:58,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91365070] [2023-08-04 02:46:58,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91365070] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:46:58,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938936768] [2023-08-04 02:46:58,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:46:58,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:46:58,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:46:58,923 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 02:46:58,925 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 02:46:58,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:46:58,994 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 02:46:58,995 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:46:59,008 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 02:46:59,008 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 02:46:59,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938936768] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:46:59,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 02:46:59,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-08-04 02:46:59,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565770966] [2023-08-04 02:46:59,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:46:59,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 02:46:59,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:46:59,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 02:46:59,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:46:59,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 306 [2023-08-04 02:46:59,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 45 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states 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 02:46:59,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:46:59,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 306 [2023-08-04 02:46:59,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:46:59,774 INFO L124 PetriNetUnfolderBase]: 7284/9574 cut-off events. [2023-08-04 02:46:59,774 INFO L125 PetriNetUnfolderBase]: For 610/610 co-relation queries the response was YES. [2023-08-04 02:46:59,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19649 conditions, 9574 events. 7284/9574 cut-off events. For 610/610 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 42915 event pairs, 2490 based on Foata normal form. 0/5675 useless extension candidates. Maximal degree in co-relation 6727. Up to 6830 conditions per place. [2023-08-04 02:46:59,816 INFO L140 encePairwiseOnDemand]: 303/306 looper letters, 49 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-08-04 02:46:59,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 59 transitions, 282 flow [2023-08-04 02:46:59,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 02:46:59,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 02:46:59,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2023-08-04 02:46:59,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.485838779956427 [2023-08-04 02:46:59,818 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 446 transitions. [2023-08-04 02:46:59,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions. [2023-08-04 02:46:59,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:46:59,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions. [2023-08-04 02:46:59,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states 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 02:46:59,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states 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 02:46:59,821 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states 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 02:46:59,821 INFO L175 Difference]: Start difference. First operand has 42 places, 45 transitions, 142 flow. Second operand 3 states and 446 transitions. [2023-08-04 02:46:59,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 59 transitions, 282 flow [2023-08-04 02:46:59,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 59 transitions, 280 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 02:46:59,823 INFO L231 Difference]: Finished difference. Result has 44 places, 46 transitions, 152 flow [2023-08-04 02:46:59,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=44, PETRI_TRANSITIONS=46} [2023-08-04 02:46:59,824 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2023-08-04 02:46:59,824 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 46 transitions, 152 flow [2023-08-04 02:46:59,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states 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 02:46:59,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:46:59,824 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:46:59,830 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-04 02:47:00,030 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 02:47:00,030 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:47:00,030 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:47:00,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1109974358, now seen corresponding path program 1 times [2023-08-04 02:47:00,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:47:00,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341767151] [2023-08-04 02:47:00,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:47:00,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:47:00,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:47:00,074 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 02:47:00,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:47:00,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341767151] [2023-08-04 02:47:00,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341767151] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:47:00,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746052679] [2023-08-04 02:47:00,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:47:00,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:47:00,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:47:00,079 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 02:47:00,081 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 02:47:00,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:47:00,152 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 02:47:00,153 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:47:00,159 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 02:47:00,159 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 02:47:00,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746052679] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:47:00,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 02:47:00,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2023-08-04 02:47:00,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884947926] [2023-08-04 02:47:00,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:47:00,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 02:47:00,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:47:00,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 02:47:00,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:47:00,168 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 306 [2023-08-04 02:47:00,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 46 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states 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 02:47:00,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:47:00,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 306 [2023-08-04 02:47:00,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:47:00,936 INFO L124 PetriNetUnfolderBase]: 7161/9503 cut-off events. [2023-08-04 02:47:00,936 INFO L125 PetriNetUnfolderBase]: For 1496/1496 co-relation queries the response was YES. [2023-08-04 02:47:00,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20209 conditions, 9503 events. 7161/9503 cut-off events. For 1496/1496 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 42779 event pairs, 2789 based on Foata normal form. 0/5935 useless extension candidates. Maximal degree in co-relation 7255. Up to 7264 conditions per place. [2023-08-04 02:47:00,988 INFO L140 encePairwiseOnDemand]: 303/306 looper letters, 50 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-08-04 02:47:00,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 60 transitions, 294 flow [2023-08-04 02:47:00,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 02:47:00,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 02:47:00,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2023-08-04 02:47:00,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.485838779956427 [2023-08-04 02:47:00,990 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 446 transitions. [2023-08-04 02:47:00,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions. [2023-08-04 02:47:00,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:47:00,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions. [2023-08-04 02:47:00,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states 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 02:47:00,993 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states 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 02:47:00,993 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states 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 02:47:00,993 INFO L175 Difference]: Start difference. First operand has 44 places, 46 transitions, 152 flow. Second operand 3 states and 446 transitions. [2023-08-04 02:47:00,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 60 transitions, 294 flow [2023-08-04 02:47:00,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 60 transitions, 292 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 02:47:01,001 INFO L231 Difference]: Finished difference. Result has 46 places, 47 transitions, 162 flow [2023-08-04 02:47:01,001 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=162, PETRI_PLACES=46, PETRI_TRANSITIONS=47} [2023-08-04 02:47:01,001 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places. [2023-08-04 02:47:01,001 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 47 transitions, 162 flow [2023-08-04 02:47:01,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states 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 02:47:01,002 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:47:01,002 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:47:01,010 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 02:47:01,210 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 02:47:01,210 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:47:01,210 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:47:01,210 INFO L85 PathProgramCache]: Analyzing trace with hash 201679611, now seen corresponding path program 1 times [2023-08-04 02:47:01,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:47:01,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747083624] [2023-08-04 02:47:01,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:47:01,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:47:01,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:47:01,249 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 02:47:01,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:47:01,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747083624] [2023-08-04 02:47:01,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747083624] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:47:01,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2043855368] [2023-08-04 02:47:01,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:47:01,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:47:01,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:47:01,251 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 02:47:01,254 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 02:47:01,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:47:01,337 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 02:47:01,338 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:47:01,354 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 02:47:01,354 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:47:01,373 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 02:47:01,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2043855368] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:47:01,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:47:01,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 02:47:01,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146378208] [2023-08-04 02:47:01,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:47:01,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:47:01,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:47:01,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:47:01,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:47:01,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 306 [2023-08-04 02:47:01,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 47 transitions, 162 flow. Second operand has 5 states, 5 states have (on average 136.0) internal successors, (680), 5 states have internal predecessors, (680), 0 states have call successors, (0), 0 states 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 02:47:01,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:47:01,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 306 [2023-08-04 02:47:01,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:47:02,052 INFO L124 PetriNetUnfolderBase]: 6454/8556 cut-off events. [2023-08-04 02:47:02,052 INFO L125 PetriNetUnfolderBase]: For 1161/1161 co-relation queries the response was YES. [2023-08-04 02:47:02,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18393 conditions, 8556 events. 6454/8556 cut-off events. For 1161/1161 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 38154 event pairs, 1919 based on Foata normal form. 3/5407 useless extension candidates. Maximal degree in co-relation 12366. Up to 8127 conditions per place. [2023-08-04 02:47:02,094 INFO L140 encePairwiseOnDemand]: 302/306 looper letters, 43 selfloop transitions, 3 changer transitions 1/55 dead transitions. [2023-08-04 02:47:02,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 55 transitions, 272 flow [2023-08-04 02:47:02,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 02:47:02,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 02:47:02,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 569 transitions. [2023-08-04 02:47:02,096 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46486928104575165 [2023-08-04 02:47:02,096 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 569 transitions. [2023-08-04 02:47:02,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 569 transitions. [2023-08-04 02:47:02,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:47:02,097 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 569 transitions. [2023-08-04 02:47:02,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.25) internal successors, (569), 4 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:47:02,099 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 306.0) internal successors, (1530), 5 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states 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 02:47:02,099 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 306.0) internal successors, (1530), 5 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states 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 02:47:02,100 INFO L175 Difference]: Start difference. First operand has 46 places, 47 transitions, 162 flow. Second operand 4 states and 569 transitions. [2023-08-04 02:47:02,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 55 transitions, 272 flow [2023-08-04 02:47:02,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 55 transitions, 270 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 02:47:02,122 INFO L231 Difference]: Finished difference. Result has 50 places, 47 transitions, 174 flow [2023-08-04 02:47:02,122 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=174, PETRI_PLACES=50, PETRI_TRANSITIONS=47} [2023-08-04 02:47:02,123 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2023-08-04 02:47:02,123 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 174 flow [2023-08-04 02:47:02,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 136.0) internal successors, (680), 5 states have internal predecessors, (680), 0 states have call successors, (0), 0 states 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 02:47:02,123 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:47:02,124 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 02:47:02,132 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 02:47:02,329 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 02:47:02,330 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:47:02,330 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:47:02,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1191151671, now seen corresponding path program 1 times [2023-08-04 02:47:02,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:47:02,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557210029] [2023-08-04 02:47:02,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:47:02,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:47:02,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:47:02,376 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 02:47:02,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:47:02,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557210029] [2023-08-04 02:47:02,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557210029] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:47:02,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477807166] [2023-08-04 02:47:02,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:47:02,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:47:02,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:47:02,378 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 02:47:02,381 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 02:47:02,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:47:02,461 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 02:47:02,462 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:47:02,472 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 02:47:02,472 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:47:02,485 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 02:47:02,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477807166] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:47:02,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:47:02,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 02:47:02,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260780849] [2023-08-04 02:47:02,486 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:47:02,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:47:02,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:47:02,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:47:02,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:47:02,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 306 [2023-08-04 02:47:02,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 174 flow. Second operand has 5 states, 5 states have (on average 136.0) internal successors, (680), 5 states have internal predecessors, (680), 0 states have call successors, (0), 0 states 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 02:47:02,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:47:02,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 306 [2023-08-04 02:47:02,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:47:03,130 INFO L124 PetriNetUnfolderBase]: 6115/8100 cut-off events. [2023-08-04 02:47:03,130 INFO L125 PetriNetUnfolderBase]: For 775/775 co-relation queries the response was YES. [2023-08-04 02:47:03,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17363 conditions, 8100 events. 6115/8100 cut-off events. For 775/775 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 36461 event pairs, 1699 based on Foata normal form. 27/5131 useless extension candidates. Maximal degree in co-relation 11402. Up to 6554 conditions per place. [2023-08-04 02:47:03,181 INFO L140 encePairwiseOnDemand]: 302/306 looper letters, 51 selfloop transitions, 3 changer transitions 1/63 dead transitions. [2023-08-04 02:47:03,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 63 transitions, 316 flow [2023-08-04 02:47:03,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 02:47:03,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 02:47:03,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 577 transitions. [2023-08-04 02:47:03,185 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4714052287581699 [2023-08-04 02:47:03,185 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 577 transitions. [2023-08-04 02:47:03,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 577 transitions. [2023-08-04 02:47:03,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:47:03,185 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 577 transitions. [2023-08-04 02:47:03,188 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.25) internal successors, (577), 4 states have internal predecessors, (577), 0 states have call successors, (0), 0 states 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 02:47:03,191 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 306.0) internal successors, (1530), 5 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states 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 02:47:03,191 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 306.0) internal successors, (1530), 5 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states 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 02:47:03,191 INFO L175 Difference]: Start difference. First operand has 50 places, 47 transitions, 174 flow. Second operand 4 states and 577 transitions. [2023-08-04 02:47:03,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 63 transitions, 316 flow [2023-08-04 02:47:03,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 63 transitions, 307 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 02:47:03,209 INFO L231 Difference]: Finished difference. Result has 52 places, 47 transitions, 179 flow [2023-08-04 02:47:03,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=179, PETRI_PLACES=52, PETRI_TRANSITIONS=47} [2023-08-04 02:47:03,210 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 10 predicate places. [2023-08-04 02:47:03,210 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 47 transitions, 179 flow [2023-08-04 02:47:03,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 136.0) internal successors, (680), 5 states have internal predecessors, (680), 0 states have call successors, (0), 0 states 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 02:47:03,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:47:03,211 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, 1, 1] [2023-08-04 02:47:03,217 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 02:47:03,416 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 02:47:03,417 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:47:03,417 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:47:03,417 INFO L85 PathProgramCache]: Analyzing trace with hash -877380180, now seen corresponding path program 1 times [2023-08-04 02:47:03,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:47:03,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308528043] [2023-08-04 02:47:03,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:47:03,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:47:03,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:47:03,469 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 02:47:03,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:47:03,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308528043] [2023-08-04 02:47:03,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308528043] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:47:03,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392271858] [2023-08-04 02:47:03,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:47:03,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:47:03,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:47:03,471 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 02:47:03,474 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 02:47:03,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:47:03,557 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 02:47:03,559 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:47:03,573 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 02:47:03,574 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:47:03,588 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 02:47:03,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392271858] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:47:03,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:47:03,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 02:47:03,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135278683] [2023-08-04 02:47:03,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:47:03,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:47:03,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:47:03,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:47:03,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:47:03,602 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 306 [2023-08-04 02:47:03,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 47 transitions, 179 flow. Second operand has 5 states, 5 states have (on average 136.2) internal successors, (681), 5 states have internal predecessors, (681), 0 states have call successors, (0), 0 states 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 02:47:03,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:47:03,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 306 [2023-08-04 02:47:03,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:47:03,982 INFO L124 PetriNetUnfolderBase]: 4137/5531 cut-off events. [2023-08-04 02:47:03,982 INFO L125 PetriNetUnfolderBase]: For 1271/1271 co-relation queries the response was YES. [2023-08-04 02:47:03,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11984 conditions, 5531 events. 4137/5531 cut-off events. For 1271/1271 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 22630 event pairs, 747 based on Foata normal form. 108/3587 useless extension candidates. Maximal degree in co-relation 10560. Up to 2082 conditions per place. [2023-08-04 02:47:04,011 INFO L140 encePairwiseOnDemand]: 302/306 looper letters, 57 selfloop transitions, 4 changer transitions 0/69 dead transitions. [2023-08-04 02:47:04,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 69 transitions, 354 flow [2023-08-04 02:47:04,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 02:47:04,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 02:47:04,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 583 transitions. [2023-08-04 02:47:04,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47630718954248363 [2023-08-04 02:47:04,014 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 583 transitions. [2023-08-04 02:47:04,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 583 transitions. [2023-08-04 02:47:04,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:47:04,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 583 transitions. [2023-08-04 02:47:04,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 145.75) internal successors, (583), 4 states have internal predecessors, (583), 0 states have call successors, (0), 0 states 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 02:47:04,018 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 306.0) internal successors, (1530), 5 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states 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 02:47:04,018 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 306.0) internal successors, (1530), 5 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states 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 02:47:04,018 INFO L175 Difference]: Start difference. First operand has 52 places, 47 transitions, 179 flow. Second operand 4 states and 583 transitions. [2023-08-04 02:47:04,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 69 transitions, 354 flow [2023-08-04 02:47:04,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 69 transitions, 344 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 02:47:04,026 INFO L231 Difference]: Finished difference. Result has 54 places, 48 transitions, 190 flow [2023-08-04 02:47:04,026 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=190, PETRI_PLACES=54, PETRI_TRANSITIONS=48} [2023-08-04 02:47:04,027 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2023-08-04 02:47:04,027 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 48 transitions, 190 flow [2023-08-04 02:47:04,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 136.2) internal successors, (681), 5 states have internal predecessors, (681), 0 states have call successors, (0), 0 states 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 02:47:04,027 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:47:04,027 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, 1, 1, 1] [2023-08-04 02:47:04,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-04 02:47:04,232 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 02:47:04,233 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:47:04,233 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:47:04,233 INFO L85 PathProgramCache]: Analyzing trace with hash 2130512015, now seen corresponding path program 1 times [2023-08-04 02:47:04,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:47:04,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810068678] [2023-08-04 02:47:04,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:47:04,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:47:04,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:47:04,292 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 02:47:04,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:47:04,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810068678] [2023-08-04 02:47:04,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810068678] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:47:04,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576292931] [2023-08-04 02:47:04,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:47:04,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:47:04,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:47:04,294 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 02:47:04,297 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 02:47:04,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:47:04,385 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 02:47:04,387 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:47:04,397 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 02:47:04,397 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:47:04,411 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 02:47:04,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576292931] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:47:04,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:47:04,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 02:47:04,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086586480] [2023-08-04 02:47:04,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:47:04,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:47:04,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:47:04,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:47:04,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:47:04,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 306 [2023-08-04 02:47:04,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 48 transitions, 190 flow. Second operand has 5 states, 5 states have (on average 136.6) internal successors, (683), 5 states have internal predecessors, (683), 0 states have call successors, (0), 0 states 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 02:47:04,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:47:04,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 306 [2023-08-04 02:47:04,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:47:04,835 INFO L124 PetriNetUnfolderBase]: 4121/5504 cut-off events. [2023-08-04 02:47:04,835 INFO L125 PetriNetUnfolderBase]: For 2152/2152 co-relation queries the response was YES. [2023-08-04 02:47:04,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12520 conditions, 5504 events. 4121/5504 cut-off events. For 2152/2152 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 22464 event pairs, 1861 based on Foata normal form. 13/3473 useless extension candidates. Maximal degree in co-relation 11106. Up to 4663 conditions per place. [2023-08-04 02:47:04,909 INFO L140 encePairwiseOnDemand]: 302/306 looper letters, 57 selfloop transitions, 3 changer transitions 2/70 dead transitions. [2023-08-04 02:47:04,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 70 transitions, 366 flow [2023-08-04 02:47:04,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 02:47:04,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 02:47:04,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 583 transitions. [2023-08-04 02:47:04,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47630718954248363 [2023-08-04 02:47:04,912 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 583 transitions. [2023-08-04 02:47:04,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 583 transitions. [2023-08-04 02:47:04,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:47:04,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 583 transitions. [2023-08-04 02:47:04,914 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 145.75) internal successors, (583), 4 states have internal predecessors, (583), 0 states have call successors, (0), 0 states 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 02:47:04,916 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 306.0) internal successors, (1530), 5 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states 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 02:47:04,917 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 306.0) internal successors, (1530), 5 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states 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 02:47:04,917 INFO L175 Difference]: Start difference. First operand has 54 places, 48 transitions, 190 flow. Second operand 4 states and 583 transitions. [2023-08-04 02:47:04,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 70 transitions, 366 flow [2023-08-04 02:47:04,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 70 transitions, 362 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-04 02:47:04,928 INFO L231 Difference]: Finished difference. Result has 58 places, 47 transitions, 194 flow [2023-08-04 02:47:04,928 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=194, PETRI_PLACES=58, PETRI_TRANSITIONS=47} [2023-08-04 02:47:04,929 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 16 predicate places. [2023-08-04 02:47:04,929 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 47 transitions, 194 flow [2023-08-04 02:47:04,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 136.6) internal successors, (683), 5 states have internal predecessors, (683), 0 states have call successors, (0), 0 states 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 02:47:04,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:47:04,930 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, 1] [2023-08-04 02:47:04,936 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 02:47:05,135 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 02:47:05,136 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:47:05,136 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:47:05,136 INFO L85 PathProgramCache]: Analyzing trace with hash -479114054, now seen corresponding path program 1 times [2023-08-04 02:47:05,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:47:05,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013434177] [2023-08-04 02:47:05,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:47:05,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:47:05,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:47:05,337 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 02:47:05,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:47:05,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013434177] [2023-08-04 02:47:05,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013434177] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:47:05,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:47:05,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 02:47:05,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484189807] [2023-08-04 02:47:05,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:47:05,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 02:47:05,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:47:05,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 02:47:05,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 02:47:05,346 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 306 [2023-08-04 02:47:05,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 47 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states 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 02:47:05,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:47:05,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 306 [2023-08-04 02:47:05,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:47:05,803 INFO L124 PetriNetUnfolderBase]: 4908/6389 cut-off events. [2023-08-04 02:47:05,804 INFO L125 PetriNetUnfolderBase]: For 3428/3428 co-relation queries the response was YES. [2023-08-04 02:47:05,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14818 conditions, 6389 events. 4908/6389 cut-off events. For 3428/3428 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 25150 event pairs, 500 based on Foata normal form. 1/3951 useless extension candidates. Maximal degree in co-relation 14532. Up to 5460 conditions per place. [2023-08-04 02:47:05,834 INFO L140 encePairwiseOnDemand]: 300/306 looper letters, 67 selfloop transitions, 5 changer transitions 1/81 dead transitions. [2023-08-04 02:47:05,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 81 transitions, 498 flow [2023-08-04 02:47:05,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 02:47:05,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 02:47:05,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 471 transitions. [2023-08-04 02:47:05,836 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5130718954248366 [2023-08-04 02:47:05,836 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 471 transitions. [2023-08-04 02:47:05,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 471 transitions. [2023-08-04 02:47:05,836 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:47:05,836 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 471 transitions. [2023-08-04 02:47:05,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 0 states 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 02:47:05,839 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states 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 02:47:05,839 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states 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 02:47:05,839 INFO L175 Difference]: Start difference. First operand has 58 places, 47 transitions, 194 flow. Second operand 3 states and 471 transitions. [2023-08-04 02:47:05,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 81 transitions, 498 flow [2023-08-04 02:47:05,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 81 transitions, 482 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-04 02:47:05,850 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 219 flow [2023-08-04 02:47:05,850 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=186, 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=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=219, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2023-08-04 02:47:05,850 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 16 predicate places. [2023-08-04 02:47:05,850 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 219 flow [2023-08-04 02:47:05,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states 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 02:47:05,851 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:47:05,851 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, 1, 1] [2023-08-04 02:47:05,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-04 02:47:05,851 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:47:05,851 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:47:05,851 INFO L85 PathProgramCache]: Analyzing trace with hash -220298542, now seen corresponding path program 1 times [2023-08-04 02:47:05,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:47:05,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528430856] [2023-08-04 02:47:05,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:47:05,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:47:05,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:47:05,955 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 02:47:05,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:47:05,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528430856] [2023-08-04 02:47:05,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528430856] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:47:05,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:47:05,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-04 02:47:05,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245504341] [2023-08-04 02:47:05,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:47:05,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:47:05,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:47:05,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:47:05,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:47:06,026 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 306 [2023-08-04 02:47:06,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 219 flow. Second operand has 5 states, 5 states have (on average 132.8) internal successors, (664), 5 states have internal predecessors, (664), 0 states have call successors, (0), 0 states 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 02:47:06,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:47:06,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 306 [2023-08-04 02:47:06,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:47:06,994 INFO L124 PetriNetUnfolderBase]: 9243/12653 cut-off events. [2023-08-04 02:47:06,994 INFO L125 PetriNetUnfolderBase]: For 8299/8299 co-relation queries the response was YES. [2023-08-04 02:47:07,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34020 conditions, 12653 events. 9243/12653 cut-off events. For 8299/8299 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 64826 event pairs, 2979 based on Foata normal form. 374/13027 useless extension candidates. Maximal degree in co-relation 33408. Up to 6237 conditions per place. [2023-08-04 02:47:07,044 INFO L140 encePairwiseOnDemand]: 301/306 looper letters, 113 selfloop transitions, 4 changer transitions 0/124 dead transitions. [2023-08-04 02:47:07,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 124 transitions, 796 flow [2023-08-04 02:47:07,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 02:47:07,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 02:47:07,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 732 transitions. [2023-08-04 02:47:07,046 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47843137254901963 [2023-08-04 02:47:07,046 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 732 transitions. [2023-08-04 02:47:07,046 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 732 transitions. [2023-08-04 02:47:07,047 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:47:07,047 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 732 transitions. [2023-08-04 02:47:07,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 146.4) internal successors, (732), 5 states have internal predecessors, (732), 0 states have call successors, (0), 0 states 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 02:47:07,051 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 306.0) internal successors, (1836), 6 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states 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 02:47:07,051 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 306.0) internal successors, (1836), 6 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states 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 02:47:07,051 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 219 flow. Second operand 5 states and 732 transitions. [2023-08-04 02:47:07,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 124 transitions, 796 flow [2023-08-04 02:47:07,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 124 transitions, 785 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 02:47:07,095 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 247 flow [2023-08-04 02:47:07,096 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=247, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2023-08-04 02:47:07,096 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 22 predicate places. [2023-08-04 02:47:07,096 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 247 flow [2023-08-04 02:47:07,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.8) internal successors, (664), 5 states have internal predecessors, (664), 0 states have call successors, (0), 0 states 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 02:47:07,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:47:07,097 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, 1, 1] [2023-08-04 02:47:07,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-04 02:47:07,097 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:47:07,097 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:47:07,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1794056941, now seen corresponding path program 1 times [2023-08-04 02:47:07,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:47:07,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715676885] [2023-08-04 02:47:07,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:47:07,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:47:07,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:47:07,196 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-08-04 02:47:07,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:47:07,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715676885] [2023-08-04 02:47:07,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715676885] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:47:07,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:47:07,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-04 02:47:07,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502311809] [2023-08-04 02:47:07,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:47:07,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:47:07,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:47:07,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:47:07,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:47:07,253 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 306 [2023-08-04 02:47:07,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 247 flow. Second operand has 5 states, 5 states have (on average 132.6) internal successors, (663), 5 states have internal predecessors, (663), 0 states have call successors, (0), 0 states 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 02:47:07,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:47:07,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 306 [2023-08-04 02:47:07,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:47:08,083 INFO L124 PetriNetUnfolderBase]: 7573/10719 cut-off events. [2023-08-04 02:47:08,083 INFO L125 PetriNetUnfolderBase]: For 8352/8740 co-relation queries the response was YES. [2023-08-04 02:47:08,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28406 conditions, 10719 events. 7573/10719 cut-off events. For 8352/8740 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 56124 event pairs, 3749 based on Foata normal form. 674/11393 useless extension candidates. Maximal degree in co-relation 27828. Up to 6239 conditions per place. [2023-08-04 02:47:08,132 INFO L140 encePairwiseOnDemand]: 301/306 looper letters, 106 selfloop transitions, 4 changer transitions 0/118 dead transitions. [2023-08-04 02:47:08,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 118 transitions, 770 flow [2023-08-04 02:47:08,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 02:47:08,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 02:47:08,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 728 transitions. [2023-08-04 02:47:08,135 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47581699346405226 [2023-08-04 02:47:08,135 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 728 transitions. [2023-08-04 02:47:08,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 728 transitions. [2023-08-04 02:47:08,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:47:08,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 728 transitions. [2023-08-04 02:47:08,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 145.6) internal successors, (728), 5 states have internal predecessors, (728), 0 states have call successors, (0), 0 states 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 02:47:08,140 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 306.0) internal successors, (1836), 6 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states 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 02:47:08,141 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 306.0) internal successors, (1836), 6 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states 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 02:47:08,141 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 247 flow. Second operand 5 states and 728 transitions. [2023-08-04 02:47:08,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 118 transitions, 770 flow [2023-08-04 02:47:08,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 118 transitions, 766 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-04 02:47:08,188 INFO L231 Difference]: Finished difference. Result has 69 places, 55 transitions, 262 flow [2023-08-04 02:47:08,189 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=262, PETRI_PLACES=69, PETRI_TRANSITIONS=55} [2023-08-04 02:47:08,189 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 27 predicate places. [2023-08-04 02:47:08,189 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 55 transitions, 262 flow [2023-08-04 02:47:08,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.6) internal successors, (663), 5 states have internal predecessors, (663), 0 states have call successors, (0), 0 states 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 02:47:08,190 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:47:08,190 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, 1, 1] [2023-08-04 02:47:08,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-04 02:47:08,190 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:47:08,190 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:47:08,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1840779043, now seen corresponding path program 1 times [2023-08-04 02:47:08,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:47:08,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963591971] [2023-08-04 02:47:08,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:47:08,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:47:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:47:08,330 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 02:47:08,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:47:08,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963591971] [2023-08-04 02:47:08,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963591971] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:47:08,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:47:08,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-04 02:47:08,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163289282] [2023-08-04 02:47:08,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:47:08,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:47:08,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:47:08,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:47:08,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:47:08,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 306 [2023-08-04 02:47:08,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 55 transitions, 262 flow. Second operand has 5 states, 5 states have (on average 132.8) internal successors, (664), 5 states have internal predecessors, (664), 0 states have call successors, (0), 0 states 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 02:47:08,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:47:08,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 306 [2023-08-04 02:47:08,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:47:09,142 INFO L124 PetriNetUnfolderBase]: 6361/9105 cut-off events. [2023-08-04 02:47:09,142 INFO L125 PetriNetUnfolderBase]: For 8538/9098 co-relation queries the response was YES. [2023-08-04 02:47:09,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24878 conditions, 9105 events. 6361/9105 cut-off events. For 8538/9098 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 47684 event pairs, 2989 based on Foata normal form. 762/9867 useless extension candidates. Maximal degree in co-relation 24338. Up to 6257 conditions per place. [2023-08-04 02:47:09,172 INFO L140 encePairwiseOnDemand]: 301/306 looper letters, 99 selfloop transitions, 4 changer transitions 0/112 dead transitions. [2023-08-04 02:47:09,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 112 transitions, 732 flow [2023-08-04 02:47:09,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 02:47:09,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 02:47:09,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 723 transitions. [2023-08-04 02:47:09,174 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4725490196078431 [2023-08-04 02:47:09,174 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 723 transitions. [2023-08-04 02:47:09,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 723 transitions. [2023-08-04 02:47:09,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:47:09,174 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 723 transitions. [2023-08-04 02:47:09,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 144.6) internal successors, (723), 5 states have internal predecessors, (723), 0 states have call successors, (0), 0 states 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 02:47:09,178 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 306.0) internal successors, (1836), 6 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states 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 02:47:09,178 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 306.0) internal successors, (1836), 6 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states 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 02:47:09,178 INFO L175 Difference]: Start difference. First operand has 69 places, 55 transitions, 262 flow. Second operand 5 states and 723 transitions. [2023-08-04 02:47:09,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 112 transitions, 732 flow [2023-08-04 02:47:09,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 112 transitions, 727 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 02:47:09,206 INFO L231 Difference]: Finished difference. Result has 73 places, 56 transitions, 276 flow [2023-08-04 02:47:09,206 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=276, PETRI_PLACES=73, PETRI_TRANSITIONS=56} [2023-08-04 02:47:09,206 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 31 predicate places. [2023-08-04 02:47:09,206 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 56 transitions, 276 flow [2023-08-04 02:47:09,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.8) internal successors, (664), 5 states have internal predecessors, (664), 0 states have call successors, (0), 0 states 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 02:47:09,207 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:47:09,207 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, 1, 1] [2023-08-04 02:47:09,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-04 02:47:09,207 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:47:09,207 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:47:09,207 INFO L85 PathProgramCache]: Analyzing trace with hash 2008048024, now seen corresponding path program 1 times [2023-08-04 02:47:09,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:47:09,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192499134] [2023-08-04 02:47:09,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:47:09,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:47:09,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:47:09,296 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-08-04 02:47:09,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:47:09,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192499134] [2023-08-04 02:47:09,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192499134] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 02:47:09,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 02:47:09,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-04 02:47:09,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629748723] [2023-08-04 02:47:09,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:47:09,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:47:09,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:47:09,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:47:09,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 02:47:09,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 306 [2023-08-04 02:47:09,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 56 transitions, 276 flow. Second operand has 5 states, 5 states have (on average 132.8) internal successors, (664), 5 states have internal predecessors, (664), 0 states have call successors, (0), 0 states 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 02:47:09,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:47:09,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 306 [2023-08-04 02:47:09,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:47:09,982 INFO L124 PetriNetUnfolderBase]: 5583/7837 cut-off events. [2023-08-04 02:47:09,982 INFO L125 PetriNetUnfolderBase]: For 8789/9218 co-relation queries the response was YES. [2023-08-04 02:47:10,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22364 conditions, 7837 events. 5583/7837 cut-off events. For 8789/9218 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 38845 event pairs, 2646 based on Foata normal form. 524/8361 useless extension candidates. Maximal degree in co-relation 21930. Up to 6361 conditions per place. [2023-08-04 02:47:10,023 INFO L140 encePairwiseOnDemand]: 301/306 looper letters, 43 selfloop transitions, 2 changer transitions 53/105 dead transitions. [2023-08-04 02:47:10,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 105 transitions, 695 flow [2023-08-04 02:47:10,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 02:47:10,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 02:47:10,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 718 transitions. [2023-08-04 02:47:10,025 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.469281045751634 [2023-08-04 02:47:10,025 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 718 transitions. [2023-08-04 02:47:10,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 718 transitions. [2023-08-04 02:47:10,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:47:10,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 718 transitions. [2023-08-04 02:47:10,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.6) internal successors, (718), 5 states have internal predecessors, (718), 0 states have call successors, (0), 0 states 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 02:47:10,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 306.0) internal successors, (1836), 6 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states 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 02:47:10,029 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 306.0) internal successors, (1836), 6 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states 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 02:47:10,029 INFO L175 Difference]: Start difference. First operand has 73 places, 56 transitions, 276 flow. Second operand 5 states and 718 transitions. [2023-08-04 02:47:10,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 105 transitions, 695 flow [2023-08-04 02:47:10,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 105 transitions, 684 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-04 02:47:10,069 INFO L231 Difference]: Finished difference. Result has 77 places, 52 transitions, 242 flow [2023-08-04 02:47:10,069 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=242, PETRI_PLACES=77, PETRI_TRANSITIONS=52} [2023-08-04 02:47:10,069 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 35 predicate places. [2023-08-04 02:47:10,069 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 52 transitions, 242 flow [2023-08-04 02:47:10,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.8) internal successors, (664), 5 states have internal predecessors, (664), 0 states have call successors, (0), 0 states 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 02:47:10,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:47:10,070 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, 1, 1, 1] [2023-08-04 02:47:10,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-04 02:47:10,070 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:47:10,070 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:47:10,070 INFO L85 PathProgramCache]: Analyzing trace with hash -764897442, now seen corresponding path program 1 times [2023-08-04 02:47:10,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:47:10,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54987698] [2023-08-04 02:47:10,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:47:10,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:47:10,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:47:10,168 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-08-04 02:47:10,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:47:10,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54987698] [2023-08-04 02:47:10,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54987698] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:47:10,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290218443] [2023-08-04 02:47:10,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:47:10,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:47:10,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:47:10,170 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 02:47:10,189 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 02:47:10,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:47:10,290 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-04 02:47:10,301 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:47:10,349 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-08-04 02:47:10,349 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:47:10,382 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-08-04 02:47:10,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290218443] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:47:10,383 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:47:10,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2023-08-04 02:47:10,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944293217] [2023-08-04 02:47:10,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:47:10,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-04 02:47:10,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:47:10,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-04 02:47:10,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-08-04 02:47:10,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 306 [2023-08-04 02:47:10,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 52 transitions, 242 flow. Second operand has 10 states, 10 states have (on average 128.1) internal successors, (1281), 10 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states 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 02:47:10,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:47:10,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 306 [2023-08-04 02:47:10,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:47:11,183 INFO L124 PetriNetUnfolderBase]: 5240/6997 cut-off events. [2023-08-04 02:47:11,184 INFO L125 PetriNetUnfolderBase]: For 5478/5478 co-relation queries the response was YES. [2023-08-04 02:47:11,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19327 conditions, 6997 events. 5240/6997 cut-off events. For 5478/5478 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 30889 event pairs, 1734 based on Foata normal form. 371/7368 useless extension candidates. Maximal degree in co-relation 19296. Up to 5035 conditions per place. [2023-08-04 02:47:11,219 INFO L140 encePairwiseOnDemand]: 301/306 looper letters, 70 selfloop transitions, 5 changer transitions 0/82 dead transitions. [2023-08-04 02:47:11,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 82 transitions, 540 flow [2023-08-04 02:47:11,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 02:47:11,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 02:47:11,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 683 transitions. [2023-08-04 02:47:11,221 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44640522875816996 [2023-08-04 02:47:11,221 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 683 transitions. [2023-08-04 02:47:11,221 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 683 transitions. [2023-08-04 02:47:11,221 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:47:11,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 683 transitions. [2023-08-04 02:47:11,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.6) internal successors, (683), 5 states have internal predecessors, (683), 0 states have call successors, (0), 0 states 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 02:47:11,225 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 306.0) internal successors, (1836), 6 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states 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 02:47:11,225 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 306.0) internal successors, (1836), 6 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states 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 02:47:11,225 INFO L175 Difference]: Start difference. First operand has 77 places, 52 transitions, 242 flow. Second operand 5 states and 683 transitions. [2023-08-04 02:47:11,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 82 transitions, 540 flow [2023-08-04 02:47:11,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 82 transitions, 514 flow, removed 11 selfloop flow, removed 10 redundant places. [2023-08-04 02:47:11,240 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 243 flow [2023-08-04 02:47:11,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=243, PETRI_PLACES=64, PETRI_TRANSITIONS=53} [2023-08-04 02:47:11,240 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 22 predicate places. [2023-08-04 02:47:11,240 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 243 flow [2023-08-04 02:47:11,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 128.1) internal successors, (1281), 10 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states 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 02:47:11,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:47:11,241 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, 1, 1, 1] [2023-08-04 02:47:11,246 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 02:47:11,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:47:11,446 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:47:11,446 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:47:11,446 INFO L85 PathProgramCache]: Analyzing trace with hash -482879231, now seen corresponding path program 1 times [2023-08-04 02:47:11,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:47:11,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182189696] [2023-08-04 02:47:11,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:47:11,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:47:11,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:47:11,551 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-08-04 02:47:11,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:47:11,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182189696] [2023-08-04 02:47:11,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182189696] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:47:11,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232035513] [2023-08-04 02:47:11,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:47:11,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:47:11,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:47:11,557 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 02:47:11,560 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 02:47:11,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:47:11,663 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-04 02:47:11,665 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:47:11,692 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-08-04 02:47:11,692 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:47:11,719 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 02:47:11,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232035513] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-04 02:47:11,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-04 02:47:11,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2023-08-04 02:47:11,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487696887] [2023-08-04 02:47:11,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:47:11,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:47:11,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:47:11,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:47:11,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-08-04 02:47:11,772 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 306 [2023-08-04 02:47:11,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 243 flow. Second operand has 5 states, 5 states have (on average 130.0) internal successors, (650), 5 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:47:11,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:47:11,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 306 [2023-08-04 02:47:11,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:47:12,374 INFO L124 PetriNetUnfolderBase]: 4518/6110 cut-off events. [2023-08-04 02:47:12,374 INFO L125 PetriNetUnfolderBase]: For 6086/6776 co-relation queries the response was YES. [2023-08-04 02:47:12,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17849 conditions, 6110 events. 4518/6110 cut-off events. For 6086/6776 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 27023 event pairs, 1697 based on Foata normal form. 991/7101 useless extension candidates. Maximal degree in co-relation 17817. Up to 4502 conditions per place. [2023-08-04 02:47:12,397 INFO L140 encePairwiseOnDemand]: 301/306 looper letters, 75 selfloop transitions, 5 changer transitions 0/87 dead transitions. [2023-08-04 02:47:12,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 87 transitions, 570 flow [2023-08-04 02:47:12,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 02:47:12,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 02:47:12,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 685 transitions. [2023-08-04 02:47:12,399 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4477124183006536 [2023-08-04 02:47:12,399 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 685 transitions. [2023-08-04 02:47:12,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 685 transitions. [2023-08-04 02:47:12,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:47:12,399 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 685 transitions. [2023-08-04 02:47:12,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.0) internal successors, (685), 5 states have internal predecessors, (685), 0 states have call successors, (0), 0 states 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 02:47:12,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 306.0) internal successors, (1836), 6 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states 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 02:47:12,402 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 306.0) internal successors, (1836), 6 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states 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 02:47:12,402 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 243 flow. Second operand 5 states and 685 transitions. [2023-08-04 02:47:12,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 87 transitions, 570 flow [2023-08-04 02:47:12,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 87 transitions, 553 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-04 02:47:12,414 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 253 flow [2023-08-04 02:47:12,414 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=253, PETRI_PLACES=66, PETRI_TRANSITIONS=54} [2023-08-04 02:47:12,415 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 24 predicate places. [2023-08-04 02:47:12,415 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 253 flow [2023-08-04 02:47:12,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.0) internal successors, (650), 5 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 02:47:12,415 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:47:12,415 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, 1, 1, 1, 1] [2023-08-04 02:47:12,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-04 02:47:12,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:47:12,621 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:47:12,621 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:47:12,621 INFO L85 PathProgramCache]: Analyzing trace with hash -157556449, now seen corresponding path program 1 times [2023-08-04 02:47:12,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:47:12,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733401467] [2023-08-04 02:47:12,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:47:12,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:47:12,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:47:12,745 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 02:47:12,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:47:12,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733401467] [2023-08-04 02:47:12,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733401467] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:47:12,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [570228077] [2023-08-04 02:47:12,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:47:12,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:47:12,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:47:12,747 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 02:47:12,766 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 02:47:12,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:47:12,868 INFO L262 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-04 02:47:12,869 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:47:12,915 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 02:47:12,915 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:47:12,957 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 02:47:12,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [570228077] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:47:12,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:47:12,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2023-08-04 02:47:12,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90068734] [2023-08-04 02:47:12,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:47:12,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-04 02:47:12,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:47:12,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-04 02:47:12,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-08-04 02:47:13,099 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 306 [2023-08-04 02:47:13,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 253 flow. Second operand has 10 states, 10 states have (on average 128.5) internal successors, (1285), 10 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states 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 02:47:13,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:47:13,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 306 [2023-08-04 02:47:13,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:47:13,608 INFO L124 PetriNetUnfolderBase]: 4073/5596 cut-off events. [2023-08-04 02:47:13,608 INFO L125 PetriNetUnfolderBase]: For 7040/8333 co-relation queries the response was YES. [2023-08-04 02:47:13,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17236 conditions, 5596 events. 4073/5596 cut-off events. For 7040/8333 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 24577 event pairs, 1645 based on Foata normal form. 1555/7151 useless extension candidates. Maximal degree in co-relation 17203. Up to 4201 conditions per place. [2023-08-04 02:47:13,634 INFO L140 encePairwiseOnDemand]: 301/306 looper letters, 71 selfloop transitions, 5 changer transitions 0/83 dead transitions. [2023-08-04 02:47:13,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 83 transitions, 546 flow [2023-08-04 02:47:13,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 02:47:13,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 02:47:13,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 680 transitions. [2023-08-04 02:47:13,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2023-08-04 02:47:13,636 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 680 transitions. [2023-08-04 02:47:13,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 680 transitions. [2023-08-04 02:47:13,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:47:13,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 680 transitions. [2023-08-04 02:47:13,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.0) internal successors, (680), 5 states have internal predecessors, (680), 0 states have call successors, (0), 0 states 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 02:47:13,639 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 306.0) internal successors, (1836), 6 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states 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 02:47:13,639 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 306.0) internal successors, (1836), 6 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states 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 02:47:13,639 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 253 flow. Second operand 5 states and 680 transitions. [2023-08-04 02:47:13,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 83 transitions, 546 flow [2023-08-04 02:47:13,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 83 transitions, 529 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-04 02:47:13,652 INFO L231 Difference]: Finished difference. Result has 68 places, 55 transitions, 263 flow [2023-08-04 02:47:13,652 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=263, PETRI_PLACES=68, PETRI_TRANSITIONS=55} [2023-08-04 02:47:13,653 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 26 predicate places. [2023-08-04 02:47:13,653 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 55 transitions, 263 flow [2023-08-04 02:47:13,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 128.5) internal successors, (1285), 10 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states 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 02:47:13,653 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:47:13,653 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, 1, 1, 1, 1, 1] [2023-08-04 02:47:13,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-04 02:47:13,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-08-04 02:47:13,859 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:47:13,859 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:47:13,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1485852754, now seen corresponding path program 1 times [2023-08-04 02:47:13,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:47:13,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621785782] [2023-08-04 02:47:13,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:47:13,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:47:13,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:47:13,934 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-08-04 02:47:13,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:47:13,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621785782] [2023-08-04 02:47:13,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621785782] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:47:13,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102750119] [2023-08-04 02:47:13,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:47:13,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:47:13,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:47:13,936 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 02:47:13,938 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 02:47:14,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:47:14,052 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-04 02:47:14,053 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:47:14,100 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-08-04 02:47:14,101 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:47:14,152 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-08-04 02:47:14,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102750119] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-04 02:47:14,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-04 02:47:14,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2023-08-04 02:47:14,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848084803] [2023-08-04 02:47:14,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 02:47:14,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 02:47:14,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:47:14,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 02:47:14,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-08-04 02:47:14,216 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 306 [2023-08-04 02:47:14,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 55 transitions, 263 flow. Second operand has 5 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 0 states have call successors, (0), 0 states 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 02:47:14,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:47:14,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 306 [2023-08-04 02:47:14,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:47:14,725 INFO L124 PetriNetUnfolderBase]: 3796/5286 cut-off events. [2023-08-04 02:47:14,729 INFO L125 PetriNetUnfolderBase]: For 8105/9970 co-relation queries the response was YES. [2023-08-04 02:47:14,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17187 conditions, 5286 events. 3796/5286 cut-off events. For 8105/9970 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 23317 event pairs, 1541 based on Foata normal form. 2093/7379 useless extension candidates. Maximal degree in co-relation 17153. Up to 4094 conditions per place. [2023-08-04 02:47:14,760 INFO L140 encePairwiseOnDemand]: 301/306 looper letters, 70 selfloop transitions, 5 changer transitions 0/82 dead transitions. [2023-08-04 02:47:14,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 82 transitions, 551 flow [2023-08-04 02:47:14,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 02:47:14,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 02:47:14,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 678 transitions. [2023-08-04 02:47:14,764 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44313725490196076 [2023-08-04 02:47:14,764 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 678 transitions. [2023-08-04 02:47:14,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 678 transitions. [2023-08-04 02:47:14,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:47:14,764 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 678 transitions. [2023-08-04 02:47:14,765 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.6) internal successors, (678), 5 states have internal predecessors, (678), 0 states have call successors, (0), 0 states 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 02:47:14,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 306.0) internal successors, (1836), 6 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states 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 02:47:14,767 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 306.0) internal successors, (1836), 6 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states 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 02:47:14,767 INFO L175 Difference]: Start difference. First operand has 68 places, 55 transitions, 263 flow. Second operand 5 states and 678 transitions. [2023-08-04 02:47:14,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 82 transitions, 551 flow [2023-08-04 02:47:14,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 82 transitions, 534 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-04 02:47:14,780 INFO L231 Difference]: Finished difference. Result has 70 places, 56 transitions, 273 flow [2023-08-04 02:47:14,780 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=273, PETRI_PLACES=70, PETRI_TRANSITIONS=56} [2023-08-04 02:47:14,780 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 28 predicate places. [2023-08-04 02:47:14,780 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 56 transitions, 273 flow [2023-08-04 02:47:14,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 0 states have call successors, (0), 0 states 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 02:47:14,781 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:47:14,781 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, 1, 1, 1, 1, 1, 1] [2023-08-04 02:47:14,787 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 02:47:14,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:47:14,987 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:47:14,987 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:47:14,987 INFO L85 PathProgramCache]: Analyzing trace with hash -950739524, now seen corresponding path program 1 times [2023-08-04 02:47:14,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:47:14,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285671175] [2023-08-04 02:47:14,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:47:14,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:47:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:47:16,082 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 02:47:16,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:47:16,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285671175] [2023-08-04 02:47:16,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285671175] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:47:16,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1136636400] [2023-08-04 02:47:16,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:47:16,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:47:16,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:47:16,084 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 02:47:16,088 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 02:47:16,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:47:16,196 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 84 conjunts are in the unsatisfiable core [2023-08-04 02:47:16,200 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:47:16,256 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-04 02:47:16,312 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 02:47:16,408 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 02:47:16,410 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 02:47:16,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 02:47:16,512 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 02:47:16,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 02:47:16,537 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 02:47:16,661 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-04 02:47:16,661 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:47:17,070 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_616 (Array Int Int)) (v_ArrVal_618 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_616))) (< (* (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_618) c_~A~0.base) c_~A~0.offset) 2) (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~counter~0 1)))) (forall ((v_ArrVal_616 (Array Int Int)) (v_ArrVal_618 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_616))) (<= (+ (select (select .cse1 c_~A~0.base) c_~A~0.offset) c_~counter~0) (* (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_618) c_~A~0.base) c_~A~0.offset) 2))))) is different from false [2023-08-04 02:47:17,105 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* |c_thread1Thread1of2ForFork1_~i~0#1| 4))))) (and (forall ((v_ArrVal_616 (Array Int Int)) (v_ArrVal_618 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_616))) (< (* (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_618) c_~A~0.base) c_~A~0.offset) 2) (+ (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~counter~0 .cse1 1)))) (forall ((v_ArrVal_616 (Array Int Int)) (v_ArrVal_618 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_616))) (<= (+ (select (select .cse2 c_~A~0.base) c_~A~0.offset) c_~counter~0 .cse1) (* (select (select (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_618) c_~A~0.base) c_~A~0.offset) 2)))))) is different from false [2023-08-04 02:47:17,120 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (and (forall ((v_ArrVal_616 (Array Int Int)) (v_ArrVal_618 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_616))) (< (* (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_618) c_~A~0.base) c_~A~0.offset) 2) (+ .cse1 (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~counter~0 1)))) (forall ((v_ArrVal_616 (Array Int Int)) (v_ArrVal_618 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_616))) (<= (+ .cse1 (select (select .cse2 c_~A~0.base) c_~A~0.offset) c_~counter~0) (* (select (select (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_618) c_~A~0.base) c_~A~0.offset) 2)))))) is different from false [2023-08-04 02:47:17,164 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_616 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (v_ArrVal_618 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_616))) (< (* (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_618) c_~A~0.base) c_~A~0.offset) 2) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_615) c_~A~0.base) c_~A~0.offset) (select (select .cse0 c_~A~0.base) c_~A~0.offset) c_~counter~0 1)))) (forall ((v_ArrVal_616 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (v_ArrVal_618 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_616))) (<= (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_615) c_~A~0.base) c_~A~0.offset) (select (select .cse1 c_~A~0.base) c_~A~0.offset) c_~counter~0) (* (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_618) c_~A~0.base) c_~A~0.offset) 2))))) is different from false [2023-08-04 02:47:17,177 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_616 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (v_ArrVal_618 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_616))) (<= (+ c_~counter~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_615) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (* 2 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_618) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))) (forall ((v_ArrVal_616 (Array Int Int)) (v_ArrVal_615 (Array Int Int)) (v_ArrVal_618 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_616))) (< (* 2 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_618) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (+ c_~counter~0 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_615) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) is different from false [2023-08-04 02:47:17,187 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 02:47:17,187 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 68 treesize of output 45 [2023-08-04 02:47:17,192 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 364 treesize of output 316 [2023-08-04 02:47:17,202 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 37 treesize of output 33 [2023-08-04 02:47:17,207 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 33 treesize of output 29 [2023-08-04 02:47:17,210 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 59 treesize of output 55 [2023-08-04 02:47:17,240 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 02:47:17,241 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 46 [2023-08-04 02:47:17,244 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-04 02:47:17,244 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-04 02:47:17,270 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 8 not checked. [2023-08-04 02:47:17,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1136636400] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:47:17,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:47:17,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 33 [2023-08-04 02:47:17,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721964480] [2023-08-04 02:47:17,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:47:17,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-08-04 02:47:17,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:47:17,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-08-04 02:47:17,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=735, Unknown=25, NotChecked=300, Total=1190 [2023-08-04 02:47:17,295 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 306 [2023-08-04 02:47:17,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 56 transitions, 273 flow. Second operand has 35 states, 35 states have (on average 92.62857142857143) internal successors, (3242), 35 states have internal predecessors, (3242), 0 states have call successors, (0), 0 states 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 02:47:17,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:47:17,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 306 [2023-08-04 02:47:17,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:47:20,209 INFO L124 PetriNetUnfolderBase]: 11583/15713 cut-off events. [2023-08-04 02:47:20,209 INFO L125 PetriNetUnfolderBase]: For 21702/21702 co-relation queries the response was YES. [2023-08-04 02:47:20,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53075 conditions, 15713 events. 11583/15713 cut-off events. For 21702/21702 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 73480 event pairs, 1321 based on Foata normal form. 1/15709 useless extension candidates. Maximal degree in co-relation 53040. Up to 11716 conditions per place. [2023-08-04 02:47:20,444 INFO L140 encePairwiseOnDemand]: 295/306 looper letters, 222 selfloop transitions, 56 changer transitions 1/283 dead transitions. [2023-08-04 02:47:20,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 283 transitions, 2021 flow [2023-08-04 02:47:20,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-08-04 02:47:20,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-08-04 02:47:20,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1605 transitions. [2023-08-04 02:47:20,448 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34967320261437906 [2023-08-04 02:47:20,448 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1605 transitions. [2023-08-04 02:47:20,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1605 transitions. [2023-08-04 02:47:20,449 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:47:20,449 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1605 transitions. [2023-08-04 02:47:20,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 107.0) internal successors, (1605), 15 states have internal predecessors, (1605), 0 states have call successors, (0), 0 states 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 02:47:20,456 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 306.0) internal successors, (4896), 16 states have internal predecessors, (4896), 0 states have call successors, (0), 0 states 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 02:47:20,457 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 306.0) internal successors, (4896), 16 states have internal predecessors, (4896), 0 states have call successors, (0), 0 states 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 02:47:20,457 INFO L175 Difference]: Start difference. First operand has 70 places, 56 transitions, 273 flow. Second operand 15 states and 1605 transitions. [2023-08-04 02:47:20,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 283 transitions, 2021 flow [2023-08-04 02:47:20,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 283 transitions, 1976 flow, removed 11 selfloop flow, removed 3 redundant places. [2023-08-04 02:47:20,490 INFO L231 Difference]: Finished difference. Result has 88 places, 106 transitions, 686 flow [2023-08-04 02:47:20,490 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=686, PETRI_PLACES=88, PETRI_TRANSITIONS=106} [2023-08-04 02:47:20,491 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 46 predicate places. [2023-08-04 02:47:20,491 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 106 transitions, 686 flow [2023-08-04 02:47:20,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 92.62857142857143) internal successors, (3242), 35 states have internal predecessors, (3242), 0 states have call successors, (0), 0 states 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 02:47:20,491 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:47:20,492 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, 1, 1, 1, 1, 1, 1] [2023-08-04 02:47:20,497 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 02:47:20,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:47:20,692 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:47:20,692 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:47:20,692 INFO L85 PathProgramCache]: Analyzing trace with hash 961377954, now seen corresponding path program 2 times [2023-08-04 02:47:20,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:47:20,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688002713] [2023-08-04 02:47:20,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:47:20,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:47:20,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:47:21,482 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-04 02:47:21,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:47:21,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688002713] [2023-08-04 02:47:21,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688002713] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:47:21,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792201781] [2023-08-04 02:47:21,482 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 02:47:21,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:47:21,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:47:21,484 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 02:47:21,503 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 02:47:21,615 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 02:47:21,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 02:47:21,617 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 69 conjunts are in the unsatisfiable core [2023-08-04 02:47:21,620 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:47:21,924 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-04 02:47:21,924 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:47:22,072 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 02:47:22,073 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 58 [2023-08-04 02:47:22,311 INFO L322 Elim1Store]: treesize reduction 16, result has 67.3 percent of original size [2023-08-04 02:47:22,312 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 41 [2023-08-04 02:47:22,646 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-04 02:47:22,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792201781] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:47:22,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:47:22,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 17 [2023-08-04 02:47:22,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048873021] [2023-08-04 02:47:22,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:47:22,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-04 02:47:22,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:47:22,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-04 02:47:22,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2023-08-04 02:47:23,387 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 306 [2023-08-04 02:47:23,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 106 transitions, 686 flow. Second operand has 19 states, 19 states have (on average 123.63157894736842) internal successors, (2349), 19 states have internal predecessors, (2349), 0 states have call successors, (0), 0 states 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 02:47:23,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:47:23,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 306 [2023-08-04 02:47:23,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:47:25,517 INFO L124 PetriNetUnfolderBase]: 13295/18207 cut-off events. [2023-08-04 02:47:25,517 INFO L125 PetriNetUnfolderBase]: For 44149/44149 co-relation queries the response was YES. [2023-08-04 02:47:25,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72152 conditions, 18207 events. 13295/18207 cut-off events. For 44149/44149 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 87932 event pairs, 3133 based on Foata normal form. 1/18202 useless extension candidates. Maximal degree in co-relation 72110. Up to 15961 conditions per place. [2023-08-04 02:47:25,647 INFO L140 encePairwiseOnDemand]: 296/306 looper letters, 205 selfloop transitions, 55 changer transitions 1/265 dead transitions. [2023-08-04 02:47:25,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 265 transitions, 2138 flow [2023-08-04 02:47:25,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-04 02:47:25,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-04 02:47:25,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1626 transitions. [2023-08-04 02:47:25,651 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44281045751633985 [2023-08-04 02:47:25,651 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1626 transitions. [2023-08-04 02:47:25,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1626 transitions. [2023-08-04 02:47:25,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:47:25,652 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1626 transitions. [2023-08-04 02:47:25,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 135.5) internal successors, (1626), 12 states have internal predecessors, (1626), 0 states have call successors, (0), 0 states 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 02:47:25,657 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 306.0) internal successors, (3978), 13 states have internal predecessors, (3978), 0 states have call successors, (0), 0 states 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 02:47:25,658 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 306.0) internal successors, (3978), 13 states have internal predecessors, (3978), 0 states have call successors, (0), 0 states 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 02:47:25,658 INFO L175 Difference]: Start difference. First operand has 88 places, 106 transitions, 686 flow. Second operand 12 states and 1626 transitions. [2023-08-04 02:47:25,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 265 transitions, 2138 flow [2023-08-04 02:47:25,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 265 transitions, 2023 flow, removed 44 selfloop flow, removed 2 redundant places. [2023-08-04 02:47:25,729 INFO L231 Difference]: Finished difference. Result has 104 places, 153 transitions, 1084 flow [2023-08-04 02:47:25,729 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=596, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1084, PETRI_PLACES=104, PETRI_TRANSITIONS=153} [2023-08-04 02:47:25,730 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 62 predicate places. [2023-08-04 02:47:25,730 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 153 transitions, 1084 flow [2023-08-04 02:47:25,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 123.63157894736842) internal successors, (2349), 19 states have internal predecessors, (2349), 0 states have call successors, (0), 0 states 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 02:47:25,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:47:25,730 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, 1, 1, 1, 1, 1, 1] [2023-08-04 02:47:25,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-08-04 02:47:25,931 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,SelfDestructingSolverStorable23 [2023-08-04 02:47:25,931 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:47:25,931 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:47:25,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1618965502, now seen corresponding path program 3 times [2023-08-04 02:47:25,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:47:25,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983427487] [2023-08-04 02:47:25,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:47:25,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:47:25,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:47:26,593 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-04 02:47:26,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:47:26,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983427487] [2023-08-04 02:47:26,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983427487] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:47:26,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078903923] [2023-08-04 02:47:26,594 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-04 02:47:26,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:47:26,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:47:26,598 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 02:47:26,624 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 02:47:26,759 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-08-04 02:47:26,759 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 02:47:26,762 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 69 conjunts are in the unsatisfiable core [2023-08-04 02:47:26,764 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:47:26,980 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-04 02:47:26,980 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:47:27,154 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 02:47:27,154 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 57 [2023-08-04 02:47:27,339 INFO L322 Elim1Store]: treesize reduction 16, result has 67.3 percent of original size [2023-08-04 02:47:27,340 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 42 [2023-08-04 02:47:27,561 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-04 02:47:27,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078903923] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:47:27,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:47:27,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 17 [2023-08-04 02:47:27,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46836987] [2023-08-04 02:47:27,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:47:27,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-04 02:47:27,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:47:27,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-04 02:47:27,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2023-08-04 02:47:28,140 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 306 [2023-08-04 02:47:28,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 153 transitions, 1084 flow. Second operand has 19 states, 19 states have (on average 123.36842105263158) internal successors, (2344), 19 states have internal predecessors, (2344), 0 states have call successors, (0), 0 states 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 02:47:28,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:47:28,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 306 [2023-08-04 02:47:28,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:47:30,696 INFO L124 PetriNetUnfolderBase]: 16055/21999 cut-off events. [2023-08-04 02:47:30,696 INFO L125 PetriNetUnfolderBase]: For 79039/79039 co-relation queries the response was YES. [2023-08-04 02:47:30,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94346 conditions, 21999 events. 16055/21999 cut-off events. For 79039/79039 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 107846 event pairs, 5409 based on Foata normal form. 1/21994 useless extension candidates. Maximal degree in co-relation 94297. Up to 18410 conditions per place. [2023-08-04 02:47:30,907 INFO L140 encePairwiseOnDemand]: 295/306 looper letters, 217 selfloop transitions, 107 changer transitions 1/329 dead transitions. [2023-08-04 02:47:30,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 329 transitions, 2832 flow [2023-08-04 02:47:30,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-04 02:47:30,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-04 02:47:30,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1499 transitions. [2023-08-04 02:47:30,910 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4453357100415924 [2023-08-04 02:47:30,910 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1499 transitions. [2023-08-04 02:47:30,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1499 transitions. [2023-08-04 02:47:30,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:47:30,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1499 transitions. [2023-08-04 02:47:30,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 136.27272727272728) internal successors, (1499), 11 states have internal predecessors, (1499), 0 states have call successors, (0), 0 states 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 02:47:30,916 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 306.0) internal successors, (3672), 12 states have internal predecessors, (3672), 0 states have call successors, (0), 0 states 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 02:47:30,917 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 306.0) internal successors, (3672), 12 states have internal predecessors, (3672), 0 states have call successors, (0), 0 states 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 02:47:30,917 INFO L175 Difference]: Start difference. First operand has 104 places, 153 transitions, 1084 flow. Second operand 11 states and 1499 transitions. [2023-08-04 02:47:30,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 329 transitions, 2832 flow [2023-08-04 02:47:31,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 329 transitions, 2732 flow, removed 50 selfloop flow, removed 0 redundant places. [2023-08-04 02:47:31,096 INFO L231 Difference]: Finished difference. Result has 120 places, 221 transitions, 1874 flow [2023-08-04 02:47:31,096 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=990, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1874, PETRI_PLACES=120, PETRI_TRANSITIONS=221} [2023-08-04 02:47:31,096 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 78 predicate places. [2023-08-04 02:47:31,096 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 221 transitions, 1874 flow [2023-08-04 02:47:31,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 123.36842105263158) internal successors, (2344), 19 states have internal predecessors, (2344), 0 states have call successors, (0), 0 states 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 02:47:31,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:47:31,097 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, 1, 1, 1, 1, 1, 1] [2023-08-04 02:47:31,106 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 02:47:31,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:47:31,304 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:47:31,304 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:47:31,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1786955284, now seen corresponding path program 4 times [2023-08-04 02:47:31,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:47:31,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112192059] [2023-08-04 02:47:31,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:47:31,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:47:31,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:47:32,298 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 02:47:32,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:47:32,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112192059] [2023-08-04 02:47:32,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112192059] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:47:32,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247434552] [2023-08-04 02:47:32,299 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-04 02:47:32,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:47:32,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:47:32,300 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 02:47:32,303 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 02:47:32,439 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-04 02:47:32,439 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 02:47:32,442 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 84 conjunts are in the unsatisfiable core [2023-08-04 02:47:32,444 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:47:32,477 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-04 02:47:32,533 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 02:47:32,565 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 02:47:32,646 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 02:47:32,670 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 02:47:32,817 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 02:47:32,818 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:47:33,181 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 02:47:33,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247434552] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:47:33,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:47:33,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 9] total 26 [2023-08-04 02:47:33,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810717006] [2023-08-04 02:47:33,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:47:33,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-08-04 02:47:33,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:47:33,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-08-04 02:47:33,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=651, Unknown=1, NotChecked=0, Total=756 [2023-08-04 02:47:34,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 306 [2023-08-04 02:47:34,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 221 transitions, 1874 flow. Second operand has 28 states, 28 states have (on average 92.85714285714286) internal successors, (2600), 28 states have internal predecessors, (2600), 0 states have call successors, (0), 0 states 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 02:47:34,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:47:34,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 306 [2023-08-04 02:47:34,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:47:38,956 INFO L124 PetriNetUnfolderBase]: 21089/28696 cut-off events. [2023-08-04 02:47:38,957 INFO L125 PetriNetUnfolderBase]: For 126442/126442 co-relation queries the response was YES. [2023-08-04 02:47:39,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135411 conditions, 28696 events. 21089/28696 cut-off events. For 126442/126442 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 146713 event pairs, 3227 based on Foata normal form. 1/28692 useless extension candidates. Maximal degree in co-relation 135354. Up to 21886 conditions per place. [2023-08-04 02:47:39,173 INFO L140 encePairwiseOnDemand]: 293/306 looper letters, 259 selfloop transitions, 229 changer transitions 1/493 dead transitions. [2023-08-04 02:47:39,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 493 transitions, 4861 flow [2023-08-04 02:47:39,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-04 02:47:39,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-04 02:47:39,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1485 transitions. [2023-08-04 02:47:39,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34663865546218486 [2023-08-04 02:47:39,175 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1485 transitions. [2023-08-04 02:47:39,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1485 transitions. [2023-08-04 02:47:39,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:47:39,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1485 transitions. [2023-08-04 02:47:39,178 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 106.07142857142857) internal successors, (1485), 14 states have internal predecessors, (1485), 0 states have call successors, (0), 0 states 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 02:47:39,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 306.0) internal successors, (4590), 15 states have internal predecessors, (4590), 0 states have call successors, (0), 0 states 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 02:47:39,182 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 306.0) internal successors, (4590), 15 states have internal predecessors, (4590), 0 states have call successors, (0), 0 states 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 02:47:39,182 INFO L175 Difference]: Start difference. First operand has 120 places, 221 transitions, 1874 flow. Second operand 14 states and 1485 transitions. [2023-08-04 02:47:39,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 493 transitions, 4861 flow [2023-08-04 02:47:39,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 493 transitions, 4674 flow, removed 61 selfloop flow, removed 2 redundant places. [2023-08-04 02:47:39,793 INFO L231 Difference]: Finished difference. Result has 139 places, 352 transitions, 3701 flow [2023-08-04 02:47:39,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=1773, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3701, PETRI_PLACES=139, PETRI_TRANSITIONS=352} [2023-08-04 02:47:39,794 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 97 predicate places. [2023-08-04 02:47:39,794 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 352 transitions, 3701 flow [2023-08-04 02:47:39,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 92.85714285714286) internal successors, (2600), 28 states have internal predecessors, (2600), 0 states have call successors, (0), 0 states 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 02:47:39,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:47:39,794 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, 1, 1, 1, 1, 1, 1] [2023-08-04 02:47:39,799 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 02:47:39,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:47:39,995 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:47:39,995 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:47:39,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1212655278, now seen corresponding path program 5 times [2023-08-04 02:47:39,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:47:39,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136736313] [2023-08-04 02:47:39,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:47:39,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:47:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:47:40,658 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 02:47:40,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:47:40,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136736313] [2023-08-04 02:47:40,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136736313] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:47:40,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581497005] [2023-08-04 02:47:40,659 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-04 02:47:40,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:47:40,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:47:40,661 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 02:47:40,664 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 02:47:40,846 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2023-08-04 02:47:40,847 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 02:47:40,849 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 71 conjunts are in the unsatisfiable core [2023-08-04 02:47:40,851 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:47:41,159 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 02:47:41,159 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:47:41,350 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 02:47:41,351 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 57 [2023-08-04 02:47:41,548 INFO L322 Elim1Store]: treesize reduction 16, result has 67.3 percent of original size [2023-08-04 02:47:41,548 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 42 [2023-08-04 02:47:41,736 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 02:47:41,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581497005] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:47:41,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:47:41,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 17 [2023-08-04 02:47:41,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205669867] [2023-08-04 02:47:41,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:47:41,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-04 02:47:41,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:47:41,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-04 02:47:41,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2023-08-04 02:47:42,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 306 [2023-08-04 02:47:42,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 352 transitions, 3701 flow. Second operand has 19 states, 19 states have (on average 123.47368421052632) internal successors, (2346), 19 states have internal predecessors, (2346), 0 states have call successors, (0), 0 states 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 02:47:42,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:47:42,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 306 [2023-08-04 02:47:42,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:47:47,261 INFO L124 PetriNetUnfolderBase]: 22880/31337 cut-off events. [2023-08-04 02:47:47,261 INFO L125 PetriNetUnfolderBase]: For 181197/181197 co-relation queries the response was YES. [2023-08-04 02:47:47,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162641 conditions, 31337 events. 22880/31337 cut-off events. For 181197/181197 co-relation queries the response was YES. Maximal size of possible extension queue 586. Compared 163218 event pairs, 6494 based on Foata normal form. 1/31323 useless extension candidates. Maximal degree in co-relation 162574. Up to 28288 conditions per place. [2023-08-04 02:47:47,518 INFO L140 encePairwiseOnDemand]: 296/306 looper letters, 386 selfloop transitions, 132 changer transitions 1/523 dead transitions. [2023-08-04 02:47:47,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 523 transitions, 6195 flow [2023-08-04 02:47:47,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-04 02:47:47,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-04 02:47:47,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1620 transitions. [2023-08-04 02:47:47,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4411764705882353 [2023-08-04 02:47:47,520 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1620 transitions. [2023-08-04 02:47:47,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1620 transitions. [2023-08-04 02:47:47,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:47:47,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1620 transitions. [2023-08-04 02:47:47,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 135.0) internal successors, (1620), 12 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states 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 02:47:47,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 306.0) internal successors, (3978), 13 states have internal predecessors, (3978), 0 states have call successors, (0), 0 states 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 02:47:47,526 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 306.0) internal successors, (3978), 13 states have internal predecessors, (3978), 0 states have call successors, (0), 0 states 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 02:47:47,526 INFO L175 Difference]: Start difference. First operand has 139 places, 352 transitions, 3701 flow. Second operand 12 states and 1620 transitions. [2023-08-04 02:47:47,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 523 transitions, 6195 flow [2023-08-04 02:47:48,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 523 transitions, 6017 flow, removed 78 selfloop flow, removed 2 redundant places. [2023-08-04 02:47:48,352 INFO L231 Difference]: Finished difference. Result has 155 places, 419 transitions, 4818 flow [2023-08-04 02:47:48,353 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=3547, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=4818, PETRI_PLACES=155, PETRI_TRANSITIONS=419} [2023-08-04 02:47:48,353 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 113 predicate places. [2023-08-04 02:47:48,353 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 419 transitions, 4818 flow [2023-08-04 02:47:48,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 123.47368421052632) internal successors, (2346), 19 states have internal predecessors, (2346), 0 states have call successors, (0), 0 states 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 02:47:48,354 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:47:48,354 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, 1, 1, 1, 1, 1, 1] [2023-08-04 02:47:48,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-08-04 02:47:48,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:47:48,560 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:47:48,560 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:47:48,561 INFO L85 PathProgramCache]: Analyzing trace with hash 255595532, now seen corresponding path program 6 times [2023-08-04 02:47:48,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:47:48,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977235110] [2023-08-04 02:47:48,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:47:48,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:47:48,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:47:49,251 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-08-04 02:47:49,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:47:49,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977235110] [2023-08-04 02:47:49,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977235110] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:47:49,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893299885] [2023-08-04 02:47:49,252 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-04 02:47:49,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:47:49,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:47:49,254 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 02:47:49,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-08-04 02:47:49,404 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-08-04 02:47:49,404 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 02:47:49,406 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 69 conjunts are in the unsatisfiable core [2023-08-04 02:47:49,408 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:47:49,593 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-08-04 02:47:49,594 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:47:49,749 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 02:47:49,750 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 21 treesize of output 14 [2023-08-04 02:47:49,761 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 02:47:49,761 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 22 treesize of output 11 [2023-08-04 02:47:49,838 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-08-04 02:47:49,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893299885] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:47:49,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:47:49,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 17 [2023-08-04 02:47:49,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995570301] [2023-08-04 02:47:49,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:47:49,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-04 02:47:49,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:47:49,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-04 02:47:49,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2023-08-04 02:47:50,221 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 306 [2023-08-04 02:47:50,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 419 transitions, 4818 flow. Second operand has 19 states, 19 states have (on average 123.15789473684211) internal successors, (2340), 19 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states 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 02:47:50,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:47:50,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 306 [2023-08-04 02:47:50,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:47:55,883 INFO L124 PetriNetUnfolderBase]: 25473/34913 cut-off events. [2023-08-04 02:47:55,883 INFO L125 PetriNetUnfolderBase]: For 244223/244223 co-relation queries the response was YES. [2023-08-04 02:47:56,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187244 conditions, 34913 events. 25473/34913 cut-off events. For 244223/244223 co-relation queries the response was YES. Maximal size of possible extension queue 662. Compared 185184 event pairs, 7420 based on Foata normal form. 1/34899 useless extension candidates. Maximal degree in co-relation 187170. Up to 30010 conditions per place. [2023-08-04 02:47:56,313 INFO L140 encePairwiseOnDemand]: 296/306 looper letters, 414 selfloop transitions, 207 changer transitions 1/626 dead transitions. [2023-08-04 02:47:56,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 626 transitions, 7886 flow [2023-08-04 02:47:56,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-04 02:47:56,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-04 02:47:56,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1896 transitions. [2023-08-04 02:47:56,316 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4425770308123249 [2023-08-04 02:47:56,316 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1896 transitions. [2023-08-04 02:47:56,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1896 transitions. [2023-08-04 02:47:56,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:47:56,316 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1896 transitions. [2023-08-04 02:47:56,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 135.42857142857142) internal successors, (1896), 14 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states 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 02:47:56,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 306.0) internal successors, (4590), 15 states have internal predecessors, (4590), 0 states have call successors, (0), 0 states 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 02:47:56,321 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 306.0) internal successors, (4590), 15 states have internal predecessors, (4590), 0 states have call successors, (0), 0 states 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 02:47:56,321 INFO L175 Difference]: Start difference. First operand has 155 places, 419 transitions, 4818 flow. Second operand 14 states and 1896 transitions. [2023-08-04 02:47:56,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 626 transitions, 7886 flow [2023-08-04 02:47:57,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 626 transitions, 7698 flow, removed 94 selfloop flow, removed 0 redundant places. [2023-08-04 02:47:57,610 INFO L231 Difference]: Finished difference. Result has 178 places, 496 transitions, 6396 flow [2023-08-04 02:47:57,610 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=4638, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=136, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=6396, PETRI_PLACES=178, PETRI_TRANSITIONS=496} [2023-08-04 02:47:57,610 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 136 predicate places. [2023-08-04 02:47:57,611 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 496 transitions, 6396 flow [2023-08-04 02:47:57,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 123.15789473684211) internal successors, (2340), 19 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states 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 02:47:57,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:47:57,611 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, 1, 1, 1, 1, 1, 1] [2023-08-04 02:47:57,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-08-04 02:47:57,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-08-04 02:47:57,813 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:47:57,813 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:47:57,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1561062660, now seen corresponding path program 7 times [2023-08-04 02:47:57,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:47:57,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549993301] [2023-08-04 02:47:57,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:47:57,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:47:57,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:47:58,486 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-04 02:47:58,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:47:58,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549993301] [2023-08-04 02:47:58,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549993301] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:47:58,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1953974494] [2023-08-04 02:47:58,486 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-04 02:47:58,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:47:58,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:47:58,490 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 02:47:58,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-08-04 02:47:58,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:47:58,634 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 84 conjunts are in the unsatisfiable core [2023-08-04 02:47:58,637 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:47:58,664 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-04 02:47:58,716 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 02:47:58,746 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 02:47:58,818 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 02:47:58,845 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 02:47:58,977 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-04 02:47:58,977 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:47:59,286 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-04 02:47:59,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1953974494] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:47:59,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:47:59,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 8] total 21 [2023-08-04 02:47:59,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48487064] [2023-08-04 02:47:59,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:47:59,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-04 02:47:59,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:47:59,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-04 02:47:59,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=426, Unknown=4, NotChecked=0, Total=506 [2023-08-04 02:47:59,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 306 [2023-08-04 02:47:59,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 496 transitions, 6396 flow. Second operand has 23 states, 23 states have (on average 93.43478260869566) internal successors, (2149), 23 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states 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 02:47:59,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:47:59,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 306 [2023-08-04 02:47:59,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:48:06,788 INFO L124 PetriNetUnfolderBase]: 28206/38461 cut-off events. [2023-08-04 02:48:06,788 INFO L125 PetriNetUnfolderBase]: For 302083/302083 co-relation queries the response was YES. [2023-08-04 02:48:07,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215037 conditions, 38461 events. 28206/38461 cut-off events. For 302083/302083 co-relation queries the response was YES. Maximal size of possible extension queue 744. Compared 206649 event pairs, 5353 based on Foata normal form. 1/38430 useless extension candidates. Maximal degree in co-relation 214951. Up to 31524 conditions per place. [2023-08-04 02:48:07,307 INFO L140 encePairwiseOnDemand]: 293/306 looper letters, 337 selfloop transitions, 338 changer transitions 1/680 dead transitions. [2023-08-04 02:48:07,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 680 transitions, 9096 flow [2023-08-04 02:48:07,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-04 02:48:07,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-04 02:48:07,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1302 transitions. [2023-08-04 02:48:07,309 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3545751633986928 [2023-08-04 02:48:07,309 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1302 transitions. [2023-08-04 02:48:07,309 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1302 transitions. [2023-08-04 02:48:07,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:48:07,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1302 transitions. [2023-08-04 02:48:07,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 108.5) internal successors, (1302), 12 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states 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 02:48:07,313 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 306.0) internal successors, (3978), 13 states have internal predecessors, (3978), 0 states have call successors, (0), 0 states 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 02:48:07,314 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 306.0) internal successors, (3978), 13 states have internal predecessors, (3978), 0 states have call successors, (0), 0 states 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 02:48:07,314 INFO L175 Difference]: Start difference. First operand has 178 places, 496 transitions, 6396 flow. Second operand 12 states and 1302 transitions. [2023-08-04 02:48:07,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 680 transitions, 9096 flow [2023-08-04 02:48:09,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 680 transitions, 8846 flow, removed 125 selfloop flow, removed 0 redundant places. [2023-08-04 02:48:09,319 INFO L231 Difference]: Finished difference. Result has 192 places, 538 transitions, 7591 flow [2023-08-04 02:48:09,319 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=6162, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=496, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=310, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=7591, PETRI_PLACES=192, PETRI_TRANSITIONS=538} [2023-08-04 02:48:09,320 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 150 predicate places. [2023-08-04 02:48:09,320 INFO L495 AbstractCegarLoop]: Abstraction has has 192 places, 538 transitions, 7591 flow [2023-08-04 02:48:09,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 93.43478260869566) internal successors, (2149), 23 states have internal predecessors, (2149), 0 states have call successors, (0), 0 states 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 02:48:09,320 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:48:09,320 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, 1, 1, 1, 1, 1, 1] [2023-08-04 02:48:09,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-08-04 02:48:09,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-08-04 02:48:09,524 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:48:09,525 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:48:09,525 INFO L85 PathProgramCache]: Analyzing trace with hash -166660438, now seen corresponding path program 8 times [2023-08-04 02:48:09,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:48:09,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45011152] [2023-08-04 02:48:09,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:48:09,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:48:09,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:48:10,112 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 02:48:10,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:48:10,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45011152] [2023-08-04 02:48:10,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45011152] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:48:10,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517864507] [2023-08-04 02:48:10,113 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 02:48:10,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:48:10,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:48:10,117 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 02:48:10,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-08-04 02:48:10,257 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 02:48:10,258 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 02:48:10,260 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 69 conjunts are in the unsatisfiable core [2023-08-04 02:48:10,262 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:48:10,440 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 02:48:10,441 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:48:10,614 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 02:48:10,614 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 17 treesize of output 14 [2023-08-04 02:48:10,696 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-08-04 02:48:10,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517864507] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:48:10,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:48:10,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 17 [2023-08-04 02:48:10,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232029172] [2023-08-04 02:48:10,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:48:10,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-04 02:48:10,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:48:10,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-04 02:48:10,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2023-08-04 02:48:11,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 306 [2023-08-04 02:48:11,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 538 transitions, 7591 flow. Second operand has 19 states, 19 states have (on average 123.3157894736842) internal successors, (2343), 19 states have internal predecessors, (2343), 0 states have call successors, (0), 0 states 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 02:48:11,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:48:11,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 306 [2023-08-04 02:48:11,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:48:18,990 INFO L124 PetriNetUnfolderBase]: 31525/43089 cut-off events. [2023-08-04 02:48:18,990 INFO L125 PetriNetUnfolderBase]: For 369021/369021 co-relation queries the response was YES. [2023-08-04 02:48:19,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 246738 conditions, 43089 events. 31525/43089 cut-off events. For 369021/369021 co-relation queries the response was YES. Maximal size of possible extension queue 847. Compared 236983 event pairs, 6563 based on Foata normal form. 1/43058 useless extension candidates. Maximal degree in co-relation 246646. Up to 34473 conditions per place. [2023-08-04 02:48:19,736 INFO L140 encePairwiseOnDemand]: 294/306 looper letters, 365 selfloop transitions, 367 changer transitions 1/737 dead transitions. [2023-08-04 02:48:19,737 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 737 transitions, 10537 flow [2023-08-04 02:48:19,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-04 02:48:19,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-04 02:48:19,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1677 transitions. [2023-08-04 02:48:19,738 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45669934640522875 [2023-08-04 02:48:19,738 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1677 transitions. [2023-08-04 02:48:19,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1677 transitions. [2023-08-04 02:48:19,739 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:48:19,739 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1677 transitions. [2023-08-04 02:48:19,740 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 139.75) internal successors, (1677), 12 states have internal predecessors, (1677), 0 states have call successors, (0), 0 states 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 02:48:19,742 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 306.0) internal successors, (3978), 13 states have internal predecessors, (3978), 0 states have call successors, (0), 0 states 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 02:48:19,742 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 306.0) internal successors, (3978), 13 states have internal predecessors, (3978), 0 states have call successors, (0), 0 states 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 02:48:19,742 INFO L175 Difference]: Start difference. First operand has 192 places, 538 transitions, 7591 flow. Second operand 12 states and 1677 transitions. [2023-08-04 02:48:19,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 737 transitions, 10537 flow [2023-08-04 02:48:22,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 737 transitions, 10130 flow, removed 136 selfloop flow, removed 3 redundant places. [2023-08-04 02:48:22,577 INFO L231 Difference]: Finished difference. Result has 205 places, 582 transitions, 8792 flow [2023-08-04 02:48:22,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=7242, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=538, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=326, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=8792, PETRI_PLACES=205, PETRI_TRANSITIONS=582} [2023-08-04 02:48:22,578 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 163 predicate places. [2023-08-04 02:48:22,578 INFO L495 AbstractCegarLoop]: Abstraction has has 205 places, 582 transitions, 8792 flow [2023-08-04 02:48:22,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 123.3157894736842) internal successors, (2343), 19 states have internal predecessors, (2343), 0 states have call successors, (0), 0 states 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 02:48:22,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:48:22,579 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, 1, 1, 1, 1, 1, 1] [2023-08-04 02:48:22,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-08-04 02:48:22,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:48:22,781 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:48:22,781 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:48:22,781 INFO L85 PathProgramCache]: Analyzing trace with hash 830818848, now seen corresponding path program 9 times [2023-08-04 02:48:22,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:48:22,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472892594] [2023-08-04 02:48:22,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:48:22,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:48:22,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:48:23,255 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-08-04 02:48:23,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:48:23,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472892594] [2023-08-04 02:48:23,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472892594] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:48:23,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806432496] [2023-08-04 02:48:23,256 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-04 02:48:23,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:48:23,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:48:23,262 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 02:48:23,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-08-04 02:48:23,409 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-04 02:48:23,410 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 02:48:23,412 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 26 conjunts are in the unsatisfiable core [2023-08-04 02:48:23,413 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:48:23,434 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 13 treesize of output 9 [2023-08-04 02:48:23,474 INFO L322 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-08-04 02:48:23,474 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2023-08-04 02:48:23,664 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-08-04 02:48:23,686 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-08-04 02:48:23,686 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:48:24,231 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2023-08-04 02:48:24,237 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 252 treesize of output 244 [2023-08-04 02:48:24,253 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2023-08-04 02:48:24,268 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-08-04 02:48:24,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806432496] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:48:24,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:48:24,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 23 [2023-08-04 02:48:24,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943498037] [2023-08-04 02:48:24,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:48:24,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-08-04 02:48:24,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:48:24,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-08-04 02:48:24,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2023-08-04 02:48:24,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 306 [2023-08-04 02:48:24,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 582 transitions, 8792 flow. Second operand has 23 states, 23 states have (on average 120.47826086956522) internal successors, (2771), 23 states have internal predecessors, (2771), 0 states have call successors, (0), 0 states 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 02:48:24,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:48:24,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 306 [2023-08-04 02:48:24,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:48:33,219 INFO L124 PetriNetUnfolderBase]: 30542/41723 cut-off events. [2023-08-04 02:48:33,219 INFO L125 PetriNetUnfolderBase]: For 468109/505541 co-relation queries the response was YES. [2023-08-04 02:48:33,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 247780 conditions, 41723 events. 30542/41723 cut-off events. For 468109/505541 co-relation queries the response was YES. Maximal size of possible extension queue 866. Compared 230998 event pairs, 2203 based on Foata normal form. 5809/47050 useless extension candidates. Maximal degree in co-relation 247683. Up to 31060 conditions per place. [2023-08-04 02:48:33,812 INFO L140 encePairwiseOnDemand]: 295/306 looper letters, 1637 selfloop transitions, 23 changer transitions 0/1718 dead transitions. [2023-08-04 02:48:33,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 1718 transitions, 28848 flow [2023-08-04 02:48:33,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-04 02:48:33,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-04 02:48:33,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1384 transitions. [2023-08-04 02:48:33,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41117052881758764 [2023-08-04 02:48:33,815 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1384 transitions. [2023-08-04 02:48:33,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1384 transitions. [2023-08-04 02:48:33,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:48:33,815 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1384 transitions. [2023-08-04 02:48:33,817 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 125.81818181818181) internal successors, (1384), 11 states have internal predecessors, (1384), 0 states have call successors, (0), 0 states 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 02:48:33,818 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 306.0) internal successors, (3672), 12 states have internal predecessors, (3672), 0 states have call successors, (0), 0 states 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 02:48:33,818 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 306.0) internal successors, (3672), 12 states have internal predecessors, (3672), 0 states have call successors, (0), 0 states 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 02:48:33,818 INFO L175 Difference]: Start difference. First operand has 205 places, 582 transitions, 8792 flow. Second operand 11 states and 1384 transitions. [2023-08-04 02:48:33,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 1718 transitions, 28848 flow [2023-08-04 02:48:35,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 1718 transitions, 27866 flow, removed 229 selfloop flow, removed 4 redundant places. [2023-08-04 02:48:35,486 INFO L231 Difference]: Finished difference. Result has 214 places, 589 transitions, 8585 flow [2023-08-04 02:48:35,486 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=8464, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=563, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8585, PETRI_PLACES=214, PETRI_TRANSITIONS=589} [2023-08-04 02:48:35,486 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 172 predicate places. [2023-08-04 02:48:35,486 INFO L495 AbstractCegarLoop]: Abstraction has has 214 places, 589 transitions, 8585 flow [2023-08-04 02:48:35,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 120.47826086956522) internal successors, (2771), 23 states have internal predecessors, (2771), 0 states have call successors, (0), 0 states 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 02:48:35,487 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:48:35,487 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, 1, 1, 1, 1, 1, 1] [2023-08-04 02:48:35,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-08-04 02:48:35,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:48:35,689 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:48:35,689 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:48:35,689 INFO L85 PathProgramCache]: Analyzing trace with hash 425591032, now seen corresponding path program 10 times [2023-08-04 02:48:35,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:48:35,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216028632] [2023-08-04 02:48:35,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:48:35,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:48:35,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:48:36,444 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 02:48:36,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:48:36,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216028632] [2023-08-04 02:48:36,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216028632] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:48:36,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919954991] [2023-08-04 02:48:36,445 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-04 02:48:36,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:48:36,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:48:36,447 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 02:48:36,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-08-04 02:48:36,585 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-04 02:48:36,586 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 02:48:36,588 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 84 conjunts are in the unsatisfiable core [2023-08-04 02:48:36,590 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:48:36,622 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-04 02:48:36,671 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 02:48:36,722 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 02:48:36,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 02:48:36,865 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 02:48:36,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 02:48:36,892 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 02:48:36,994 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-08-04 02:48:36,995 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:48:37,150 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_982 (Array Int Int))) (< (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_982) c_~A~0.base) c_~A~0.offset) 2) (+ c_~counter~0 1))) (forall ((v_ArrVal_982 (Array Int Int))) (<= c_~counter~0 (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_982) c_~A~0.base) c_~A~0.offset) 2)))) is different from false [2023-08-04 02:48:37,190 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* 4 |c_thread1Thread2of2ForFork1_~i~0#1|))))) (and (forall ((v_ArrVal_982 (Array Int Int))) (<= (+ .cse0 c_~counter~0) (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_982) c_~A~0.base) c_~A~0.offset) 2))) (forall ((v_ArrVal_982 (Array Int Int))) (< (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_982) c_~A~0.base) c_~A~0.offset) 2) (+ .cse0 c_~counter~0 1))))) is different from false [2023-08-04 02:48:37,268 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~A~0.base))) (let ((.cse0 (select .cse2 c_~A~0.offset)) (.cse1 (select .cse2 (+ c_~A~0.offset (* |c_thread1Thread1of2ForFork1_~i~0#1| 4))))) (and (forall ((v_ArrVal_982 (Array Int Int))) (<= (+ .cse0 c_~counter~0 .cse1) (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_982) c_~A~0.base) c_~A~0.offset) 2))) (forall ((v_ArrVal_982 (Array Int Int))) (< (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_982) c_~A~0.base) c_~A~0.offset) 2) (+ .cse0 c_~counter~0 .cse1 1)))))) is different from false [2023-08-04 02:48:37,278 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~A~0.offset (* |c_thread1Thread1of2ForFork1_~i~0#1| 4)))) (and (forall ((v_ArrVal_980 (Array Int Int)) (v_ArrVal_982 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_980))) (< (* 2 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_982) c_~A~0.base) c_~A~0.offset)) (let ((.cse1 (select .cse0 c_~A~0.base))) (+ (select .cse1 c_~A~0.offset) c_~counter~0 (select .cse1 .cse2) 1))))) (forall ((v_ArrVal_980 (Array Int Int)) (v_ArrVal_982 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_980))) (<= (let ((.cse3 (select .cse4 c_~A~0.base))) (+ (select .cse3 c_~A~0.offset) c_~counter~0 (select .cse3 .cse2))) (* 2 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_982) c_~A~0.base) c_~A~0.offset))))))) is different from false [2023-08-04 02:48:37,302 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_980 (Array Int Int)) (v_ArrVal_982 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_980))) (< (* 2 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_982) c_~A~0.base) c_~A~0.offset)) (+ c_~counter~0 (* (select (select .cse0 c_~A~0.base) c_~A~0.offset) 2) 1)))) (forall ((v_ArrVal_980 (Array Int Int)) (v_ArrVal_982 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_980))) (<= (+ c_~counter~0 (* (select (select .cse1 c_~A~0.base) c_~A~0.offset) 2)) (* 2 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_982) c_~A~0.base) c_~A~0.offset)))))) is different from false [2023-08-04 02:48:37,326 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_980 (Array Int Int)) (v_ArrVal_982 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_980))) (< (* (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_982) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2) (+ (* 2 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~counter~0 1)))) (forall ((v_ArrVal_980 (Array Int Int)) (v_ArrVal_982 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_980))) (<= (+ (* 2 (select (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) c_~counter~0) (* (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_982) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) 2))))) is different from false [2023-08-04 02:48:37,333 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 02:48:37,334 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 51 treesize of output 40 [2023-08-04 02:48:37,337 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 354 treesize of output 322 [2023-08-04 02:48:37,343 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 33 treesize of output 31 [2023-08-04 02:48:37,345 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 64 treesize of output 60 [2023-08-04 02:48:37,368 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 02:48:37,368 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 50 treesize of output 39 [2023-08-04 02:48:37,371 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-04 02:48:37,373 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2023-08-04 02:48:37,400 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 14 not checked. [2023-08-04 02:48:37,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919954991] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:48:37,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:48:37,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 31 [2023-08-04 02:48:37,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519979673] [2023-08-04 02:48:37,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:48:37,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-08-04 02:48:37,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:48:37,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-08-04 02:48:37,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=598, Unknown=12, NotChecked=330, Total=1056 [2023-08-04 02:48:37,456 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 306 [2023-08-04 02:48:37,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 589 transitions, 8585 flow. Second operand has 33 states, 33 states have (on average 92.54545454545455) internal successors, (3054), 33 states have internal predecessors, (3054), 0 states have call successors, (0), 0 states 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 02:48:37,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:48:37,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 306 [2023-08-04 02:48:37,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:48:46,973 INFO L124 PetriNetUnfolderBase]: 35289/48205 cut-off events. [2023-08-04 02:48:46,973 INFO L125 PetriNetUnfolderBase]: For 427385/427385 co-relation queries the response was YES. [2023-08-04 02:48:47,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 284729 conditions, 48205 events. 35289/48205 cut-off events. For 427385/427385 co-relation queries the response was YES. Maximal size of possible extension queue 955. Compared 269036 event pairs, 6436 based on Foata normal form. 1/48182 useless extension candidates. Maximal degree in co-relation 284628. Up to 36882 conditions per place. [2023-08-04 02:48:47,706 INFO L140 encePairwiseOnDemand]: 294/306 looper letters, 378 selfloop transitions, 421 changer transitions 2/807 dead transitions. [2023-08-04 02:48:47,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 807 transitions, 12045 flow [2023-08-04 02:48:47,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-04 02:48:47,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-04 02:48:47,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1300 transitions. [2023-08-04 02:48:47,708 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3540305010893246 [2023-08-04 02:48:47,708 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1300 transitions. [2023-08-04 02:48:47,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1300 transitions. [2023-08-04 02:48:47,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:48:47,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1300 transitions. [2023-08-04 02:48:47,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 108.33333333333333) internal successors, (1300), 12 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states 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 02:48:47,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 306.0) internal successors, (3978), 13 states have internal predecessors, (3978), 0 states have call successors, (0), 0 states 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 02:48:47,712 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 306.0) internal successors, (3978), 13 states have internal predecessors, (3978), 0 states have call successors, (0), 0 states 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 02:48:47,712 INFO L175 Difference]: Start difference. First operand has 214 places, 589 transitions, 8585 flow. Second operand 12 states and 1300 transitions. [2023-08-04 02:48:47,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 807 transitions, 12045 flow [2023-08-04 02:48:50,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 807 transitions, 11891 flow, removed 47 selfloop flow, removed 6 redundant places. [2023-08-04 02:48:50,461 INFO L231 Difference]: Finished difference. Result has 221 places, 652 transitions, 10314 flow [2023-08-04 02:48:50,462 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=8533, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=589, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=385, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=10314, PETRI_PLACES=221, PETRI_TRANSITIONS=652} [2023-08-04 02:48:50,462 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 179 predicate places. [2023-08-04 02:48:50,462 INFO L495 AbstractCegarLoop]: Abstraction has has 221 places, 652 transitions, 10314 flow [2023-08-04 02:48:50,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 92.54545454545455) internal successors, (3054), 33 states have internal predecessors, (3054), 0 states have call successors, (0), 0 states 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 02:48:50,463 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:48:50,463 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, 1, 1, 1, 1, 1, 1] [2023-08-04 02:48:50,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-08-04 02:48:50,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:48:50,668 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:48:50,669 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:48:50,669 INFO L85 PathProgramCache]: Analyzing trace with hash -672087092, now seen corresponding path program 11 times [2023-08-04 02:48:50,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:48:50,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777137425] [2023-08-04 02:48:50,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:48:50,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:48:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:48:51,239 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 02:48:51,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:48:51,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777137425] [2023-08-04 02:48:51,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777137425] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:48:51,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615428124] [2023-08-04 02:48:51,240 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-04 02:48:51,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:48:51,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:48:51,242 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 02:48:51,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-08-04 02:48:51,399 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-08-04 02:48:51,399 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 02:48:51,402 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 69 conjunts are in the unsatisfiable core [2023-08-04 02:48:51,403 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:48:51,578 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-04 02:48:51,579 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:48:51,771 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 02:48:51,771 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 17 treesize of output 14 [2023-08-04 02:48:51,846 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-08-04 02:48:51,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615428124] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:48:51,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:48:51,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 8] total 17 [2023-08-04 02:48:51,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845285937] [2023-08-04 02:48:51,847 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:48:51,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-08-04 02:48:51,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:48:51,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-08-04 02:48:51,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2023-08-04 02:48:52,245 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 306 [2023-08-04 02:48:52,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 652 transitions, 10314 flow. Second operand has 19 states, 19 states have (on average 123.42105263157895) internal successors, (2345), 19 states have internal predecessors, (2345), 0 states have call successors, (0), 0 states 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 02:48:52,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:48:52,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 306 [2023-08-04 02:48:52,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:49:02,556 INFO L124 PetriNetUnfolderBase]: 37424/51302 cut-off events. [2023-08-04 02:49:02,556 INFO L125 PetriNetUnfolderBase]: For 542305/542305 co-relation queries the response was YES. [2023-08-04 02:49:03,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 316955 conditions, 51302 events. 37424/51302 cut-off events. For 542305/542305 co-relation queries the response was YES. Maximal size of possible extension queue 1009. Compared 290473 event pairs, 7753 based on Foata normal form. 1/51269 useless extension candidates. Maximal degree in co-relation 316851. Up to 42177 conditions per place. [2023-08-04 02:49:03,390 INFO L140 encePairwiseOnDemand]: 294/306 looper letters, 444 selfloop transitions, 375 changer transitions 2/827 dead transitions. [2023-08-04 02:49:03,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 827 transitions, 13150 flow [2023-08-04 02:49:03,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-04 02:49:03,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-04 02:49:03,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1673 transitions. [2023-08-04 02:49:03,392 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45561002178649235 [2023-08-04 02:49:03,392 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1673 transitions. [2023-08-04 02:49:03,392 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1673 transitions. [2023-08-04 02:49:03,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:49:03,392 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1673 transitions. [2023-08-04 02:49:03,394 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 139.41666666666666) internal successors, (1673), 12 states have internal predecessors, (1673), 0 states have call successors, (0), 0 states 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 02:49:03,395 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 306.0) internal successors, (3978), 13 states have internal predecessors, (3978), 0 states have call successors, (0), 0 states 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 02:49:03,396 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 306.0) internal successors, (3978), 13 states have internal predecessors, (3978), 0 states have call successors, (0), 0 states 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 02:49:03,396 INFO L175 Difference]: Start difference. First operand has 221 places, 652 transitions, 10314 flow. Second operand 12 states and 1673 transitions. [2023-08-04 02:49:03,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 827 transitions, 13150 flow [2023-08-04 02:49:07,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 827 transitions, 12768 flow, removed 102 selfloop flow, removed 5 redundant places. [2023-08-04 02:49:07,941 INFO L231 Difference]: Finished difference. Result has 230 places, 672 transitions, 11166 flow [2023-08-04 02:49:07,941 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=9953, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=652, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=355, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=11166, PETRI_PLACES=230, PETRI_TRANSITIONS=672} [2023-08-04 02:49:07,942 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 188 predicate places. [2023-08-04 02:49:07,942 INFO L495 AbstractCegarLoop]: Abstraction has has 230 places, 672 transitions, 11166 flow [2023-08-04 02:49:07,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 123.42105263157895) internal successors, (2345), 19 states have internal predecessors, (2345), 0 states have call successors, (0), 0 states 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 02:49:07,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:49:07,942 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, 1, 1, 1, 1, 1, 1] [2023-08-04 02:49:07,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2023-08-04 02:49:08,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2023-08-04 02:49:08,143 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:49:08,143 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:49:08,143 INFO L85 PathProgramCache]: Analyzing trace with hash -494766606, now seen corresponding path program 12 times [2023-08-04 02:49:08,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:49:08,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906574817] [2023-08-04 02:49:08,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:49:08,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:49:08,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:49:08,725 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-04 02:49:08,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:49:08,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906574817] [2023-08-04 02:49:08,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906574817] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:49:08,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441898093] [2023-08-04 02:49:08,726 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-04 02:49:08,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:49:08,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:49:08,730 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 02:49:08,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-08-04 02:49:08,876 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-08-04 02:49:08,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 02:49:08,878 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 84 conjunts are in the unsatisfiable core [2023-08-04 02:49:08,880 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:49:08,910 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-04 02:49:08,954 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 02:49:08,976 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 02:49:09,030 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 02:49:09,054 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 02:49:09,189 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-04 02:49:09,189 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:49:09,531 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-04 02:49:09,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441898093] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:49:09,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:49:09,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 9] total 23 [2023-08-04 02:49:09,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177616410] [2023-08-04 02:49:09,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:49:09,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-04 02:49:09,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:49:09,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-04 02:49:09,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=513, Unknown=2, NotChecked=0, Total=600 [2023-08-04 02:49:10,090 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 306 [2023-08-04 02:49:10,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 672 transitions, 11166 flow. Second operand has 25 states, 25 states have (on average 93.28) internal successors, (2332), 25 states have internal predecessors, (2332), 0 states have call successors, (0), 0 states 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 02:49:10,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:49:10,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 306 [2023-08-04 02:49:10,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:49:21,741 INFO L124 PetriNetUnfolderBase]: 40733/56157 cut-off events. [2023-08-04 02:49:21,742 INFO L125 PetriNetUnfolderBase]: For 605194/605194 co-relation queries the response was YES. [2023-08-04 02:49:22,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 349711 conditions, 56157 events. 40733/56157 cut-off events. For 605194/605194 co-relation queries the response was YES. Maximal size of possible extension queue 1126. Compared 323218 event pairs, 10718 based on Foata normal form. 1/56110 useless extension candidates. Maximal degree in co-relation 349605. Up to 45311 conditions per place. [2023-08-04 02:49:22,713 INFO L140 encePairwiseOnDemand]: 293/306 looper letters, 449 selfloop transitions, 417 changer transitions 2/874 dead transitions. [2023-08-04 02:49:22,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 874 transitions, 14733 flow [2023-08-04 02:49:22,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-04 02:49:22,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-04 02:49:22,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1399 transitions. [2023-08-04 02:49:22,716 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35168426344896936 [2023-08-04 02:49:22,716 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1399 transitions. [2023-08-04 02:49:22,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1399 transitions. [2023-08-04 02:49:22,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:49:22,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1399 transitions. [2023-08-04 02:49:22,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 107.61538461538461) internal successors, (1399), 13 states have internal predecessors, (1399), 0 states have call successors, (0), 0 states 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 02:49:22,721 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 306.0) internal successors, (4284), 14 states have internal predecessors, (4284), 0 states have call successors, (0), 0 states 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 02:49:22,721 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 306.0) internal successors, (4284), 14 states have internal predecessors, (4284), 0 states have call successors, (0), 0 states 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 02:49:22,721 INFO L175 Difference]: Start difference. First operand has 230 places, 672 transitions, 11166 flow. Second operand 13 states and 1399 transitions. [2023-08-04 02:49:22,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 874 transitions, 14733 flow [2023-08-04 02:49:27,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 874 transitions, 14239 flow, removed 26 selfloop flow, removed 3 redundant places. [2023-08-04 02:49:27,662 INFO L231 Difference]: Finished difference. Result has 243 places, 722 transitions, 12713 flow [2023-08-04 02:49:27,662 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=10699, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=672, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=370, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=12713, PETRI_PLACES=243, PETRI_TRANSITIONS=722} [2023-08-04 02:49:27,663 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 201 predicate places. [2023-08-04 02:49:27,663 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 722 transitions, 12713 flow [2023-08-04 02:49:27,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 93.28) internal successors, (2332), 25 states have internal predecessors, (2332), 0 states have call successors, (0), 0 states 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 02:49:27,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:49:27,663 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, 1, 1, 1, 1, 1, 1] [2023-08-04 02:49:27,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2023-08-04 02:49:27,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2023-08-04 02:49:27,864 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:49:27,864 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:49:27,864 INFO L85 PathProgramCache]: Analyzing trace with hash 378766378, now seen corresponding path program 13 times [2023-08-04 02:49:27,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:49:27,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789883295] [2023-08-04 02:49:27,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:49:27,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:49:27,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:49:28,791 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 02:49:28,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:49:28,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789883295] [2023-08-04 02:49:28,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789883295] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:49:28,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742630829] [2023-08-04 02:49:28,792 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-04 02:49:28,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:49:28,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:49:28,798 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 02:49:28,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-08-04 02:49:28,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:49:28,954 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 84 conjunts are in the unsatisfiable core [2023-08-04 02:49:28,957 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:49:28,991 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-04 02:49:29,048 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 02:49:29,075 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 02:49:29,158 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 02:49:29,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 02:49:29,299 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 02:49:29,463 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 02:49:29,463 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:49:29,642 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* |c_thread2Thread1of2ForFork0_~i~1#1| 4)))) (and (forall ((v_ArrVal_1108 (Array Int Int))) (<= c_~counter~0 (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1108) c_~A~0.base))) (+ (select .cse0 c_~A~0.offset) (select .cse0 .cse1))))) (forall ((v_ArrVal_1108 (Array Int Int))) (< (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1108) c_~A~0.base))) (+ (select .cse2 c_~A~0.offset) (select .cse2 .cse1))) (+ c_~counter~0 1))))) is different from false [2023-08-04 02:49:29,698 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* 4 |c_thread1Thread2of2ForFork1_~i~0#1|))))) (and (forall ((v_ArrVal_1108 (Array Int Int))) (<= (+ .cse0 c_~counter~0) (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1108) c_~A~0.base) c_~A~0.offset)))) (forall ((v_ArrVal_1108 (Array Int Int))) (< (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1108) c_~A~0.base) c_~A~0.offset)) (+ .cse0 c_~counter~0 1))))) is different from false [2023-08-04 02:49:29,706 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (and (forall ((v_ArrVal_1108 (Array Int Int))) (< (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1108) c_~A~0.base) c_~A~0.offset)) (+ .cse0 c_~counter~0 1))) (forall ((v_ArrVal_1108 (Array Int Int))) (<= (+ .cse0 c_~counter~0) (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1108) c_~A~0.base) c_~A~0.offset)))))) is different from false [2023-08-04 02:49:29,728 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~A~0.base))) (let ((.cse0 (select .cse2 c_~A~0.offset)) (.cse1 (select .cse2 (+ c_~A~0.offset (* |c_thread1Thread1of2ForFork1_~i~0#1| 4))))) (and (forall ((v_ArrVal_1108 (Array Int Int))) (<= (+ .cse0 c_~counter~0 .cse1) (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1108) c_~A~0.base) c_~A~0.offset)))) (forall ((v_ArrVal_1108 (Array Int Int))) (< (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1108) c_~A~0.base) c_~A~0.offset)) (+ .cse0 c_~counter~0 .cse1 1)))))) is different from false [2023-08-04 02:49:29,744 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* |c_thread1Thread1of2ForFork1_~i~0#1| 4)))) (and (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1107 (Array Int Int))) (< (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1108) c_~A~0.base) c_~A~0.offset)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1107) c_~A~0.base))) (+ (select .cse0 c_~A~0.offset) (select .cse0 .cse1) c_~counter~0 1)))) (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1107 (Array Int Int))) (<= (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1107) c_~A~0.base))) (+ (select .cse2 c_~A~0.offset) (select .cse2 .cse1) c_~counter~0)) (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1108) c_~A~0.base) c_~A~0.offset)))))) is different from false [2023-08-04 02:49:29,783 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1107 (Array Int Int))) (<= (+ c_~counter~0 (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1107) c_~A~0.base) c_~A~0.offset) 2)) (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1108) c_~A~0.base) c_~A~0.offset)))) (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1107 (Array Int Int))) (< (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1108) c_~A~0.base) c_~A~0.offset)) (+ c_~counter~0 (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1107) c_~A~0.base) c_~A~0.offset) 2) 1)))) is different from false [2023-08-04 02:49:29,800 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1107 (Array Int Int)) (v_ArrVal_1106 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1106))) (<= (+ c_~counter~0 (* 2 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1107) c_~A~0.base) c_~A~0.offset))) (* 2 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1108) c_~A~0.base) c_~A~0.offset))))) (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1107 (Array Int Int)) (v_ArrVal_1106 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1106))) (< (* 2 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1108) c_~A~0.base) c_~A~0.offset)) (+ c_~counter~0 (* 2 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1107) c_~A~0.base) c_~A~0.offset)) 1))))) is different from false [2023-08-04 02:49:29,835 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1107 (Array Int Int)) (v_ArrVal_1106 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1106))) (< (* 2 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1108) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (+ c_~counter~0 (* 2 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1107) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)))) (forall ((v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1107 (Array Int Int)) (v_ArrVal_1106 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1106))) (<= (+ c_~counter~0 (* 2 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1107) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (* 2 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1108) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) is different from false [2023-08-04 02:49:29,843 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 02:49:29,844 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 54 treesize of output 43 [2023-08-04 02:49:29,847 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1502 treesize of output 1406 [2023-08-04 02:49:29,855 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 38 treesize of output 34 [2023-08-04 02:49:29,858 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 30 [2023-08-04 02:49:29,873 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 02:49:29,874 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 42 [2023-08-04 02:49:29,876 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-04 02:49:29,878 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 66 treesize of output 58 [2023-08-04 02:49:29,899 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 14 not checked. [2023-08-04 02:49:29,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [742630829] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:49:29,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:49:29,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 35 [2023-08-04 02:49:29,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739254582] [2023-08-04 02:49:29,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:49:29,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-08-04 02:49:29,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:49:29,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-08-04 02:49:29,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=709, Unknown=12, NotChecked=488, Total=1332 [2023-08-04 02:49:29,929 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 306 [2023-08-04 02:49:29,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 722 transitions, 12713 flow. Second operand has 37 states, 37 states have (on average 92.51351351351352) internal successors, (3423), 37 states have internal predecessors, (3423), 0 states have call successors, (0), 0 states 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 02:49:29,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:49:29,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 306 [2023-08-04 02:49:29,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:49:43,273 INFO L124 PetriNetUnfolderBase]: 44326/60791 cut-off events. [2023-08-04 02:49:43,274 INFO L125 PetriNetUnfolderBase]: For 677514/677514 co-relation queries the response was YES. [2023-08-04 02:49:44,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 383465 conditions, 60791 events. 44326/60791 cut-off events. For 677514/677514 co-relation queries the response was YES. Maximal size of possible extension queue 1238. Compared 353453 event pairs, 8517 based on Foata normal form. 1/60746 useless extension candidates. Maximal degree in co-relation 383354. Up to 46126 conditions per place. [2023-08-04 02:49:44,647 INFO L140 encePairwiseOnDemand]: 294/306 looper letters, 435 selfloop transitions, 478 changer transitions 2/921 dead transitions. [2023-08-04 02:49:44,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 921 transitions, 15984 flow [2023-08-04 02:49:44,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-04 02:49:44,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-04 02:49:44,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1404 transitions. [2023-08-04 02:49:44,649 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35294117647058826 [2023-08-04 02:49:44,649 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1404 transitions. [2023-08-04 02:49:44,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1404 transitions. [2023-08-04 02:49:44,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:49:44,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1404 transitions. [2023-08-04 02:49:44,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 108.0) internal successors, (1404), 13 states have internal predecessors, (1404), 0 states have call successors, (0), 0 states 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 02:49:44,653 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 306.0) internal successors, (4284), 14 states have internal predecessors, (4284), 0 states have call successors, (0), 0 states 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 02:49:44,653 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 306.0) internal successors, (4284), 14 states have internal predecessors, (4284), 0 states have call successors, (0), 0 states 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 02:49:44,653 INFO L175 Difference]: Start difference. First operand has 243 places, 722 transitions, 12713 flow. Second operand 13 states and 1404 transitions. [2023-08-04 02:49:44,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 921 transitions, 15984 flow [2023-08-04 02:49:50,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 921 transitions, 15703 flow, removed 45 selfloop flow, removed 4 redundant places. [2023-08-04 02:49:50,480 INFO L231 Difference]: Finished difference. Result has 257 places, 759 transitions, 14312 flow [2023-08-04 02:49:50,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=12432, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=722, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=445, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=14312, PETRI_PLACES=257, PETRI_TRANSITIONS=759} [2023-08-04 02:49:50,481 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 215 predicate places. [2023-08-04 02:49:50,481 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 759 transitions, 14312 flow [2023-08-04 02:49:50,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 92.51351351351352) internal successors, (3423), 37 states have internal predecessors, (3423), 0 states have call successors, (0), 0 states 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 02:49:50,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:49:50,482 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, 1, 1, 1, 1, 1, 1] [2023-08-04 02:49:50,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2023-08-04 02:49:50,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2023-08-04 02:49:50,682 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:49:50,683 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:49:50,683 INFO L85 PathProgramCache]: Analyzing trace with hash -911961696, now seen corresponding path program 14 times [2023-08-04 02:49:50,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:49:50,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281843149] [2023-08-04 02:49:50,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:49:50,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:49:50,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:49:51,562 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-04 02:49:51,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:49:51,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281843149] [2023-08-04 02:49:51,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281843149] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:49:51,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007966297] [2023-08-04 02:49:51,563 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-04 02:49:51,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:49:51,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:49:51,565 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 02:49:51,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-08-04 02:49:51,721 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-04 02:49:51,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 02:49:51,723 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 69 conjunts are in the unsatisfiable core [2023-08-04 02:49:51,725 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:49:51,956 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-04 02:49:51,957 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:49:52,167 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 02:49:52,168 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 17 treesize of output 14 [2023-08-04 02:49:52,261 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-08-04 02:49:52,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007966297] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:49:52,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:49:52,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 8] total 22 [2023-08-04 02:49:52,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863021450] [2023-08-04 02:49:52,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:49:52,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-04 02:49:52,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:49:52,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-04 02:49:52,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2023-08-04 02:49:52,983 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 306 [2023-08-04 02:49:52,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 759 transitions, 14312 flow. Second operand has 24 states, 24 states have (on average 116.41666666666667) internal successors, (2794), 24 states have internal predecessors, (2794), 0 states have call successors, (0), 0 states 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 02:49:52,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:49:52,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 306 [2023-08-04 02:49:52,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:50:07,700 INFO L124 PetriNetUnfolderBase]: 45680/62814 cut-off events. [2023-08-04 02:50:07,701 INFO L125 PetriNetUnfolderBase]: For 775750/775750 co-relation queries the response was YES. [2023-08-04 02:50:08,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 419459 conditions, 62814 events. 45680/62814 cut-off events. For 775750/775750 co-relation queries the response was YES. Maximal size of possible extension queue 1279. Compared 368326 event pairs, 10459 based on Foata normal form. 1/62755 useless extension candidates. Maximal degree in co-relation 419341. Up to 52622 conditions per place. [2023-08-04 02:50:09,225 INFO L140 encePairwiseOnDemand]: 293/306 looper letters, 510 selfloop transitions, 411 changer transitions 2/929 dead transitions. [2023-08-04 02:50:09,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 929 transitions, 17384 flow [2023-08-04 02:50:09,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-04 02:50:09,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-04 02:50:09,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1706 transitions. [2023-08-04 02:50:09,228 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42885872297637 [2023-08-04 02:50:09,228 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1706 transitions. [2023-08-04 02:50:09,228 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1706 transitions. [2023-08-04 02:50:09,229 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:50:09,229 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1706 transitions. [2023-08-04 02:50:09,231 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 131.23076923076923) internal successors, (1706), 13 states have internal predecessors, (1706), 0 states have call successors, (0), 0 states 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 02:50:09,233 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 306.0) internal successors, (4284), 14 states have internal predecessors, (4284), 0 states have call successors, (0), 0 states 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 02:50:09,233 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 306.0) internal successors, (4284), 14 states have internal predecessors, (4284), 0 states have call successors, (0), 0 states 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 02:50:09,234 INFO L175 Difference]: Start difference. First operand has 257 places, 759 transitions, 14312 flow. Second operand 13 states and 1706 transitions. [2023-08-04 02:50:09,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 929 transitions, 17384 flow [2023-08-04 02:50:16,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 929 transitions, 17197 flow, removed 26 selfloop flow, removed 3 redundant places. [2023-08-04 02:50:16,595 INFO L231 Difference]: Finished difference. Result has 269 places, 772 transitions, 15434 flow [2023-08-04 02:50:16,596 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=14125, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=759, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=398, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=15434, PETRI_PLACES=269, PETRI_TRANSITIONS=772} [2023-08-04 02:50:16,597 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 227 predicate places. [2023-08-04 02:50:16,597 INFO L495 AbstractCegarLoop]: Abstraction has has 269 places, 772 transitions, 15434 flow [2023-08-04 02:50:16,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 116.41666666666667) internal successors, (2794), 24 states have internal predecessors, (2794), 0 states have call successors, (0), 0 states 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 02:50:16,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:50:16,597 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, 1, 1, 1, 1, 1, 1] [2023-08-04 02:50:16,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2023-08-04 02:50:16,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:50:16,804 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:50:16,804 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:50:16,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1104145150, now seen corresponding path program 15 times [2023-08-04 02:50:16,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:50:16,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024903084] [2023-08-04 02:50:16,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:50:16,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:50:16,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:50:17,531 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 02:50:17,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:50:17,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024903084] [2023-08-04 02:50:17,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024903084] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:50:17,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166563335] [2023-08-04 02:50:17,532 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-04 02:50:17,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:50:17,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:50:17,534 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 02:50:17,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2023-08-04 02:50:17,713 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-08-04 02:50:17,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 02:50:17,716 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 76 conjunts are in the unsatisfiable core [2023-08-04 02:50:17,718 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:50:17,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 02:50:17,955 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 02:50:18,091 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 02:50:18,091 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:50:18,234 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* |c_thread2Thread1of2ForFork0_~i~1#1| 4)))) (and (forall ((v_ArrVal_1185 (Array Int Int))) (< (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1185) c_~A~0.base))) (+ (select .cse0 .cse1) (select .cse0 c_~A~0.offset))) (+ c_~counter~0 1))) (forall ((v_ArrVal_1185 (Array Int Int))) (<= c_~counter~0 (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1185) c_~A~0.base))) (+ (select .cse2 .cse1) (select .cse2 c_~A~0.offset))))))) is different from false [2023-08-04 02:50:18,240 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1185 (Array Int Int))) (<= c_~counter~0 (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1185) c_~A~0.base) c_~A~0.offset) 2))) (forall ((v_ArrVal_1185 (Array Int Int))) (< (* (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1185) c_~A~0.base) c_~A~0.offset) 2) (+ c_~counter~0 1)))) is different from false [2023-08-04 02:50:18,334 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 02:50:18,335 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 49 treesize of output 33 [2023-08-04 02:50:18,342 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 14 treesize of output 12 [2023-08-04 02:50:18,351 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-04 02:50:18,484 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 2 not checked. [2023-08-04 02:50:18,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166563335] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:50:18,485 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:50:18,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 30 [2023-08-04 02:50:18,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132415158] [2023-08-04 02:50:18,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:50:18,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-08-04 02:50:18,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:50:18,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-08-04 02:50:18,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=749, Unknown=9, NotChecked=114, Total=992 [2023-08-04 02:50:18,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 306 [2023-08-04 02:50:18,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 772 transitions, 15434 flow. Second operand has 32 states, 32 states have (on average 101.09375) internal successors, (3235), 32 states have internal predecessors, (3235), 0 states have call successors, (0), 0 states 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 02:50:18,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:50:18,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 306 [2023-08-04 02:50:18,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:50:33,646 INFO L124 PetriNetUnfolderBase]: 47720/65652 cut-off events. [2023-08-04 02:50:33,647 INFO L125 PetriNetUnfolderBase]: For 917745/917745 co-relation queries the response was YES. [2023-08-04 02:50:34,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 452481 conditions, 65652 events. 47720/65652 cut-off events. For 917745/917745 co-relation queries the response was YES. Maximal size of possible extension queue 1350. Compared 387957 event pairs, 10043 based on Foata normal form. 1/65611 useless extension candidates. Maximal degree in co-relation 452359. Up to 49745 conditions per place. [2023-08-04 02:50:35,164 INFO L140 encePairwiseOnDemand]: 295/306 looper letters, 455 selfloop transitions, 499 changer transitions 2/962 dead transitions. [2023-08-04 02:50:35,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 962 transitions, 18889 flow [2023-08-04 02:50:35,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-04 02:50:35,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-04 02:50:35,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1412 transitions. [2023-08-04 02:50:35,166 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38453159041394336 [2023-08-04 02:50:35,166 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1412 transitions. [2023-08-04 02:50:35,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1412 transitions. [2023-08-04 02:50:35,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:50:35,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1412 transitions. [2023-08-04 02:50:35,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 117.66666666666667) internal successors, (1412), 12 states have internal predecessors, (1412), 0 states have call successors, (0), 0 states 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 02:50:35,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 306.0) internal successors, (3978), 13 states have internal predecessors, (3978), 0 states have call successors, (0), 0 states 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 02:50:35,171 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 306.0) internal successors, (3978), 13 states have internal predecessors, (3978), 0 states have call successors, (0), 0 states 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 02:50:35,171 INFO L175 Difference]: Start difference. First operand has 269 places, 772 transitions, 15434 flow. Second operand 12 states and 1412 transitions. [2023-08-04 02:50:35,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 962 transitions, 18889 flow [2023-08-04 02:50:43,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 962 transitions, 18149 flow, removed 45 selfloop flow, removed 8 redundant places. [2023-08-04 02:50:43,769 INFO L231 Difference]: Finished difference. Result has 276 places, 796 transitions, 16523 flow [2023-08-04 02:50:43,770 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=14694, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=772, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=478, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=16523, PETRI_PLACES=276, PETRI_TRANSITIONS=796} [2023-08-04 02:50:43,770 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 234 predicate places. [2023-08-04 02:50:43,771 INFO L495 AbstractCegarLoop]: Abstraction has has 276 places, 796 transitions, 16523 flow [2023-08-04 02:50:43,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 101.09375) internal successors, (3235), 32 states have internal predecessors, (3235), 0 states have call successors, (0), 0 states 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 02:50:43,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:50:43,771 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, 1, 1, 1, 1, 1, 1] [2023-08-04 02:50:43,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2023-08-04 02:50:43,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2023-08-04 02:50:43,974 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:50:43,974 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:50:43,974 INFO L85 PathProgramCache]: Analyzing trace with hash 2079743992, now seen corresponding path program 16 times [2023-08-04 02:50:43,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:50:43,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757910378] [2023-08-04 02:50:43,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:50:43,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:50:44,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:50:44,584 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 02:50:44,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:50:44,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757910378] [2023-08-04 02:50:44,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757910378] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:50:44,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439413309] [2023-08-04 02:50:44,585 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-04 02:50:44,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:50:44,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:50:44,589 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 02:50:44,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2023-08-04 02:50:44,750 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-04 02:50:44,751 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 02:50:44,753 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 84 conjunts are in the unsatisfiable core [2023-08-04 02:50:44,756 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:50:44,786 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-04 02:50:44,855 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 02:50:44,892 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 02:50:44,939 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 02:50:45,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 02:50:45,065 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 02:50:45,185 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-04 02:50:45,185 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:50:45,328 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1229 (Array Int Int))) (< (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1229) c_~A~0.base) c_~A~0.offset)) (+ c_~counter~0 1))) (forall ((v_ArrVal_1229 (Array Int Int))) (<= c_~counter~0 (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1229) c_~A~0.base) c_~A~0.offset))))) is different from false [2023-08-04 02:50:45,335 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* 4 |c_thread1Thread2of2ForFork1_~i~0#1|))))) (and (forall ((v_ArrVal_1229 (Array Int Int))) (<= (+ .cse0 c_~counter~0) (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1229) c_~A~0.base) c_~A~0.offset)))) (forall ((v_ArrVal_1229 (Array Int Int))) (< (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1229) c_~A~0.base) c_~A~0.offset)) (+ .cse0 c_~counter~0 1))))) is different from false [2023-08-04 02:50:45,342 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (and (forall ((v_ArrVal_1229 (Array Int Int))) (<= (+ .cse0 c_~counter~0) (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1229) c_~A~0.base) c_~A~0.offset)))) (forall ((v_ArrVal_1229 (Array Int Int))) (< (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1229) c_~A~0.base) c_~A~0.offset)) (+ .cse0 c_~counter~0 1))))) is different from false [2023-08-04 02:50:45,352 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~A~0.base))) (let ((.cse0 (select .cse2 c_~A~0.offset)) (.cse1 (select .cse2 (+ c_~A~0.offset (* |c_thread1Thread1of2ForFork1_~i~0#1| 4))))) (and (forall ((v_ArrVal_1229 (Array Int Int))) (< (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1229) c_~A~0.base) c_~A~0.offset)) (+ .cse0 c_~counter~0 .cse1 1))) (forall ((v_ArrVal_1229 (Array Int Int))) (<= (+ .cse0 c_~counter~0 .cse1) (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1229) c_~A~0.base) c_~A~0.offset))))))) is different from false [2023-08-04 02:50:45,359 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (* (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) 2))) (and (forall ((v_ArrVal_1229 (Array Int Int))) (<= (+ c_~counter~0 .cse0) (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1229) c_~A~0.base) c_~A~0.offset)))) (forall ((v_ArrVal_1229 (Array Int Int))) (< (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1229) c_~A~0.base) c_~A~0.offset)) (+ c_~counter~0 .cse0 1))))) is different from false [2023-08-04 02:50:45,383 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1229 (Array Int Int)) (v_ArrVal_1228 (Array Int Int))) (< (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1229) c_~A~0.base) c_~A~0.offset)) (+ c_~counter~0 (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1228) c_~A~0.base) c_~A~0.offset)) 1))) (forall ((v_ArrVal_1229 (Array Int Int)) (v_ArrVal_1228 (Array Int Int))) (<= (+ c_~counter~0 (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1228) c_~A~0.base) c_~A~0.offset))) (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1229) c_~A~0.base) c_~A~0.offset))))) is different from false [2023-08-04 02:50:45,417 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1229 (Array Int Int)) (v_ArrVal_1228 (Array Int Int)) (v_ArrVal_1227 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1227))) (< (* (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1229) c_~A~0.base) c_~A~0.offset) 2) (+ c_~counter~0 (* (select (select (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1228) c_~A~0.base) c_~A~0.offset) 2) 1)))) (forall ((v_ArrVal_1229 (Array Int Int)) (v_ArrVal_1228 (Array Int Int)) (v_ArrVal_1227 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1227))) (<= (+ c_~counter~0 (* (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1228) c_~A~0.base) c_~A~0.offset) 2)) (* (select (select (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1229) c_~A~0.base) c_~A~0.offset) 2))))) is different from false [2023-08-04 02:50:45,529 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 02:50:45,529 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 43 [2023-08-04 02:50:45,533 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1502 treesize of output 1406 [2023-08-04 02:50:45,545 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 38 treesize of output 34 [2023-08-04 02:50:45,548 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 30 [2023-08-04 02:50:45,556 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 02:50:45,556 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 42 [2023-08-04 02:50:45,558 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-04 02:50:45,560 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 66 treesize of output 58 [2023-08-04 02:50:45,587 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 1 times theorem prover too weak. 7 trivial. 13 not checked. [2023-08-04 02:50:45,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439413309] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:50:45,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:50:45,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 14] total 32 [2023-08-04 02:50:45,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116559756] [2023-08-04 02:50:45,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:50:45,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-08-04 02:50:45,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:50:45,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-08-04 02:50:45,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=600, Unknown=18, NotChecked=392, Total=1122 [2023-08-04 02:50:45,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 306 [2023-08-04 02:50:45,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 796 transitions, 16523 flow. Second operand has 34 states, 34 states have (on average 92.52941176470588) internal successors, (3146), 34 states have internal predecessors, (3146), 0 states have call successors, (0), 0 states 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 02:50:45,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:50:45,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 306 [2023-08-04 02:50:45,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:51:01,647 INFO L124 PetriNetUnfolderBase]: 49073/67657 cut-off events. [2023-08-04 02:51:01,647 INFO L125 PetriNetUnfolderBase]: For 1111503/1111503 co-relation queries the response was YES. [2023-08-04 02:51:02,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 480500 conditions, 67657 events. 49073/67657 cut-off events. For 1111503/1111503 co-relation queries the response was YES. Maximal size of possible extension queue 1397. Compared 402453 event pairs, 11133 based on Foata normal form. 1/67616 useless extension candidates. Maximal degree in co-relation 480375. Up to 51071 conditions per place. [2023-08-04 02:51:03,319 INFO L140 encePairwiseOnDemand]: 294/306 looper letters, 445 selfloop transitions, 521 changer transitions 2/974 dead transitions. [2023-08-04 02:51:03,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 974 transitions, 19911 flow [2023-08-04 02:51:03,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-04 02:51:03,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-04 02:51:03,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1399 transitions. [2023-08-04 02:51:03,321 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35168426344896936 [2023-08-04 02:51:03,321 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1399 transitions. [2023-08-04 02:51:03,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1399 transitions. [2023-08-04 02:51:03,321 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 02:51:03,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1399 transitions. [2023-08-04 02:51:03,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 107.61538461538461) internal successors, (1399), 13 states have internal predecessors, (1399), 0 states have call successors, (0), 0 states 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 02:51:03,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 306.0) internal successors, (4284), 14 states have internal predecessors, (4284), 0 states have call successors, (0), 0 states 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 02:51:03,325 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 306.0) internal successors, (4284), 14 states have internal predecessors, (4284), 0 states have call successors, (0), 0 states 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 02:51:03,325 INFO L175 Difference]: Start difference. First operand has 276 places, 796 transitions, 16523 flow. Second operand 13 states and 1399 transitions. [2023-08-04 02:51:03,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 974 transitions, 19911 flow [2023-08-04 02:51:13,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 974 transitions, 19506 flow, removed 82 selfloop flow, removed 4 redundant places. [2023-08-04 02:51:13,176 INFO L231 Difference]: Finished difference. Result has 288 places, 817 transitions, 17983 flow [2023-08-04 02:51:13,177 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=16122, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=796, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=503, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=17983, PETRI_PLACES=288, PETRI_TRANSITIONS=817} [2023-08-04 02:51:13,177 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 246 predicate places. [2023-08-04 02:51:13,177 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 817 transitions, 17983 flow [2023-08-04 02:51:13,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 92.52941176470588) internal successors, (3146), 34 states have internal predecessors, (3146), 0 states have call successors, (0), 0 states 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 02:51:13,178 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 02:51:13,178 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, 1, 1, 1, 1, 1, 1] [2023-08-04 02:51:13,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2023-08-04 02:51:13,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2023-08-04 02:51:13,383 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 02:51:13,384 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 02:51:13,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1640674520, now seen corresponding path program 17 times [2023-08-04 02:51:13,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 02:51:13,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548388231] [2023-08-04 02:51:13,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 02:51:13,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 02:51:13,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 02:51:14,007 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-04 02:51:14,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 02:51:14,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548388231] [2023-08-04 02:51:14,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548388231] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 02:51:14,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388739967] [2023-08-04 02:51:14,008 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-04 02:51:14,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 02:51:14,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 02:51:14,010 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 02:51:14,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2023-08-04 02:51:14,177 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-08-04 02:51:14,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 02:51:14,180 INFO L262 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 93 conjunts are in the unsatisfiable core [2023-08-04 02:51:14,183 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 02:51:14,226 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-04 02:51:14,289 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 02:51:14,315 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 02:51:14,408 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 02:51:14,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 02:51:14,604 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 22 treesize of output 22 [2023-08-04 02:51:14,839 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 02:51:14,839 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 17 treesize of output 14 [2023-08-04 02:51:14,929 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-04 02:51:14,929 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 02:51:16,899 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 02:51:16,900 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 105 treesize of output 70 [2023-08-04 02:51:16,920 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-04 02:51:16,921 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2286 treesize of output 1942 [2023-08-04 02:51:16,943 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 02:51:16,944 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 50 [2023-08-04 02:51:16,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 02:51:16,950 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2023-08-04 02:51:16,957 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 02:51:16,958 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 50 treesize of output 43 [2023-08-04 02:51:16,993 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 02:51:16,993 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 104 treesize of output 69 [2023-08-04 02:51:16,998 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-04 02:51:17,013 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-08-04 02:51:17,014 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 124 treesize of output 92 [2023-08-04 02:51:17,028 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 02:51:17,029 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 21 treesize of output 14 [2023-08-04 02:51:17,093 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 13 refuted. 6 times theorem prover too weak. 7 trivial. 0 not checked. [2023-08-04 02:51:17,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388739967] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 02:51:17,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 02:51:17,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16, 17] total 42 [2023-08-04 02:51:17,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991896802] [2023-08-04 02:51:17,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 02:51:17,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-08-04 02:51:17,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 02:51:17,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-08-04 02:51:17,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1684, Unknown=21, NotChecked=0, Total=1892 [2023-08-04 02:51:17,967 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 306 [2023-08-04 02:51:17,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 817 transitions, 17983 flow. Second operand has 44 states, 44 states have (on average 80.29545454545455) internal successors, (3533), 44 states have internal predecessors, (3533), 0 states have call successors, (0), 0 states 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 02:51:17,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 02:51:17,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 306 [2023-08-04 02:51:17,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 02:51:20,452 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 02:51:22,814 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 02:51:24,828 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 02:51:26,308 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| c_~A~0.base))) (let ((.cse1 (select .cse7 c_~A~0.offset)) (.cse9 (<= c_~N~0 |c_thread1Thread1of2ForFork1_~i~0#1|)) (.cse8 (+ c_~A~0.offset (* |c_thread1Thread1of2ForFork1_~i~0#1| 4))) (.cse3 (<= 2 |c_ULTIMATE.start_main_~asdf~1#1|))) (and (or (and (forall ((|v_thread2Thread1of2ForFork0_~i~1#1_114| Int) (v_ArrVal_1273 (Array Int Int))) (or (< (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1273) c_~A~0.base))) (+ (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset (* |v_thread2Thread1of2ForFork0_~i~1#1_114| 4))))) (+ .cse1 c_~counter~0 1)) (< 0 |v_thread2Thread1of2ForFork0_~i~1#1_114|) (< (+ |v_thread2Thread1of2ForFork0_~i~1#1_114| 1) c_~N~0))) (forall ((|v_thread2Thread1of2ForFork0_~i~1#1_114| Int) (v_ArrVal_1273 (Array Int Int))) (or (<= (+ .cse1 c_~counter~0) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1273) c_~A~0.base))) (+ (select .cse2 c_~A~0.offset) (select .cse2 (+ c_~A~0.offset (* |v_thread2Thread1of2ForFork0_~i~1#1_114| 4)))))) (< 0 |v_thread2Thread1of2ForFork0_~i~1#1_114|) (< (+ |v_thread2Thread1of2ForFork0_~i~1#1_114| 1) c_~N~0)))) .cse3) (or (let ((.cse5 (select .cse7 .cse8))) (and (forall ((|v_thread2Thread1of2ForFork0_~i~1#1_114| Int) (v_ArrVal_1273 (Array Int Int))) (or (< 0 |v_thread2Thread1of2ForFork0_~i~1#1_114|) (< (+ |v_thread2Thread1of2ForFork0_~i~1#1_114| 1) c_~N~0) (< (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1273) c_~A~0.base))) (+ (select .cse4 c_~A~0.offset) (select .cse4 (+ c_~A~0.offset (* |v_thread2Thread1of2ForFork0_~i~1#1_114| 4))))) (+ .cse1 c_~counter~0 .cse5 1)))) (forall ((|v_thread2Thread1of2ForFork0_~i~1#1_114| Int) (v_ArrVal_1273 (Array Int Int))) (or (< 0 |v_thread2Thread1of2ForFork0_~i~1#1_114|) (<= (+ .cse1 c_~counter~0 .cse5) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1273) c_~A~0.base))) (+ (select .cse6 c_~A~0.offset) (select .cse6 (+ c_~A~0.offset (* |v_thread2Thread1of2ForFork0_~i~1#1_114| 4)))))) (< (+ |v_thread2Thread1of2ForFork0_~i~1#1_114| 1) c_~N~0))))) (< 0 |c_ULTIMATE.start_main_~asdf~1#1|) .cse9) (or .cse9 (and (forall ((|v_thread2Thread1of2ForFork0_~i~1#1_114| Int) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1272 (Array Int Int))) (or (< 0 |v_thread2Thread1of2ForFork0_~i~1#1_114|) (< (+ |v_thread2Thread1of2ForFork0_~i~1#1_114| 1) c_~N~0) (< (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1273) c_~A~0.base))) (+ (select .cse10 c_~A~0.offset) (select .cse10 (+ c_~A~0.offset (* |v_thread2Thread1of2ForFork0_~i~1#1_114| 4))))) (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1272) c_~A~0.base))) (+ c_~counter~0 (select .cse11 .cse8) (select .cse11 c_~A~0.offset) 1))))) (forall ((|v_thread2Thread1of2ForFork0_~i~1#1_114| Int) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1272 (Array Int Int))) (or (< 0 |v_thread2Thread1of2ForFork0_~i~1#1_114|) (<= (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1272) c_~A~0.base))) (+ c_~counter~0 (select .cse12 .cse8) (select .cse12 c_~A~0.offset))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1273) c_~A~0.base))) (+ (select .cse13 c_~A~0.offset) (select .cse13 (+ c_~A~0.offset (* |v_thread2Thread1of2ForFork0_~i~1#1_114| 4)))))) (< (+ |v_thread2Thread1of2ForFork0_~i~1#1_114| 1) c_~N~0))))) (or (let ((.cse14 (select .cse7 (+ c_~A~0.offset (* 4 |c_thread1Thread2of2ForFork1_~i~0#1|))))) (and (forall ((|v_thread2Thread1of2ForFork0_~i~1#1_114| Int) (v_ArrVal_1273 (Array Int Int))) (or (<= (+ .cse14 c_~counter~0) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1273) c_~A~0.base))) (+ (select .cse15 c_~A~0.offset) (select .cse15 (+ c_~A~0.offset (* |v_thread2Thread1of2ForFork0_~i~1#1_114| 4)))))) (< 0 |v_thread2Thread1of2ForFork0_~i~1#1_114|) (< (+ |v_thread2Thread1of2ForFork0_~i~1#1_114| 1) c_~N~0))) (forall ((|v_thread2Thread1of2ForFork0_~i~1#1_114| Int) (v_ArrVal_1273 (Array Int Int))) (or (< 0 |v_thread2Thread1of2ForFork0_~i~1#1_114|) (< (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1273) c_~A~0.base))) (+ (select .cse16 c_~A~0.offset) (select .cse16 (+ c_~A~0.offset (* |v_thread2Thread1of2ForFork0_~i~1#1_114| 4))))) (+ .cse14 c_~counter~0 1)) (< (+ |v_thread2Thread1of2ForFork0_~i~1#1_114| 1) c_~N~0))))) .cse3)))) is different from false [2023-08-04 02:51:34,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 02:51:36,697 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 02:51:38,935 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 02:51:59,398 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 02:52:30,722 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| c_~A~0.base))) (let ((.cse1 (select .cse8 c_~A~0.offset)) (.cse10 (<= c_~N~0 |c_thread1Thread1of2ForFork1_~i~0#1|)) (.cse9 (+ c_~A~0.offset (* |c_thread1Thread1of2ForFork1_~i~0#1| 4)))) (and (or (and (forall ((|v_thread2Thread1of2ForFork0_~i~1#1_114| Int) (v_ArrVal_1273 (Array Int Int))) (or (< (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1273) c_~A~0.base))) (+ (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset (* |v_thread2Thread1of2ForFork0_~i~1#1_114| 4))))) (+ .cse1 c_~counter~0 1)) (< 0 |v_thread2Thread1of2ForFork0_~i~1#1_114|) (< (+ |v_thread2Thread1of2ForFork0_~i~1#1_114| 1) c_~N~0))) (forall ((|v_thread2Thread1of2ForFork0_~i~1#1_114| Int) (v_ArrVal_1273 (Array Int Int))) (or (<= (+ .cse1 c_~counter~0) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1273) c_~A~0.base))) (+ (select .cse2 c_~A~0.offset) (select .cse2 (+ c_~A~0.offset (* |v_thread2Thread1of2ForFork0_~i~1#1_114| 4)))))) (< 0 |v_thread2Thread1of2ForFork0_~i~1#1_114|) (< (+ |v_thread2Thread1of2ForFork0_~i~1#1_114| 1) c_~N~0)))) (<= 2 |c_ULTIMATE.start_main_~asdf~1#1|)) (let ((.cse3 (<= 1 c_~N~0)) (.cse4 (<= |c_thread2Thread1of2ForFork0_~i~1#1| 1))) (or (and .cse3 .cse4 (= c_~counter~0 0)) (and .cse3 (<= (+ |c_thread2Thread1of2ForFork0_~i~1#1| 1) c_~N~0) .cse4))) (or (let ((.cse6 (select .cse8 .cse9))) (and (forall ((|v_thread2Thread1of2ForFork0_~i~1#1_114| Int) (v_ArrVal_1273 (Array Int Int))) (or (< 0 |v_thread2Thread1of2ForFork0_~i~1#1_114|) (< (+ |v_thread2Thread1of2ForFork0_~i~1#1_114| 1) c_~N~0) (< (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1273) c_~A~0.base))) (+ (select .cse5 c_~A~0.offset) (select .cse5 (+ c_~A~0.offset (* |v_thread2Thread1of2ForFork0_~i~1#1_114| 4))))) (+ .cse1 c_~counter~0 .cse6 1)))) (forall ((|v_thread2Thread1of2ForFork0_~i~1#1_114| Int) (v_ArrVal_1273 (Array Int Int))) (or (< 0 |v_thread2Thread1of2ForFork0_~i~1#1_114|) (<= (+ .cse1 c_~counter~0 .cse6) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1273) c_~A~0.base))) (+ (select .cse7 c_~A~0.offset) (select .cse7 (+ c_~A~0.offset (* |v_thread2Thread1of2ForFork0_~i~1#1_114| 4)))))) (< (+ |v_thread2Thread1of2ForFork0_~i~1#1_114| 1) c_~N~0))))) (< 0 |c_ULTIMATE.start_main_~asdf~1#1|) .cse10) (or .cse10 (and (forall ((|v_thread2Thread1of2ForFork0_~i~1#1_114| Int) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1272 (Array Int Int))) (or (< 0 |v_thread2Thread1of2ForFork0_~i~1#1_114|) (< (+ |v_thread2Thread1of2ForFork0_~i~1#1_114| 1) c_~N~0) (< (let ((.cse11 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1273) c_~A~0.base))) (+ (select .cse11 c_~A~0.offset) (select .cse11 (+ c_~A~0.offset (* |v_thread2Thread1of2ForFork0_~i~1#1_114| 4))))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1272) c_~A~0.base))) (+ c_~counter~0 (select .cse12 .cse9) (select .cse12 c_~A~0.offset) 1))))) (forall ((|v_thread2Thread1of2ForFork0_~i~1#1_114| Int) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1272 (Array Int Int))) (or (< 0 |v_thread2Thread1of2ForFork0_~i~1#1_114|) (<= (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1272) c_~A~0.base))) (+ c_~counter~0 (select .cse13 .cse9) (select .cse13 c_~A~0.offset))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1273) c_~A~0.base))) (+ (select .cse14 c_~A~0.offset) (select .cse14 (+ c_~A~0.offset (* |v_thread2Thread1of2ForFork0_~i~1#1_114| 4)))))) (< (+ |v_thread2Thread1of2ForFork0_~i~1#1_114| 1) c_~N~0)))))))) is different from false [2023-08-04 02:52:45,503 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_int| c_~A~0.base))) (let ((.cse1 (select .cse10 c_~A~0.offset)) (.cse12 (<= c_~N~0 |c_thread1Thread1of2ForFork1_~i~0#1|)) (.cse11 (+ c_~A~0.offset (* |c_thread1Thread1of2ForFork1_~i~0#1| 4))) (.cse3 (<= 2 |c_ULTIMATE.start_main_~asdf~1#1|)) (.cse5 (+ c_~counter~0 1))) (and (or (and (forall ((|v_thread2Thread1of2ForFork0_~i~1#1_114| Int) (v_ArrVal_1273 (Array Int Int))) (or (< (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1273) c_~A~0.base))) (+ (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset (* |v_thread2Thread1of2ForFork0_~i~1#1_114| 4))))) (+ .cse1 c_~counter~0 1)) (< 0 |v_thread2Thread1of2ForFork0_~i~1#1_114|) (< (+ |v_thread2Thread1of2ForFork0_~i~1#1_114| 1) c_~N~0))) (forall ((|v_thread2Thread1of2ForFork0_~i~1#1_114| Int) (v_ArrVal_1273 (Array Int Int))) (or (<= (+ .cse1 c_~counter~0) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1273) c_~A~0.base))) (+ (select .cse2 c_~A~0.offset) (select .cse2 (+ c_~A~0.offset (* |v_thread2Thread1of2ForFork0_~i~1#1_114| 4)))))) (< 0 |v_thread2Thread1of2ForFork0_~i~1#1_114|) (< (+ |v_thread2Thread1of2ForFork0_~i~1#1_114| 1) c_~N~0)))) .cse3) (or (and (forall ((|v_thread2Thread1of2ForFork0_~i~1#1_114| Int) (v_ArrVal_1273 (Array Int Int))) (or (< 0 |v_thread2Thread1of2ForFork0_~i~1#1_114|) (< (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1273) c_~A~0.base))) (+ (select .cse4 c_~A~0.offset) (select .cse4 (+ c_~A~0.offset (* |v_thread2Thread1of2ForFork0_~i~1#1_114| 4))))) .cse5) (< (+ |v_thread2Thread1of2ForFork0_~i~1#1_114| 1) c_~N~0))) (forall ((|v_thread2Thread1of2ForFork0_~i~1#1_114| Int) (v_ArrVal_1273 (Array Int Int))) (or (<= c_~counter~0 (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1273) c_~A~0.base))) (+ (select .cse6 c_~A~0.offset) (select .cse6 (+ c_~A~0.offset (* |v_thread2Thread1of2ForFork0_~i~1#1_114| 4)))))) (< 0 |v_thread2Thread1of2ForFork0_~i~1#1_114|) (< (+ |v_thread2Thread1of2ForFork0_~i~1#1_114| 1) c_~N~0)))) .cse3) (or (let ((.cse8 (select .cse10 .cse11))) (and (forall ((|v_thread2Thread1of2ForFork0_~i~1#1_114| Int) (v_ArrVal_1273 (Array Int Int))) (or (< 0 |v_thread2Thread1of2ForFork0_~i~1#1_114|) (< (+ |v_thread2Thread1of2ForFork0_~i~1#1_114| 1) c_~N~0) (< (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1273) c_~A~0.base))) (+ (select .cse7 c_~A~0.offset) (select .cse7 (+ c_~A~0.offset (* |v_thread2Thread1of2ForFork0_~i~1#1_114| 4))))) (+ .cse1 c_~counter~0 .cse8 1)))) (forall ((|v_thread2Thread1of2ForFork0_~i~1#1_114| Int) (v_ArrVal_1273 (Array Int Int))) (or (< 0 |v_thread2Thread1of2ForFork0_~i~1#1_114|) (<= (+ .cse1 c_~counter~0 .cse8) (let ((.cse9 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1273) c_~A~0.base))) (+ (select .cse9 c_~A~0.offset) (select .cse9 (+ c_~A~0.offset (* |v_thread2Thread1of2ForFork0_~i~1#1_114| 4)))))) (< (+ |v_thread2Thread1of2ForFork0_~i~1#1_114| 1) c_~N~0))))) (< 0 |c_ULTIMATE.start_main_~asdf~1#1|) .cse12) (or .cse12 (and (forall ((|v_thread2Thread1of2ForFork0_~i~1#1_114| Int) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1272 (Array Int Int))) (or (< 0 |v_thread2Thread1of2ForFork0_~i~1#1_114|) (< (+ |v_thread2Thread1of2ForFork0_~i~1#1_114| 1) c_~N~0) (< (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1273) c_~A~0.base))) (+ (select .cse13 c_~A~0.offset) (select .cse13 (+ c_~A~0.offset (* |v_thread2Thread1of2ForFork0_~i~1#1_114| 4))))) (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1272) c_~A~0.base))) (+ c_~counter~0 (select .cse14 .cse11) (select .cse14 c_~A~0.offset) 1))))) (forall ((|v_thread2Thread1of2ForFork0_~i~1#1_114| Int) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1272 (Array Int Int))) (or (< 0 |v_thread2Thread1of2ForFork0_~i~1#1_114|) (<= (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1272) c_~A~0.base))) (+ c_~counter~0 (select .cse15 .cse11) (select .cse15 c_~A~0.offset))) (let ((.cse16 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1273) c_~A~0.base))) (+ (select .cse16 c_~A~0.offset) (select .cse16 (+ c_~A~0.offset (* |v_thread2Thread1of2ForFork0_~i~1#1_114| 4)))))) (< (+ |v_thread2Thread1of2ForFork0_~i~1#1_114| 1) c_~N~0))))) (or (let ((.cse17 (select .cse10 (+ c_~A~0.offset (* 4 |c_thread1Thread2of2ForFork1_~i~0#1|))))) (and (forall ((|v_thread2Thread1of2ForFork0_~i~1#1_114| Int) (v_ArrVal_1273 (Array Int Int))) (or (<= (+ .cse17 c_~counter~0) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1273) c_~A~0.base))) (+ (select .cse18 c_~A~0.offset) (select .cse18 (+ c_~A~0.offset (* |v_thread2Thread1of2ForFork0_~i~1#1_114| 4)))))) (< 0 |v_thread2Thread1of2ForFork0_~i~1#1_114|) (< (+ |v_thread2Thread1of2ForFork0_~i~1#1_114| 1) c_~N~0))) (forall ((|v_thread2Thread1of2ForFork0_~i~1#1_114| Int) (v_ArrVal_1273 (Array Int Int))) (or (< 0 |v_thread2Thread1of2ForFork0_~i~1#1_114|) (< (let ((.cse19 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1273) c_~A~0.base))) (+ (select .cse19 c_~A~0.offset) (select .cse19 (+ c_~A~0.offset (* |v_thread2Thread1of2ForFork0_~i~1#1_114| 4))))) (+ .cse17 c_~counter~0 1)) (< (+ |v_thread2Thread1of2ForFork0_~i~1#1_114| 1) c_~N~0))))) .cse3) (or (< (+ |c_thread2Thread1of2ForFork0_~i~1#1| 1) c_~N~0) (let ((.cse20 (select .cse10 (+ c_~A~0.offset (* |c_thread2Thread1of2ForFork0_~i~1#1| 4))))) (and (< .cse20 .cse5) (<= c_~counter~0 .cse20))))))) is different from false [2023-08-04 02:52:46,543 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_int| c_~A~0.base))) (let ((.cse1 (select .cse8 c_~A~0.offset)) (.cse10 (< 0 |c_ULTIMATE.start_main_~asdf~1#1|)) (.cse11 (<= c_~N~0 |c_thread1Thread1of2ForFork1_~i~0#1|)) (.cse9 (+ c_~A~0.offset (* |c_thread1Thread1of2ForFork1_~i~0#1| 4)))) (and (or (and (forall ((|v_thread2Thread1of2ForFork0_~i~1#1_114| Int) (v_ArrVal_1273 (Array Int Int))) (or (< (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1273) c_~A~0.base))) (+ (select .cse0 c_~A~0.offset) (select .cse0 (+ c_~A~0.offset (* |v_thread2Thread1of2ForFork0_~i~1#1_114| 4))))) (+ .cse1 c_~counter~0 1)) (< 0 |v_thread2Thread1of2ForFork0_~i~1#1_114|) (< (+ |v_thread2Thread1of2ForFork0_~i~1#1_114| 1) c_~N~0))) (forall ((|v_thread2Thread1of2ForFork0_~i~1#1_114| Int) (v_ArrVal_1273 (Array Int Int))) (or (<= (+ .cse1 c_~counter~0) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1273) c_~A~0.base))) (+ (select .cse2 c_~A~0.offset) (select .cse2 (+ c_~A~0.offset (* |v_thread2Thread1of2ForFork0_~i~1#1_114| 4)))))) (< 0 |v_thread2Thread1of2ForFork0_~i~1#1_114|) (< (+ |v_thread2Thread1of2ForFork0_~i~1#1_114| 1) c_~N~0)))) (<= 2 |c_ULTIMATE.start_main_~asdf~1#1|)) (let ((.cse3 (<= 1 c_~N~0)) (.cse4 (<= |c_thread2Thread1of2ForFork0_~i~1#1| 1))) (or (and .cse3 .cse4 (= c_~counter~0 0)) (and .cse3 (<= (+ |c_thread2Thread1of2ForFork0_~i~1#1| 1) c_~N~0) .cse4))) (or (let ((.cse6 (select .cse8 .cse9))) (and (forall ((|v_thread2Thread1of2ForFork0_~i~1#1_114| Int) (v_ArrVal_1273 (Array Int Int))) (or (< 0 |v_thread2Thread1of2ForFork0_~i~1#1_114|) (< (+ |v_thread2Thread1of2ForFork0_~i~1#1_114| 1) c_~N~0) (< (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1273) c_~A~0.base))) (+ (select .cse5 c_~A~0.offset) (select .cse5 (+ c_~A~0.offset (* |v_thread2Thread1of2ForFork0_~i~1#1_114| 4))))) (+ .cse1 c_~counter~0 .cse6 1)))) (forall ((|v_thread2Thread1of2ForFork0_~i~1#1_114| Int) (v_ArrVal_1273 (Array Int Int))) (or (< 0 |v_thread2Thread1of2ForFork0_~i~1#1_114|) (<= (+ .cse1 c_~counter~0 .cse6) (let ((.cse7 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1273) c_~A~0.base))) (+ (select .cse7 c_~A~0.offset) (select .cse7 (+ c_~A~0.offset (* |v_thread2Thread1of2ForFork0_~i~1#1_114| 4)))))) (< (+ |v_thread2Thread1of2ForFork0_~i~1#1_114| 1) c_~N~0))))) .cse10 .cse11) (or .cse10 .cse11 (and (forall ((|v_thread2Thread1of2ForFork0_~i~1#1_114| Int) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1272 (Array Int Int))) (or (< 0 |v_thread2Thread1of2ForFork0_~i~1#1_114|) (< (+ |v_thread2Thread1of2ForFork0_~i~1#1_114| 1) c_~N~0) (< (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1273) c_~A~0.base))) (+ (select .cse12 c_~A~0.offset) (select .cse12 (+ c_~A~0.offset (* |v_thread2Thread1of2ForFork0_~i~1#1_114| 4))))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1272) c_~A~0.base))) (+ c_~counter~0 (select .cse13 .cse9) (select .cse13 c_~A~0.offset) 1))))) (forall ((|v_thread2Thread1of2ForFork0_~i~1#1_114| Int) (v_ArrVal_1273 (Array Int Int)) (v_ArrVal_1272 (Array Int Int))) (or (< 0 |v_thread2Thread1of2ForFork0_~i~1#1_114|) (<= (let ((.cse14 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1272) c_~A~0.base))) (+ c_~counter~0 (select .cse14 .cse9) (select .cse14 c_~A~0.offset))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1273) c_~A~0.base))) (+ (select .cse15 c_~A~0.offset) (select .cse15 (+ c_~A~0.offset (* |v_thread2Thread1of2ForFork0_~i~1#1_114| 4)))))) (< (+ |v_thread2Thread1of2ForFork0_~i~1#1_114| 1) c_~N~0)))))))) is different from false [2023-08-04 02:53:51,091 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]